{"meta":{"query_hash":"038a4c4cc89e","filters":{"topic":"Coding theory and cryptography"},"cohort_total":1096,"direct_labels_cover":0,"predictions_cover":1096,"exported":1096,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/038a4c4cc89e","api":"https://metacan.xera.ac/api/v1/cohort?topic=Coding+theory+and+cryptography"},"results":[{"id":"W102471322","doi":"10.11575/prism/30585","title":"ASYMPTOTICALLY EFFICIENT ALGORITHMS FOR THE FROBENIUS FORM","year":2000,"lang":"en","type":"article","venue":"PRISM (University of Calgary)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Computation; Algorithm; Matrix (chemical analysis); Asymptotically optimal algorithm; Finite field; Matrix multiplication; Field (mathematics); Computational complexity theory; Invariant (physics); Discrete mathematics; Pure mathematics","score_opus":0.009492412432150656,"score_gpt":0.19100361902651192,"score_spread":0.18151120659436126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W102471322","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020496117,0.000093576644,0.9706992,0.0010727621,0.00009699003,0.00020388316,3.6874184e-7,0.00008009781,0.0072570047],"genre_scores_gemma":[0.31985924,0.000107642365,0.67599446,0.00042199274,0.000041335476,0.0000022840711,0.000003619519,0.000014699794,0.0035547481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930084,0.000028637342,0.00007737153,0.00021352393,0.00017662214,0.00020301822],"domain_scores_gemma":[0.9992151,0.00023318322,0.0000426729,0.00039451354,0.000046365443,0.00006811798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027919593,0.000082970044,0.000116163385,0.000060857998,0.00034053923,0.00002627893,0.0010222181,0.000051967527,0.00016959735],"category_scores_gemma":[0.000008633477,0.00007354728,0.00018233011,0.00021777638,0.00013830629,0.00012380735,0.00012886971,0.0000903881,0.0000273212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045230267,0.00006437691,0.000017041777,0.0000065185786,0.000031869633,0.000004031234,0.0010757755,0.000023177925,0.000034168468,0.13418777,0.0004833058,0.8640267],"study_design_scores_gemma":[0.0008208885,0.0001817005,0.003454558,0.000015567122,0.000046090005,0.0000054974184,0.000036844165,0.9068873,0.00013392577,0.026519315,0.061716318,0.00018200958],"about_ca_topic_score_codex":0.000047386362,"about_ca_topic_score_gemma":0.000001833905,"teacher_disagreement_score":0.9068641,"about_ca_system_score_codex":0.000014376096,"about_ca_system_score_gemma":0.00003067438,"threshold_uncertainty_score":0.2999171},"labels":[],"label_agreement":null},{"id":"W104545548","doi":"10.1007/978-1-4471-0673-9_10","title":"On the Linear Complexity of Generalised Legendre Sequence","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Legendre polynomials; Sequence (biology); Mathematics; Computer science; Mathematical analysis; Biology; Genetics","score_opus":0.14476162486024358,"score_gpt":0.2575739493118693,"score_spread":0.1128123244516257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104545548","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104610306,0.00008666861,0.03758222,0.0012207323,0.00023789745,0.00018860356,0.000028685674,0.00014635344,0.9604042],"genre_scores_gemma":[0.112329796,0.00026074555,0.032720473,0.006583784,0.00046646575,0.000017855578,0.000023773646,0.00008320485,0.8475139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988087,0.000047571197,0.00025534467,0.00037931293,0.0003397111,0.00016939091],"domain_scores_gemma":[0.9983015,0.0001956951,0.00017459416,0.0011888094,0.00008447603,0.000054924174],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025057816,0.0002450466,0.0002595197,0.00011309523,0.00012296306,0.000040848667,0.0015352343,0.00013210154,0.0018504042],"category_scores_gemma":[0.000009887546,0.00016055856,0.00027002025,0.00007798252,0.0003855862,0.00007061784,0.00023720208,0.0003025894,0.00017554905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003903549,0.000012150974,4.583034e-7,0.000008380912,0.000028657714,0.000006555274,0.00006859073,0.000013953162,0.00006131829,0.9949138,0.0034797762,0.0014024248],"study_design_scores_gemma":[0.00009358597,0.00012934665,0.0000041078583,0.00007917464,0.000011866219,0.0000086637465,0.0000015375055,0.0045559695,0.00081578153,0.943129,0.0508969,0.0002740476],"about_ca_topic_score_codex":0.0000092622095,"about_ca_topic_score_gemma":0.0000047465883,"teacher_disagreement_score":0.112890325,"about_ca_system_score_codex":0.000015095228,"about_ca_system_score_gemma":0.00002450554,"threshold_uncertainty_score":0.99906206},"labels":[],"label_agreement":null},{"id":"W1055513040","doi":"10.1007/s12095-015-0141-x","title":"Enhanced criteria on differential uniformity and nonlinearity of cryptographically significant functions","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; S-box; Nonlinear system; Differential cryptanalysis; Differential (mechanical device); Cryptography; Mathematics; Linear cryptanalysis; Permutation (music); Substitution (logic); Discrete mathematics; Stream cipher; Pure mathematics; Algorithm; Computer science; Physics; Quantum mechanics","score_opus":0.04080440793990234,"score_gpt":0.2805707567951725,"score_spread":0.23976634885527018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1055513040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41136622,0.0004245384,0.58181185,0.0010048916,0.00016259612,0.00023654131,0.00004610383,0.00017337775,0.004773859],"genre_scores_gemma":[0.96756744,0.00036596056,0.031848542,0.00012136395,0.000021025364,0.00004171883,0.00002146849,0.000008017573,0.000004448124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860346,0.0002806911,0.0003418202,0.00034372424,0.00020878739,0.00022151138],"domain_scores_gemma":[0.9973455,0.00031701179,0.0001425647,0.0017071082,0.0002263872,0.00026143575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040537014,0.00019686713,0.0002584555,0.00041518375,0.00042618695,0.00013911907,0.001061382,0.00010285598,0.000011141266],"category_scores_gemma":[0.00006160403,0.000182262,0.0001437957,0.0010543183,0.0008507495,0.00028610945,0.0005971074,0.00030059877,0.0000021770213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007497512,0.00058377476,0.0029971066,0.000021185911,0.00008095268,4.4000606e-7,0.0012422394,0.0000028106242,0.0029037718,0.9730139,0.00011617596,0.018962711],"study_design_scores_gemma":[0.003977753,0.0029654696,0.12275014,0.0002830305,0.0002615641,0.000027607446,0.002600772,0.0118196495,0.0056193797,0.83874696,0.009404758,0.0015429144],"about_ca_topic_score_codex":0.00002566377,"about_ca_topic_score_gemma":0.000023863176,"teacher_disagreement_score":0.5562012,"about_ca_system_score_codex":0.000005516722,"about_ca_system_score_gemma":0.000046195222,"threshold_uncertainty_score":0.74324286},"labels":[],"label_agreement":null},{"id":"W1153974305","doi":"","title":"The absorbant number of generalized de Bruijn digraphs","year":2015,"lang":"nl","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"De Bruijn sequence; Mathematics; Combinatorics","score_opus":0.020482688134634705,"score_gpt":0.26444522987266283,"score_spread":0.24396254173802812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1153974305","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9698212,0.003431579,0.0012025473,0.0010688421,0.008041395,0.00028487347,0.000007703074,0.00013816998,0.0160037],"genre_scores_gemma":[0.99772227,0.00032903766,0.00086719496,0.00018574663,0.000029343306,0.000018605979,0.0000015451611,0.000023288501,0.0008229777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971713,0.0006221502,0.00051802356,0.000431786,0.0005831415,0.00067363284],"domain_scores_gemma":[0.9972248,0.00049370865,0.00031234542,0.0012931149,0.00032935393,0.00034664923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022340263,0.00029311122,0.00036563227,0.00008335253,0.00036524064,0.00028659703,0.001915532,0.00015697263,0.000041750343],"category_scores_gemma":[0.00019619578,0.00023031665,0.00032726163,0.0010870814,0.00043639875,0.00026207115,0.0004735599,0.0003103623,0.00020764908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009643913,0.00020062787,0.010862911,0.000013898022,0.00011391783,0.00001557167,0.0018205267,0.000010534881,0.00013154805,0.96792364,0.015584002,0.0032263582],"study_design_scores_gemma":[0.0015455947,0.00018963791,0.0021249203,0.000058728772,0.000048852326,0.000030368019,0.00016351018,0.0014698401,0.0013500517,0.9628304,0.02988871,0.00029937262],"about_ca_topic_score_codex":0.00018733593,"about_ca_topic_score_gemma":0.000012898061,"teacher_disagreement_score":0.02790107,"about_ca_system_score_codex":0.00006251217,"about_ca_system_score_gemma":0.00033277273,"threshold_uncertainty_score":0.9392041},"labels":[],"label_agreement":null},{"id":"W118358129","doi":"","title":"A Diffie-Hellman-like Key Exchange Protocol Based on Multivariate Ore Polynomials.","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polynomial ring; Ring (chemistry); Polynomial; Diffie–Hellman key exchange; Extension (predicate logic); Protocol (science); Key exchange; Computer science; Euclidean geometry; Key (lock); Discrete mathematics; Commutative ring; Commutative property; Mathematics; Theoretical computer science; Public-key cryptography; Computer network; Computer security; Programming language; Encryption; Geometry; Chemistry","score_opus":0.05824747959151991,"score_gpt":0.20658063988747757,"score_spread":0.14833316029595767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118358129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016772453,0.0000080303835,0.94771093,0.00020918484,0.0010707155,0.024337145,0.000028531776,0.0009237483,0.0089392755],"genre_scores_gemma":[0.9945239,0.000004069177,0.0021705544,0.0005952301,0.00020695556,0.0010729518,0.0000134793945,0.00004283213,0.0013700428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966652,0.0005781493,0.00027755235,0.0017204422,0.00017817058,0.0005805124],"domain_scores_gemma":[0.9964368,0.0002921406,0.0004074685,0.0024417858,0.00013214526,0.00028969315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006301894,0.00058989745,0.00051792746,0.00065857184,0.0003017532,0.00022836728,0.0029593606,0.00044946902,0.00013440815],"category_scores_gemma":[0.000043794083,0.0006222213,0.0004998534,0.0007474067,0.0001597478,0.00022835293,0.0018986228,0.0008154094,0.00019664603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019247193,0.0019123722,0.002740136,0.0013702129,0.0003695285,0.00097286474,0.00145842,0.26058546,0.0002776997,0.71188563,0.004959749,0.011543183],"study_design_scores_gemma":[0.0030786584,0.00045982617,0.0015533637,0.00048459775,0.00008075323,0.0000024696133,0.000017714223,0.9133956,0.00023574453,0.047197968,0.032182597,0.0013107057],"about_ca_topic_score_codex":0.00008789915,"about_ca_topic_score_gemma":0.0000247775,"teacher_disagreement_score":0.97775143,"about_ca_system_score_codex":0.00015340965,"about_ca_system_score_gemma":0.00017645718,"threshold_uncertainty_score":0.99962294},"labels":[],"label_agreement":null},{"id":"W11914327","doi":"10.1093/ije/31.1.240","title":"Some NP-Completeness Results on Partial Steiner Triple Systems and Parallel Classes.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Completeness (order theory); Steiner tree problem; Combinatorics; Steiner system; Discrete mathematics; Mathematical analysis","score_opus":0.01615037672060516,"score_gpt":0.2279742945901348,"score_spread":0.21182391786952964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11914327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9790458,0.0012383211,0.0036338288,0.0013107215,0.00862355,0.0005399282,0.000020585732,0.0006196534,0.004967608],"genre_scores_gemma":[0.9991386,0.000018604178,0.00028403162,0.00014062732,0.000083590036,0.000034625922,0.000008402964,0.000013566107,0.00027796463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818766,0.0002014922,0.0003671849,0.0005390384,0.00032236922,0.00038225937],"domain_scores_gemma":[0.9987583,0.00023448613,0.0001377396,0.00070084346,0.000061808576,0.000106803316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054884964,0.00021483579,0.0002732957,0.0001434547,0.00024079732,0.00031373822,0.0005886262,0.000094123396,0.0000013620245],"category_scores_gemma":[0.000031424745,0.00019458587,0.00008271726,0.00038313828,0.00008380694,0.00038894996,0.00016330111,0.00016362705,0.00003290836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008569742,0.00013778788,0.0003909742,0.000011879802,0.000014854792,0.000022776278,0.00006140935,0.00016136344,0.00019535133,0.9931259,0.0053481874,0.00044379523],"study_design_scores_gemma":[0.0037040894,0.00047219693,0.0049571055,0.000054142172,0.000014996795,0.000020501242,0.000020787365,0.007648372,0.0004600706,0.947382,0.034806177,0.00045959008],"about_ca_topic_score_codex":0.00011610903,"about_ca_topic_score_gemma":0.0000036096997,"teacher_disagreement_score":0.045743953,"about_ca_system_score_codex":0.000027191638,"about_ca_system_score_gemma":0.000029576482,"threshold_uncertainty_score":0.7934981},"labels":[],"label_agreement":null},{"id":"W12542839","doi":"10.1186/1472-6920-3-1","title":"Decoding Goppa Codes with MAGMA.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Mathematics; Magma; Algorithm; Geology; Geochemistry","score_opus":0.010724034832790583,"score_gpt":0.22322160053674717,"score_spread":0.2124975657039566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12542839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93895066,0.00018987924,0.032596212,0.0005712005,0.001122235,0.0001282151,6.339212e-7,0.0004890968,0.02595186],"genre_scores_gemma":[0.99390566,0.000032582666,0.005625849,0.0002278209,0.0000084363755,0.000011279566,9.3454537e-7,0.000010648952,0.00017676983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894994,0.0000651552,0.00013259084,0.00032326457,0.00021468964,0.00031436398],"domain_scores_gemma":[0.99908024,0.0001232886,0.0000582936,0.00056612835,0.000062203246,0.00010984976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002925834,0.00014420431,0.00014670011,0.00011128954,0.00021135874,0.00017519422,0.0007771913,0.000043739485,0.00003330292],"category_scores_gemma":[0.000018245568,0.0001238666,0.000057981142,0.00072909705,0.00006399476,0.00041458348,0.00014914482,0.0001304068,0.00007138597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001751443,0.00006164212,0.01108073,0.0000031140287,0.000017932642,0.0000556666,0.00019294284,0.000005972981,0.00013535008,0.9766742,0.00049501896,0.011259891],"study_design_scores_gemma":[0.00079538825,0.00025512345,0.004436936,0.000041722506,0.000011074178,0.00009377219,0.000040953953,0.0013777316,0.0010862873,0.9772539,0.014288942,0.00031814567],"about_ca_topic_score_codex":0.000008443135,"about_ca_topic_score_gemma":0.0000063281905,"teacher_disagreement_score":0.054955013,"about_ca_system_score_codex":0.000022273973,"about_ca_system_score_gemma":0.000030521936,"threshold_uncertainty_score":0.5051133},"labels":[],"label_agreement":null},{"id":"W127787461","doi":"10.1007/978-3-642-35999-6_8","title":"Cryptographically Strong de Bruijn Sequences with Large Periods","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"De Bruijn sequence; Computer science; Combinatorics; Mathematics","score_opus":0.01049555853560011,"score_gpt":0.2268672857817493,"score_spread":0.2163717272461492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W127787461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081243034,0.0004255325,0.9896116,0.0006780188,0.00055787456,0.00036923526,0.000005309932,0.00030689742,0.007233051],"genre_scores_gemma":[0.4014657,0.000055937926,0.59613055,0.0017710198,0.00034521506,0.000027714359,0.000003425852,0.000045196986,0.00015521006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99556583,0.00007891103,0.0004418193,0.0016778581,0.0010485328,0.0011870627],"domain_scores_gemma":[0.9971714,0.00040319073,0.00027457316,0.0015500387,0.00027245068,0.00032833367],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012579055,0.0006659266,0.00056261057,0.0010730459,0.00051716017,0.0012291608,0.0044812444,0.0003617676,0.00013568166],"category_scores_gemma":[0.000039904742,0.00053105486,0.00021119184,0.0011807024,0.0014198016,0.00089730864,0.0010569951,0.0011254158,0.00004568936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015315618,0.000058358994,0.0007518458,0.00004529816,0.00003844254,0.00015225062,0.0012089105,0.0031558364,0.00015723302,0.65346456,0.000027671118,0.3409243],"study_design_scores_gemma":[0.00058534875,0.0009820232,0.0009378151,0.0008152482,0.000026384752,0.00028831247,0.0000014927101,0.15045731,0.00052762084,0.8385507,0.005169363,0.0016584056],"about_ca_topic_score_codex":0.000030355917,"about_ca_topic_score_gemma":0.00013589703,"teacher_disagreement_score":0.40065327,"about_ca_system_score_codex":0.0001484253,"about_ca_system_score_gemma":0.0007400876,"threshold_uncertainty_score":0.99980766},"labels":[],"label_agreement":null},{"id":"W1409037350","doi":"10.1007/978-3-642-36883-7_1","title":"DAFA - A Lightweight DES Augmented Finite Automaton Cryptosystem","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cryptosystem; Hybrid cryptosystem; Encryption; Computer science; Theoretical computer science; Finite-state machine; Timed automaton; Key (lock); Automaton; Algorithm; Computer network; Computer security","score_opus":0.020171387946917592,"score_gpt":0.2210664401697527,"score_spread":0.2008950522228351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1409037350","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041275172,0.0004755053,0.9933514,0.00040011268,0.0005287351,0.00052051514,0.000030385,0.00016485897,0.0041157478],"genre_scores_gemma":[0.018512094,0.000093248214,0.9809816,0.00013894429,0.00010744551,0.000040645908,0.000019047577,0.000017714347,0.0000892456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986354,0.000018429604,0.00063067005,0.00018426517,0.00025835348,0.00027285816],"domain_scores_gemma":[0.9980815,0.00041623772,0.00047368277,0.0007795526,0.00018484873,0.00006415741],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003918735,0.00031885947,0.00038287806,0.00029539652,0.0012056069,0.00040331468,0.00261596,0.0002071716,0.0000029823477],"category_scores_gemma":[0.00004284902,0.00024603115,0.00026961017,0.00033838418,0.0004421241,0.00057482877,0.001001978,0.00034168086,0.0000026347043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017111724,0.000021511472,0.0000037919008,0.000433217,0.00016060135,1.4611255e-7,0.0029025234,0.28886437,0.000020437317,0.6718073,0.00013458639,0.035649814],"study_design_scores_gemma":[0.00020988277,0.000092949056,0.000028316002,0.0005383572,0.00004717951,0.000014386802,0.0000036763984,0.9381453,0.00014354642,0.014921683,0.045454748,0.00039998526],"about_ca_topic_score_codex":0.00001629544,"about_ca_topic_score_gemma":0.0000255026,"teacher_disagreement_score":0.65688556,"about_ca_system_score_codex":0.00005539983,"about_ca_system_score_gemma":0.000117197225,"threshold_uncertainty_score":0.99999917},"labels":[],"label_agreement":null},{"id":"W1480437861","doi":"10.1007/3-540-44706-7_8","title":"On the Interpolation Attacks on Block Ciphers","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Lagrange polynomial; Polynomial interpolation; Interpolation (computer graphics); Polynomial; Discrete mathematics; Algebraic function; Matrix polynomial; Algebra over a field; Algebraic number; Linear interpolation; Computer science; Pure mathematics; Mathematical analysis","score_opus":0.018221020170992308,"score_gpt":0.24229249926363322,"score_spread":0.2240714790926409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480437861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031338533,0.000077367054,0.9408266,0.0022066433,0.0016728212,0.0003048711,0.0000016614899,0.00016544198,0.054431234],"genre_scores_gemma":[0.95879865,0.000044752218,0.027974978,0.011832083,0.00071368297,0.000017465942,0.0000028006323,0.000051615403,0.00056395883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699587,0.00007452193,0.00033848794,0.0012072141,0.0008733081,0.000510629],"domain_scores_gemma":[0.99645466,0.001435109,0.00021909713,0.0016752903,0.00010591296,0.00010992905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001027641,0.0004694143,0.00030219855,0.0007003229,0.00041144225,0.00055347796,0.0036267606,0.00022909931,0.00007443178],"category_scores_gemma":[0.00008816171,0.0003303618,0.00019406503,0.00078572007,0.0006020964,0.00024879756,0.00066619436,0.0010124267,0.00012733047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016685863,0.000028146644,0.00001605451,0.000005014441,0.000010469014,0.000030078092,0.00045661902,0.00947544,0.000028366385,0.6194253,0.0001436751,0.3703642],"study_design_scores_gemma":[0.00016601646,0.00053640356,0.000048812497,0.0005200188,0.0000062188506,0.000035064913,3.4099867e-7,0.1806551,0.00035458396,0.8112426,0.005876631,0.00055822474],"about_ca_topic_score_codex":0.000004184422,"about_ca_topic_score_gemma":0.000018578048,"teacher_disagreement_score":0.9584853,"about_ca_system_score_codex":0.00014539574,"about_ca_system_score_gemma":0.00013619798,"threshold_uncertainty_score":0.9999148},"labels":[],"label_agreement":null},{"id":"W1482661747","doi":"10.1007/978-3-540-77224-8_2","title":"A Survey of Recent Attacks on the Filter Generator","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Shift register; Generator (circuit theory); Self-shrinking generator; Stream cipher; Computer science; Boolean function; Linear feedback shift register; Filter (signal processing); Key (lock); Arithmetic; Computer hardware; Algorithm; Function (biology); Mathematics; Electrical engineering; Chip; Telecommunications; Engineering; Cryptography; Computer security; Voltage; Power (physics); Physics","score_opus":0.06693660021298899,"score_gpt":0.28198977806372466,"score_spread":0.2150531778507357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482661747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004545014,0.00025964205,0.990668,0.0006243143,0.0015252011,0.00028502767,0.000011370844,0.000065792075,0.006106173],"genre_scores_gemma":[0.72657895,0.00038023113,0.25117448,0.01999592,0.0012409519,0.000026370559,0.000021389855,0.00012834126,0.00045333867],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680126,0.00013874681,0.00049831136,0.0010654905,0.000971318,0.00052488944],"domain_scores_gemma":[0.9954189,0.0019039732,0.00030370645,0.0018606771,0.00039657782,0.00011617851],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037944505,0.00041956874,0.00041888948,0.0006850187,0.00022863504,0.00024758483,0.004000735,0.00023628923,0.000108603286],"category_scores_gemma":[0.00021057205,0.00028756398,0.00014629212,0.0011802007,0.0008299809,0.00016792593,0.0009400668,0.0007507011,0.000030359564],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024271876,0.000048755115,0.00017559188,0.000014226234,0.000020097617,0.00002727387,0.0004477728,0.0021199116,0.000092517024,0.12436813,0.0001443167,0.8725171],"study_design_scores_gemma":[0.00094954635,0.0019782567,0.009106725,0.0013767839,0.000032160064,0.0000835122,4.803638e-7,0.2416602,0.025784526,0.68590635,0.02999099,0.003130476],"about_ca_topic_score_codex":0.000022973833,"about_ca_topic_score_gemma":0.00015684155,"teacher_disagreement_score":0.8693867,"about_ca_system_score_codex":0.00009519174,"about_ca_system_score_gemma":0.0003044444,"threshold_uncertainty_score":0.9999577},"labels":[],"label_agreement":null},{"id":"W1483070169","doi":"10.1002/9781118336816.ch4","title":"Irreducibility and Factorization","year":2012,"lang":"en","type":"other","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Irreducibility; Adjunction; Factorization; Mathematics; Pure mathematics; Algebra over a field; Combinatorics; Algorithm","score_opus":0.011500891406426758,"score_gpt":0.21948272758431406,"score_spread":0.2079818361778873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483070169","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005640871,0.0003886892,0.41676858,0.000040058916,0.0003396717,0.000046964455,0.0000011650914,0.00028148264,0.58212775],"genre_scores_gemma":[0.03402547,0.000049193113,0.027374495,0.00019637636,0.00035258752,0.0000066128555,0.0000065013674,0.000094070936,0.9378947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995623,0.000026991067,0.00004645285,0.00021303837,0.000059607057,0.00009156774],"domain_scores_gemma":[0.99950856,0.000015953154,0.000034003293,0.00038906003,0.000005240361,0.00004718153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010543955,0.0000811833,0.000075381635,0.00008550626,0.000018800785,0.00004306543,0.00019785695,0.000081279395,0.00086309033],"category_scores_gemma":[0.0000056850636,0.00006623856,0.00002245122,0.00010482645,0.00002475542,0.00007553872,0.000096383446,0.00004442216,0.00003871289],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.293036e-7,0.000022328324,0.00078884495,0.0000209079,0.000011942396,1.7739524e-7,0.00008556858,1.2651596e-8,0.000019439218,0.7723355,0.16460887,0.062105946],"study_design_scores_gemma":[0.00003636793,0.000009183458,0.0007590119,0.000011705522,0.0000038541057,0.0000012454844,0.000001979945,0.000023495164,0.00002945323,0.013095904,0.98590404,0.0001237724],"about_ca_topic_score_codex":0.0000149596835,"about_ca_topic_score_gemma":0.000004824185,"teacher_disagreement_score":0.82129514,"about_ca_system_score_codex":0.0000029721639,"about_ca_system_score_gemma":0.0000063631383,"threshold_uncertainty_score":0.9450234},"labels":[],"label_agreement":null},{"id":"W1485412461","doi":"10.1090/conm/655/13230","title":"On the Greatest Prime Factor of Some Divisibility Sequences","year":2015,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Divisibility rule; Prime (order theory); Factor (programming language); Prime factor; Combinatorics; Pure mathematics; Computer science; Programming language","score_opus":0.05242042567602115,"score_gpt":0.2786193819061626,"score_spread":0.22619895623014144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485412461","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027715901,0.0011527692,0.20985436,0.0017327559,0.0003754261,0.0027323114,0.00049214705,0.0016823986,0.7792062],"genre_scores_gemma":[0.49016705,0.00023071475,0.29623294,0.003714029,0.0008976269,0.00063367904,0.00010190727,0.0018583812,0.20616366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965183,0.00030998807,0.0008929751,0.0007264616,0.0010904812,0.0004617734],"domain_scores_gemma":[0.9936421,0.0021562043,0.001386199,0.0024264145,0.00012910848,0.00025997357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014621683,0.0006758084,0.0013959032,0.00011421148,0.00012526954,0.00014712337,0.0026068257,0.00023657388,0.00049637095],"category_scores_gemma":[0.0005585991,0.00041653597,0.0007539245,0.00083946146,0.0018581143,0.00018746316,0.0005752165,0.0005359523,0.00021041353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058144365,0.00071006676,0.000018380852,0.00065394107,0.0003996927,0.0000051701354,0.0038823085,3.373178e-7,0.000046940728,0.74472,0.24896717,0.0005901883],"study_design_scores_gemma":[0.00029263133,0.00050692685,0.000009991056,0.0010761612,0.000058582315,0.0000075070184,0.0008938196,0.002744474,0.00022351531,0.98147166,0.0119343195,0.0007804183],"about_ca_topic_score_codex":0.000028473163,"about_ca_topic_score_gemma":0.0000010778259,"teacher_disagreement_score":0.5730426,"about_ca_system_score_codex":0.0000682743,"about_ca_system_score_gemma":0.00034100618,"threshold_uncertainty_score":0.99982864},"labels":[],"label_agreement":null},{"id":"W1485596561","doi":"10.1007/11561354_19","title":"Reed-Solomon and Hermitian Code-Based Scheduling Protocols for Wireless Ad Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless ad hoc network; Scheduling (production processes); Wireless; Hermitian matrix; Computer network; Code (set theory); Telecommunications; Programming language; Mathematical optimization; Mathematics","score_opus":0.020788367603709813,"score_gpt":0.2660016171101031,"score_spread":0.2452132495063933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485596561","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010759928,0.0009319796,0.9917671,0.0006379568,0.00053776044,0.0054410202,0.00000788337,0.00025328316,0.00031543404],"genre_scores_gemma":[0.108027734,0.00006896245,0.88618726,0.0032256036,0.00092267996,0.001385635,0.000010010469,0.00008403306,0.000088062225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996264,0.00005404686,0.00053116155,0.0017535117,0.0005733946,0.00082390715],"domain_scores_gemma":[0.9971717,0.00076899154,0.00033660454,0.0012559668,0.00022967636,0.00023708589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001400959,0.00060713984,0.00060528493,0.0006607949,0.00049955293,0.00084658054,0.0026657102,0.00044544353,0.000006937006],"category_scores_gemma":[0.000046694662,0.000581519,0.00020468472,0.0005788771,0.0008735367,0.00049531576,0.0007040326,0.0007861026,0.0000031843394],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004633648,0.00003076292,0.000032531436,0.00007377129,0.000010000722,0.000019993111,0.00020861768,0.038355995,0.000060139497,0.024865938,0.0000059630825,0.93628997],"study_design_scores_gemma":[0.0006954223,0.0004952073,0.000029171706,0.0010908894,0.000010649338,0.000031088577,1.8150331e-7,0.8858449,0.00047435623,0.10610076,0.004453369,0.0007740169],"about_ca_topic_score_codex":0.0000013682031,"about_ca_topic_score_gemma":0.00008124189,"teacher_disagreement_score":0.93551594,"about_ca_system_score_codex":0.00012571982,"about_ca_system_score_gemma":0.0003567745,"threshold_uncertainty_score":0.99966365},"labels":[],"label_agreement":null},{"id":"W1486394389","doi":"10.1016/j.disc.2014.03.002","title":"Semidefinite programming for permutation codes","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Semidefinite programming; Permutation (music); Combinatorics; Permutation group; Conjugacy class; Upper and lower bounds; Order (exchange); Symmetric group; Discrete mathematics","score_opus":0.01757138752844671,"score_gpt":0.2605234870199942,"score_spread":0.2429520994915475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486394389","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070621627,0.000014728988,0.9891169,0.00022313179,0.00008934017,0.00021732629,0.0000026913435,0.00022061817,0.0030530777],"genre_scores_gemma":[0.4504428,0.0000019289012,0.5492182,0.000116418814,0.000043929787,0.00007022787,0.000007736091,0.000011310211,0.00008746639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926615,0.000032543852,0.00018507434,0.00018463377,0.00013490995,0.00019667724],"domain_scores_gemma":[0.99905443,0.00038931074,0.000096190815,0.0003549362,0.00005649831,0.000048616894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005852277,0.00010522068,0.00013639957,0.00006641752,0.00014839509,0.00019122893,0.0003873782,0.000035450452,0.0000032018286],"category_scores_gemma":[0.00017197288,0.0000897728,0.00010528032,0.0001884664,0.000036206435,0.00018014465,0.00006671005,0.00004678605,0.000015490326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018207261,0.000024655323,0.000029145347,0.0000974149,0.00000971081,1.8997366e-7,0.0018241015,0.000022739001,0.00017809834,0.96377844,0.000060233204,0.03397343],"study_design_scores_gemma":[0.00024072645,0.00013453349,0.000041340503,0.00006946514,0.000020441019,0.0000066222988,0.00018249225,0.22749197,0.0010587745,0.7600735,0.0104685845,0.0002115599],"about_ca_topic_score_codex":5.1929e-7,"about_ca_topic_score_gemma":0.0000010882932,"teacher_disagreement_score":0.44338062,"about_ca_system_score_codex":0.0000068069103,"about_ca_system_score_gemma":0.000008673683,"threshold_uncertainty_score":0.36608285},"labels":[],"label_agreement":null},{"id":"W1486886369","doi":"10.1109/mwscas.1993.343002","title":"An approach to double error correcting Reed-Solomon decoding without Chien search","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Decoding methods; Computer science; List decoding; Algorithm; Berlekamp–Welch algorithm; Arithmetic; Code (set theory); Search algorithm; Sequential decoding; Symbol (formal); Theoretical computer science; Mathematics; Concatenated error correction code; Set (abstract data type); Block code","score_opus":0.07511058565965957,"score_gpt":0.29733168500230067,"score_spread":0.22222109934264112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486886369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29715556,0.000016714048,0.58255905,0.0001406258,0.0002176647,0.00019156282,2.6362167e-7,0.00047917996,0.119239375],"genre_scores_gemma":[0.87749374,0.0000010811796,0.12143721,0.0003173034,0.00007896797,0.00001795089,7.51084e-7,0.000012280146,0.0006407031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983321,0.000102610575,0.00018848466,0.00060727674,0.0002851974,0.0004843279],"domain_scores_gemma":[0.9988309,0.000055759458,0.00003576114,0.0007614746,0.000057024088,0.0002590596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079903373,0.00015985176,0.00016702188,0.0002567684,0.00037691824,0.00036029573,0.0012019253,0.00005920459,0.00007536023],"category_scores_gemma":[0.000014503383,0.0001434588,0.00007404184,0.0010228297,0.000035165274,0.00061854214,0.00026818662,0.00020631352,0.00012521172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014537154,0.0011614019,0.048572104,0.00004940282,0.000066698434,0.000017044273,0.031289086,0.0041229003,0.005502988,0.515756,0.0016349416,0.39168206],"study_design_scores_gemma":[0.0011591157,0.00059822487,0.001766972,0.000046956946,0.000012685045,0.000108808505,0.0018616861,0.976987,0.013419728,0.0021855556,0.0009393309,0.0009139478],"about_ca_topic_score_codex":0.00007823267,"about_ca_topic_score_gemma":0.000023640754,"teacher_disagreement_score":0.9728641,"about_ca_system_score_codex":0.000025538478,"about_ca_system_score_gemma":0.000009870385,"threshold_uncertainty_score":0.585008},"labels":[],"label_agreement":null},{"id":"W1487285776","doi":"10.1007/3-540-44983-3_16","title":"On Welch-Gong Transformation Sequence Generators","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Transformation (genetics); Linear span; Golomb coding; Boolean function; Sequence (biology); Mathematics; Randomness; Discrete mathematics; Correlation attack; Pseudorandom number generator; Pseudorandom binary sequence; Combinatorics; Algorithm; Computer science; Binary number; Arithmetic; Cryptography; Statistics","score_opus":0.020299438594315204,"score_gpt":0.23967961475022667,"score_spread":0.21938017615591146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487285776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055853714,0.00014432569,0.9796935,0.0005525384,0.0016814441,0.00030454362,0.0000047282037,0.0002693676,0.016791021],"genre_scores_gemma":[0.8121705,0.00016304314,0.1813632,0.0052429433,0.00076114305,0.000023286379,0.000013281093,0.00006480828,0.00019777424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965455,0.000053451324,0.0004826224,0.0012967968,0.0009728541,0.0006487712],"domain_scores_gemma":[0.99779695,0.00036036278,0.00020740405,0.0013004562,0.00014850653,0.00018630097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009606705,0.0005423159,0.00040537634,0.0011778952,0.00039657333,0.0005824354,0.003104356,0.00030585343,0.000048370664],"category_scores_gemma":[0.00003775859,0.0004968864,0.00019674332,0.0010499433,0.00056557887,0.00087038527,0.00034155458,0.0008220784,0.000085840096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008331341,0.000016585285,0.000005416111,0.000013795793,0.0000058082837,0.000050414514,0.0006338767,0.01266714,0.00010586991,0.4205492,0.000011477029,0.5659321],"study_design_scores_gemma":[0.0002444161,0.00031486654,0.00002507445,0.00037372485,0.000007312242,0.000092235234,1.5928481e-7,0.17705305,0.0026558365,0.8151922,0.0032575754,0.0007835495],"about_ca_topic_score_codex":0.000007750593,"about_ca_topic_score_gemma":0.000027932378,"teacher_disagreement_score":0.811612,"about_ca_system_score_codex":0.00023879782,"about_ca_system_score_gemma":0.00028230328,"threshold_uncertainty_score":0.9997483},"labels":[],"label_agreement":null},{"id":"W1490900877","doi":"10.1109/glocom.2001.966337","title":"Highly reliable data transmission using concatenated coding and hybrid-type I ARQ in DS-CDMA systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Convolutional code; Decoding methods; Retransmission; Algorithm; Hybrid automatic repeat request; Error detection and correction; Automatic repeat request; Viterbi decoder; Concatenated error correction code; Viterbi algorithm; Selective Repeat ARQ; Coding gain; Forward error correction; Transmission (telecommunications); Telecommunications; Block code","score_opus":0.07650628644300536,"score_gpt":0.25740373411247136,"score_spread":0.180897447669466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490900877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43308088,0.0035096821,0.55177087,0.00073414756,0.0008458809,0.00042277257,0.000006999895,0.0005543967,0.009074376],"genre_scores_gemma":[0.98864365,0.00018078211,0.010792086,0.000099540666,0.000022915901,0.0000011598191,0.0000045783604,0.000008357163,0.00024691154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875796,0.00008542945,0.0002495018,0.0004805766,0.0001579199,0.00026862315],"domain_scores_gemma":[0.9990732,0.000091662994,0.00005429058,0.0006496528,0.00003533191,0.00009587609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005407705,0.00013054651,0.00018477168,0.00018569014,0.00014262536,0.00023835093,0.0007657859,0.00004702636,0.000033933124],"category_scores_gemma":[0.0000139085505,0.00011059264,0.000018750972,0.0006553212,0.000042854022,0.0007560495,0.00024230497,0.0001251155,0.000010934623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019164672,0.0008150218,0.011845482,0.00072932907,0.0001939617,0.00083518034,0.0039104586,0.005653321,0.1383299,0.6487322,0.023823654,0.16493988],"study_design_scores_gemma":[0.0004393234,0.000049731832,0.00009552663,0.00015010688,0.000008437343,0.00006153739,0.000035953744,0.98202753,0.0014201489,0.0010261848,0.014483023,0.00020251553],"about_ca_topic_score_codex":0.0001863044,"about_ca_topic_score_gemma":0.0000028990014,"teacher_disagreement_score":0.9763742,"about_ca_system_score_codex":0.000018940604,"about_ca_system_score_gemma":0.000012869261,"threshold_uncertainty_score":0.4509837},"labels":[],"label_agreement":null},{"id":"W1491595969","doi":"10.1109/asap.1990.145465","title":"Array processing on finite polynomial rings","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Redundancy (engineering); Polynomial ring; Computer science; Testability; Computation; Overhead (engineering); Polynomial; Theoretical computer science; Computational complexity theory; Algorithm; Parallel computing; Mathematics","score_opus":0.021484041150828033,"score_gpt":0.21481304053629294,"score_spread":0.1933289993854649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491595969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018537635,0.00007381234,0.60864,0.00162049,0.0002751692,0.00006449889,2.970448e-7,0.0005448035,0.37024325],"genre_scores_gemma":[0.9862677,0.0000024674691,0.0106244655,0.0011976572,0.00007984322,0.000003375785,8.978867e-8,0.0000040917635,0.001820323],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938375,0.00002055933,0.000085152526,0.00021850641,0.000117218835,0.0001747922],"domain_scores_gemma":[0.99959105,0.000061023013,0.000027977398,0.00025176108,0.0000147139135,0.00005348239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010950983,0.000078708865,0.000063598236,0.000094846866,0.0001384227,0.00015896457,0.00043396474,0.000026497335,0.00015448287],"category_scores_gemma":[0.000014954092,0.00006554911,0.000049916755,0.00030817086,0.000026565513,0.00025490968,0.000043349395,0.00008377505,0.000225038],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018115436,0.00024433955,0.0005952351,0.000017415814,0.000013363278,0.000015348178,0.0028133823,0.00010177886,0.003486408,0.267906,0.014031252,0.7107574],"study_design_scores_gemma":[0.002734184,0.0016198469,0.0037929104,0.00031524224,0.000025278758,0.000067069624,0.00017490238,0.23104385,0.094221845,0.07859582,0.58495986,0.0024491758],"about_ca_topic_score_codex":0.0000016767075,"about_ca_topic_score_gemma":6.5942504e-7,"teacher_disagreement_score":0.96773005,"about_ca_system_score_codex":0.000006670974,"about_ca_system_score_gemma":0.0000043987643,"threshold_uncertainty_score":0.28924835},"labels":[],"label_agreement":null},{"id":"W1496348523","doi":"10.1023/a:1016544907275","title":"An Enumeration of Binary Self-Dual Codes of Length 32","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Enumeration; Binary number; Mathematics; Permutation (music); Code (set theory); Binary code; Discrete mathematics; Dual (grammatical number); Automorphism; Linear code; Dual code; Set (abstract data type); Block code; Computer science; Algorithm; Decoding methods; Arithmetic; Physics","score_opus":0.024392864935547386,"score_gpt":0.2343478383543354,"score_spread":0.20995497341878802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496348523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7412477,0.0014649524,0.2555868,0.000069798836,0.00008676817,0.00020534232,0.000020392898,0.00022290798,0.0010953079],"genre_scores_gemma":[0.9454053,0.00044743027,0.05402625,0.00006194126,0.00002960645,0.000011804858,0.000004634956,0.000010370116,0.0000026673845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985131,0.00023621687,0.0003598812,0.0003776596,0.00026652592,0.00024661192],"domain_scores_gemma":[0.9988738,0.00016041598,0.00018479895,0.0005390785,0.00012377501,0.0001181772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045038908,0.00020010478,0.0003082629,0.00046788537,0.00017055433,0.00008135435,0.00043278924,0.000094352145,0.000040819956],"category_scores_gemma":[0.000008647067,0.00018706179,0.00017290351,0.0010018147,0.00020627765,0.00052904815,0.000066978515,0.00010696002,0.0000017215029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000689355,0.0012654538,0.011673565,0.00015127612,0.00024036774,0.000013150949,0.0070010684,0.00022656393,0.075949945,0.8573336,0.0005331425,0.04554292],"study_design_scores_gemma":[0.006103732,0.017450608,0.059180092,0.00057287223,0.00065250054,0.00020056899,0.002628825,0.499663,0.15377006,0.24654132,0.009468908,0.0037675044],"about_ca_topic_score_codex":0.000012701981,"about_ca_topic_score_gemma":0.0000027640872,"teacher_disagreement_score":0.6107923,"about_ca_system_score_codex":0.000003547026,"about_ca_system_score_gemma":0.000012127589,"threshold_uncertainty_score":0.7628158},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018154682644453475,"score_gpt":0.24135369018950092,"score_spread":0.22319900754504746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498077172","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086867955,0.00028503814,0.9869064,0.0020132198,0.003974684,0.00070607354,0.000061048915,0.000393986,0.0047908546],"genre_scores_gemma":[0.2794839,0.000032941716,0.7147017,0.0033487277,0.0014172433,0.000043196782,0.000033380606,0.0000733915,0.0008654531],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99492705,0.00009078581,0.00064240996,0.0021796066,0.0012086467,0.0009515152],"domain_scores_gemma":[0.9947552,0.002041092,0.00030929607,0.001994571,0.00042368725,0.00047613127],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012010691,0.00077625486,0.00080993946,0.0019065447,0.0008097497,0.0017101613,0.0036916533,0.00041564976,0.00008739058],"category_scores_gemma":[0.00026075894,0.00072960276,0.0004055421,0.0017246412,0.0011151313,0.00087354466,0.0011321979,0.0010712954,0.00012003677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011049896,0.00006349758,0.00012558483,0.000021497508,0.00008114832,0.00015613869,0.0020075636,0.008791103,0.0008094089,0.11780809,0.0001951893,0.86983025],"study_design_scores_gemma":[0.0029676675,0.0005919246,0.00032099185,0.00066792284,0.00009276097,0.00025717862,0.0000054338234,0.13129087,0.001413691,0.84754425,0.012558578,0.0022887066],"about_ca_topic_score_codex":0.000046893754,"about_ca_topic_score_gemma":0.0002438742,"teacher_disagreement_score":0.86754155,"about_ca_system_score_codex":0.00021172233,"about_ca_system_score_gemma":0.00048669984,"threshold_uncertainty_score":0.99951553},"labels":[],"label_agreement":null},{"id":"W1499185341","doi":"10.1109/ccece.2004.1347674","title":"Design of a high-speed (255,239) RS decoder using 0.18 μm CMOS","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Very-large-scale integration; Soft-decision decoder; CMOS; Decoding methods; Latency (audio); Parallel computing; Computer hardware; Electronic engineering; Algorithm; Embedded system; Engineering; Telecommunications","score_opus":0.052031596979778265,"score_gpt":0.2628484752812741,"score_spread":0.2108168783014958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499185341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11435057,0.000039460152,0.88407594,0.00015748278,0.00017426275,0.0001126898,4.3948532e-7,0.00014361517,0.0009455237],"genre_scores_gemma":[0.6942502,0.0000030485328,0.30544648,0.00023785753,0.000019932248,0.0000012698873,2.0279818e-7,0.000006041322,0.00003495559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989749,0.00007460506,0.000212512,0.00028900808,0.00019983426,0.00024913298],"domain_scores_gemma":[0.99918544,0.000098467324,0.000076765406,0.0004954836,0.000068693,0.00007514796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036982805,0.0001262819,0.00016796878,0.00015719979,0.0000990219,0.000068109905,0.0006440361,0.000055589775,0.000113750175],"category_scores_gemma":[0.000018543325,0.000110297704,0.00008503019,0.0006151029,0.000071202725,0.00032069278,0.00014869127,0.00007643957,0.000022591441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004818198,0.00020806669,0.00014971205,0.000017605846,0.00006124823,0.000021098096,0.0010940458,0.059041608,0.04149314,0.88911504,0.00022668003,0.008523558],"study_design_scores_gemma":[0.0020028464,0.0004042705,0.0005965877,0.00010831398,0.000039634877,0.000061287035,0.00008754339,0.08424062,0.17983012,0.73163176,0.00035321442,0.0006438273],"about_ca_topic_score_codex":0.00011136381,"about_ca_topic_score_gemma":0.000004690974,"teacher_disagreement_score":0.57989967,"about_ca_system_score_codex":0.000025773441,"about_ca_system_score_gemma":0.000080167265,"threshold_uncertainty_score":0.44978097},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02246416249936636,"score_gpt":0.25627651318834527,"score_spread":0.2338123506889789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499326532","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001810783,0.000336638,0.9808649,0.0007447131,0.0021152778,0.0003508301,0.0000058510495,0.00026632485,0.015134386],"genre_scores_gemma":[0.15847805,0.000032247142,0.82684404,0.011131635,0.001466397,0.000017648741,0.000004095226,0.00008638238,0.0019395174],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956564,0.000036998295,0.0004916352,0.0018058035,0.0010973744,0.00091182004],"domain_scores_gemma":[0.99670523,0.0005815271,0.00025569138,0.0018621705,0.0002304966,0.00036488308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014617805,0.000603027,0.000546438,0.0016836002,0.0003488734,0.00065871986,0.0049198787,0.0003499187,0.00004553552],"category_scores_gemma":[0.00010108969,0.00056576426,0.0002230016,0.0014497942,0.00051817636,0.00045670063,0.0018705914,0.00085017877,0.00017231221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011623287,0.00003425237,0.00015562124,0.000025318834,0.000012650316,0.00014995027,0.00067314814,0.0037098175,0.00011414646,0.18842728,0.000047060912,0.80663913],"study_design_scores_gemma":[0.00043281837,0.0006316023,0.0021580937,0.001218134,0.00001754886,0.00016313829,5.894901e-7,0.032237194,0.0027090134,0.9233316,0.034936476,0.0021637871],"about_ca_topic_score_codex":0.000010305448,"about_ca_topic_score_gemma":0.000096523225,"teacher_disagreement_score":0.8044753,"about_ca_system_score_codex":0.00016883505,"about_ca_system_score_gemma":0.00025214715,"threshold_uncertainty_score":0.9996794},"labels":[],"label_agreement":null},{"id":"W1503393710","doi":"10.1007/978-3-642-17517-6_25","title":"Computing Sparse Multiples of Polynomials","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplicative function; Degree (music); Multiple; Combinatorics; Finite field; Polynomial; Extension (predicate logic); Computational complexity theory; Constant (computer programming); Discrete mathematics; Mathematics; Time complexity; Field (mathematics); Order (exchange); Algorithm; Computer science; Arithmetic; Pure mathematics; Physics; Mathematical analysis","score_opus":0.018457738780916284,"score_gpt":0.24135644795938668,"score_spread":0.2228987091784704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503393710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014391526,0.00027871208,0.99252695,0.00021131725,0.0022532048,0.00027513757,0.0000058849614,0.0001650834,0.0028445486],"genre_scores_gemma":[0.5053083,0.000014859887,0.49385014,0.00039119393,0.0003659201,0.000001564892,0.0000017796153,0.000024267101,0.00004197902],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965629,0.000049982045,0.0006990932,0.0013019961,0.00076741324,0.00061860407],"domain_scores_gemma":[0.99637395,0.0009996501,0.0005310967,0.0016924437,0.00023313497,0.00016974515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015380991,0.0005081729,0.00069698476,0.0011299684,0.00027181776,0.00029076854,0.004308979,0.0004028034,0.000027763588],"category_scores_gemma":[0.00014101031,0.00047502015,0.0002627997,0.0006838102,0.0013620927,0.00037967006,0.0017786411,0.0010434743,0.000020463496],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011556753,0.00005032339,0.000190551,0.000055722492,0.000019378978,0.000040364423,0.0012688906,0.0042994767,0.006931606,0.12511778,0.0000058438427,0.8620085],"study_design_scores_gemma":[0.0006733619,0.0003677569,0.00050059205,0.0009966618,0.000023177718,0.000120334655,4.738478e-7,0.22882804,0.053464282,0.71073467,0.00276675,0.0015238868],"about_ca_topic_score_codex":0.00002128023,"about_ca_topic_score_gemma":0.00005431178,"teacher_disagreement_score":0.8604846,"about_ca_system_score_codex":0.000059202874,"about_ca_system_score_gemma":0.00036218253,"threshold_uncertainty_score":0.99977016},"labels":[],"label_agreement":null},{"id":"W1504604993","doi":"10.1109/isit.1993.748411","title":"A New Remainder Based Decoding Algorithm for Reed-Solomon Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Remainder; Berlekamp–Welch algorithm; Algorithm; Polynomial; Polynomial code; Decoding methods; Euclidean algorithm; Computation; List decoding; Computer science; Chinese remainder theorem; Mathematics; Sequential decoding; Arithmetic; Concatenated error correction code; Block code","score_opus":0.01713977745125817,"score_gpt":0.256591572027516,"score_spread":0.23945179457625781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504604993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036975942,0.00005955762,0.9925282,0.0016368512,0.000149387,0.00015749976,0.0000014301643,0.00033467103,0.0047626593],"genre_scores_gemma":[0.08020399,0.0000021156854,0.9171887,0.0016271236,0.00018873953,0.000014125046,0.0000015614054,0.000008181352,0.000765469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990543,0.00003371956,0.0001610355,0.00032435366,0.00013671812,0.00028985416],"domain_scores_gemma":[0.99915045,0.00024042919,0.00004511353,0.00039464358,0.000045067583,0.0001242739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043658225,0.000113302194,0.00012483387,0.00012746002,0.00015931691,0.00014542643,0.00056562456,0.00005518316,0.00007873797],"category_scores_gemma":[0.000023167007,0.0001058475,0.00013451265,0.00030586115,0.000019102037,0.0003253465,0.00007370315,0.0000647917,0.00002587222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006332012,0.000024006444,0.00003746302,0.0000029009432,0.000009275618,0.0000010562408,0.00010802392,0.000052412655,0.0003060661,0.17535491,0.0042266054,0.81987095],"study_design_scores_gemma":[0.0010508669,0.00017602603,0.00011190193,0.000026991805,0.000012000698,0.000009394642,0.000029346285,0.8792912,0.017131506,0.0563205,0.045494817,0.0003454533],"about_ca_topic_score_codex":0.00001161946,"about_ca_topic_score_gemma":0.00004001443,"teacher_disagreement_score":0.8792388,"about_ca_system_score_codex":0.000021735643,"about_ca_system_score_gemma":0.000063743086,"threshold_uncertainty_score":0.4316336},"labels":[],"label_agreement":null},{"id":"W1504958541","doi":"","title":"Irreducible cyclic codes of length 2pn.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Arithmetic; Discrete mathematics","score_opus":0.012311740047581175,"score_gpt":0.24737944442209656,"score_spread":0.23506770437451538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504958541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96920294,0.00027829938,0.011379228,0.00012633242,0.0019173891,0.000092426795,0.0000010515665,0.00018467016,0.016817683],"genre_scores_gemma":[0.9968886,0.0000150780925,0.0029327008,0.00007386066,0.0000077682735,0.0000024948206,8.360415e-7,0.0000073529945,0.00007132346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892324,0.000051215724,0.00024289158,0.0002686722,0.00022536948,0.00028859195],"domain_scores_gemma":[0.9988477,0.00023608452,0.00010094156,0.0006485869,0.000073544754,0.00009312876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094094535,0.00011390879,0.00017258526,0.00017396043,0.00009549556,0.000039294086,0.0008266823,0.00005915475,0.00001534718],"category_scores_gemma":[0.000047545407,0.00011277737,0.000100299454,0.0007345458,0.00008763418,0.0002481343,0.00017247109,0.000118259806,0.000027621949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010464092,0.0001252053,0.0025151705,0.000007993566,0.000017843837,0.000006213822,0.00038759073,0.0000019303875,0.0025045285,0.9831474,0.00046678568,0.010808871],"study_design_scores_gemma":[0.00042518502,0.0001580659,0.009432282,0.000023799916,0.000007277748,0.000007042094,0.00005178563,0.00012333614,0.042663038,0.9434654,0.0034737769,0.00016899884],"about_ca_topic_score_codex":0.00001605614,"about_ca_topic_score_gemma":0.0000028617594,"teacher_disagreement_score":0.04015851,"about_ca_system_score_codex":0.000015981064,"about_ca_system_score_gemma":0.000030328521,"threshold_uncertainty_score":0.45989278},"labels":[],"label_agreement":null},{"id":"W1505242526","doi":"10.1007/3-540-45311-3_12","title":"Frameproof and IPP Codes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Computer science; Property (philosophy); Generalization; Class (philosophy); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Computer security; Artificial intelligence","score_opus":0.013638423814225266,"score_gpt":0.2320977954967139,"score_spread":0.21845937168248863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505242526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019837018,0.001064019,0.9846299,0.00060251006,0.0008739573,0.00021143713,0.0000025995414,0.00020168192,0.01221551],"genre_scores_gemma":[0.38304424,0.00042102227,0.61062807,0.004348914,0.00084572687,0.000015755677,0.0000041430526,0.00006440091,0.00062771165],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970422,0.000034270408,0.00033322137,0.0014204672,0.0006167928,0.0005530646],"domain_scores_gemma":[0.9978301,0.00047042468,0.00016398692,0.0012308666,0.00012227299,0.00018237611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008573289,0.00044532766,0.00043696718,0.0007851604,0.00029405972,0.00064323394,0.0024737387,0.00028781893,0.000031949203],"category_scores_gemma":[0.00005436387,0.00040462875,0.00011060974,0.00064572383,0.0010378932,0.00048710848,0.001347575,0.000720945,0.000022397067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004028928,0.000013670658,0.00010239656,0.00001709192,0.0000074899062,0.00006573281,0.00037557867,0.000566744,0.00003911553,0.23056497,0.000013442182,0.7682297],"study_design_scores_gemma":[0.00016700767,0.00018323901,0.00013596447,0.00026220974,0.000006941495,0.00014060228,1.1203593e-7,0.0610416,0.0003196691,0.9297911,0.007372858,0.0005787135],"about_ca_topic_score_codex":0.000008992869,"about_ca_topic_score_gemma":0.000031002608,"teacher_disagreement_score":0.767651,"about_ca_system_score_codex":0.00006855573,"about_ca_system_score_gemma":0.00017126268,"threshold_uncertainty_score":0.99984056},"labels":[],"label_agreement":null},{"id":"W1506034437","doi":"10.1007/11799313_24","title":"Upper Bounds on Algebraic Immunity of Boolean Power Functions","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Boolean function; Combinatorics; Mathematics; Degree (music); Algebraic number; Upper and lower bounds; Inverse; Discrete mathematics; Cipher; Stream cipher; Function (biology); Algorithm; Cryptography; Computer science; Physics","score_opus":0.009893089772609848,"score_gpt":0.21856680517346075,"score_spread":0.2086737154008509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506034437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012995787,0.00025624997,0.9625593,0.00031110938,0.0017942198,0.00020925772,0.00000983376,0.00016534174,0.03339515],"genre_scores_gemma":[0.9434332,0.000013277755,0.053790018,0.0014245217,0.00026931165,0.0000078140665,0.000011111189,0.000043776705,0.0010069585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685794,0.00006827009,0.0005255216,0.0011132061,0.00087458955,0.000560491],"domain_scores_gemma":[0.996781,0.0005586924,0.0003030661,0.0020164077,0.00021844418,0.00012241921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009570991,0.0005005891,0.0004952239,0.001349569,0.00039935522,0.0003166561,0.0031702744,0.0002910408,0.00007687898],"category_scores_gemma":[0.000052360156,0.00045805343,0.0003253271,0.00097049103,0.0011218206,0.00040689143,0.00094639696,0.0009534459,0.00005213858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003716699,0.00023956348,0.00022186847,0.000051919953,0.000047210793,0.000045439454,0.0008974269,0.011949426,0.00048492092,0.57713866,0.00052010163,0.40836632],"study_design_scores_gemma":[0.00047766315,0.0011604271,0.0018892669,0.00073642615,0.000022975924,0.00006034375,6.184987e-7,0.021773865,0.002594141,0.96057135,0.009467256,0.0012456451],"about_ca_topic_score_codex":0.000028999932,"about_ca_topic_score_gemma":0.000029862562,"teacher_disagreement_score":0.9421336,"about_ca_system_score_codex":0.00013463655,"about_ca_system_score_gemma":0.00030360615,"threshold_uncertainty_score":0.9997871},"labels":[],"label_agreement":null},{"id":"W1509953781","doi":"10.1109/tit.2015.2462846","title":"Unequal Message Protection: Asymptotic and Non-Asymptotic Tradeoffs","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National University of Singapore; National Science Foundation","keywords":"Disjoint sets; Erasure code; Header; Block code; Mathematics; Discrete mathematics; Computer science; Repetition code; Coset; Linear code; Decoding methods; Algorithm; Statistics","score_opus":0.017193150510787302,"score_gpt":0.2138287944117505,"score_spread":0.19663564390096322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509953781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012901819,0.000016515143,0.9798352,0.0002991701,0.0008456427,0.0003351764,0.0000067819906,0.00034415146,0.005415536],"genre_scores_gemma":[0.9975115,0.000007954932,0.0018202487,0.00042589882,0.000028570985,0.00008546986,0.0000014997136,0.0000079677775,0.00011088794],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873185,0.00017566571,0.00034294528,0.00019288853,0.0003184011,0.0002382703],"domain_scores_gemma":[0.9990332,0.00012501667,0.00011365074,0.00043328656,0.00009898972,0.0001958448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010171891,0.00019117244,0.00015778815,0.00042021816,0.00031649924,0.0002532054,0.0003523871,0.00010545453,0.00003412152],"category_scores_gemma":[0.000014555972,0.00017943485,0.00009456675,0.0005954106,0.00010766217,0.002655896,0.000004634461,0.00028005772,0.0002119854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004001959,0.00026122972,0.000014477238,0.00011175129,0.00014241211,0.0000045890397,0.01920473,0.017793387,0.00016561378,0.45445454,0.00026702505,0.50718004],"study_design_scores_gemma":[0.011601522,0.005006818,0.001806823,0.00048417973,0.00028733572,0.0005207664,0.007650541,0.32239288,0.045944832,0.58461064,0.016376236,0.0033173983],"about_ca_topic_score_codex":0.0000061533674,"about_ca_topic_score_gemma":0.0000015400656,"teacher_disagreement_score":0.98460966,"about_ca_system_score_codex":0.000054819222,"about_ca_system_score_gemma":0.00008148609,"threshold_uncertainty_score":0.73171407},"labels":[],"label_agreement":null},{"id":"W1511609224","doi":"","title":"No maximal partial spread of size 115 in PG(3,11)","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.009746909160056534,"score_gpt":0.2230698239956414,"score_spread":0.21332291483558488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511609224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9804733,0.00009198483,0.0009340732,0.00007281433,0.0028121895,0.00012274807,0.0000011139241,0.00008044452,0.015411337],"genre_scores_gemma":[0.9978555,0.000006706112,0.0019512505,0.000071066584,0.000006859043,0.000010353955,3.311952e-7,0.000007496041,0.00009046327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874777,0.00018746992,0.00026245136,0.0002936267,0.00021362299,0.0002950583],"domain_scores_gemma":[0.998954,0.0002547149,0.00008476485,0.00056511175,0.000064976324,0.00007645426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057061354,0.00013031656,0.00020497387,0.00009371424,0.00005018962,0.000039855167,0.00062477525,0.00006935321,0.000041816515],"category_scores_gemma":[0.0002279388,0.00013422214,0.000096562515,0.00061713974,0.000070926646,0.00019358553,0.000119122014,0.00012778016,0.000048540034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014944796,0.00018570638,0.018678403,0.000008055623,0.0000075633516,0.000013910081,0.00020628919,0.0000027336555,0.00074820156,0.9787655,0.00021381913,0.0011548898],"study_design_scores_gemma":[0.0012029175,0.00021674419,0.0100172125,0.000033232907,0.000005971898,0.000006576883,0.00001730624,0.0002478017,0.010310754,0.9671623,0.010548032,0.0002311418],"about_ca_topic_score_codex":0.000035962326,"about_ca_topic_score_gemma":0.000007919279,"teacher_disagreement_score":0.017382178,"about_ca_system_score_codex":0.000018348775,"about_ca_system_score_gemma":0.000058972586,"threshold_uncertainty_score":0.547342},"labels":[],"label_agreement":null},{"id":"W1516924677","doi":"10.1007/978-3-540-68164-9_13","title":"An Adaptation of the NICE Cryptosystem to Real Quadratic Orders","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Nice; Cryptosystem; Computer science; Quadratic equation; Factorization; Quadratic residue; Adaptation (eye); Theoretical computer science; Arithmetic; Algorithm; Cryptography; Mathematics; Physics","score_opus":0.018174923402855103,"score_gpt":0.23764810164879216,"score_spread":0.21947317824593707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516924677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028579794,0.00007266906,0.9932037,0.00041440647,0.0012008073,0.00042170173,0.0000028414588,0.0001017193,0.0017241848],"genre_scores_gemma":[0.8236618,0.000020645419,0.17539592,0.00068584515,0.00016110158,0.000008492774,0.0000011266658,0.000020752808,0.000044291006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997075,0.00011365967,0.000487367,0.0009949576,0.0009325573,0.00039641676],"domain_scores_gemma":[0.9970672,0.00034964818,0.000316679,0.0018617205,0.00025993027,0.00014483143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007986103,0.0003510823,0.00038811378,0.00060324837,0.00033270093,0.00018906483,0.004317756,0.0001824449,0.000005771866],"category_scores_gemma":[0.0000464224,0.00026846907,0.00015836876,0.0012444824,0.00050998904,0.0004568929,0.0006364304,0.00040629177,0.000010583149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026297335,0.00007562255,0.00021499023,0.0000853466,0.000021592425,0.00002618777,0.014801549,0.20424739,0.00075675035,0.21946052,0.000042172942,0.5602416],"study_design_scores_gemma":[0.00040497177,0.00096957805,0.00092017476,0.0010710451,0.000021724265,0.000113618364,0.00000570561,0.7776653,0.0020872352,0.21391214,0.0016664981,0.0011620182],"about_ca_topic_score_codex":0.00013648947,"about_ca_topic_score_gemma":0.00044393446,"teacher_disagreement_score":0.8208038,"about_ca_system_score_codex":0.00011157769,"about_ca_system_score_gemma":0.00048549834,"threshold_uncertainty_score":0.99997675},"labels":[],"label_agreement":null},{"id":"W1517085700","doi":"10.1109/tit.2015.2463285","title":"On a Markov Lemma and Typical Sequences for Polish Alphabets","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Lemma (botany); Mathematics; Markov process; Computer science; Discrete mathematics; Algorithm; Combinatorics; Statistics","score_opus":0.018577101489721453,"score_gpt":0.24363570155091918,"score_spread":0.22505860006119774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517085700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0139873745,0.000010362169,0.9812869,0.0003955225,0.00057286595,0.00020471693,0.000022543605,0.00017203034,0.0033477303],"genre_scores_gemma":[0.9934048,0.000005508641,0.0051163426,0.0012967901,0.00002163173,0.00006758735,0.0000023218072,0.0000040864757,0.00008093161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999261,0.00008471981,0.00019717446,0.00012219352,0.00017063055,0.00016425892],"domain_scores_gemma":[0.99913937,0.00035079318,0.00006262892,0.00023726065,0.00008730738,0.0001226273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069024705,0.000110582514,0.000096075695,0.0002501718,0.00019915773,0.00016564513,0.00025895776,0.00006534583,0.000018532432],"category_scores_gemma":[0.000024763449,0.00009733312,0.00006946461,0.00022316078,0.00008125922,0.0013844821,0.0000022222646,0.00011725906,0.000050617447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003940026,0.000042219177,0.0000012136292,0.000013986128,0.000020166795,2.7580126e-7,0.00211766,0.00077490095,0.00001223618,0.76730096,0.00065872405,0.22866365],"study_design_scores_gemma":[0.001924684,0.0012547876,0.00008844348,0.000064346146,0.00002844036,0.000036800582,0.0010333546,0.019796306,0.005928911,0.9593177,0.01009942,0.00042683922],"about_ca_topic_score_codex":0.000002226918,"about_ca_topic_score_gemma":0.0000018562664,"teacher_disagreement_score":0.97941744,"about_ca_system_score_codex":0.000027982096,"about_ca_system_score_gemma":0.00004996323,"threshold_uncertainty_score":0.39691296},"labels":[],"label_agreement":null},{"id":"W151888074","doi":"","title":"Binary codes from graphs on triples and permutation decoding.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Adjacency list; Adjacency matrix; Discrete mathematics; Binary number; Permutation (music); Decoding methods; Arithmetic; Algorithm; Graph","score_opus":0.009198161447047309,"score_gpt":0.21855478652794538,"score_spread":0.20935662508089808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151888074","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950825,0.0003819286,0.0011443894,0.00028390405,0.0008256056,0.00008637954,0.0000052296105,0.00020149622,0.0019885418],"genre_scores_gemma":[0.99816537,0.000029334778,0.0016123421,0.000125414,0.000009429227,0.000009921589,0.00001166101,0.000007805677,0.000028731049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990614,0.000093662646,0.00015621995,0.0003396363,0.00017121811,0.00017783475],"domain_scores_gemma":[0.99923015,0.0002998717,0.000066042565,0.000315525,0.00003469586,0.000053717868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019352016,0.00013476076,0.00013673281,0.00016149157,0.00021475623,0.00015974915,0.00032999984,0.000057154986,0.000009440949],"category_scores_gemma":[0.00002056141,0.00013084788,0.00006189567,0.00036345454,0.0000670889,0.0002678002,0.00008617748,0.00009839145,0.000016464857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001778078,0.00008877193,0.005611057,0.0000026948865,0.0000101812,0.000010616994,0.00017407912,0.000009805291,0.0010399739,0.98652786,0.00079848146,0.0057086837],"study_design_scores_gemma":[0.00055668515,0.00015939305,0.043697257,0.000022808135,0.000008103708,0.0000022810739,0.000026480018,0.0019694963,0.0018457868,0.95101637,0.0005268151,0.00016855673],"about_ca_topic_score_codex":0.00008106133,"about_ca_topic_score_gemma":0.000007852839,"teacher_disagreement_score":0.0380862,"about_ca_system_score_codex":0.000014096193,"about_ca_system_score_gemma":0.000013815689,"threshold_uncertainty_score":0.53358215},"labels":[],"label_agreement":null},{"id":"W1520746258","doi":"10.1007/11863854_9","title":"Crosscorrelation Properties of Binary Sequences with Ideal Two-Level Autocorrelation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Binary number; Ideal (ethics); Mathematics; Autocorrelation matrix; Complementary sequences; Pseudorandom binary sequence; Autocorrelation technique; Algorithm; Computer science; Discrete mathematics; Statistics; Arithmetic","score_opus":0.02488444683529998,"score_gpt":0.23091078610925872,"score_spread":0.20602633927395875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520746258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034455664,0.00038396078,0.99256533,0.00019400068,0.00067884853,0.00043268903,0.000004180498,0.00014919067,0.0021462522],"genre_scores_gemma":[0.8140866,0.0000054939055,0.18541726,0.00015514228,0.00014235503,0.0000113461965,0.0000047786,0.00001910019,0.00015792553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711066,0.000050546965,0.0005218379,0.0010067226,0.0009032232,0.00040702213],"domain_scores_gemma":[0.9981188,0.00020575737,0.00046293327,0.0008456759,0.00029485926,0.00007197901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007776361,0.00041761558,0.00041089556,0.0008875468,0.0002870973,0.0003092994,0.0017393988,0.00020385548,0.000006661182],"category_scores_gemma":[0.000027020675,0.00032299542,0.00011219948,0.0008685423,0.0012802407,0.00095659896,0.00045556427,0.0005213475,0.000008275464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007033538,0.000071918344,0.0012516752,0.0001250562,0.000026720898,0.00005835336,0.0017249243,0.51898915,0.0031705105,0.15138556,0.000017070075,0.3231087],"study_design_scores_gemma":[0.000542863,0.0006715793,0.0020787371,0.0016814399,0.000022257333,0.00009472073,4.803419e-7,0.7219947,0.005201009,0.26663703,0.00016947938,0.0009056953],"about_ca_topic_score_codex":0.00009262292,"about_ca_topic_score_gemma":0.00008019878,"teacher_disagreement_score":0.81064105,"about_ca_system_score_codex":0.000121563455,"about_ca_system_score_gemma":0.00053541793,"threshold_uncertainty_score":0.9999222},"labels":[],"label_agreement":null},{"id":"W1527547811","doi":"10.1109/isit.1991.695092","title":"Hermitian Codes As GRS Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hermitian matrix; Computer science; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.010355568479633925,"score_gpt":0.24123007707653799,"score_spread":0.23087450859690406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527547811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12911074,0.0001928351,0.43230325,0.0050978237,0.00024711216,0.00010292138,0.0000013326215,0.0009270989,0.4320169],"genre_scores_gemma":[0.9701359,0.0000106733805,0.025646254,0.0021663741,0.00008017228,0.0000045527636,5.46646e-7,0.0000041814324,0.0019513414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993036,0.000043539894,0.000103623046,0.00021911347,0.00013175249,0.00019836324],"domain_scores_gemma":[0.99943006,0.0000715065,0.000022586359,0.00037015366,0.00002250358,0.00008319487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020502073,0.000086833556,0.000085593165,0.000073398645,0.0001173568,0.00013442994,0.00061211083,0.000031994892,0.00034168627],"category_scores_gemma":[0.000011888873,0.00007379677,0.00007093637,0.00025838905,0.0000513408,0.00034504902,0.00011458803,0.00006495134,0.00051243434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025004701,0.000031047697,0.00025633196,0.0000015714248,0.00000746095,0.0000042047345,0.00021928952,0.000017254228,0.00031512784,0.84560895,0.0018689882,0.15166725],"study_design_scores_gemma":[0.0007804804,0.000326261,0.0044327606,0.000041896048,0.000015818763,0.00013741186,0.00023604384,0.014893125,0.07352277,0.41467986,0.49004194,0.00089161424],"about_ca_topic_score_codex":0.000015216809,"about_ca_topic_score_gemma":0.000044299384,"teacher_disagreement_score":0.8410252,"about_ca_system_score_codex":0.000008819055,"about_ca_system_score_gemma":0.0000195006,"threshold_uncertainty_score":0.6586478},"labels":[],"label_agreement":null},{"id":"W1528404527","doi":"10.1109/itw.2015.7133088","title":"Encoding and decoding algorithms for LP-decodable multipermutation codes","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Computer science; Encoding (memory); Sequential decoding; List decoding; Berlekamp–Welch algorithm; Algorithm; Theoretical computer science; Concatenated error correction code; Block code; Artificial intelligence","score_opus":0.06587234443456226,"score_gpt":0.30018924134180824,"score_spread":0.234316896907246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528404527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029962473,0.00010424944,0.9658504,0.0002559968,0.00024815503,0.00014999975,0.0000024870671,0.00020444443,0.0032217533],"genre_scores_gemma":[0.64206123,0.000008373969,0.35754377,0.00015943652,0.000047320184,0.000024166102,0.000002466079,0.000005285339,0.00014795898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924934,0.000031970238,0.0001355571,0.00027076056,0.000110749104,0.00020162752],"domain_scores_gemma":[0.9993095,0.00024624396,0.000042418367,0.00018225148,0.00009413837,0.00012549419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066243514,0.00009321337,0.000108056796,0.000108830405,0.0001617263,0.00021220793,0.00024920946,0.000038005008,0.0000040255827],"category_scores_gemma":[0.00011356036,0.00008306937,0.000040891686,0.00019814403,0.000031009706,0.0005492236,0.00010077576,0.000041781845,0.0000046635437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022243921,0.000044729008,0.001848044,0.000023421895,0.000023570981,0.000003336987,0.0027520233,0.00016576522,0.0016595674,0.74389917,0.0012227088,0.24833544],"study_design_scores_gemma":[0.0012477912,0.00021878451,0.00031069614,0.000027580147,0.00001250689,0.000022162347,0.0007110556,0.77590036,0.010448802,0.20455937,0.006202043,0.0003388302],"about_ca_topic_score_codex":0.000013972507,"about_ca_topic_score_gemma":0.000009355394,"teacher_disagreement_score":0.7757346,"about_ca_system_score_codex":0.000017327953,"about_ca_system_score_gemma":0.000027658729,"threshold_uncertainty_score":0.33874705},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028167212938885026,"score_gpt":0.2850306899984802,"score_spread":0.25686347705959517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528709073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019281576,0.000037768372,0.99599016,0.00007372502,0.000880304,0.00044119672,0.0000072635216,0.00009586754,0.00054554665],"genre_scores_gemma":[0.84258944,0.0000048140955,0.15582272,0.0014256308,0.00011837695,0.00000636662,0.000010294287,0.000013181787,0.000009170122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977132,0.00017207707,0.00045761745,0.00060712587,0.0006673485,0.00038261007],"domain_scores_gemma":[0.9976126,0.0009260111,0.00025428052,0.0008181929,0.00019502144,0.00019387616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025300584,0.000354814,0.000332023,0.0014814469,0.00018507712,0.00031361086,0.0012530778,0.0002489327,0.000024847908],"category_scores_gemma":[0.000106870524,0.0003219357,0.000073398354,0.00056430436,0.00020142192,0.0012182718,0.00029059133,0.00034480993,0.000008051889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035734984,0.00006483882,0.000056329463,0.0000961569,0.000014348316,0.0000074498157,0.0063728075,0.033627402,0.001596767,0.2252594,0.000020667809,0.7325265],"study_design_scores_gemma":[0.00045711896,0.0011598832,0.0011929731,0.0005604277,0.000014170891,0.000013020388,0.0000010376518,0.8155562,0.008745062,0.17142646,0.00018797447,0.00068564696],"about_ca_topic_score_codex":0.0000014738922,"about_ca_topic_score_gemma":0.0000019109814,"teacher_disagreement_score":0.8406613,"about_ca_system_score_codex":0.000071781265,"about_ca_system_score_gemma":0.00011603518,"threshold_uncertainty_score":0.9999233},"labels":[],"label_agreement":null},{"id":"W1531836745","doi":"10.1002/0471219282.eot107","title":"High‐Rate Punctured Convolutional Codes","year":2003,"lang":"en","type":"other","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Coding (social sciences); Computer science; Algorithm; Mathematics; Statistics; Decoding methods","score_opus":0.008329646067091911,"score_gpt":0.2032129072808378,"score_spread":0.19488326121374588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531836745","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012321135,0.00031857187,0.373495,0.00013783858,0.00089538307,0.00007351411,0.000010324626,0.00047471674,0.6245934],"genre_scores_gemma":[0.000622759,0.00003630842,0.045386963,0.0011925044,0.00017015361,0.000012527424,0.000015632293,0.00008540231,0.95247775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902034,0.00011418186,0.00011279031,0.00038164173,0.00015901926,0.00021200164],"domain_scores_gemma":[0.99924153,0.000052678566,0.000084013445,0.0005286125,0.000023593531,0.00006954654],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019847887,0.00021779005,0.00021338716,0.0002116957,0.000055025284,0.00009122969,0.00067477825,0.00017930433,0.00612331],"category_scores_gemma":[0.000011369372,0.0001690987,0.00011415449,0.00027141566,0.00007824745,0.000052092004,0.00008936555,0.00012835416,0.00046954193],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.156828e-7,0.000010663471,0.0000042757783,0.0000043524215,0.000024871712,0.000002602803,0.0000039037986,0.0000010173569,0.000010131008,0.5403847,0.4591346,0.00041802257],"study_design_scores_gemma":[0.00015211168,0.000020744015,0.000033295673,0.000024429308,0.000007827718,0.00000520098,0.0000012284374,0.000060465634,0.00007837304,0.08436052,0.91501373,0.00024210676],"about_ca_topic_score_codex":0.0000330464,"about_ca_topic_score_gemma":0.000030070763,"teacher_disagreement_score":0.45602423,"about_ca_system_score_codex":0.000011193941,"about_ca_system_score_gemma":0.000053962198,"threshold_uncertainty_score":0.99478525},"labels":[],"label_agreement":null},{"id":"W1535558765","doi":"10.1016/j.laa.2015.06.020","title":"An asymptotic formula for the number of irreducible transformation shift registers","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Transformation (genetics); Irreducible element; Generalization; Shift register; Order (exchange); Irreducible polynomial; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis; Polynomial; Electronic circuit","score_opus":0.03171151025642087,"score_gpt":0.30243546588791015,"score_spread":0.27072395563148927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535558765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03565733,0.0001332061,0.96109533,0.0013784698,0.000043600972,0.00047971166,0.00000998863,0.000057767076,0.0011445988],"genre_scores_gemma":[0.9914956,0.000018705463,0.008077138,0.0001315257,0.00005085582,0.00018174795,0.00000983485,0.000004857676,0.000029742827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994981,0.000017865319,0.00014822479,0.00014676932,0.00008803284,0.00010096966],"domain_scores_gemma":[0.9993352,0.000107246124,0.000056643887,0.00035375723,0.00007549836,0.00007163735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029238913,0.00006328614,0.00007199494,0.00003352778,0.00014720275,0.0000491267,0.000358395,0.000030638515,0.0000026828038],"category_scores_gemma":[0.000009510027,0.000046580662,0.00004311851,0.0002508679,0.00003826663,0.00036483232,0.000020892654,0.00004054723,0.000007685856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075108255,0.000039912604,0.000047575704,0.000015334075,0.000009074372,1.21067885e-8,0.0017865138,0.00004674443,0.000114127215,0.98289526,0.000062449726,0.0149754975],"study_design_scores_gemma":[0.0012752262,0.00027518705,0.0019015281,0.000025965079,0.000092655624,0.000019646317,0.00077574723,0.2560966,0.0059659784,0.64488924,0.08831081,0.00037140286],"about_ca_topic_score_codex":0.000003994287,"about_ca_topic_score_gemma":0.0000020020032,"teacher_disagreement_score":0.95583826,"about_ca_system_score_codex":0.000004065548,"about_ca_system_score_gemma":0.000026683416,"threshold_uncertainty_score":0.18995042},"labels":[],"label_agreement":null},{"id":"W1537812362","doi":"10.1007/978-1-4471-0673-9_13","title":"Linear Recursive Sequences over Elliptic Curves","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear feedback shift register; Mathematics; Sequence (biology); Binary number; Representation (politics); Elliptic curve; Shift register; Arithmetic; Pure mathematics; Computer science; Genetics; Law","score_opus":0.027434390022460356,"score_gpt":0.2326121520060971,"score_spread":0.20517776198363674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537812362","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000054884385,0.0043526622,0.02983339,0.0006018892,0.0005602769,0.00017566739,0.000007243985,0.00033317326,0.9641302],"genre_scores_gemma":[0.0004953016,0.0063172723,0.011219565,0.0026372205,0.0003285769,0.000008160261,0.000008581748,0.00003512758,0.9789502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998497,0.000028752318,0.00026282945,0.0005870339,0.0003688369,0.00025554342],"domain_scores_gemma":[0.9986611,0.0001581073,0.00016204389,0.0008225091,0.0000856904,0.00011053826],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020095558,0.00033013147,0.0003131759,0.00019918084,0.000106360545,0.00008966651,0.001223679,0.00020742402,0.0033358447],"category_scores_gemma":[0.00001411004,0.00028225686,0.00029025468,0.00009553606,0.00015431481,0.00026968698,0.00023086801,0.0003473345,0.0009049376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016196825,0.000008505001,0.0000031098002,0.000043769247,0.000043904856,0.000031803596,0.000062304796,0.0000017102943,0.000002414886,0.97994244,0.015869133,0.003989307],"study_design_scores_gemma":[0.0000753804,0.00012670184,0.000005584483,0.0006372691,0.000032144137,0.000022018785,0.0000014483353,0.00044579746,0.00004797366,0.56817293,0.42994705,0.0004857186],"about_ca_topic_score_codex":0.000004349582,"about_ca_topic_score_gemma":0.0000027335739,"teacher_disagreement_score":0.4140779,"about_ca_system_score_codex":0.000023117704,"about_ca_system_score_gemma":0.00003486399,"threshold_uncertainty_score":0.999963},"labels":[],"label_agreement":null},{"id":"W1538513703","doi":"","title":"Selected Areas in Cryptography: 11th International Workshop, SAC 2004, Waterloo, Canada, August 9-10, 2004, Revised Selected Papers","year":2005,"lang":"en","type":"book","venue":"Medical Entomology and Zoology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Correlation attack; Block cipher; Differential cryptanalysis; Key schedule; Computer science; Linear cryptanalysis; Cryptanalysis; Stream cipher; Cryptography; Theoretical computer science; Mathematics; Algorithm","score_opus":0.006049000365403056,"score_gpt":0.21773451983032355,"score_spread":0.21168551946492048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538513703","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046104774,0.0451451,0.09478128,0.06911746,0.024593798,0.0044436627,0.00026753533,0.0031825074,0.7123639],"genre_scores_gemma":[0.17475617,0.0047124797,0.005792293,0.024623984,0.0033022773,0.00047860033,0.0029126147,0.00030105858,0.7831205],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954525,0.0006761721,0.0008476344,0.0012443782,0.00073461863,0.001044658],"domain_scores_gemma":[0.9974402,0.00085736957,0.0002902954,0.00059147703,0.0002714869,0.00054915104],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008680309,0.0006173502,0.0009894316,0.0009863817,0.0001625841,0.000058039914,0.0018980417,0.0015932098,0.006464001],"category_scores_gemma":[0.0006131729,0.0005781921,0.00015847925,0.0010949713,0.0007462102,0.00013211052,0.0004461995,0.001824453,0.000032509644],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011787834,0.000825188,0.020532828,0.00025136603,0.0021254036,0.006754979,0.0012164562,0.00005628506,0.00007420731,0.20489885,0.49349183,0.26859382],"study_design_scores_gemma":[0.008276716,0.0009206797,0.027589416,0.0011795902,0.00034811895,0.0035746014,0.000051596326,0.0034221483,0.00006253297,0.078958414,0.87220496,0.003411235],"about_ca_topic_score_codex":0.013551479,"about_ca_topic_score_gemma":0.24099755,"teacher_disagreement_score":0.37871313,"about_ca_system_score_codex":0.00029949308,"about_ca_system_score_gemma":0.0029295604,"threshold_uncertainty_score":0.99970293},"labels":[],"label_agreement":null},{"id":"W1541343583","doi":"10.1090/s0002-9939-2010-10560-9","title":"The class number of $\\mathbb{Q}(\\sqrt{-p})$ and digits of $1/p$","year":2010,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Class (philosophy); Combinatorics; Mathematics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.005581346167859151,"score_gpt":0.23487206151787754,"score_spread":0.22929071535001838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541343583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99027634,0.000011795218,0.0018940446,0.0010753621,0.000045157405,0.00012915724,0.0000020422951,0.00003211249,0.006533998],"genre_scores_gemma":[0.971318,0.000022014792,0.028506987,0.00007599498,0.000017315806,0.000007500512,2.6434398e-8,0.0000077032655,0.00004443951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989356,0.000009288863,0.00034173892,0.00017703006,0.00033805842,0.00019829074],"domain_scores_gemma":[0.99839425,0.00049010385,0.0005750211,0.00028406404,0.00019855973,0.000057991816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074562005,0.00011929734,0.00030725534,0.000011793046,0.00013854753,0.000052851512,0.0011915806,0.000037660295,0.0000054194566],"category_scores_gemma":[0.0002786471,0.00006491936,0.0002882016,0.00058480346,0.0018402259,0.00015132649,0.0005587988,0.00021920068,0.000001472005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008093128,0.000080754326,0.0034878328,0.00013385307,0.000049747196,1.5836571e-8,0.0015745283,7.245797e-8,0.03473645,0.9544442,0.0004082008,0.005076194],"study_design_scores_gemma":[0.00019182911,0.00010064227,0.0071020946,0.000094948955,0.000042923555,0.000022883898,0.0012136217,0.0025389204,0.03639785,0.9513518,0.00077208976,0.0001703675],"about_ca_topic_score_codex":0.0000040194473,"about_ca_topic_score_gemma":2.185159e-7,"teacher_disagreement_score":0.026612943,"about_ca_system_score_codex":0.000004354297,"about_ca_system_score_gemma":0.000019214232,"threshold_uncertainty_score":0.6780389},"labels":[],"label_agreement":null},{"id":"W1542192939","doi":"10.1007/3-540-45311-3_20","title":"Cryptanalysis of Imai and Matsumoto Scheme B Asymmetric Cryptosystem","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptosystem; Cryptanalysis; Public-key cryptography; Ciphertext; Computer science; Encryption; Scheme (mathematics); Theoretical computer science; Key (lock); Hybrid cryptosystem; Simple (philosophy); Cryptography; Mathematics; Algorithm; Computer security","score_opus":0.012103994265801641,"score_gpt":0.227014010747114,"score_spread":0.21491001648131236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542192939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005456248,0.0014693533,0.9873293,0.0002172868,0.00055875466,0.0002590864,0.0000046571554,0.00012303326,0.009492911],"genre_scores_gemma":[0.48916754,0.00025618143,0.509578,0.0005267124,0.00027050968,0.000009814518,0.0000026784048,0.00004381263,0.00014476986],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99616206,0.00006193048,0.0007137738,0.0014616932,0.0010153014,0.0005852282],"domain_scores_gemma":[0.99684924,0.0006007284,0.00047435527,0.0016093667,0.00026105388,0.00020527461],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013642551,0.00053312484,0.00083340803,0.0028241056,0.00022054333,0.00038777056,0.002915311,0.00029578846,0.0000255148],"category_scores_gemma":[0.00009862571,0.0004870787,0.0002642698,0.0028908702,0.00079747936,0.0005097254,0.0014101394,0.00056946004,0.0000142363915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011280726,0.000042392352,0.0007109747,0.00013237933,0.000060903578,0.00007863281,0.00036912036,0.00080601964,0.00030969112,0.31263378,0.000012721821,0.6848321],"study_design_scores_gemma":[0.00055502047,0.00041881218,0.0005987857,0.00094208174,0.00006323919,0.00022608679,8.668734e-7,0.22469677,0.002209598,0.7662754,0.0026804628,0.001332892],"about_ca_topic_score_codex":0.000019836885,"about_ca_topic_score_gemma":0.000019346566,"teacher_disagreement_score":0.6834992,"about_ca_system_score_codex":0.000121661564,"about_ca_system_score_gemma":0.00020522632,"threshold_uncertainty_score":0.99975806},"labels":[],"label_agreement":null},{"id":"W1545910537","doi":"10.1109/cwit.2015.7255142","title":"A fast displacement-based Peterson decoder","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Toeplitz matrix; Factorization; Quadratic equation; Algorithm; Displacement (psychology); Sequence (biology); Computational complexity theory; Matrix (chemical analysis); Mathematics; Computer science; Matrix decomposition; Algebra over a field; Pure mathematics","score_opus":0.028703337663712882,"score_gpt":0.24774036208677777,"score_spread":0.21903702442306489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545910537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019390455,0.000017823499,0.95361376,0.00075958256,0.00021731235,0.000050153885,3.995869e-7,0.00021124691,0.025739264],"genre_scores_gemma":[0.9452186,2.2187423e-7,0.05306114,0.0011407501,0.000024850404,0.00000831962,9.821758e-7,0.0000038171515,0.0005412783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993647,0.000044127308,0.000075941265,0.00018882017,0.00016140875,0.00016501879],"domain_scores_gemma":[0.9994425,0.00003646362,0.00002152867,0.00033704616,0.000033775086,0.00012866409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002673544,0.00007327905,0.000060788367,0.0000728003,0.000046198522,0.00010862702,0.00043349777,0.000019007735,0.00005312173],"category_scores_gemma":[0.0000122627835,0.000059338323,0.000050662955,0.00023402802,0.000022557253,0.00020265082,0.00008355921,0.000040837327,0.00013425667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068913105,0.00022862684,0.005518011,0.000011259744,0.00002653616,0.000021420658,0.0014567539,0.0005071381,0.0004471075,0.91613466,0.020098459,0.055481102],"study_design_scores_gemma":[0.0063633206,0.0016480685,0.003181209,0.00007344761,0.00003570138,0.000034601562,0.0008622921,0.6990074,0.018258763,0.120530486,0.14837758,0.0016271196],"about_ca_topic_score_codex":0.0000070933015,"about_ca_topic_score_gemma":0.000009216836,"teacher_disagreement_score":0.92582816,"about_ca_system_score_codex":0.000013314886,"about_ca_system_score_gemma":0.000038568447,"threshold_uncertainty_score":0.24197467},"labels":[],"label_agreement":null},{"id":"W1547899855","doi":"10.1007/3-540-44709-1_27","title":"Efficient Implementation of “Large” Stream Cipher Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Computer science; Bottleneck; Shift register; Boolean function; Key (lock); Block cipher; Algorithm; Cryptosystem; Parallel computing; Theoretical computer science; Arithmetic; Cryptography; Mathematics; Embedded system","score_opus":0.013045707623149126,"score_gpt":0.26455108258408533,"score_spread":0.2515053749609362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547899855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020126605,0.00045266014,0.9914362,0.00007331193,0.0017198287,0.00040567352,0.000012084277,0.00011529245,0.0037723267],"genre_scores_gemma":[0.94995606,0.000021635833,0.049421508,0.00021647174,0.0002619031,0.000011006116,0.0000052129208,0.000025514735,0.0000806827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675506,0.000055048928,0.0006040188,0.0010645872,0.0009346842,0.00058657804],"domain_scores_gemma":[0.9977472,0.00026106724,0.00042067262,0.0012066413,0.00024191229,0.00012253577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011811974,0.00039918788,0.0004672436,0.00088766625,0.00018898812,0.0002641246,0.002305301,0.0001910968,0.00005596458],"category_scores_gemma":[0.000015975118,0.00036633882,0.00017206589,0.00087812875,0.00035059938,0.00017515497,0.0008213669,0.00037574198,0.000015450689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069497387,0.00006556664,0.00033158885,0.00007198337,0.000024517289,0.00003998669,0.0012541469,0.073045336,0.00016308404,0.38100892,0.000017157565,0.54397076],"study_design_scores_gemma":[0.0013238702,0.0010761452,0.00070705754,0.0011892649,0.000045662146,0.00014020091,0.000009214177,0.7363048,0.003091482,0.24965234,0.004730393,0.0017295466],"about_ca_topic_score_codex":0.000040665007,"about_ca_topic_score_gemma":0.00004079997,"teacher_disagreement_score":0.9479434,"about_ca_system_score_codex":0.00014349523,"about_ca_system_score_gemma":0.0002829296,"threshold_uncertainty_score":0.9998789},"labels":[],"label_agreement":null},{"id":"W1549861330","doi":"10.1007/3-540-44495-5_19","title":"On Efficient Normal Basis Multiplication","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplication (music); Computer science; Normal basis; Cryptography; Finite field; Basis (linear algebra); Multiplication algorithm; Arithmetic; Field (mathematics); Class (philosophy); Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Artificial intelligence; Galois theory","score_opus":0.010359372274557686,"score_gpt":0.22187067641790617,"score_spread":0.21151130414334848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549861330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052600383,0.00011069614,0.9830898,0.0005151457,0.00086397363,0.00030982832,0.000005540818,0.0002243264,0.014354651],"genre_scores_gemma":[0.78599304,0.000045451703,0.20874968,0.0043551396,0.00050323614,0.000026561183,0.000008018987,0.000051905186,0.00026693582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965883,0.000042523327,0.00039492987,0.00150727,0.00088815065,0.0005788594],"domain_scores_gemma":[0.9972666,0.0005811264,0.00018143866,0.0016936471,0.0001112025,0.00016599805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007568228,0.00046755435,0.00034898595,0.0010846014,0.00034670357,0.0004028461,0.003167847,0.00025207803,0.00008690824],"category_scores_gemma":[0.00004220334,0.0004297086,0.00019376741,0.0008046953,0.00050576153,0.00023503217,0.0005819564,0.00067763304,0.00020133697],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014001584,0.00004632014,0.000005445156,0.000008035139,0.0000051587645,0.000018739534,0.00031449733,0.07788002,0.000044007116,0.17284772,0.000014914061,0.7488012],"study_design_scores_gemma":[0.00028957627,0.0002880755,0.00015583534,0.00029663084,0.000007084113,0.000033513617,4.163558e-8,0.5168937,0.0016952301,0.47713882,0.0024822352,0.00071928673],"about_ca_topic_score_codex":0.000009467575,"about_ca_topic_score_gemma":0.0000119154265,"teacher_disagreement_score":0.7854671,"about_ca_system_score_codex":0.00016323164,"about_ca_system_score_gemma":0.00018821252,"threshold_uncertainty_score":0.99981546},"labels":[],"label_agreement":null},{"id":"W1555131579","doi":"10.1109/tit.2004.838109","title":"A Mass Formula and Rank of&amp;lt;tex&amp;gt;$BBZ_4$&amp;lt;/tex&amp;gt;Cyclic Codes of Length&amp;lt;tex&amp;gt;$2^e$&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":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Rank (graph theory); Combinatorics; Mathematics","score_opus":0.017928381731327818,"score_gpt":0.24359312349006693,"score_spread":0.2256647417587391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555131579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1723155,0.0011366676,0.8124709,0.0006629094,0.002345336,0.0019434142,0.000838635,0.0012718713,0.0070147472],"genre_scores_gemma":[0.92165506,0.0015463036,0.07089034,0.0011755209,0.0003299834,0.000515442,0.00055372156,0.000246406,0.0030872286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9868173,0.0014323997,0.0045456747,0.0018935491,0.002827002,0.0024840843],"domain_scores_gemma":[0.98755455,0.0024399732,0.002479106,0.0049518365,0.0014152193,0.001159313],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0054843673,0.002246942,0.0024215379,0.003613257,0.0022030796,0.0010556186,0.0035406796,0.0014087411,0.0016327769],"category_scores_gemma":[0.00046611213,0.0022782232,0.0018931011,0.004440146,0.0018193788,0.0069987983,0.00017101088,0.0020894373,0.0023541984],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007710735,0.0053424714,0.00025917188,0.00363451,0.0042355675,0.000014513161,0.08833914,0.074890226,0.12256612,0.42156148,0.008411488,0.26303458],"study_design_scores_gemma":[0.01771945,0.0013388696,0.0009952906,0.0032955937,0.002197086,0.0009144522,0.0010666944,0.0012095481,0.021261776,0.20714042,0.73502386,0.0078369845],"about_ca_topic_score_codex":0.00012410253,"about_ca_topic_score_gemma":0.001507201,"teacher_disagreement_score":0.7493396,"about_ca_system_score_codex":0.00059077184,"about_ca_system_score_gemma":0.00062680006,"threshold_uncertainty_score":0.9999814},"labels":[],"label_agreement":null},{"id":"W1555694369","doi":"10.1007/3-540-45067-x_43","title":"New Constructions for Resilient and Highly Nonlinear Boolean Functions","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Boolean function; Correlation attack; Concatenation (mathematics); Block cipher; Boolean network; Hadamard transform; Construct (python library); Discrete mathematics; Bent function; Nonlinear system; Computer science; Algebraic number; Mathematics; Cryptography; Algorithm; Combinatorics","score_opus":0.012358944843393007,"score_gpt":0.22787206342381894,"score_spread":0.21551311858042593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555694369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059460774,0.00044870967,0.99311334,0.0012300402,0.0024026167,0.00041120467,0.000017797318,0.00013034137,0.0021865098],"genre_scores_gemma":[0.0038670718,0.00004111045,0.9931121,0.0014423492,0.00048277856,0.0000124236285,0.0000064787455,0.000027662592,0.0010080661],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749833,0.000024152123,0.00036285864,0.0012463056,0.0003907229,0.00047761525],"domain_scores_gemma":[0.998027,0.00042600415,0.00016352684,0.0009706596,0.00016733567,0.00024541878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051963126,0.0003837255,0.0003505749,0.0007609767,0.0005300507,0.0004553549,0.0011792182,0.00021635847,0.000016590511],"category_scores_gemma":[0.00006476523,0.0003679762,0.00015346712,0.00055426743,0.0006521696,0.00036010644,0.0004278113,0.00045109406,0.000010123306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010155247,0.000016633732,0.00002361407,0.000021773669,0.000016897235,0.0000074183213,0.00024184959,0.0016499289,0.000070984715,0.29774657,0.0004120391,0.69978213],"study_design_scores_gemma":[0.00057151186,0.00041971958,0.000038577607,0.00022527925,0.000030345573,0.00018821798,6.407455e-7,0.056924757,0.0006652687,0.85899806,0.081151895,0.00078574853],"about_ca_topic_score_codex":0.000008024206,"about_ca_topic_score_gemma":0.00004457945,"teacher_disagreement_score":0.6989964,"about_ca_system_score_codex":0.00008413703,"about_ca_system_score_gemma":0.0003935683,"threshold_uncertainty_score":0.9998772},"labels":[],"label_agreement":null},{"id":"W1561267140","doi":"10.37236/1091","title":"The Number of Permutation Binomials over ${\\Bbb F}_{4p+1}$ where $p$ and $4p+1$ are Primes","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Permutation (music); Combinatorics; Finite field; Monic polynomial; Partial permutation; Discrete mathematics; Hermite polynomials; Degree (music); Primality test; Cyclic permutation; Prime number; Symmetric group; Pure mathematics; Polynomial","score_opus":0.003212088831226066,"score_gpt":0.21892021866081637,"score_spread":0.2157081298295903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561267140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96449745,0.009745874,0.022686826,0.001534437,0.00040197928,0.00010464425,5.747012e-7,0.000019886715,0.0010083318],"genre_scores_gemma":[0.998767,0.0009131752,0.000042219774,0.0000318627,0.00007831572,0.000001483621,1.2841068e-7,0.000008348165,0.00015744788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856585,0.00024029013,0.0003933591,0.00010845761,0.0003577486,0.00033426628],"domain_scores_gemma":[0.9982871,0.0005039915,0.00065349566,0.00030571755,0.00021388207,0.000035845875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001556323,0.00012420336,0.00020707241,0.0000628883,0.0002832341,0.0001279073,0.0008111299,0.000049583694,0.0000047961707],"category_scores_gemma":[0.000045539295,0.000072432624,0.00013102902,0.00043349926,0.00012471846,0.00027442432,0.00009155195,0.00036394657,0.0000017191405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003489807,0.00005827238,0.0044754073,0.000008245524,0.00004718977,0.0000020806933,0.00019208007,0.000025115456,0.00033307125,0.99263763,0.00063810666,0.0015479242],"study_design_scores_gemma":[0.0005594347,0.00018277457,0.012881912,0.00003346019,0.000037748618,0.00014688962,0.00008775817,0.0002275947,0.0015665654,0.97995543,0.0042209565,0.00009949031],"about_ca_topic_score_codex":0.000011280505,"about_ca_topic_score_gemma":0.000008965456,"teacher_disagreement_score":0.034269575,"about_ca_system_score_codex":0.00007561421,"about_ca_system_score_gemma":0.00019031265,"threshold_uncertainty_score":0.29537168},"labels":[],"label_agreement":null},{"id":"W156263185","doi":"","title":"Double Circulant Self-Dual Codes over GF(5).","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Dual (grammatical number); Arithmetic; Discrete mathematics; Linguistics","score_opus":0.009382806470143452,"score_gpt":0.22474303220213468,"score_spread":0.21536022573199123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156263185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97424084,0.00019816699,0.00035705278,0.00017824744,0.0013166963,0.00014127967,0.0000017746491,0.00069724384,0.022868708],"genre_scores_gemma":[0.9983362,0.00004248229,0.0010035875,0.0002859733,0.000016702626,0.0000147213705,0.0000025738036,0.000011799583,0.00028595544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869365,0.00008042609,0.00018898296,0.00039183768,0.0002867987,0.0003583147],"domain_scores_gemma":[0.99900645,0.00008240555,0.000044989563,0.0007013291,0.00003807606,0.0001267249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034409837,0.00016909972,0.0001811317,0.0000866361,0.00021415931,0.00019379701,0.0007339149,0.00007500035,0.00035031486],"category_scores_gemma":[0.000004027205,0.00016438187,0.0001209728,0.0005282362,0.00004776079,0.00039791488,0.00012160881,0.0001584328,0.00031493083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022725351,0.00017257915,0.0009381643,0.0000055732626,0.00003720458,0.000031425683,0.00056520285,0.00000889407,0.00018284534,0.9900124,0.0021706093,0.005852347],"study_design_scores_gemma":[0.00215435,0.00016024742,0.004208848,0.000022491404,0.000019506328,0.000042461477,0.000011810775,0.0016811015,0.0018934004,0.93597645,0.053410962,0.00041834573],"about_ca_topic_score_codex":0.00002864925,"about_ca_topic_score_gemma":0.0000018579857,"teacher_disagreement_score":0.054035954,"about_ca_system_score_codex":0.000029862029,"about_ca_system_score_gemma":0.0000442392,"threshold_uncertainty_score":0.6703298},"labels":[],"label_agreement":null},{"id":"W1562845089","doi":"10.1007/978-3-540-77026-8_12","title":"A Graph Theoretic Analysis of Double Base Number Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematical proof; Base (topology); Integer (computer science); Mathematics; Representation (politics); Combinatorial proof; Discrete mathematics; Combinatorics; Graph; Integer sequence; Theoretical computer science; Computer science","score_opus":0.0200028941033581,"score_gpt":0.2568944548547386,"score_spread":0.23689156075138051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562845089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005141327,0.0004135656,0.982974,0.00006330224,0.0012759971,0.0002984401,0.0000082365095,0.00013473928,0.014317618],"genre_scores_gemma":[0.88891596,0.000048756825,0.11020459,0.00042810035,0.00019735827,0.000009918116,0.000007817915,0.000032890086,0.00015464064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960158,0.00006156731,0.00073476165,0.0013911963,0.0011536508,0.00064303016],"domain_scores_gemma":[0.9961776,0.0007646236,0.0004681752,0.002055657,0.00034043757,0.00019347917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002491107,0.0005052327,0.0009061443,0.0032273238,0.00018886995,0.000372337,0.0036035033,0.00031864605,0.000070389426],"category_scores_gemma":[0.000029473455,0.00044279988,0.0005382797,0.00476353,0.001241124,0.0003589569,0.00085987005,0.00058349647,0.00002030192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026261754,0.00004342105,0.00039382043,0.000060882317,0.00019951536,0.000064309614,0.0006677288,0.034279276,0.000036385267,0.9009479,0.000005354387,0.06327512],"study_design_scores_gemma":[0.0005202179,0.00017833526,0.00021958434,0.00048105168,0.0003471087,0.00005675133,7.405923e-7,0.41801608,0.0008449911,0.57783663,0.00047962577,0.0010188681],"about_ca_topic_score_codex":0.000053297168,"about_ca_topic_score_gemma":0.000056510708,"teacher_disagreement_score":0.8884018,"about_ca_system_score_codex":0.000100662386,"about_ca_system_score_gemma":0.00021305072,"threshold_uncertainty_score":0.99980235},"labels":[],"label_agreement":null},{"id":"W1565645651","doi":"10.4230/lipics.ccc.2024.25","title":"Formulas For The Square Root Modulo p","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of California, San Diego; National Science Foundation","keywords":"Modulo; Primitive root modulo n; Finite field; Square (algebra); Square root; Mathematics; Prime (order theory); Combinatorics; Polynomial; Field (mathematics); Root (linguistics); Function (biology); Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.09650571339318634,"score_gpt":0.18335844820301458,"score_spread":0.08685273480982825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565645651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040299304,0.000117050215,0.9531385,0.00011197702,0.0007696688,0.0005079236,0.000016604778,0.00026990828,0.004769096],"genre_scores_gemma":[0.9974884,0.000046428984,0.0013601123,0.000090968606,0.00009571224,0.000005534452,0.0000065213726,0.000015683907,0.0008906546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854213,0.000079743986,0.00013909028,0.00082495064,0.000062520085,0.00035153583],"domain_scores_gemma":[0.99761146,0.00026354232,0.00017298195,0.0017107093,0.0001390608,0.00010223273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036555965,0.00026984813,0.00022369844,0.00017574665,0.00037276684,0.00012612467,0.0031494587,0.00020672553,0.000032175474],"category_scores_gemma":[0.00002490915,0.00023235603,0.00048720412,0.00041875077,0.000113240516,0.00026464806,0.0017532953,0.00037938703,0.00003685886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048027996,0.00004923023,0.00038800866,0.000046667767,0.00010140694,0.000016987266,0.00034972664,0.013529027,0.000004280008,0.98271924,0.00055188144,0.002195495],"study_design_scores_gemma":[0.00034005652,0.00008850148,0.0008689272,0.000042500138,0.000097988,0.000002336498,0.000055863355,0.1944679,0.00014773708,0.79815996,0.0053546964,0.0003735541],"about_ca_topic_score_codex":0.00005183416,"about_ca_topic_score_gemma":0.00006606296,"teacher_disagreement_score":0.9571891,"about_ca_system_score_codex":0.000050488088,"about_ca_system_score_gemma":0.00008207571,"threshold_uncertainty_score":0.9475204},"labels":[],"label_agreement":null},{"id":"W1567897629","doi":"10.1023/a:1008385407717","title":"On the Key Equation Over a Commutative Ring","year":2000,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"Engineering and Physical Sciences Research Council","keywords":"Monic polynomial; Mathematics; Polynomial ring; BCH code; Commutative ring; Ring (chemistry); Discrete mathematics; Integral domain; Quotient ring; Minimal polynomial (linear algebra); Combinatorics; Ring of integers; Polynomial; Field (mathematics); Matrix polynomial; Decoding methods; Reciprocal polynomial; Commutative property; Pure mathematics; Algorithm; Algebraic number field","score_opus":0.03502660253253438,"score_gpt":0.24520012163379812,"score_spread":0.21017351910126375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567897629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43859878,0.00028261656,0.5428464,0.00068619946,0.000070626265,0.00025835485,0.0000053811755,0.00020982236,0.017041832],"genre_scores_gemma":[0.9925063,0.000110108354,0.00587709,0.0014082195,0.00002559697,0.000040806484,0.0000019894594,0.000009262293,0.00002062666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987455,0.0002743405,0.000164374,0.00032139974,0.00023150175,0.00026288975],"domain_scores_gemma":[0.9986479,0.00072448654,0.00005564693,0.00046178454,0.000032218988,0.000077957775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054627063,0.00018168057,0.00014135591,0.00017654289,0.0005429547,0.00031618174,0.00051379215,0.000051020077,0.00024367035],"category_scores_gemma":[0.00001641517,0.00012634066,0.0001409695,0.0008158218,0.00017294665,0.000256975,0.000054953867,0.00018046677,0.000026569349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003720126,0.000053546253,0.0002928979,0.0000037367781,0.000039896935,0.0000035122168,0.0019563464,0.000074150055,0.00023061539,0.94800156,0.00033299802,0.04897351],"study_design_scores_gemma":[0.00058515725,0.00053340447,0.007284577,0.0000833365,0.000027452308,0.000011438028,0.00018723372,0.022385614,0.0009397073,0.9601773,0.0073429514,0.00044180962],"about_ca_topic_score_codex":0.000017198114,"about_ca_topic_score_gemma":0.000004298003,"teacher_disagreement_score":0.5539075,"about_ca_system_score_codex":0.000006047305,"about_ca_system_score_gemma":0.000010262953,"threshold_uncertainty_score":0.5152022},"labels":[],"label_agreement":null},{"id":"W1569846140","doi":"10.1109/isccsp.2004.1296487","title":"The rank of /spl Zopf//sub 4/ cyclic codes of length 2/sup e/","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Rank (graph theory); Combinatorics; Ring (chemistry); Mathematics; Block code; Discrete mathematics; Algorithm; Decoding methods","score_opus":0.008244199097920417,"score_gpt":0.21446776293390382,"score_spread":0.2062235638359834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1569846140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6863873,0.0002616078,0.30123386,0.00069633167,0.0001443221,0.00010793879,0.0000015641559,0.000096055745,0.011071001],"genre_scores_gemma":[0.9938629,0.00007498138,0.005890988,0.00008281307,0.000014734881,0.000003177536,1.9506788e-7,0.00000324793,0.00006694601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925554,0.000054971762,0.00020694922,0.00014797405,0.00017951758,0.00015506797],"domain_scores_gemma":[0.99912494,0.00017962162,0.000080689686,0.0005265404,0.00005376921,0.000034420224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004434287,0.00007698535,0.00012681494,0.00006083044,0.000103940736,0.000028946184,0.000829819,0.000029575904,0.000009382983],"category_scores_gemma":[0.000030532865,0.000048732934,0.00011821099,0.00039301082,0.00017158287,0.0001304646,0.0001327493,0.00006342783,0.000009304234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000125063225,0.00004935264,0.00019617296,0.0000075198277,0.00002043945,6.992646e-7,0.00046908276,0.00015124655,0.0041438104,0.9811106,0.00007388416,0.01376471],"study_design_scores_gemma":[0.0012250404,0.0003742054,0.0041309134,0.00007263242,0.00002119085,0.000012944905,0.00029592006,0.0019179281,0.4123595,0.5757799,0.0035379543,0.00027182902],"about_ca_topic_score_codex":0.000025876614,"about_ca_topic_score_gemma":0.000018133298,"teacher_disagreement_score":0.4082157,"about_ca_system_score_codex":0.000005770262,"about_ca_system_score_gemma":0.000032575826,"threshold_uncertainty_score":0.19872713},"labels":[],"label_agreement":null},{"id":"W1570152307","doi":"10.1007/3-540-46513-8_6","title":"Modeling Linear Characteristics of Substitution-Permutation Networks","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Linear cryptanalysis; Cryptanalysis; Bounding overwatch; Computer science; Permutation (music); Upper and lower bounds; Substitution (logic); Algorithm; Function (biology); Cryptography; Mathematics; Artificial intelligence","score_opus":0.014875678054176064,"score_gpt":0.23005850344491102,"score_spread":0.21518282539073497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570152307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012681492,0.00025979293,0.996343,0.00006283276,0.001004437,0.00018250263,0.000004013586,0.00011022315,0.0007650356],"genre_scores_gemma":[0.88284993,0.00011592236,0.116356,0.0002763363,0.0003564878,0.0000032741793,0.000010687402,0.000017691733,0.00001368194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757457,0.000032229407,0.0005694738,0.0008656342,0.00055995875,0.00039814002],"domain_scores_gemma":[0.9983513,0.00020453216,0.000212967,0.00091072,0.00021985432,0.000100643956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006655137,0.00034945933,0.00043352298,0.0006739472,0.00020052391,0.00017006726,0.001897454,0.00026019118,0.000021798902],"category_scores_gemma":[0.000034512253,0.00034183834,0.00015481752,0.0006275274,0.00047236518,0.00043447304,0.00034581448,0.0005610936,0.000010461381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008905661,0.000015464042,0.000023182038,0.000014870849,0.0000064292935,0.0000146604925,0.00019868344,0.5252941,0.000019075454,0.11372617,2.6012754e-7,0.3606782],"study_design_scores_gemma":[0.000089419664,0.00006609007,0.000032565298,0.00024611206,0.0000072626244,0.000016869102,2.541342e-8,0.79246205,0.00007880069,0.20663373,0.00008839987,0.00027865893],"about_ca_topic_score_codex":0.000007356133,"about_ca_topic_score_gemma":0.000006560217,"teacher_disagreement_score":0.8815818,"about_ca_system_score_codex":0.000076070406,"about_ca_system_score_gemma":0.0002455746,"threshold_uncertainty_score":0.9999034},"labels":[],"label_agreement":null},{"id":"W1570515303","doi":"10.1007/3-540-39568-7_8","title":"Computing Logarithms in GF (2n)","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Logarithm; Base (topology); Integer (computer science); Mathematics; Finite field; Discrete mathematics; Generator (circuit theory); Combinatorics; Element (criminal law); Binary logarithm; Field (mathematics); Iterated logarithm; Pure mathematics; Physics; Computer science; Mathematical analysis","score_opus":0.022858732874635253,"score_gpt":0.25914947474430594,"score_spread":0.2362907418696707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570515303","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028763732,0.00045189116,0.9837859,0.00029515158,0.00202474,0.00030079272,0.0000017401239,0.00023992435,0.012612175],"genre_scores_gemma":[0.35236928,0.000036699766,0.6436237,0.0030222414,0.0007212379,0.0000036421254,0.0000042197885,0.000053979904,0.00016501443],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995362,0.000059368293,0.0007175353,0.0018149511,0.0009877562,0.0010584167],"domain_scores_gemma":[0.99696153,0.000910297,0.00028575974,0.0014771412,0.00016310511,0.00020216446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027502757,0.0006074878,0.000627293,0.0022981418,0.00026798417,0.00053146813,0.0043933806,0.00043121935,0.000024326431],"category_scores_gemma":[0.000084492276,0.0005990009,0.00019944558,0.001683056,0.0008461919,0.00053388096,0.0019181834,0.0014277097,0.00005128143],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073619044,0.000037062524,0.0002723478,0.000025026255,0.0000065108743,0.00026290765,0.00085426896,0.008859404,0.000028930888,0.15364045,0.0000071762724,0.83599854],"study_design_scores_gemma":[0.00047594495,0.00021834493,0.00078640704,0.0007765051,0.0000057653674,0.00013512687,3.9525216e-7,0.36956915,0.0004741665,0.6237984,0.0026385952,0.0011212357],"about_ca_topic_score_codex":0.000033842665,"about_ca_topic_score_gemma":0.00020767609,"teacher_disagreement_score":0.8348773,"about_ca_system_score_codex":0.00028083342,"about_ca_system_score_gemma":0.00034375157,"threshold_uncertainty_score":0.9996461},"labels":[],"label_agreement":null},{"id":"W1572189866","doi":"10.1007/978-3-540-24633-6_5","title":"Mutual Irreducibility of Certain Polynomials","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Irreducibility; Word (group theory); Transformation (genetics); Computer science; Algebra over a field; Discrete mathematics; Mathematics; Pure mathematics; Genetics; Biology; Geometry","score_opus":0.018336448441338263,"score_gpt":0.2478270258690636,"score_spread":0.22949057742772533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572189866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010240118,0.00033823075,0.99207157,0.00040942425,0.0014898136,0.00031332026,0.000008789178,0.00013378919,0.0042110565],"genre_scores_gemma":[0.79637223,0.00001730521,0.20268144,0.00050785067,0.00028712876,0.0000048087304,0.0000025190425,0.000023666815,0.00010304021],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961837,0.00006115647,0.0006813453,0.0016465917,0.0008339703,0.0005932635],"domain_scores_gemma":[0.9964907,0.00057250785,0.0003776314,0.0021825193,0.0002042019,0.00017242189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017332833,0.00048506065,0.0006608505,0.00094757235,0.00017642221,0.0002200691,0.0040325234,0.0003136601,0.000059891303],"category_scores_gemma":[0.00013946138,0.00045044528,0.00028538363,0.000834912,0.0014101331,0.0004521327,0.0013047296,0.0006287643,0.000022736212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018115785,0.000067444336,0.00007620025,0.000060090362,0.000016571432,0.00003249498,0.0011705707,0.0068906927,0.0005629376,0.33514947,0.000007622698,0.6559478],"study_design_scores_gemma":[0.0003058863,0.00029200662,0.00020299242,0.0003916255,0.00000954722,0.00003216462,2.0343838e-7,0.01309219,0.007035965,0.9776457,0.00040033224,0.0005913944],"about_ca_topic_score_codex":0.000038629973,"about_ca_topic_score_gemma":0.000033648965,"teacher_disagreement_score":0.7953482,"about_ca_system_score_codex":0.0002350061,"about_ca_system_score_gemma":0.00091725163,"threshold_uncertainty_score":0.9997947},"labels":[],"label_agreement":null},{"id":"W1573509053","doi":"10.1007/978-3-540-27800-9_13","title":"The Security of Cryptosystems Based on Class Semigroups of Imaginary Quadratic Non-maximal Orders","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cryptosystem; The Imaginary; Quadratic equation; Class (philosophy); Mathematics; Arithmetic; Computer science; Discrete mathematics; Cryptography; Algorithm; Psychology; Artificial intelligence","score_opus":0.00688559336694569,"score_gpt":0.21907603396931785,"score_spread":0.21219044060237216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573509053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068973366,0.00024050576,0.99185646,0.00066208484,0.0012085659,0.00046016308,0.000007907281,0.00006926026,0.0048053153],"genre_scores_gemma":[0.9628533,0.000013714065,0.036574896,0.00040296238,0.00011281683,0.000008881644,0.0000018567831,0.000022624223,0.000008938238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963453,0.00010327239,0.000739788,0.0010476877,0.001208849,0.0005551388],"domain_scores_gemma":[0.995448,0.0015473434,0.0006194931,0.0019439785,0.00032132707,0.00011985512],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017550876,0.00050296733,0.000639674,0.0007341244,0.00031832265,0.00021958005,0.00412321,0.00024020082,0.000009115792],"category_scores_gemma":[0.00010150531,0.00037638802,0.0003025028,0.0010447046,0.0017789732,0.00029680118,0.0006452671,0.00077923853,0.0000056185986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014334699,0.00025723665,0.00023442431,0.0005331121,0.000054223194,0.00008504559,0.0025667911,0.11384589,0.00078435167,0.714113,0.00004146147,0.16734111],"study_design_scores_gemma":[0.00037915996,0.00067592366,0.00006797392,0.0011224034,0.000011427765,0.000014093374,8.434022e-7,0.4369019,0.0023609465,0.5578544,0.00019628803,0.00041461672],"about_ca_topic_score_codex":0.000040165352,"about_ca_topic_score_gemma":0.00004455409,"teacher_disagreement_score":0.96216357,"about_ca_system_score_codex":0.00016014664,"about_ca_system_score_gemma":0.00081957714,"threshold_uncertainty_score":0.9998688},"labels":[],"label_agreement":null},{"id":"W1575500402","doi":"10.1109/ictrc.2015.7156413","title":"Hybrid ARQ with partial retransmission using turbo product codes","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hybrid automatic repeat request; Retransmission; Computer science; Turbo code; Additive white Gaussian noise; Error detection and correction; Algorithm; Automatic repeat request; Decoding methods; Turbo; Cyclic redundancy check; Throughput; Real-time computing; Channel (broadcasting); Network packet; Computer network; Telecommunications link; Wireless; Engineering; Telecommunications","score_opus":0.03939280953811133,"score_gpt":0.24973526432982543,"score_spread":0.2103424547917141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575500402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38060844,0.0000646541,0.6157574,0.00052970264,0.00017551598,0.00008638153,3.5644143e-7,0.0002262412,0.0025513114],"genre_scores_gemma":[0.93232834,0.0000011756516,0.067380145,0.000113245864,0.000082811785,0.0000018741549,5.7887877e-7,0.00000532782,0.00008652592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990986,0.000066728506,0.00010059803,0.00030682716,0.00023085934,0.00019637008],"domain_scores_gemma":[0.99932736,0.000015787948,0.00003271724,0.0004095006,0.000070478825,0.0001441406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038903015,0.000100221114,0.00009975593,0.00006200932,0.00008926653,0.00011168218,0.00036527953,0.000014429224,0.000012244347],"category_scores_gemma":[0.000015190744,0.000067500485,0.000033289114,0.00026919093,0.000043845488,0.00035450235,0.00006367579,0.000089284455,0.000010280967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014269027,0.00084871764,0.020860627,0.00010465923,0.00019359407,0.0003761482,0.006050019,0.004514809,0.029712893,0.6730578,0.013287285,0.24956656],"study_design_scores_gemma":[0.0021083283,0.001543095,0.00057677313,0.00021807982,0.00005802606,0.00052190525,0.00018003276,0.17540047,0.66536576,0.11379804,0.03895214,0.0012773578],"about_ca_topic_score_codex":0.00001879027,"about_ca_topic_score_gemma":0.0000020965535,"teacher_disagreement_score":0.63565284,"about_ca_system_score_codex":0.000012292667,"about_ca_system_score_gemma":0.00008147657,"threshold_uncertainty_score":0.275259},"labels":[],"label_agreement":null},{"id":"W1577489686","doi":"10.1007/978-3-540-77404-4_4","title":"The Perfect Binary Sequence of Period 4 for Low Periodic and Aperiodic Autocorrelations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Aperiodic graph; Autocorrelation; Complementary sequences; Sequence (biology); Pseudorandom binary sequence; Legendre polynomials; Binary number; Mathematics; Periodic sequence; Product (mathematics); Combinatorics; Statistics; Mathematical analysis; Arithmetic; Chemistry","score_opus":0.023019069819535592,"score_gpt":0.2633508461847912,"score_spread":0.24033177636525563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577489686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00102627,0.0014549928,0.9944598,0.000520451,0.0009781318,0.0007280619,0.000012065224,0.0000954794,0.00072476716],"genre_scores_gemma":[0.71236134,0.00018903687,0.28606185,0.00067413936,0.00034278838,0.00007105096,0.000007302933,0.000049861985,0.00024263638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729925,0.000047102938,0.00050515425,0.0010194988,0.00056346005,0.00056550506],"domain_scores_gemma":[0.9966049,0.0015965202,0.00029920627,0.0011261745,0.00024155532,0.00013159889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018725607,0.00040609227,0.0004108787,0.00063548837,0.001087783,0.00053237664,0.0023009665,0.00024124375,0.000008087656],"category_scores_gemma":[0.00016096933,0.0003106578,0.0002075049,0.00066569104,0.0025271447,0.0003814237,0.0007549157,0.0005489438,0.0000037401649],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002520592,0.00002141267,0.00010807141,0.0000778322,0.000015912721,0.000017922119,0.0022557348,0.0019228227,0.00052670203,0.20322452,0.000006695283,0.79179716],"study_design_scores_gemma":[0.0005244012,0.0010107744,0.0006804008,0.0007442417,0.000029929293,0.0002102334,0.0000031093205,0.5926333,0.00047942434,0.39716852,0.005568208,0.00094743713],"about_ca_topic_score_codex":0.0000047021945,"about_ca_topic_score_gemma":0.00003126707,"teacher_disagreement_score":0.79084975,"about_ca_system_score_codex":0.00009167857,"about_ca_system_score_gemma":0.00048953376,"threshold_uncertainty_score":0.99993455},"labels":[],"label_agreement":null},{"id":"W1579458986","doi":"10.1006/jcta.2000.3159","title":"Orthogonal Frames in the Leech Lattice and a Type II Code over Z22","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Leech; Lattice (music); Basis (linear algebra); Mathematics; Orthogonal basis; Combinatorics; Code (set theory); Type (biology); Discrete mathematics; Pure mathematics; Computer science; Physics; Geometry; Programming language; Biology; Quantum mechanics","score_opus":0.011505245931273068,"score_gpt":0.2479558214037235,"score_spread":0.23645057547245044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579458986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98907864,0.0007554993,0.0026280012,0.0013092627,0.0028770359,0.00008787047,9.388554e-7,0.000022586408,0.0032401404],"genre_scores_gemma":[0.9982181,0.00018819513,0.00078101386,0.00043965885,0.00031494186,0.000001446859,1.5754873e-7,0.000006477167,0.00004996447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854213,0.00047093144,0.00032196948,0.00013163283,0.00033378808,0.00019952224],"domain_scores_gemma":[0.9987697,0.0005681651,0.00021225163,0.00027001006,0.000115795345,0.00006409062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025080526,0.0001280014,0.00022216335,0.00014455078,0.00021379613,0.00017178098,0.00080638373,0.00007271431,0.00004948769],"category_scores_gemma":[0.0002101054,0.00008649544,0.00009208777,0.0006238135,0.00014072283,0.00073999376,0.00018088582,0.00039477617,0.0000012441726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072863244,0.000119365344,0.0013651836,0.0000042361157,0.000028730625,0.00009880797,0.0026223927,0.00000419185,0.00010361578,0.9913247,0.00018547001,0.0034146274],"study_design_scores_gemma":[0.00082514115,0.00093579676,0.0034626373,0.000037948932,0.000016157474,0.0005110565,0.00031047876,0.000025282909,0.000053252013,0.93151015,0.062197447,0.000114664675],"about_ca_topic_score_codex":0.0000014126856,"about_ca_topic_score_gemma":0.0000026370258,"teacher_disagreement_score":0.062011976,"about_ca_system_score_codex":0.000014782415,"about_ca_system_score_gemma":0.000073112744,"threshold_uncertainty_score":0.35271817},"labels":[],"label_agreement":null},{"id":"W1580296010","doi":"10.1002/9780470724347.ch5","title":"Space‐Time Trellis Codes","year":2007,"lang":"en","type":"other","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Space–time trellis code; Trellis (graph); Block code; Code (set theory); Computer science; Convolutional code; Space time; Mathematics; Algorithm; Linear code; Theoretical computer science; Decoding methods; Engineering; Programming language","score_opus":0.008985799443707261,"score_gpt":0.22570541772169425,"score_spread":0.216719618277987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580296010","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.3830885e-7,0.00029207705,0.3081237,0.000090640075,0.00020644038,0.000057252346,0.0000024072388,0.0008047166,0.6904221],"genre_scores_gemma":[0.00004197824,0.000046581874,0.038805682,0.00030274424,0.00018724936,0.0000023089217,0.0000030307067,0.0000960444,0.96051437],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991066,0.000034649056,0.000097126554,0.00034665616,0.00017709224,0.00023791812],"domain_scores_gemma":[0.99909544,0.00006396549,0.00006903463,0.00068042707,0.000011182317,0.00007996735],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002153823,0.0001903208,0.00019711818,0.0005609829,0.000033729008,0.00008904086,0.0008798735,0.0001859704,0.008230709],"category_scores_gemma":[0.0000052087803,0.00015927992,0.00012936637,0.00047826176,0.000056016605,0.000046368852,0.00014203353,0.00011838643,0.002801956],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.302212e-7,0.000014953337,0.000003927644,0.000005231584,0.000019354851,0.000008365724,0.000020648658,9.965733e-8,0.00001233455,0.40090817,0.58859915,0.0104068285],"study_design_scores_gemma":[0.00007298505,0.00002847644,0.000003452332,0.00004036329,0.000006262295,0.000004445553,0.0000019172091,0.00017000381,0.0001667195,0.00808009,0.9911929,0.00023241463],"about_ca_topic_score_codex":0.000035289668,"about_ca_topic_score_gemma":0.000018226121,"teacher_disagreement_score":0.4025937,"about_ca_system_score_codex":0.0000070627993,"about_ca_system_score_gemma":0.000017353368,"threshold_uncertainty_score":0.99797446},"labels":[],"label_agreement":null},{"id":"W1582873326","doi":"10.1090/conm/579","title":"Theory and Applications of Finite Fields","year":2012,"lang":"en","type":"book","venue":"Contemporary mathematics - American Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.02218294791805391,"score_gpt":0.2545365056760358,"score_spread":0.2323535577579819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582873326","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020736756,0.0012774499,0.7310727,0.00009227838,0.00003809963,0.0005687849,0.00003092076,0.00018188506,0.2667171],"genre_scores_gemma":[0.07113283,0.00078466063,0.63410115,0.0021012314,0.00088255684,0.00089238945,0.000106749074,0.00036138017,0.28963703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750066,0.00015709882,0.0009414819,0.0005137082,0.0004986249,0.00038845083],"domain_scores_gemma":[0.99280113,0.0042947717,0.0010372454,0.0014661577,0.00012872972,0.00027194584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018438529,0.0005153312,0.0011954178,0.00011489932,0.00015766469,0.00009564733,0.0012542941,0.00030382385,0.00010954817],"category_scores_gemma":[0.00014969656,0.00044762454,0.0006653241,0.00038343147,0.0013677507,0.00025536452,0.0007043421,0.00056146714,0.00006559028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047441126,0.00024621002,0.0000049379405,0.0013581137,0.00025112674,0.0000011411829,0.004085601,4.480479e-7,0.0000066191687,0.9792404,0.0067017106,0.008098928],"study_design_scores_gemma":[0.00015915092,0.000116048825,0.0000027291703,0.00034191358,0.0001105303,0.000013215274,0.00045643738,0.0010910314,0.000026491309,0.9722591,0.02494695,0.00047637476],"about_ca_topic_score_codex":0.0000011020159,"about_ca_topic_score_gemma":1.2390157e-7,"teacher_disagreement_score":0.09697156,"about_ca_system_score_codex":0.00004135832,"about_ca_system_score_gemma":0.00024989975,"threshold_uncertainty_score":0.9997975},"labels":[],"label_agreement":null},{"id":"W1590232726","doi":"10.1109/sips.2002.1049692","title":"An assessment of VLSI and embedded software implementations for Reed-Solomon decoders","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Very-large-scale integration; Decoding methods; Computer science; Implementation; CMOS; Software; Focus (optics); Soft-decision decoder; Domain (mathematical analysis); Software implementation; Embedded system; Computer hardware; Parallel computing; Computer architecture; Telecommunications; Electronic engineering; Engineering; Operating system; Mathematics","score_opus":0.021169950523226986,"score_gpt":0.3719385247002031,"score_spread":0.3507685741769761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590232726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055132367,0.00001721941,0.94349027,0.000057266985,0.0000751129,0.00016194396,0.000005141567,0.000064059306,0.0009966483],"genre_scores_gemma":[0.55821687,0.0000029555329,0.4416555,0.00007777448,0.0000026934372,0.000018050374,0.0000021168585,0.0000024078424,0.000021673295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999414,0.000054600143,0.00013749252,0.00018770799,0.00007720691,0.0001289846],"domain_scores_gemma":[0.9994466,0.00013927356,0.000048271813,0.0002583164,0.000052778712,0.00005481462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033516076,0.00006258625,0.00008250369,0.00007466011,0.00011205768,0.00005104415,0.00018830442,0.000019713762,0.000035486213],"category_scores_gemma":[0.0000205359,0.000057599795,0.000040981104,0.00016012318,0.000030258894,0.00025562762,0.00002544083,0.000025102549,2.2006836e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028070676,0.00006968225,0.007050034,0.000015416781,0.000018206933,2.542145e-7,0.0005261883,0.000032797285,0.0017450638,0.97763526,0.0002970028,0.012607305],"study_design_scores_gemma":[0.0037126772,0.0022564775,0.025703544,0.000040634488,0.000085481384,0.000022257946,0.0044099824,0.041038558,0.042099968,0.8735088,0.006242463,0.000879126],"about_ca_topic_score_codex":0.0000041838903,"about_ca_topic_score_gemma":0.00004669405,"teacher_disagreement_score":0.5030845,"about_ca_system_score_codex":0.0000061155274,"about_ca_system_score_gemma":0.00003622377,"threshold_uncertainty_score":0.23488514},"labels":[],"label_agreement":null},{"id":"W1593375236","doi":"10.1007/11423461_22","title":"New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; TRACE (psycholinguistics); Discrete logarithm; Cryptosystem; Computer science; Linear feedback shift register; Cryptography; Algorithm; Tuple; Theoretical computer science; Logarithm; Arithmetic; Mathematics; Discrete mathematics; Public-key cryptography; Shift register; Encryption","score_opus":0.010743690716865094,"score_gpt":0.22239090092781358,"score_spread":0.21164721021094848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593375236","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038329446,0.0029225112,0.9851446,0.00507648,0.0009262627,0.0007965111,0.0000042093125,0.0002448961,0.0048461794],"genre_scores_gemma":[0.22621372,0.000114282324,0.7684544,0.0027249258,0.0014768263,0.00003852666,0.0000031069824,0.00007831932,0.0008959048],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995693,0.00014850797,0.0006414011,0.0017040436,0.0010259354,0.0007871105],"domain_scores_gemma":[0.9961763,0.0012615261,0.00039436598,0.0017443661,0.00013742459,0.0002860106],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021183186,0.0007020914,0.00071204937,0.0006389339,0.000543047,0.0012449536,0.004130592,0.00033755737,0.00002840275],"category_scores_gemma":[0.000055368444,0.00048376355,0.00027155917,0.0008076381,0.001500299,0.00062003627,0.0009385536,0.0010698889,0.000024941692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004338916,0.000015493591,0.000021348565,0.000050521357,0.000018443041,0.000024492145,0.0011205067,0.014211381,0.00004139085,0.34769425,0.000057045654,0.63670176],"study_design_scores_gemma":[0.0015120103,0.0002327796,0.000043895463,0.0006866643,0.000031152667,0.00011561357,5.2170816e-7,0.35929418,0.00041715018,0.6183757,0.018316364,0.00097397575],"about_ca_topic_score_codex":0.000041216917,"about_ca_topic_score_gemma":0.00012875363,"teacher_disagreement_score":0.63572776,"about_ca_system_score_codex":0.00011468509,"about_ca_system_score_gemma":0.0005763321,"threshold_uncertainty_score":0.99979186},"labels":[],"label_agreement":null},{"id":"W1594587694","doi":"10.1007/3-540-45624-4_13","title":"Optimal Double Circulant Z4-Codes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Computer science; Theoretical computer science; Algorithm","score_opus":0.019987837981299827,"score_gpt":0.2410516356966528,"score_spread":0.22106379771535298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594587694","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003092922,0.00056642253,0.9756443,0.00045161598,0.0016885082,0.0002925514,0.0000033124306,0.00032854485,0.020715471],"genre_scores_gemma":[0.35945544,0.00020720191,0.6352995,0.002664031,0.001401686,0.00002706916,0.000011735841,0.00009182069,0.00084151316],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958772,0.000034822016,0.0004837211,0.0017543762,0.0009784377,0.0008714227],"domain_scores_gemma":[0.9972145,0.0003168811,0.00023552334,0.0018160028,0.00018239026,0.00023471791],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010773076,0.00060627185,0.000571795,0.0010728805,0.00038790985,0.0008219111,0.0046945163,0.00033236886,0.0000873326],"category_scores_gemma":[0.00002298098,0.00055707997,0.00026326888,0.0010006429,0.0008281285,0.0006365453,0.001502572,0.0008676026,0.00009388799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026893902,0.00005614049,0.00007623275,0.000033463362,0.000027792474,0.000360354,0.0008570904,0.036039535,0.00020587852,0.36929283,0.00004704041,0.59297675],"study_design_scores_gemma":[0.0008303328,0.00037762005,0.000098300436,0.00056714955,0.00002259666,0.0005204277,3.3378845e-7,0.23708168,0.002390202,0.7396453,0.016746266,0.0017197834],"about_ca_topic_score_codex":0.00002066519,"about_ca_topic_score_gemma":0.000028607828,"teacher_disagreement_score":0.591257,"about_ca_system_score_codex":0.0001704724,"about_ca_system_score_gemma":0.00036268772,"threshold_uncertainty_score":0.9996881},"labels":[],"label_agreement":null},{"id":"W1596162550","doi":"10.5539/jmr.v7n2p187","title":"The Weight and Nonlinearity of 2-rotation Symmetric Cubic Boolean Function","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Mathematics; Boolean function; Rotation (mathematics); Symmetric function; Invariant (physics); Nonlinear system; Combinatorics; Function (biology); Weight function; Pure mathematics; Mathematical analysis; Mathematical physics; Geometry; Quantum mechanics; Physics","score_opus":0.11785239494734996,"score_gpt":0.3654475783462523,"score_spread":0.24759518339890235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596162550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.606028,0.0018336913,0.38694164,0.0015609573,0.0003935392,0.0001844113,7.749841e-7,0.000014037121,0.0030429503],"genre_scores_gemma":[0.9743035,0.00020408707,0.02530161,0.000008501516,0.00009770868,0.0000013825245,9.8168435e-8,0.000004812833,0.000078323974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982896,0.00025803843,0.00033952188,0.00006936623,0.0008956508,0.0001478128],"domain_scores_gemma":[0.997413,0.0010972254,0.00023232636,0.00024659277,0.000904005,0.0001068671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009016427,0.000049458926,0.00012502592,0.00041579243,0.00014485799,0.00013891088,0.00052831275,0.000032618907,0.0000019701931],"category_scores_gemma":[0.0009472602,0.000029957511,0.000054427484,0.00088668143,0.00012090622,0.00026216827,0.00015487548,0.00031161544,0.000004195897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095673204,0.00037505053,0.00074005616,0.0001301148,0.000085773136,0.000009417632,0.0027327924,0.000027341817,0.0010612207,0.90770644,0.0022281462,0.084807955],"study_design_scores_gemma":[0.0006243742,0.0011219976,0.0012635761,0.000112716494,0.000018451752,0.000108758446,0.001377358,0.044085477,0.0020032793,0.94586223,0.0033436497,0.00007813963],"about_ca_topic_score_codex":0.0000023999885,"about_ca_topic_score_gemma":0.0000018726473,"teacher_disagreement_score":0.3682755,"about_ca_system_score_codex":0.000024055018,"about_ca_system_score_gemma":0.00011499683,"threshold_uncertainty_score":0.31249318},"labels":[],"label_agreement":null},{"id":"W1596459745","doi":"10.1023/a:1016521712726","title":"A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Coprime integers; Mathematics; Logarithm; Discrete logarithm; Heuristic; Calculus (dental); Saddle point; Discrete mathematics; Computer science; Mathematical analysis; Mathematical optimization","score_opus":0.022576844291554887,"score_gpt":0.22157195822432255,"score_spread":0.19899511393276767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596459745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017522555,0.0017615028,0.9938137,0.0009807491,0.00017469235,0.0009146981,0.000028967843,0.00008141546,0.000492007],"genre_scores_gemma":[0.77730465,0.000259334,0.22122157,0.0005181441,0.00010394862,0.0004067373,0.0000022587215,0.000029637804,0.00015372282],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985296,0.00014354644,0.00028874277,0.00039669898,0.00025964476,0.00038177858],"domain_scores_gemma":[0.9985935,0.0003569177,0.00015360565,0.0007201769,0.00010286105,0.00007294298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005411738,0.00022650951,0.00023214726,0.00013101225,0.0006045956,0.00019530464,0.0011328075,0.000076610064,0.000014466322],"category_scores_gemma":[0.000010627559,0.000118166594,0.00036955887,0.0008537312,0.0004338502,0.00020384208,0.0002119898,0.00015391881,8.309481e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018605726,0.00017681053,0.00057149824,0.00006291615,0.0002148696,0.0000022714275,0.0027545784,0.00004138324,0.00058178586,0.31666565,0.0014697491,0.67743987],"study_design_scores_gemma":[0.0025327152,0.0017664554,0.0020266564,0.00023860921,0.00035713206,0.00012918272,0.0005917988,0.30826125,0.018152958,0.6167743,0.047993872,0.0011750605],"about_ca_topic_score_codex":0.000023802546,"about_ca_topic_score_gemma":0.000011541452,"teacher_disagreement_score":0.7755524,"about_ca_system_score_codex":0.0000044229187,"about_ca_system_score_gemma":0.000010781249,"threshold_uncertainty_score":0.4818694},"labels":[],"label_agreement":null},{"id":"W1599558128","doi":"","title":"The WG Stream Cipher","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Affine cipher; Running key cipher; Cipher; Stream cipher attack; Keystream; Computer science; Transposition cipher; Two-square cipher; Block cipher mode of operation; Cryptography; Arithmetic; Algorithm; Mathematics; Theoretical computer science; CBC-MAC; Computer security; Encryption","score_opus":0.00714446427892813,"score_gpt":0.21473544862564034,"score_spread":0.20759098434671222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599558128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02755876,0.00029353602,0.48986325,0.012302154,0.00035351145,0.00008175165,2.1381778e-7,0.0004935579,0.46905327],"genre_scores_gemma":[0.98402166,0.000011065367,0.011100171,0.00080317724,0.000086868946,0.0000036186977,5.5259477e-8,0.0000019518973,0.0039713997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996254,0.000022981627,0.00005440863,0.00009892543,0.00007679914,0.000121484445],"domain_scores_gemma":[0.9995168,0.000084289786,0.000011792348,0.0003453673,0.000012905018,0.000028879918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017880858,0.000039237137,0.000026104326,0.000013916016,0.00016941622,0.00012245157,0.0005652934,0.000012130896,0.000075942444],"category_scores_gemma":[0.0000059678327,0.000022135153,0.000038845414,0.0001506315,0.000027790713,0.00014323597,0.00009258464,0.000039524442,0.00017542584],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.2409955e-7,0.00000785572,0.00006364816,1.1985324e-7,0.000002545267,2.1682438e-7,0.0000608875,0.000006264907,0.000026016714,0.70423126,0.0038078076,0.29179263],"study_design_scores_gemma":[0.00010203274,0.000033480108,0.0010118351,0.0000019406539,0.0000015275981,0.0000040737173,0.000031229447,0.006054248,0.0017488577,0.088657804,0.90225625,0.00009674414],"about_ca_topic_score_codex":0.00000207292,"about_ca_topic_score_gemma":0.000021275844,"teacher_disagreement_score":0.9564629,"about_ca_system_score_codex":0.0000038004373,"about_ca_system_score_gemma":0.000007234192,"threshold_uncertainty_score":0.22548027},"labels":[],"label_agreement":null},{"id":"W1604695990","doi":"10.1007/3-540-45624-4_12","title":"On Senary Simplex Codes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Simplex; Weight distribution; Orthogonality; Computer science; Block code; Linear code; Hierarchy; Binary number; Discrete mathematics; Mathematics; Combinatorics; Algorithm; Arithmetic; Decoding methods; Physics; Geometry","score_opus":0.01759614767029209,"score_gpt":0.24465608818497314,"score_spread":0.22705994051468106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604695990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015147093,0.00021107419,0.9627242,0.00065243046,0.0013908624,0.00024260404,0.0000050071208,0.00031026662,0.034312084],"genre_scores_gemma":[0.64026403,0.00018239475,0.3425463,0.013914541,0.0015877384,0.000023190427,0.000015684269,0.00012506032,0.0013410703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962086,0.000054087242,0.00041362498,0.0016367412,0.0009466957,0.0007402666],"domain_scores_gemma":[0.996668,0.0009770439,0.00020718582,0.0018079896,0.00013523443,0.0002045685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008941498,0.0005811098,0.0004999763,0.0011621603,0.00036431153,0.000530243,0.003946241,0.00030281526,0.00008620698],"category_scores_gemma":[0.00006906734,0.0005211072,0.00022077456,0.0009273033,0.0007783306,0.00042194,0.0011615484,0.00089269225,0.00012112252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102542335,0.00002987386,0.000012369433,0.000012032839,0.000008877723,0.00017234834,0.00023452034,0.00637929,0.000030180336,0.3965189,0.000086829874,0.5965045],"study_design_scores_gemma":[0.00018300257,0.00032684,0.000038129812,0.00028973614,0.0000054200755,0.000095598014,7.579225e-8,0.078710616,0.0003541361,0.90930545,0.010035264,0.0006557302],"about_ca_topic_score_codex":0.0000074847844,"about_ca_topic_score_gemma":0.00002481146,"teacher_disagreement_score":0.6401126,"about_ca_system_score_codex":0.00015484043,"about_ca_system_score_gemma":0.00025913824,"threshold_uncertainty_score":0.99972403},"labels":[],"label_agreement":null},{"id":"W1605083655","doi":"10.1007/11779360_29","title":"Realizations from Decimation Hadamard Transform for Special Classes of Binary Sequences with Two-Level Autocorrelation","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hadamard transform; Autocorrelation; Decimation; Mathematics; Complementary sequences; Binary number; Pseudorandom binary sequence; Autocorrelation matrix; Sequence (biology); Quadratic residue; Autocorrelation technique; Discrete mathematics; Algorithm; Combinatorics; Computer science; Arithmetic; Statistics; Telecommunications; Mathematical analysis","score_opus":0.023116194565001393,"score_gpt":0.24891497706386684,"score_spread":0.22579878249886545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605083655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028819128,0.00007983001,0.9942021,0.0003313988,0.0008161749,0.00070673245,0.00007095563,0.00009833973,0.0034062841],"genre_scores_gemma":[0.18325824,0.000015248052,0.81536895,0.00018203245,0.0008986299,0.00003870269,0.00010962409,0.000028475257,0.000100086145],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759835,0.000032550073,0.0005155294,0.00087064103,0.0006611207,0.00032179613],"domain_scores_gemma":[0.9978409,0.000768459,0.00037633505,0.0006250601,0.0003228579,0.00006643157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049931847,0.00034835303,0.00039538136,0.00073924154,0.00028166658,0.00024237641,0.0013818906,0.00020277337,0.000015438238],"category_scores_gemma":[0.000032683845,0.00029980985,0.00014006149,0.00074250443,0.0005990923,0.00079390936,0.0001343948,0.0002644601,0.0000019983925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006391992,0.000059725953,0.00019942918,0.000052568128,0.000027605647,0.000010012528,0.0010678526,0.20169714,0.00029218322,0.23339392,0.00008510159,0.5630505],"study_design_scores_gemma":[0.0004518813,0.00034578817,0.00075089454,0.000433993,0.000025793393,0.000008543823,4.3338207e-7,0.33845812,0.0013376147,0.6569648,0.0008123134,0.0004098554],"about_ca_topic_score_codex":0.00008286463,"about_ca_topic_score_gemma":0.000592294,"teacher_disagreement_score":0.56264067,"about_ca_system_score_codex":0.00012570096,"about_ca_system_score_gemma":0.0004789598,"threshold_uncertainty_score":0.9999454},"labels":[],"label_agreement":null},{"id":"W1606804863","doi":"10.1090/crmp/035/19","title":"Convex cones and SAGBI bases of permutation invariants","year":2004,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"","keywords":"Combinatorics; Mathematics; Invariant (physics); Regular polygon; Polynomial ring; Permutation (music); Ring (chemistry); Permutation group; Order (exchange); Polynomial; Pure mathematics; Geometry; Physics; Mathematical analysis; Chemistry; Mathematical physics","score_opus":0.01322399768692253,"score_gpt":0.2088755088114998,"score_spread":0.19565151112457727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606804863","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019463241,0.008364181,0.19699098,0.003067971,0.0010120085,0.0013892435,0.00006840016,0.0009060988,0.76873785],"genre_scores_gemma":[0.9981052,0.00017834589,0.001026481,0.00040463306,0.00014435733,0.00000772537,0.0000073195492,0.000031768242,0.00009412082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985988,0.0000056278473,0.000314588,0.0005751663,0.00028686455,0.0002189376],"domain_scores_gemma":[0.9988459,0.00019552467,0.0003617493,0.00018101437,0.00032394042,0.00009187508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022298591,0.00037425332,0.0004556044,0.0003155368,0.00014454553,0.00018011004,0.00046455293,0.00033688045,0.00008406701],"category_scores_gemma":[0.0001619026,0.00034194018,0.00013245679,0.00012506699,0.00023665272,0.0003273592,0.0001692593,0.0003255052,0.000007639316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022093138,0.000012075717,0.00017713936,0.00022515134,0.000053510197,0.000004327044,0.0015614707,0.0000036429249,0.0014944683,0.9806293,0.0000114834065,0.01580532],"study_design_scores_gemma":[0.00028969903,0.00021675137,0.0002841666,0.0006504394,0.000072592884,0.000045266363,0.000010153486,0.00010848568,0.0072413306,0.98928577,0.001412596,0.00038276718],"about_ca_topic_score_codex":0.0000094100105,"about_ca_topic_score_gemma":0.00000305594,"teacher_disagreement_score":0.978642,"about_ca_system_score_codex":0.000025252679,"about_ca_system_score_gemma":0.00010442779,"threshold_uncertainty_score":0.99990326},"labels":[],"label_agreement":null},{"id":"W162262572","doi":"","title":"Subquadratic Multiplication Using Optimal Normal Bases","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Toeplitz matrix; Matrix multiplication; Multiplication (music); Mathematics; Multiplication algorithm; Binary number; Product (mathematics); Scheme (mathematics); Computational complexity theory; Algebra over a field; Matrix (chemical analysis); Computer science; Arithmetic; Algorithm; Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.01449888554027283,"score_gpt":0.23049675273143308,"score_spread":0.21599786719116026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W162262572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3131437,0.000015276359,0.6828543,0.00007804192,0.000050384973,0.000039839688,2.5286246e-7,0.00013962234,0.003678566],"genre_scores_gemma":[0.83053535,3.1300237e-7,0.16921817,0.00009534435,0.00004656803,0.000003127604,0.0000012025951,0.0000026317527,0.00009729416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994425,0.000031064737,0.0001132981,0.00017307542,0.000097015334,0.00014304441],"domain_scores_gemma":[0.99957985,0.000054026463,0.000033166703,0.0002758038,0.00003006545,0.000027119408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013184852,0.000066072,0.000054764016,0.000074985015,0.00012314884,0.00010258396,0.00028958108,0.000021609696,0.0000416487],"category_scores_gemma":[0.000005745576,0.00005970799,0.000047497022,0.00029034592,0.000025629803,0.00039626603,0.000070679846,0.0000355812,0.000025465033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006871892,0.00011321182,0.0040690396,0.000006814447,0.0000053073995,0.0000043811665,0.0001022884,0.006146801,0.018563801,0.9601741,0.00032989978,0.010477488],"study_design_scores_gemma":[0.00028782533,0.000055941688,0.008223927,0.000010473242,0.00000805753,0.000026764188,0.000026236383,0.94282675,0.03136757,0.015401931,0.00149343,0.00027106982],"about_ca_topic_score_codex":0.00007587308,"about_ca_topic_score_gemma":0.000008778884,"teacher_disagreement_score":0.9447722,"about_ca_system_score_codex":0.000009503732,"about_ca_system_score_gemma":0.000014622007,"threshold_uncertainty_score":0.24348211},"labels":[],"label_agreement":null},{"id":"W1630586687","doi":"10.26421/qic13.3-4-4","title":"Reduction from non-injective hidden shift problem to injective hidden shift problem","year":2013,"lang":"en","type":"preprint","venue":"Quantum Information and Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Injective function; Reduction (mathematics); Bent molecular geometry; Simple (philosophy); Mathematics; Discrete mathematics; Computer science; Combinatorics; Geometry","score_opus":0.012470724546861066,"score_gpt":0.2453528538428424,"score_spread":0.23288212929598132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1630586687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26608214,0.00004463361,0.72739923,0.0010477394,0.00096536794,0.0018225091,0.00004464305,0.000474286,0.0021194713],"genre_scores_gemma":[0.9349191,0.000021704109,0.063610956,0.00038497616,0.00019824234,0.0004189516,0.00041211504,0.000020962596,0.0000129838145],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704075,0.0002444213,0.00097857,0.00073460065,0.00058992056,0.00041176777],"domain_scores_gemma":[0.99776316,0.00014501163,0.00084527495,0.0005534644,0.00044731807,0.000245789],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006117982,0.00052895804,0.0004878528,0.0008832681,0.00041250818,0.0015709815,0.0007789379,0.00039101206,0.000022417073],"category_scores_gemma":[0.000032443106,0.0005392195,0.00017024265,0.0007578891,0.00008120993,0.0034519949,0.0010203816,0.00069542933,0.00032362153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020609083,0.00016856355,0.00023516273,0.00041662555,0.00027233807,0.0000021992278,0.14254148,0.013710035,0.0000672402,0.35712668,0.0031497425,0.48210382],"study_design_scores_gemma":[0.0006279704,0.0004166951,0.012471599,0.00038227564,0.00004656936,0.000009861791,0.0012845072,0.18700871,0.00017600218,0.79624665,0.00053340965,0.00079577387],"about_ca_topic_score_codex":0.0009954717,"about_ca_topic_score_gemma":0.00001934178,"teacher_disagreement_score":0.66883695,"about_ca_system_score_codex":0.0001963236,"about_ca_system_score_gemma":0.0002470111,"threshold_uncertainty_score":0.9997059},"labels":[],"label_agreement":null},{"id":"W16323757","doi":"10.1021/es051382h","title":"On Generalized Schur Numbers for x1+x2+c = kx3.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Schur's theorem; Schur complement; Combinatorics; Pure mathematics; Orthogonal polynomials; Physics; Eigenvalues and eigenvectors","score_opus":0.012983303118572858,"score_gpt":0.2578665010753239,"score_spread":0.24488319795675104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16323757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.887945,0.00010509105,0.091061346,0.0005310077,0.00584199,0.0003947223,0.000002933944,0.00046747204,0.013650417],"genre_scores_gemma":[0.98960125,0.000005198499,0.0092481645,0.00082125375,0.000022351673,0.000022427395,0.0000031426991,0.000015899734,0.0002603306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986713,0.000053162334,0.00021714365,0.00038893323,0.00023657686,0.00043286858],"domain_scores_gemma":[0.99866086,0.00040445253,0.000080463375,0.00063002243,0.00008290427,0.00014128869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009468901,0.00016657506,0.000172915,0.00015520051,0.00023607582,0.0001099881,0.000835281,0.00008667269,0.000020208981],"category_scores_gemma":[0.00008441703,0.00016391472,0.0001704872,0.0005150537,0.00004882918,0.00021328098,0.00010992121,0.0001301636,0.000063514664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006495663,0.000102798374,0.0002399663,0.000005576497,0.000021858266,0.0000074903705,0.00017307715,0.0000058973033,0.00041145924,0.98726344,0.0054094484,0.0062940195],"study_design_scores_gemma":[0.0013785794,0.00025428593,0.00052685384,0.000016277138,0.000007189341,0.0000039082256,0.000011603026,0.00044991446,0.0048658145,0.9721782,0.020078022,0.00022934188],"about_ca_topic_score_codex":0.000009621709,"about_ca_topic_score_gemma":0.0000038352773,"teacher_disagreement_score":0.101656206,"about_ca_system_score_codex":0.000037842965,"about_ca_system_score_gemma":0.000030301573,"threshold_uncertainty_score":0.66842484},"labels":[],"label_agreement":null},{"id":"W1633446687","doi":"10.1090/mcom/2978","title":"The self-power map and collecting all residue classes","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Exponential function; Natural number; Discrete mathematics; Function (biology); Upper and lower bounds; Prime (order theory); Prime power; Exponential sum; Mathematical analysis","score_opus":0.03210874508694974,"score_gpt":0.27754703364778655,"score_spread":0.2454382885608368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1633446687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19744495,0.00027879758,0.7958091,0.0009771554,0.00025975044,0.00019761524,4.304673e-7,0.00018020347,0.0048520314],"genre_scores_gemma":[0.82562685,0.0000043431423,0.17428616,0.000032803055,0.000010811375,0.0000036296085,3.076714e-7,0.0000045743996,0.00003053138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999343,0.000062857405,0.00019557225,0.00010460403,0.00019252446,0.00010144086],"domain_scores_gemma":[0.99888384,0.00061904715,0.0001453517,0.00017632854,0.00013267768,0.000042733755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006997967,0.00006703788,0.00009572115,0.000057050533,0.000117602875,0.00014416347,0.0002477601,0.000024853658,4.0725735e-7],"category_scores_gemma":[0.00008953903,0.000049663795,0.000026404461,0.00019885822,0.000039758994,0.00014013043,0.00011361195,0.000049719656,0.0000041099293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010373072,0.000120995865,0.00014266936,0.00009481195,0.000059409096,0.0000019738118,0.02043158,0.0005364535,0.00014793058,0.9694691,0.00381271,0.0051720496],"study_design_scores_gemma":[0.00025365147,0.00013954345,0.00018983369,0.00003846404,0.00001155763,0.000012485609,0.00094325957,0.13920972,0.0007375326,0.85719746,0.0011688228,0.000097666605],"about_ca_topic_score_codex":0.0000015350162,"about_ca_topic_score_gemma":0.0000024992735,"teacher_disagreement_score":0.6281819,"about_ca_system_score_codex":0.000010694841,"about_ca_system_score_gemma":0.00003751482,"threshold_uncertainty_score":0.20252307},"labels":[],"label_agreement":null},{"id":"W1634602415","doi":"10.1109/isit.1993.748414","title":"On the minimum Code Length of s-step (T, U) Permutation Decodable Cyclic Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Permutation (music); Code (set theory); Computer science; Combinatorics; Cyclic code; Mathematics; Discrete mathematics; Algorithm; Concatenated error correction code; Block code; Decoding methods; Physics; Programming language","score_opus":0.015283925895714734,"score_gpt":0.24199640562207264,"score_spread":0.2267124797263579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1634602415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.570993,0.000065512104,0.37396687,0.0035962958,0.00011352479,0.00014291354,0.0000030873337,0.00014990383,0.05096886],"genre_scores_gemma":[0.98796743,0.000008699856,0.010602353,0.0009129547,0.000028312164,0.0000080546315,7.24471e-7,0.0000041757494,0.00046727248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999242,0.00008829821,0.00016064498,0.00018368845,0.00017462889,0.00015074812],"domain_scores_gemma":[0.99892116,0.0005158963,0.00006451151,0.00042544535,0.000039565813,0.000033449134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004058119,0.0000840665,0.00009284962,0.000075847594,0.000119985314,0.00005392941,0.00058047695,0.000029703755,0.00013915374],"category_scores_gemma":[0.000044529344,0.000053785705,0.000075370684,0.0002844916,0.00005928841,0.00019460371,0.00006608433,0.000070376474,0.00007219682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100182615,0.000068803325,0.00010581051,0.000002955399,0.0000118760645,3.9356163e-7,0.00047443804,0.00024448958,0.001213148,0.97473633,0.0023373484,0.020794366],"study_design_scores_gemma":[0.0013544756,0.0008585346,0.0049453266,0.00010523118,0.00004096237,0.000025093123,0.0008219698,0.42138696,0.1461729,0.37788656,0.045632422,0.0007695598],"about_ca_topic_score_codex":0.000007682568,"about_ca_topic_score_gemma":0.00004267751,"teacher_disagreement_score":0.5968498,"about_ca_system_score_codex":0.00001025183,"about_ca_system_score_gemma":0.000016797483,"threshold_uncertainty_score":0.21933174},"labels":[],"label_agreement":null},{"id":"W1641456849","doi":"10.1090/s0002-9939-05-08220-1","title":"A generalized Lucas sequence and permutation binomials","year":2005,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Lucas sequence; Permutation (music); Mathematics; Combinatorics; Lucas number; Genetics; Biology; Fibonacci number; Philosophy; Fibonacci polynomials","score_opus":0.022731961736840427,"score_gpt":0.27101421068409604,"score_spread":0.24828224894725562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641456849","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9866353,0.00018418395,0.0046096253,0.006774887,0.000055067834,0.0003565283,0.000008146543,0.0000848755,0.0012913697],"genre_scores_gemma":[0.8948586,0.00017144118,0.10344267,0.0011579036,0.00014371642,0.000022819953,2.1650322e-7,0.000019535253,0.00018312297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800354,0.000037900045,0.00054497767,0.00049326936,0.00049113587,0.00042917902],"domain_scores_gemma":[0.9982985,0.00025412824,0.0007997301,0.0002614893,0.00022704953,0.00015910658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010620102,0.00029124817,0.00057639834,0.000041240583,0.00032936397,0.0002656965,0.001042277,0.000074389805,0.000033053337],"category_scores_gemma":[0.00023673673,0.00021019207,0.0005142371,0.001001638,0.0017141283,0.000457141,0.00063132984,0.00026815524,0.000017118573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047837042,0.00030352682,0.0013010405,0.0006004799,0.00021262761,2.4623225e-7,0.021523755,0.00001232787,0.06807423,0.8712189,0.0020040337,0.03470101],"study_design_scores_gemma":[0.0014296258,0.0006389759,0.005178122,0.00087749155,0.0005276424,0.000171225,0.0055116643,0.18439743,0.034926154,0.7626327,0.0024393324,0.0012696349],"about_ca_topic_score_codex":0.000014590986,"about_ca_topic_score_gemma":2.7134433e-7,"teacher_disagreement_score":0.1843851,"about_ca_system_score_codex":0.00007026239,"about_ca_system_score_gemma":0.000055694527,"threshold_uncertainty_score":0.8571384},"labels":[],"label_agreement":null},{"id":"W1646201678","doi":"10.1007/978-3-642-30615-0_29","title":"The Density of Ternary Barker Sequences","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Aperiodic graph; Ternary operation; Autocorrelation; Sequence (biology); Computer science; Offset (computer science); Lattice (music); Arithmetic; Mathematics; Algorithm; Combinatorics; Discrete mathematics; Statistics; Programming language; Physics","score_opus":0.014786015811448408,"score_gpt":0.22878428086090818,"score_spread":0.2139982650494598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1646201678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005136487,0.0015658218,0.99204147,0.00046320845,0.0018028313,0.00018480366,0.0000018987238,0.000080428304,0.0033458683],"genre_scores_gemma":[0.85264003,0.00024009909,0.145669,0.00072372914,0.0005037961,0.0000059535296,0.0000010356116,0.000023407756,0.00019292785],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973929,0.00006749012,0.00041686202,0.0007592945,0.00080195506,0.00056150643],"domain_scores_gemma":[0.99691594,0.0009823274,0.00031054567,0.0014774323,0.00018607487,0.00012766082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018159219,0.0003474836,0.0003512754,0.00036342957,0.0004217606,0.00028167455,0.004302407,0.00018728132,0.000014202358],"category_scores_gemma":[0.00006293353,0.00023838272,0.00018781981,0.0005100565,0.0016778737,0.00048017272,0.0014392296,0.00056596857,0.000019111214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008049019,0.000014851472,0.0008235892,0.000016582952,0.000014745247,0.000017882783,0.0004911908,0.0004273477,0.00020408703,0.20685282,0.00001368278,0.79111516],"study_design_scores_gemma":[0.00012206849,0.00015021824,0.0014945916,0.00027762845,0.0000132689665,0.00009774696,3.029137e-7,0.031610142,0.0035330502,0.95826226,0.0038952366,0.00054347643],"about_ca_topic_score_codex":0.000015242572,"about_ca_topic_score_gemma":0.0000383008,"teacher_disagreement_score":0.8521264,"about_ca_system_score_codex":0.0000705492,"about_ca_system_score_gemma":0.00025111574,"threshold_uncertainty_score":0.97209656},"labels":[],"label_agreement":null},{"id":"W1667057730","doi":"10.3233/fi-2012-633","title":"Public-Key Cryptography Based on a Cubic Extension of the Lucas Functions","year":2012,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Mount Royal University","funders":"","keywords":"Public-key cryptography; Key (lock); Key exchange; Cryptography; Extension (predicate logic); Computer science; Public key cryptosystem; Theoretical computer science; Computer security; Mathematics; Encryption; Programming language","score_opus":0.0386312350513452,"score_gpt":0.23051973436159862,"score_spread":0.19188849931025342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1667057730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21405089,0.000116771465,0.6675501,0.0046051624,0.0032341958,0.00086921005,0.000029137962,0.0004495486,0.10909498],"genre_scores_gemma":[0.9898086,0.0000021349554,0.007248972,0.0028256616,0.000043527292,0.000030847015,0.0000042729052,0.0000065911513,0.00002935947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985315,0.00010322222,0.0003726659,0.00012825606,0.0004611236,0.00040319256],"domain_scores_gemma":[0.99818367,0.00025300906,0.0002022698,0.0011241481,0.00008051099,0.00015636932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006733754,0.0001614698,0.00015400873,0.00033357317,0.00034045565,0.00014584317,0.00084516814,0.00005580496,0.00018809896],"category_scores_gemma":[0.000100422,0.00010835272,0.00026476718,0.0012772295,0.0001489129,0.0011791505,0.00025835022,0.00018221639,0.00014440116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036738,0.00062240567,0.019854313,0.00007437341,0.00005862686,2.654219e-7,0.0025730042,0.000105802304,0.00036285107,0.9437842,0.011094461,0.021432986],"study_design_scores_gemma":[0.003798295,0.0016809251,0.20372932,0.0005922048,0.00018983617,0.000058922873,0.0022146243,0.087504834,0.008742683,0.039441466,0.6503283,0.0017186443],"about_ca_topic_score_codex":0.000003457969,"about_ca_topic_score_gemma":0.0000010207391,"teacher_disagreement_score":0.9043427,"about_ca_system_score_codex":0.000028227969,"about_ca_system_score_gemma":0.000048281552,"threshold_uncertainty_score":0.44184956},"labels":[],"label_agreement":null},{"id":"W167165370","doi":"","title":"New Linear Codes of Dimensions 5 and 6 over GF(8).","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; GF(2); Arithmetic; Discrete mathematics; Finite field","score_opus":0.013753463928825767,"score_gpt":0.22618413138596213,"score_spread":0.21243066745713637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167165370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98919123,0.0011072821,0.0049103987,0.00030282376,0.00093254,0.000085044514,0.0000014692023,0.00012866486,0.0033405637],"genre_scores_gemma":[0.99418014,0.00007543688,0.005471586,0.000088047476,0.00000525701,0.0000011850923,2.4252884e-7,0.000004696355,0.00017342485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993925,0.000038884467,0.00012343888,0.00018231066,0.00012864271,0.00013419193],"domain_scores_gemma":[0.99935067,0.00012472534,0.000048517064,0.00035501542,0.000026143089,0.000094960276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011522362,0.000082074686,0.00012530982,0.00007229187,0.00007536571,0.000026716862,0.00029335718,0.00003921152,0.00006342764],"category_scores_gemma":[0.000023337216,0.00007717642,0.000047206093,0.0003128864,0.000047832396,0.00017121839,0.00016716536,0.00007523182,0.000013725548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023476398,0.00004533251,0.0017356918,0.0000037464308,0.0000120998875,0.0000027821575,0.00036177263,0.0000015697112,0.00062909676,0.98892516,0.0031319987,0.0051483763],"study_design_scores_gemma":[0.00068992755,0.00017134631,0.0033740064,0.000029449164,0.000011346366,0.0000067437027,0.000010246682,0.0049898303,0.002691107,0.98175687,0.006107871,0.00016124446],"about_ca_topic_score_codex":0.000017333796,"about_ca_topic_score_gemma":0.0000011114784,"teacher_disagreement_score":0.0071683046,"about_ca_system_score_codex":0.0000043051796,"about_ca_system_score_gemma":0.000008964552,"threshold_uncertainty_score":0.3147163},"labels":[],"label_agreement":null},{"id":"W1688130520","doi":"10.1007/3-540-39568-7_21","title":"A Fast Pseudo Random Permutation Generator With Applications to Cryptology","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Permutation (music); Random permutation; Sequence (biology); Pseudorandom number generator; Cryptography; Random sequence; Generator (circuit theory); Random number generation; Computer science; Mathematics; Discrete mathematics; Algorithm; Combinatorics; Physics; Symmetric group","score_opus":0.015654088069899565,"score_gpt":0.25421091414589386,"score_spread":0.2385568260759943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1688130520","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016182124,0.0001370809,0.9945219,0.00056489615,0.00046118913,0.00076316745,0.000004394591,0.00020175819,0.0031837735],"genre_scores_gemma":[0.04578208,0.000010523868,0.9502526,0.003231281,0.00050049415,0.000085222746,0.000006432502,0.000034695575,0.0000966658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968581,0.000040134688,0.00039935706,0.0014370123,0.00067070697,0.00059468555],"domain_scores_gemma":[0.9975948,0.00043310144,0.00019269978,0.0012229515,0.0003085822,0.00024789647],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086339447,0.00044404782,0.00044134204,0.0013117875,0.00036621824,0.00039754857,0.0023976613,0.00023623924,0.000020394647],"category_scores_gemma":[0.000026558839,0.00037885574,0.00010933432,0.0013466396,0.00055566384,0.00031858886,0.0005490035,0.00051746867,0.00006711829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042095733,0.000027845974,0.00004055697,0.000016052525,0.000013578861,0.0000400167,0.00080553704,0.014266446,0.00026390146,0.2978079,0.000010886425,0.6866652],"study_design_scores_gemma":[0.0020230315,0.0011668768,0.00026286408,0.0004511175,0.000047359477,0.00053735916,0.0000012202654,0.17842388,0.0036919743,0.7959953,0.01508389,0.0023151212],"about_ca_topic_score_codex":0.0000056514073,"about_ca_topic_score_gemma":0.00009300199,"teacher_disagreement_score":0.6843501,"about_ca_system_score_codex":0.00013548392,"about_ca_system_score_gemma":0.00034124753,"threshold_uncertainty_score":0.99986637},"labels":[],"label_agreement":null},{"id":"W170607195","doi":"","title":"Aperiodic Perfect Maps from de Bruijn Sequences.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Aperiodic graph; De Bruijn sequence; Mathematics; Combinatorics","score_opus":0.013655785243458417,"score_gpt":0.21469496949299977,"score_spread":0.20103918424954134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170607195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.989252,0.0005272509,0.0035966542,0.00034481028,0.0015857547,0.00008783266,0.0000039193555,0.0003649377,0.0042368653],"genre_scores_gemma":[0.99606925,0.000070684946,0.0032149048,0.00051809073,0.00001867149,0.00001442345,0.00000393628,0.0000102526,0.00007977547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986904,0.00015709961,0.00016419713,0.0003916147,0.00024070646,0.00035593726],"domain_scores_gemma":[0.9989137,0.00018261626,0.000059722737,0.00065367704,0.000042573447,0.00014768816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027765383,0.00016117665,0.00017760723,0.00009234839,0.0003691564,0.000102344115,0.0010796225,0.000082765764,0.00006281078],"category_scores_gemma":[0.00004247081,0.0001609914,0.00012702326,0.0005032624,0.00014466132,0.0003436546,0.00019230349,0.00020201252,0.00017242743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009221249,0.00008985245,0.017433053,0.0000033570548,0.000027661508,0.00013985347,0.0019041472,0.000005646188,0.0017664771,0.97177595,0.0035210156,0.0033237953],"study_design_scores_gemma":[0.00053407555,0.00012896741,0.012145535,0.000019481331,0.00000785315,0.00006631996,0.0000233939,0.00063600077,0.0031375967,0.9741635,0.008857253,0.00028004323],"about_ca_topic_score_codex":0.00013438791,"about_ca_topic_score_gemma":0.0000033250685,"teacher_disagreement_score":0.0068172854,"about_ca_system_score_codex":0.000050193954,"about_ca_system_score_gemma":0.00012761798,"threshold_uncertainty_score":0.6565039},"labels":[],"label_agreement":null},{"id":"W1714957475","doi":"10.1109/glocom.2001.965164","title":"A number theory based dual transmit antennas space-time code","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Coding gain; Space–time block code; Diversity gain; Constellation; Code (set theory); Block code; Diophantine approximation; Transmit diversity; Code rate; Space–time code; Constant-weight code; Computer science; Algebraic number theory; Mathematics; Coding (social sciences); Algebraic number; Algorithm; Discrete mathematics; Diophantine equation; Concatenated error correction code; Fading; Decoding methods; Physics; Statistics","score_opus":0.014672696548461312,"score_gpt":0.21193862730809934,"score_spread":0.19726593075963803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1714957475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007097016,0.000049511138,0.80471516,0.0024334684,0.00014240951,0.00012069446,0.000018618315,0.000730637,0.18469247],"genre_scores_gemma":[0.9381341,0.0000064782953,0.041402847,0.0026209813,0.0000720935,0.00001893241,0.0000031954066,0.00001869072,0.01772271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988127,0.0001750105,0.00014427619,0.00034826912,0.00020536222,0.0003143957],"domain_scores_gemma":[0.99890983,0.00035346785,0.00003257687,0.0005524974,0.000035491754,0.00011614469],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00038467874,0.00015329072,0.00014635328,0.00008490566,0.00013141312,0.0001245968,0.0005468358,0.000058082867,0.026602278],"category_scores_gemma":[0.000021708578,0.00012738699,0.00016901203,0.00051037845,0.00009113807,0.00027152506,0.00005378929,0.00011826662,0.0022799755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002146612,0.00019010101,0.00013486101,0.000007008432,0.000028251352,0.000046967696,0.00053927733,0.000008992867,0.0007512987,0.949805,0.025217833,0.023248933],"study_design_scores_gemma":[0.0025486103,0.00039305034,0.0012773521,0.00011001615,0.00005574498,0.00017592378,0.00008377444,0.3762996,0.0061445483,0.3274197,0.28394362,0.0015480646],"about_ca_topic_score_codex":0.000002218425,"about_ca_topic_score_gemma":0.000002469118,"teacher_disagreement_score":0.93103707,"about_ca_system_score_codex":0.000008208808,"about_ca_system_score_gemma":0.000011715604,"threshold_uncertainty_score":0.9984969},"labels":[],"label_agreement":null},{"id":"W1749437014","doi":"10.1007/s11425-013-4633-x","title":"Linear recurring sequences and subfield subcodes of cyclic codes","year":2013,"lang":"en","type":"article","venue":"Science China Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Finite field; Generator (circuit theory); TRACE (psycholinguistics); Sequence (biology); Discrete mathematics; Polynomial; Physics; Mathematical analysis","score_opus":0.012811184275334363,"score_gpt":0.24794942487591168,"score_spread":0.2351382406005773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1749437014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92408216,0.000088154324,0.071381316,0.0003135067,0.000107714506,0.00012737358,6.7136153e-7,0.00007877133,0.003820331],"genre_scores_gemma":[0.87046146,0.0000367323,0.12941922,0.00003668097,0.000012098891,0.0000064598644,7.6115306e-8,0.0000031220254,0.000024123687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988862,0.000023824767,0.00023414766,0.00027223775,0.00032911898,0.00025445037],"domain_scores_gemma":[0.9990651,0.00016264606,0.00013119486,0.00045764536,0.00008625515,0.00009716356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095341995,0.00010975779,0.00017170906,0.0001849919,0.00023107966,0.00019594483,0.0010939814,0.00003089166,0.000015479016],"category_scores_gemma":[0.00022190287,0.000084005085,0.000041630115,0.00086312415,0.00074062153,0.0009650038,0.00031305154,0.00009168793,0.000011806579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.0701566e-7,0.00007159931,0.0021762073,0.00011600115,0.0000061002643,0.0000018070172,0.008198157,0.000020893103,0.03194704,0.94694895,0.00003120655,0.0104813175],"study_design_scores_gemma":[0.00009638892,0.0001365959,0.00493251,0.0001617883,0.0000065018494,0.000040306593,0.00066883944,0.03809686,0.076542154,0.8790618,0.000020440752,0.00023581342],"about_ca_topic_score_codex":0.000028144212,"about_ca_topic_score_gemma":0.000002805607,"teacher_disagreement_score":0.06788716,"about_ca_system_score_codex":0.000007716475,"about_ca_system_score_gemma":0.000049804446,"threshold_uncertainty_score":0.3425628},"labels":[],"label_agreement":null},{"id":"W175177793","doi":"","title":"On the Structure of Optimal Linear Block Codes of Length a Multiple of 4 and d = 4.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Discrete mathematics","score_opus":0.009039251704525087,"score_gpt":0.22062445887223744,"score_spread":0.21158520716771237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175177793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9991763,0.00009843107,0.00025647308,0.00013724287,0.000114601055,0.00007803049,0.0000078339,0.000014747624,0.00011631054],"genre_scores_gemma":[0.9966901,0.00000931391,0.0032585957,0.00002933037,0.000003773798,6.531754e-7,3.1819982e-7,0.0000036907222,0.0000042500765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993841,0.000065531705,0.00017314516,0.00013127564,0.0001520468,0.00009388892],"domain_scores_gemma":[0.99899334,0.000425336,0.00012542885,0.00036170252,0.00006832205,0.00002584671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017771451,0.00007896663,0.00015678133,0.0000578642,0.00004226505,0.000007216479,0.00041960756,0.00003974523,0.0000065464687],"category_scores_gemma":[0.00007293113,0.000055935303,0.000053653966,0.00022236636,0.00013165621,0.00007069908,0.00011833831,0.00009003663,4.2597037e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029664692,0.0000853351,0.0012591253,0.000013724739,0.000025413974,2.7073784e-7,0.0008597786,0.00030788776,0.009522982,0.98635185,0.00006575474,0.0014781918],"study_design_scores_gemma":[0.0013727219,0.0007824576,0.004567897,0.00009485886,0.000023265804,0.000005818972,0.00011183337,0.035272114,0.42026398,0.53698194,0.00033451087,0.00018860126],"about_ca_topic_score_codex":0.000007525641,"about_ca_topic_score_gemma":0.0000022741606,"teacher_disagreement_score":0.44936994,"about_ca_system_score_codex":0.0000033478823,"about_ca_system_score_gemma":0.000015689362,"threshold_uncertainty_score":0.22809754},"labels":[],"label_agreement":null},{"id":"W1765342747","doi":"10.3968/j.sms.1923845220120201.015","title":"Image Encryption Using Novel Mappings over GF(2^n)","year":2011,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Encryption; Mathematics; Permutation (music); Image (mathematics); Transformation (genetics); Galois theory; Field (mathematics); Linear map; Pixel; Algorithm; Discrete mathematics; Computer science; Pure mathematics; Artificial intelligence; Computer security","score_opus":0.22264554610467582,"score_gpt":0.36771581880290216,"score_spread":0.14507027269822634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765342747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27698666,0.00021255435,0.6873658,0.00013580949,0.00036944216,0.00017044638,6.030374e-7,0.000128189,0.034630504],"genre_scores_gemma":[0.5249547,0.0000170844,0.47487956,0.00009825997,0.000024346351,0.000010154512,2.504227e-8,0.0000027543938,0.0000131661445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986572,0.00004806445,0.00026532254,0.0003636821,0.00032548376,0.00034021278],"domain_scores_gemma":[0.9993618,0.00023280723,0.00007841575,0.00023682808,0.000043239295,0.00004691332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015062786,0.00012827538,0.00020263574,0.00017361277,0.00028804134,0.000076254626,0.0008352398,0.000031604264,0.00008463586],"category_scores_gemma":[0.00025572034,0.00009307119,0.000067118155,0.0010444763,0.0010906379,0.0006811421,0.0004922649,0.00008947495,0.000029920808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021943958,0.00010864227,0.0004179161,0.000041396408,0.000011092856,0.0000043033115,0.008638986,0.0000021679457,0.0022272293,0.98775965,0.000022590244,0.0007638511],"study_design_scores_gemma":[0.00012630029,0.00007516615,0.0010404213,0.00014921621,0.0000058147857,0.000014549426,0.00153432,0.018294593,0.0003900483,0.97814375,0.000045812703,0.00018001512],"about_ca_topic_score_codex":0.0000087893795,"about_ca_topic_score_gemma":0.0000032492453,"teacher_disagreement_score":0.247968,"about_ca_system_score_codex":0.000030141864,"about_ca_system_score_gemma":0.000020477724,"threshold_uncertainty_score":0.40185007},"labels":[],"label_agreement":null},{"id":"W1773531050","doi":"10.1142/s0219498814500819","title":"Repeated root constacyclic codes of length mp<sup>s</sup> over 𝔽<sub>p<sup>r</sup></sub> + u𝔽<sub>p<sup>r</sup></sub> + ⋯ + u<sup>e-1</sup>𝔽<sub>p<sup>r</sup></sub>","year":2014,"lang":"en","type":"article","venue":"Journal of Algebra and Its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Physics; Duality (order theory); Mathematics","score_opus":0.009540668583239924,"score_gpt":0.2276470803804855,"score_spread":0.21810641179724558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1773531050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9299207,0.003596725,0.057261445,0.0026648573,0.00030457144,0.002710233,0.00047888682,0.0008567313,0.0022058524],"genre_scores_gemma":[0.9892051,0.0031557546,0.0027722963,0.001678996,0.0018808888,0.00050247816,0.0002361089,0.00041686767,0.00015150094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98136866,0.00205639,0.0059304074,0.0036882185,0.0034604894,0.0034958224],"domain_scores_gemma":[0.9826989,0.0034930645,0.003774223,0.0047265263,0.0026671602,0.002640101],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0053710635,0.002889241,0.0038973207,0.003059549,0.0027361722,0.0016874437,0.0058242907,0.0016403551,0.00024584515],"category_scores_gemma":[0.0011949317,0.0028056349,0.0023719822,0.0057338215,0.0019288118,0.0041530975,0.001817086,0.0037477382,0.00048635795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027725722,0.009735754,0.011862243,0.0022452543,0.0066892244,0.0005141819,0.027648382,0.11130829,0.18222018,0.40224025,0.053570785,0.1891929],"study_design_scores_gemma":[0.018537033,0.0049595446,0.0057688626,0.0030596133,0.0037047944,0.0043357178,0.0055688177,0.5143775,0.2819483,0.07737144,0.07088299,0.009485401],"about_ca_topic_score_codex":0.000062891115,"about_ca_topic_score_gemma":0.000035749305,"teacher_disagreement_score":0.4030692,"about_ca_system_score_codex":0.0005083185,"about_ca_system_score_gemma":0.0011969851,"threshold_uncertainty_score":0.9996557},"labels":[],"label_agreement":null},{"id":"W1786799192","doi":"10.1007/3-540-45325-3_28","title":"Generating Large Instances of the Gong-Harn Cryptosystem","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptosystem; Computer science; Computer security; Cryptography","score_opus":0.01337517671546098,"score_gpt":0.2252701815759936,"score_spread":0.21189500486053262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1786799192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010576465,0.000811321,0.98767614,0.0002785598,0.0021723888,0.00030280088,0.000006661204,0.00010435979,0.007590105],"genre_scores_gemma":[0.853611,0.00006103327,0.14393985,0.0014316821,0.000654146,0.000011021069,0.0000015598936,0.00003732222,0.0002524057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967091,0.00009163357,0.00059277157,0.0010675306,0.0009429462,0.000595999],"domain_scores_gemma":[0.99711037,0.00036636268,0.0004977776,0.0017144636,0.00021809795,0.000092905764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013718522,0.00042761778,0.0004904467,0.00046331808,0.00046461762,0.00033233117,0.004946254,0.0002256869,0.00002142772],"category_scores_gemma":[0.000073142706,0.00030728042,0.00026147853,0.0012025376,0.00060346717,0.00042735777,0.0016715374,0.00066499884,0.000008428035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064282726,0.000044268352,0.00063393905,0.00008949,0.00002322666,0.000030397188,0.0013764229,0.014968137,0.00056840334,0.512058,0.00002307961,0.47017822],"study_design_scores_gemma":[0.00052829774,0.00022416624,0.00027706148,0.0017948777,0.000020967203,0.00012363338,0.0000014352308,0.4061997,0.0045026,0.57382447,0.011374901,0.0011278781],"about_ca_topic_score_codex":0.0000074583995,"about_ca_topic_score_gemma":0.00014601438,"teacher_disagreement_score":0.8525533,"about_ca_system_score_codex":0.00010452807,"about_ca_system_score_gemma":0.00033125488,"threshold_uncertainty_score":0.99993795},"labels":[],"label_agreement":null},{"id":"W1796297130","doi":"10.1007/978-3-540-77224-8_36","title":"Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF(p,2)","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"TRACE (psycholinguistics); Weight distribution; Mathematics; Galois theory; Binary number; Distribution (mathematics); Finite field; Construct (python library); Discrete mathematics; Field (mathematics); Arithmetic; Pure mathematics; Computer science; Mathematical analysis; Physics","score_opus":0.012430558016525216,"score_gpt":0.24924893176911564,"score_spread":0.23681837375259043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1796297130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006763472,0.0009864079,0.98955023,0.0001038847,0.00074375886,0.00021317748,0.00002119715,0.00015420387,0.0014636845],"genre_scores_gemma":[0.778319,0.00012844577,0.22071612,0.0003543037,0.0003871713,0.0000037413863,0.000012533945,0.000024855664,0.000053820662],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969462,0.000052766605,0.0005001667,0.0011313872,0.00085559185,0.00051385467],"domain_scores_gemma":[0.99776757,0.0007043104,0.00031094815,0.00084800745,0.0002074622,0.00016171293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015516803,0.00043947969,0.00049527874,0.00057024165,0.00023969142,0.0002408462,0.0016560904,0.00024508894,0.000013554928],"category_scores_gemma":[0.000042728436,0.00039752517,0.00016144349,0.00068492215,0.0010208088,0.0005046865,0.0007970116,0.0005584435,0.0000034469053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002495139,0.00007728668,0.0007364134,0.00007740851,0.000034867106,0.000051418392,0.0009835091,0.001311632,0.00024373605,0.46775246,0.000019601624,0.5286867],"study_design_scores_gemma":[0.00053201657,0.00033977476,0.00351016,0.0004457752,0.000032613603,0.000119654294,2.7686897e-7,0.11817003,0.0032249906,0.8713817,0.0014154685,0.0008275219],"about_ca_topic_score_codex":0.000008944723,"about_ca_topic_score_gemma":0.000023450288,"teacher_disagreement_score":0.77155554,"about_ca_system_score_codex":0.00009654358,"about_ca_system_score_gemma":0.00020150917,"threshold_uncertainty_score":0.99984765},"labels":[],"label_agreement":null},{"id":"W180019437","doi":"10.1007/1-4020-7987-7_1","title":"Randomness and Discrepancy Transforms","year":2006,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Construct (python library); Algorithm; Binary number; Property (philosophy); Nonlinear system; Computer science; Mathematics; Linear span; Theoretical computer science; Discrete mathematics; Arithmetic; Statistics","score_opus":0.010586050972330854,"score_gpt":0.2051184550469212,"score_spread":0.19453240407459033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W180019437","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011965859,0.0017199578,0.037706323,0.0005724572,0.00081789965,0.0005216,0.000019209087,0.0005906029,0.9579323],"genre_scores_gemma":[0.0181187,0.00011320475,0.001627306,0.001285622,0.0007649513,0.00009829036,0.000051666993,0.00016301926,0.97777724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969496,0.00004877042,0.0006823805,0.001094289,0.0006024157,0.0006225106],"domain_scores_gemma":[0.9982701,0.00017935365,0.0002887635,0.00087682775,0.000091688315,0.00029326664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083733856,0.0006750958,0.0007051491,0.00055810245,0.00025382798,0.0008531809,0.0019586731,0.0011091772,0.000057860583],"category_scores_gemma":[0.00002028375,0.0005883242,0.0003962644,0.000072550705,0.0004188935,0.0015278804,0.00039083263,0.0019220102,0.000019863397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004522828,0.000005410578,0.000013123719,0.000054922286,0.00009037337,0.000019202778,0.00041359288,7.473352e-7,0.000016410277,0.8850625,0.032444764,0.0818337],"study_design_scores_gemma":[0.00094420766,0.00004819165,0.000013258376,0.00015200248,0.000057531586,0.000046379286,0.0000063357766,0.00006342417,0.000028759032,0.49059942,0.5074433,0.00059720373],"about_ca_topic_score_codex":0.000015920476,"about_ca_topic_score_gemma":0.0000056841272,"teacher_disagreement_score":0.47499853,"about_ca_system_score_codex":0.000054013897,"about_ca_system_score_gemma":0.00013137635,"threshold_uncertainty_score":0.9996568},"labels":[],"label_agreement":null},{"id":"W1809690300","doi":"10.1007/s00145-001-0010-y","title":"Almost k -Wise Independent Sample Spaces and Their Cryptologic Applications","year":2001,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet","keywords":"Mathematics; Pseudorandom number generator; Block cipher; Hash function; Discrete mathematics; Random oracle; Key (lock); Decorrelation; Random function; Combinatorics; Random variable; Algorithm; Cryptography; Computer science; Encryption; Public-key cryptography; Statistics","score_opus":0.015516179908635358,"score_gpt":0.2484218251798251,"score_spread":0.23290564527118976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809690300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23876306,0.0009987372,0.75668126,0.0025088107,0.00020570845,0.00007977084,0.0000017555283,0.00003295834,0.0007279339],"genre_scores_gemma":[0.9633657,0.00046496934,0.035483815,0.00052584853,0.00013798576,0.000008506316,4.394501e-7,0.0000060811344,0.000006656837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989152,0.00014832914,0.00036043458,0.00019710418,0.0001328844,0.00024603348],"domain_scores_gemma":[0.99856585,0.00048850966,0.0003514057,0.00030546554,0.0001483583,0.00014038802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005218605,0.0001402243,0.0002978221,0.00027782598,0.00015943071,0.00009701234,0.0007307665,0.00010161149,0.000057318703],"category_scores_gemma":[0.00007501095,0.000101983336,0.000117163705,0.0003813437,0.00016232315,0.00031368772,0.00016735237,0.0002652103,0.000008103592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009902514,0.00017614712,0.019318465,0.000009327375,0.00008066656,0.000054967633,0.0007716298,0.000025151352,0.0017766772,0.8877581,0.00043311444,0.089496754],"study_design_scores_gemma":[0.00055269693,0.0006695686,0.009335397,0.00001587209,0.000019518722,0.0028316805,0.0002412109,0.0003054258,0.0006803899,0.8519635,0.13317814,0.00020657369],"about_ca_topic_score_codex":0.000005214799,"about_ca_topic_score_gemma":0.0000099255585,"teacher_disagreement_score":0.72460264,"about_ca_system_score_codex":0.000015460388,"about_ca_system_score_gemma":0.000052513296,"threshold_uncertainty_score":0.41587597},"labels":[],"label_agreement":null},{"id":"W1824465360","doi":"10.1007/978-3-540-45238-6_16","title":"On Low Complexity Bit Parallel Polynomial Basis Multipliers","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplier (economics); Finite field; Polynomial basis; Mathematics; Irreducible polynomial; Verilog; Basis (linear algebra); Arithmetic; Polynomial; Finite field arithmetic; Discrete mathematics; Algebra over a field; Computer science; Field-programmable gate array; Pure mathematics; Matrix polynomial; Mathematical analysis; Computer hardware","score_opus":0.02197533117921908,"score_gpt":0.23651409616052138,"score_spread":0.2145387649813023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824465360","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002874748,0.00013680827,0.98675543,0.00088932377,0.0025810571,0.00040700444,0.000010743963,0.00025090852,0.008681219],"genre_scores_gemma":[0.2348767,0.000046089364,0.75098574,0.012922597,0.0006445762,0.000024610872,0.000010434178,0.00009035342,0.0003989129],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952839,0.00009997597,0.000548052,0.002057922,0.0010632061,0.00094693014],"domain_scores_gemma":[0.99641144,0.0007949995,0.00030084094,0.002033224,0.00014664575,0.00031282817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010669099,0.0007643595,0.0006660426,0.0012455055,0.0005433265,0.0006143563,0.0042144493,0.00039917202,0.00007707744],"category_scores_gemma":[0.000107839034,0.0007153618,0.000343042,0.0009113739,0.0015783274,0.00042881054,0.00093659485,0.0011393274,0.000111193185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066841734,0.00014557595,0.00005190647,0.000054337634,0.000032543823,0.00013563035,0.00082332385,0.038525254,0.00007500579,0.45509553,0.0005094566,0.5044846],"study_design_scores_gemma":[0.0008034506,0.0004594826,0.00014715217,0.00041375787,0.000012798248,0.00005683649,2.2984263e-7,0.17438716,0.00079407083,0.8181264,0.0034001449,0.0013985238],"about_ca_topic_score_codex":0.0000150548785,"about_ca_topic_score_gemma":0.000036890076,"teacher_disagreement_score":0.5030861,"about_ca_system_score_codex":0.0002719626,"about_ca_system_score_gemma":0.00029786504,"threshold_uncertainty_score":0.9995297},"labels":[],"label_agreement":null},{"id":"W1829033653","doi":"10.22108/ijgt.2015.5813","title":"On group rings and some of their applications to combinatorics and symmetric cryptography","year":2015,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Cryptography; Symmetric-key algorithm; Symmetric group; Combinatorics; Block cipher; Group (periodic table); Cryptanalysis; Representation theory of the symmetric group; Discrete mathematics; Encryption; Public-key cryptography; Computer science; Algorithm; Physics; Computer security","score_opus":0.17841363466608717,"score_gpt":0.4767955956942137,"score_spread":0.29838196102812653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829033653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9178373,0.014640587,0.06297002,0.00023934091,0.0003441856,0.0007063121,0.000019367306,0.00007427422,0.00316859],"genre_scores_gemma":[0.99630827,0.0017094517,0.001554567,0.0003097908,0.000036610803,0.00005445571,0.0000011339486,0.00001723745,0.0000085060165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819154,0.00016785244,0.00046834128,0.00045013445,0.00046339966,0.00025872263],"domain_scores_gemma":[0.99775356,0.00054010964,0.00041674776,0.000604092,0.00025074417,0.00043472805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014938784,0.0002323716,0.00048516033,0.0019751638,0.00019562688,0.0008215001,0.002588957,0.00006958779,0.00003342206],"category_scores_gemma":[0.00011711422,0.00020310392,0.00010707279,0.0036089062,0.00015151402,0.0016349499,0.0013711227,0.00022595185,0.0000023437926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000921516,0.0004417807,0.10956025,0.00007239379,0.00011605757,0.0000035052035,0.00054007437,0.000019769222,0.0051039713,0.8274003,0.0031458968,0.053503796],"study_design_scores_gemma":[0.0005126054,0.00008039829,0.16397603,0.00013802538,0.000025096204,0.0000074411814,0.000056936457,0.00010865803,0.003679338,0.8266799,0.0044294987,0.0003060778],"about_ca_topic_score_codex":0.000067820125,"about_ca_topic_score_gemma":0.0000023824732,"teacher_disagreement_score":0.07847092,"about_ca_system_score_codex":0.000023299215,"about_ca_system_score_gemma":0.00003789429,"threshold_uncertainty_score":0.8282338},"labels":[],"label_agreement":null},{"id":"W1829145527","doi":"10.1109/ccece.2001.933651","title":"A new family of stream ciphers based on cascaded small s-boxes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Stream cipher; Computer science; Cascade; Block cipher; Stream cipher attack; Block size; RC4; Cryptography; Key schedule; S-box; Cipher; Arithmetic; Shift register; Parallel computing; Algorithm; Running key cipher; Transposition cipher; Theoretical computer science; Differential cryptanalysis; Encryption; Mathematics; Key (lock); Computer network; Operating system; Engineering; Telecommunications","score_opus":0.030319546314975142,"score_gpt":0.21202425837848124,"score_spread":0.1817047120635061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829145527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13370043,0.00009215545,0.67279965,0.0009792801,0.0002529995,0.00014716513,0.0000019520655,0.0003540042,0.19167234],"genre_scores_gemma":[0.9556474,0.0000039778297,0.04248543,0.00088045065,0.000023032653,0.000002114031,2.8268872e-7,0.0000048387196,0.00095248653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992723,0.000045599416,0.00013298096,0.00022543776,0.00015614963,0.00016753221],"domain_scores_gemma":[0.9992398,0.00013108924,0.00004484462,0.0004687571,0.00002223069,0.00009330001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001126376,0.000100675534,0.00011425835,0.00012521792,0.000040533043,0.000038842227,0.0005545648,0.000040522722,0.00034093583],"category_scores_gemma":[0.000013127895,0.000083935505,0.0001088637,0.0004468132,0.000026565418,0.00008199458,0.00004822329,0.000067554225,0.000040025916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041988507,0.00036920546,0.0009927689,0.000021682246,0.0000416082,0.00002039149,0.0010544398,0.0012906761,0.0044608777,0.6155168,0.019461924,0.35672766],"study_design_scores_gemma":[0.00755086,0.0052607157,0.02578949,0.00040742647,0.000090248766,0.00001842675,0.0006772817,0.73307836,0.0834678,0.09960618,0.04165876,0.0023944774],"about_ca_topic_score_codex":0.00007915091,"about_ca_topic_score_gemma":0.000014542288,"teacher_disagreement_score":0.821947,"about_ca_system_score_codex":0.0000071538925,"about_ca_system_score_gemma":0.000017616449,"threshold_uncertainty_score":0.37330082},"labels":[],"label_agreement":null},{"id":"W1829320485","doi":"10.1109/sips.2001.957334","title":"Efficient fault-tolerant arithmetic using a symmetrical modulus replication RNS","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Replication (statistics); Fault tolerance; Computer science; Modulus; Sample (material); Parallel computing; Arithmetic; Mathematics; Distributed computing; Physics; Statistics","score_opus":0.041599612315479435,"score_gpt":0.25311000752275215,"score_spread":0.21151039520727272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829320485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16206369,0.00013472594,0.8318696,0.0004566398,0.00018221136,0.00010935244,4.5146513e-7,0.0002560068,0.0049273004],"genre_scores_gemma":[0.94538283,0.0000033365832,0.05413908,0.0002773604,0.000033702505,0.0000069254716,2.4513153e-7,0.0000056175318,0.00015089432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987227,0.00007153313,0.00020143182,0.00049081637,0.00025918987,0.00025436713],"domain_scores_gemma":[0.99872917,0.000079251615,0.00005469341,0.0009772273,0.00005936979,0.00010028428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034621288,0.000109728986,0.000120475095,0.00028398252,0.00016880961,0.00013210217,0.0005481598,0.00004718181,0.00006272938],"category_scores_gemma":[0.000066871726,0.00009437706,0.0001001611,0.0015620011,0.000039183156,0.00008067527,0.00015295236,0.00010146024,0.000083383115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064401365,0.00059761846,0.00022994143,0.0000128236015,0.000025090498,0.000018362416,0.00095881504,0.014241537,0.0023764966,0.7415477,0.00046521006,0.23951997],"study_design_scores_gemma":[0.00015967313,0.00004875024,0.00032569875,0.000008826705,0.000006546245,0.00003624874,0.000011737574,0.9936438,0.0007296216,0.0041598654,0.0007291593,0.00014004193],"about_ca_topic_score_codex":0.000015983507,"about_ca_topic_score_gemma":5.2233815e-7,"teacher_disagreement_score":0.9794023,"about_ca_system_score_codex":0.00003724736,"about_ca_system_score_gemma":0.0000070397,"threshold_uncertainty_score":0.38485846},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017329643431957937,"score_gpt":0.226247697678485,"score_spread":0.20891805424652704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183907894","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007500632,0.0004313949,0.9568595,0.0007482104,0.002730782,0.00022098937,0.0000033248755,0.00029867148,0.038632073],"genre_scores_gemma":[0.38125935,0.0003293777,0.6008119,0.008171309,0.003136281,0.000053418305,0.000020260886,0.00015177147,0.00606633],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666226,0.00003438706,0.00039892824,0.001450617,0.0007983556,0.0006554444],"domain_scores_gemma":[0.99741507,0.00035113894,0.0001759887,0.0016845793,0.00017059167,0.00020262982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007250961,0.00047999778,0.00040079563,0.0010800827,0.00041900633,0.00054428296,0.0032963336,0.00026222513,0.000116879004],"category_scores_gemma":[0.000040454586,0.00044391668,0.0002278003,0.0010599832,0.0006507702,0.00052176166,0.001189247,0.0007858786,0.00018640462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000414733,0.000031555046,0.00004476721,0.000009910434,0.000009651489,0.000055111792,0.0002420626,0.0043559405,0.000055769073,0.15582368,0.000076992415,0.83929044],"study_design_scores_gemma":[0.00026626282,0.00029371624,0.000117221796,0.00028041212,0.000015045812,0.00021722703,2.2240184e-7,0.079077736,0.00031340416,0.858536,0.05990822,0.000974536],"about_ca_topic_score_codex":0.000009908721,"about_ca_topic_score_gemma":0.00004034585,"teacher_disagreement_score":0.8383159,"about_ca_system_score_codex":0.00016694714,"about_ca_system_score_gemma":0.00029660593,"threshold_uncertainty_score":0.9998013},"labels":[],"label_agreement":null},{"id":"W184121975","doi":"","title":"Hamiltonian Circuits in Sparse Circulant Digraphs.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Mathematics; Electronic circuit; Hamiltonian (control theory); Combinatorics; Mathematical optimization; Electrical engineering; Engineering","score_opus":0.013120626392343388,"score_gpt":0.22291582229135112,"score_spread":0.20979519589900775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184121975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98546475,0.00035528353,0.0014940193,0.0009123238,0.0013102455,0.00016810499,0.000001289681,0.00029830524,0.00999567],"genre_scores_gemma":[0.9987721,0.000028861301,0.0006136051,0.00049827277,0.00001258039,0.000018309742,0.0000011205831,0.000011059208,0.000044085275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985101,0.000114971226,0.00026330593,0.00042939934,0.00025385543,0.0004283174],"domain_scores_gemma":[0.99891984,0.00010714773,0.000067156776,0.0007372255,0.000038011785,0.00013058592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004949973,0.00017328202,0.00019873105,0.00030760668,0.00010744775,0.00012648324,0.0010178976,0.00007968858,0.000021936821],"category_scores_gemma":[0.00003557554,0.00018169697,0.0001137983,0.0010500895,0.00005961987,0.00047464008,0.000167505,0.00021678186,0.00013228424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023936589,0.00014379165,0.009843127,0.0000042321913,0.00001021294,0.00003289344,0.00075295876,0.000018269453,0.00038120424,0.9568754,0.00034905906,0.031586453],"study_design_scores_gemma":[0.0011491579,0.000093829316,0.06068232,0.00005023107,0.00000583956,0.000028280005,0.000023087541,0.0017264521,0.0011611946,0.9160126,0.018645063,0.0004219884],"about_ca_topic_score_codex":0.00001658596,"about_ca_topic_score_gemma":0.000033578828,"teacher_disagreement_score":0.050839193,"about_ca_system_score_codex":0.000050586477,"about_ca_system_score_gemma":0.000045025772,"threshold_uncertainty_score":0.7409387},"labels":[],"label_agreement":null},{"id":"W1857920410","doi":"10.1007/978-3-642-32512-0_29","title":"Spectral Norm of Symmetric Functions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Boolean function; Logarithm; Combinatorics; Norm (philosophy); Mathematics; Communication complexity; Discrete mathematics; Fourier transform; Parity (physics); Function (biology); Physics; Mathematical analysis; Quantum mechanics","score_opus":0.016332293128534237,"score_gpt":0.22401183056085874,"score_spread":0.2076795374323245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857920410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021386814,0.0010909082,0.9813323,0.00020056454,0.0021766913,0.00018705668,0.0000053158783,0.0001275354,0.01466578],"genre_scores_gemma":[0.77933896,0.00006578487,0.21918586,0.0003562532,0.0007015899,0.000005926113,0.0000034820632,0.000029944924,0.00031217554],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727666,0.000030272939,0.0004463422,0.0008808965,0.00075186853,0.0006139656],"domain_scores_gemma":[0.99755585,0.00047941506,0.00027840718,0.0013351545,0.00017552126,0.00017565553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077617576,0.00038493596,0.0004479332,0.0019279228,0.00019708865,0.00017143112,0.002750974,0.00022675515,0.00006640654],"category_scores_gemma":[0.000055304743,0.00035252812,0.0002425085,0.0018733528,0.0006958567,0.0005674761,0.00090493594,0.0006330948,0.00005952664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004343049,0.00004073406,0.00013434756,0.000024116825,0.000013015795,0.000011430289,0.00028488747,0.00090414035,0.00012525868,0.3659526,0.000012717575,0.6324924],"study_design_scores_gemma":[0.00033577657,0.00046837586,0.0010816831,0.0003280904,0.000036004178,0.00016649526,2.6925542e-7,0.043034244,0.0032248045,0.9463336,0.003943751,0.0010469184],"about_ca_topic_score_codex":0.000011139662,"about_ca_topic_score_gemma":0.000019546487,"teacher_disagreement_score":0.7791251,"about_ca_system_score_codex":0.00012043063,"about_ca_system_score_gemma":0.0002472592,"threshold_uncertainty_score":0.99989265},"labels":[],"label_agreement":null},{"id":"W1867085471","doi":"10.4153/cmb-2015-050-8","title":"Local Heuristics and an Exact Formula for Abelian Surfaces Over Finite Fields","year":2015,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Simons Foundation","keywords":"Mathematics; Quartic function; Abelian group; Polynomial; Pure mathematics; Symplectic geometry; Finite field; Product (mathematics); Prime (order theory); Class (philosophy); Algebra over a field; Discrete mathematics; Combinatorics; Mathematical analysis; Geometry","score_opus":0.025712254963116802,"score_gpt":0.25366647337671167,"score_spread":0.22795421841359487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1867085471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04232395,0.000089122936,0.94894457,0.0037341712,0.00012210698,0.00023822574,0.000023440554,0.000081520404,0.0044428795],"genre_scores_gemma":[0.9718271,0.000002642634,0.026447957,0.0013350758,0.00004769674,0.000016848891,0.000004240945,0.000012331625,0.000306143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990351,0.000044742326,0.00017490699,0.00025553317,0.0001282015,0.000361505],"domain_scores_gemma":[0.9982746,0.00039478688,0.000032482694,0.00036259304,0.00006470665,0.0008708143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005195087,0.00013320016,0.00016965854,0.00010071075,0.00012091551,0.00018214334,0.0003997149,0.00010114553,0.00025394539],"category_scores_gemma":[0.00029203878,0.00012049798,0.00004796742,0.0001225794,0.000104017185,0.000084060644,0.000053978674,0.00010196709,0.00018122946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013616759,0.000043248667,0.0000672592,0.00006992385,0.00001534619,0.000026590933,0.0010463997,0.000087865694,0.000004070576,0.9681057,0.021091323,0.009428655],"study_design_scores_gemma":[0.00049461477,0.000353797,0.000105295876,0.00004845451,0.000015893078,0.000019483577,0.00015145361,0.099874124,0.000058500147,0.7208444,0.17769425,0.0003397565],"about_ca_topic_score_codex":0.00030444638,"about_ca_topic_score_gemma":0.00091005146,"teacher_disagreement_score":0.9295031,"about_ca_system_score_codex":0.0000321221,"about_ca_system_score_gemma":0.00012084716,"threshold_uncertainty_score":0.4913765},"labels":[],"label_agreement":null},{"id":"W1889319641","doi":"10.1109/pacrim.2001.953712","title":"A high-speed baseband transceiver for wireless communications using QAM","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Baseband; Transceiver; Quadrature amplitude modulation; Wireless; Computer science; QAM; Electronic engineering; Electrical engineering; Telecommunications; Bandwidth (computing); Engineering; Bit error rate; Channel (broadcasting)","score_opus":0.06796149294477334,"score_gpt":0.26414185266375256,"score_spread":0.19618035971897924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1889319641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05372167,0.000111994275,0.94084907,0.0017854498,0.00011646328,0.00018020341,0.0000051404772,0.00018257432,0.003047434],"genre_scores_gemma":[0.8969667,0.00001859065,0.102426566,0.00032706058,0.000019968358,0.000006917225,0.0000013172025,0.0000052027694,0.00022766869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942154,0.000049757426,0.00011897216,0.00017185527,0.00007740538,0.00016047263],"domain_scores_gemma":[0.99890345,0.0001697057,0.000029645604,0.00080074224,0.00004599702,0.00005045768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001552424,0.00007821568,0.00009564665,0.000078459394,0.00027388267,0.000088990644,0.00094459316,0.000032267486,0.00012324456],"category_scores_gemma":[0.000004561851,0.00007199136,0.00009612625,0.00030490896,0.00007078963,0.0002576002,0.000063244304,0.000057135367,0.000014167374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052264004,0.00012592059,0.000042620468,0.000007882351,0.000020617745,6.306585e-7,0.000769252,0.000052918793,0.006087092,0.96876824,0.000858447,0.023261173],"study_design_scores_gemma":[0.001108906,0.00010949988,0.0001511446,0.00003017036,0.00003055632,0.0000107931655,0.000055004268,0.9451884,0.006628448,0.031229418,0.015112848,0.0003447967],"about_ca_topic_score_codex":0.000020340623,"about_ca_topic_score_gemma":0.000012774581,"teacher_disagreement_score":0.9451355,"about_ca_system_score_codex":0.000009771024,"about_ca_system_score_gemma":0.000006265086,"threshold_uncertainty_score":0.29357225},"labels":[],"label_agreement":null},{"id":"W1898554878","doi":"10.1109/acssc.1988.754650","title":"RAM-JET: Towards The Removal Of Multiplicative Compleidty In Digital Signal Processingvlst Arclutectures","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Overhead (engineering); Adder; Digital signal processing; Pipeline (software); Very-large-scale integration; Parallel computing; Multiplication (music); Systolic array; Dot product; Binary number; Throughput; Computer hardware; Algorithm; Arithmetic; Embedded system; Mathematics; Latency (audio)","score_opus":0.021511491139839346,"score_gpt":0.2517597325450082,"score_spread":0.23024824140516886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1898554878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26128152,0.00026847576,0.6995096,0.002447944,0.000045961482,0.000268594,0.000006733342,0.00016208523,0.03600906],"genre_scores_gemma":[0.980174,0.0000017384907,0.01940616,0.0002824117,0.000043225777,0.000009420499,8.7548506e-7,0.0000044903513,0.000077690485],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990657,0.00004067362,0.00022273776,0.00025761293,0.00021271668,0.00020055269],"domain_scores_gemma":[0.9992844,0.00016537335,0.000085759995,0.000354375,0.00007037099,0.000039718707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029369007,0.00012228666,0.00014733375,0.0000955503,0.00008783256,0.00012390947,0.0009856472,0.00003554763,0.000027867678],"category_scores_gemma":[0.000039825976,0.00007344383,0.00008748968,0.0005550848,0.0001868424,0.00037799883,0.00023117023,0.00014155387,0.000008318673],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004304468,0.0002058465,0.0009515645,0.000010882521,0.00001584368,0.0000090853755,0.0037293294,0.00055730896,0.000959413,0.18528083,0.00014430414,0.80809253],"study_design_scores_gemma":[0.00318124,0.0006184968,0.07462195,0.00022108055,0.000022643691,0.00055076205,0.0011141946,0.35439798,0.066813834,0.43522173,0.061805654,0.0014304488],"about_ca_topic_score_codex":0.000019105311,"about_ca_topic_score_gemma":0.00004264606,"teacher_disagreement_score":0.8066621,"about_ca_system_score_codex":0.000016003467,"about_ca_system_score_gemma":0.000050613482,"threshold_uncertainty_score":0.29949525},"labels":[],"label_agreement":null},{"id":"W1901358321","doi":"10.3968/3904","title":"The Dual Space χ2 of Double Sequences","year":2013,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dual (grammatical number); Space (punctuation); Mathematics; Computer science; Linguistics; Philosophy","score_opus":0.07864559716688914,"score_gpt":0.34565065049331106,"score_spread":0.26700505332642194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901358321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8300539,0.004316847,0.023741782,0.018750021,0.0010350733,0.000824165,6.158925e-7,0.00017550008,0.12110204],"genre_scores_gemma":[0.9825528,0.00012604697,0.017095068,0.00004223879,0.00001841879,0.00004536748,9.870656e-9,0.0000013969084,0.00011863124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988024,0.0000731796,0.00025358808,0.00021474516,0.00037115652,0.00028490525],"domain_scores_gemma":[0.9982525,0.0013145157,0.00008081328,0.00025294116,0.00006589276,0.00003331956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017329899,0.000087584376,0.00017219795,0.00006037935,0.00039091124,0.00012800311,0.0010221173,0.00001883073,0.000022088772],"category_scores_gemma":[0.0002635872,0.00004380779,0.0000518261,0.00091693527,0.002391081,0.00035114028,0.00042178872,0.000069277194,0.000042195035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011765293,0.000022269276,0.00026692235,0.000018256358,0.000010658701,8.560503e-7,0.0021258537,0.000010352735,0.000081295024,0.99509084,0.0002523954,0.0021191258],"study_design_scores_gemma":[0.00008210849,0.00008483856,0.00025407455,0.000060148213,0.0000022454192,0.0000044959284,0.0037001944,0.0015651239,0.0006842301,0.9933298,0.00015924878,0.0000734483],"about_ca_topic_score_codex":0.000014729274,"about_ca_topic_score_gemma":0.000013654086,"teacher_disagreement_score":0.15249887,"about_ca_system_score_codex":0.00001013258,"about_ca_system_score_gemma":0.000025562847,"threshold_uncertainty_score":0.8810038},"labels":[],"label_agreement":null},{"id":"W1913698319","doi":"10.1109/icc.1988.13653","title":"Minimal complexity design of analytically described trellis codes","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Trellis (graph); Convolutional code; Space–time trellis code; Encoder; Algorithm; Computer science; Trellis modulation; Discrete mathematics; Mathematics; Block code; Theoretical computer science; Decoding methods; Linear code; Fading","score_opus":0.07646655268665453,"score_gpt":0.25999145298922127,"score_spread":0.18352490030256674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913698319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011626376,0.000030851956,0.9676395,0.00009371404,0.000051652867,0.00007481953,0.0000010768246,0.00009080654,0.02039117],"genre_scores_gemma":[0.66860956,0.0000028790337,0.3311877,0.000099910394,0.0000037692528,0.000001727983,2.373547e-7,0.0000025223014,0.00009174144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998972,0.0002309182,0.00020731059,0.0002274391,0.0001639261,0.00019841903],"domain_scores_gemma":[0.9991229,0.00027231267,0.000050638497,0.00040060616,0.000072929615,0.00008058632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060251955,0.00009849013,0.000174024,0.000102913866,0.000064356216,0.000048516817,0.000511182,0.0000356059,0.00019374533],"category_scores_gemma":[0.00007465275,0.000082918166,0.00009766926,0.000527304,0.00016994857,0.00014946787,0.000051704803,0.000057303394,0.00001658986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015614276,0.00009381917,0.00047770631,0.0000044141243,0.000019738032,0.000002781568,0.00013418533,0.000048742164,0.0018318702,0.9956062,0.00040086516,0.0013640639],"study_design_scores_gemma":[0.0008633136,0.00072916265,0.0036604651,0.000026482267,0.00004065039,0.00002742471,0.00011551709,0.068743005,0.07590965,0.84700125,0.0023755762,0.00050747866],"about_ca_topic_score_codex":0.000007255634,"about_ca_topic_score_gemma":0.0000037358482,"teacher_disagreement_score":0.65698314,"about_ca_system_score_codex":0.000006949585,"about_ca_system_score_gemma":0.000041930714,"threshold_uncertainty_score":0.33813044},"labels":[],"label_agreement":null},{"id":"W191626242","doi":"","title":"Some nonexistence results for 7-dimensional ternary linear codes.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ternary operation; Computer science; Programming language","score_opus":0.020473297060375723,"score_gpt":0.2560432509599951,"score_spread":0.23556995389961935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191626242","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9559164,0.0009937568,0.019916011,0.0043385336,0.0105650285,0.00083906227,0.000045689332,0.0010337668,0.0063517652],"genre_scores_gemma":[0.9843381,0.00003338778,0.0143916905,0.00064588786,0.00006161191,0.000033973894,0.00001163655,0.000013083023,0.00047064366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986077,0.00005922587,0.00026628183,0.0004620434,0.00025609665,0.00034863147],"domain_scores_gemma":[0.99864924,0.0003602765,0.000099651195,0.00065945357,0.00010476082,0.0001266363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005679076,0.00016046128,0.0001779917,0.0001069439,0.00024111214,0.000072146984,0.00091315137,0.000074730466,0.000003910413],"category_scores_gemma":[0.00008589634,0.00015539335,0.00013772816,0.00036830571,0.000074140145,0.00038998568,0.00023368158,0.00012993038,0.000059039066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013738948,0.00013660047,0.0002692327,0.0000053885424,0.00001834311,0.000033648532,0.00013235935,0.00003836439,0.0003803359,0.9935541,0.0034880533,0.0018061675],"study_design_scores_gemma":[0.0016134657,0.0003283276,0.0008089949,0.000034495297,0.000007664959,0.000028280752,0.0000068150653,0.0147868665,0.0009345803,0.9620899,0.019106735,0.0002539012],"about_ca_topic_score_codex":0.0000088622855,"about_ca_topic_score_gemma":9.735226e-7,"teacher_disagreement_score":0.031464245,"about_ca_system_score_codex":0.000024642351,"about_ca_system_score_gemma":0.000049672428,"threshold_uncertainty_score":0.6336757},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023956393014792098,"score_gpt":0.2305802921217088,"score_spread":0.2066238991069167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191763761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62789994,0.000099051606,0.36929953,0.001117659,0.00007426198,0.000062665364,0.000008055204,0.000013462762,0.0014253629],"genre_scores_gemma":[0.98767924,0.00003260603,0.012105865,0.00010244048,0.00002735589,0.0000010988635,1.3469499e-7,0.000003958873,0.000047301626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990802,0.00008180596,0.0003696741,0.000057727528,0.00029677997,0.00011384053],"domain_scores_gemma":[0.99895155,0.0004389214,0.00018592658,0.0002841892,0.00009128895,0.000048133785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000561579,0.00007748985,0.00016335238,0.00004941759,0.00009167333,0.000052251155,0.00065226975,0.00002349174,0.00008601113],"category_scores_gemma":[0.00016191798,0.000041449268,0.0001033359,0.00016803882,0.00012436665,0.000077581666,0.00003460895,0.00015700678,0.000018607065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012508504,0.00030159258,0.000014926928,0.000025917187,0.000030906078,0.000006336403,0.00079687126,0.000047466896,0.00046796544,0.99129665,0.00060800964,0.006390861],"study_design_scores_gemma":[0.00039052876,0.00060584076,0.00028528416,0.000520125,0.00005756986,0.00021482349,0.00053258124,0.010052715,0.009559947,0.9757604,0.0018455506,0.00017465229],"about_ca_topic_score_codex":8.045373e-7,"about_ca_topic_score_gemma":4.7117743e-7,"teacher_disagreement_score":0.3597793,"about_ca_system_score_codex":0.000009574422,"about_ca_system_score_gemma":0.000031087526,"threshold_uncertainty_score":0.16902521},"labels":[],"label_agreement":null},{"id":"W1917709139","doi":"10.48550/arxiv.1409.6961","title":"On the number of $N$-free elements with prescribed trace","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"TRACE (psycholinguistics); Mersenne prime; Combinatorics; Zero (linguistics); Mathematics; Order (exchange); Multiplicative function; Finite field; Integer (computer science); Prime (order theory); Discrete mathematics; Mathematical analysis","score_opus":0.04167147445291828,"score_gpt":0.17789897464457327,"score_spread":0.136227500191655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917709139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6140787,0.000007803315,0.3730956,0.00015000605,0.00017079987,0.00023178461,0.000009390059,0.00010176474,0.012154161],"genre_scores_gemma":[0.99808353,0.000011090502,0.0012059587,0.000111614645,0.00002197885,0.000001267991,0.0000017372985,0.000010837592,0.00055196637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859154,0.00024802083,0.0001506855,0.0006434359,0.0001342259,0.00023206716],"domain_scores_gemma":[0.9969969,0.00029854703,0.00027367985,0.0022544507,0.000104157174,0.00007230298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042189116,0.00023244253,0.00023240208,0.00010701901,0.00012274184,0.000059579877,0.0032970489,0.00011532826,0.000096177486],"category_scores_gemma":[0.000038029015,0.00017627465,0.00017612874,0.00043147558,0.00016358357,0.00012153794,0.0013734251,0.00040345165,0.000034527155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096388714,0.00010085209,0.0024938064,0.000032766722,0.00011361868,0.000021803957,0.00020345887,0.009328518,0.000011349656,0.98670125,0.00063185097,0.00026435874],"study_design_scores_gemma":[0.001016415,0.00021130157,0.0021009683,0.00028268862,0.00011516658,0.0000038797652,0.000059177775,0.06610702,0.0006467664,0.9276631,0.0012719719,0.00052158046],"about_ca_topic_score_codex":0.000027636386,"about_ca_topic_score_gemma":0.000011812925,"teacher_disagreement_score":0.38400483,"about_ca_system_score_codex":0.000029924078,"about_ca_system_score_gemma":0.000058044385,"threshold_uncertainty_score":0.7188272},"labels":[],"label_agreement":null},{"id":"W1941622581","doi":"10.1007/978-3-642-30615-0_1","title":"Odd Perfect Sequences and Sets of Spreading Sequences with Zero or Low Odd Periodic Correlation Zone","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interleaving; Generalization; Periodic sequence; Sequence (biology); Mathematics; Zero (linguistics); Correlation; Property (philosophy); Periodic function; Combinatorics; Discrete mathematics; Algorithm; Computer science; Mathematical analysis; Geometry","score_opus":0.01571456617777861,"score_gpt":0.23252073574837176,"score_spread":0.21680616957059315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1941622581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011298308,0.0013567376,0.98524004,0.00014229178,0.00073497614,0.00034622863,0.000006058772,0.000117277355,0.0007581002],"genre_scores_gemma":[0.8668235,0.000116654,0.1326534,0.0001969751,0.000118037686,0.000006823181,0.000002905996,0.000019900523,0.000061819155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968355,0.00008450414,0.0004610412,0.0011639636,0.0008564979,0.0005985018],"domain_scores_gemma":[0.9975574,0.00077502587,0.0004455974,0.0008377772,0.00019240519,0.00019180814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012239176,0.0005287918,0.00060205127,0.0008238862,0.00038936033,0.0004230132,0.0017186948,0.00026228375,0.00003565338],"category_scores_gemma":[0.00005710021,0.0003810023,0.000099995894,0.00088137627,0.001960903,0.001163532,0.0005906627,0.00058790325,0.000007227061],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008639638,0.000049737348,0.0029623336,0.0002513226,0.000046261346,0.00009893794,0.0064474274,0.010110258,0.0009293556,0.04951605,0.000005246932,0.92949665],"study_design_scores_gemma":[0.0017594199,0.004548928,0.00417512,0.008549935,0.00019258626,0.0023242026,0.0000113434535,0.5866137,0.011385689,0.3751355,0.0010024019,0.004301122],"about_ca_topic_score_codex":0.000039886392,"about_ca_topic_score_gemma":0.00009223717,"teacher_disagreement_score":0.9251956,"about_ca_system_score_codex":0.00009962981,"about_ca_system_score_gemma":0.00044656981,"threshold_uncertainty_score":0.99986416},"labels":[],"label_agreement":null},{"id":"W195192778","doi":"","title":"Equivalence Classes of Subsets of a Finite Field.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Equivalence (formal languages); Finite field; Pure mathematics; Discrete mathematics","score_opus":0.02134140187472002,"score_gpt":0.23663842764748919,"score_spread":0.21529702577276916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195192778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97834593,0.00070380146,0.007469962,0.0003552795,0.0012266437,0.000101850215,0.0000025429094,0.00009616187,0.011697825],"genre_scores_gemma":[0.9985134,0.00007177855,0.0012753885,0.00007342686,0.0000025480206,0.000003317858,2.0723758e-7,0.0000037198956,0.000056184723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918413,0.00006465792,0.00021877345,0.00017782458,0.00019579173,0.0001588403],"domain_scores_gemma":[0.9987127,0.00050536223,0.00012572245,0.00052895944,0.00008231214,0.00004492273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019295397,0.000085770705,0.00016614812,0.00010384483,0.000039013285,0.000016565473,0.0007736834,0.000049722777,0.000089401176],"category_scores_gemma":[0.00012031256,0.00008443034,0.00009686056,0.00054138416,0.000066384455,0.00020248488,0.00016406787,0.00008420684,0.000015430622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005460764,0.00013207832,0.0031005256,0.000026924214,0.000013518362,0.0000039196525,0.0004600694,0.000004575821,0.0010083988,0.9871489,0.0009197175,0.0071759433],"study_design_scores_gemma":[0.0004995056,0.0004657396,0.0019418626,0.00008519697,0.000010307929,0.0000037418351,0.000021727114,0.003368751,0.03855425,0.9537237,0.0011540384,0.00017117718],"about_ca_topic_score_codex":0.0000068208947,"about_ca_topic_score_gemma":6.3271705e-7,"teacher_disagreement_score":0.037545852,"about_ca_system_score_codex":0.0000045447223,"about_ca_system_score_gemma":0.000010545036,"threshold_uncertainty_score":0.34429693},"labels":[],"label_agreement":null},{"id":"W195230590","doi":"","title":"Some Nonbinary Power Residue Codes.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Residue (chemistry); Biology","score_opus":0.007390091069230929,"score_gpt":0.2177016479665731,"score_spread":0.21031155689734216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195230590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.960986,0.0007762548,0.00026663704,0.0009850283,0.0021768506,0.0001576792,0.000002503798,0.0005964359,0.034052595],"genre_scores_gemma":[0.9974841,0.000064497704,0.00090235565,0.0006707187,0.000014497665,0.000012228955,0.0000017135615,0.000012971561,0.000836935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869037,0.000112139205,0.0001900647,0.0003976318,0.0002544232,0.00035538923],"domain_scores_gemma":[0.9988091,0.00011040257,0.000041569838,0.00086845027,0.000039204115,0.00013129532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034534308,0.0001654669,0.00017389577,0.00010617237,0.00021713802,0.00013496727,0.0011046384,0.000080871985,0.00035864077],"category_scores_gemma":[0.000013675533,0.0001652605,0.000115168026,0.00053457,0.000081288876,0.0006229015,0.00015018228,0.00018598312,0.00061873253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018220499,0.00011886137,0.00043850794,0.0000026866242,0.000015351938,0.00004519009,0.00028713132,0.0000049780388,0.00012781186,0.98671603,0.0056921034,0.006533134],"study_design_scores_gemma":[0.00048011064,0.00021000682,0.004121028,0.000017876155,0.0000048507814,0.000017504406,0.000006599489,0.00019707244,0.00079797144,0.9759881,0.017917156,0.00024171291],"about_ca_topic_score_codex":0.00001480966,"about_ca_topic_score_gemma":9.0770624e-7,"teacher_disagreement_score":0.036498066,"about_ca_system_score_codex":0.000023882805,"about_ca_system_score_gemma":0.00004063332,"threshold_uncertainty_score":0.7952761},"labels":[],"label_agreement":null},{"id":"W1952935518","doi":"10.1109/ccece.2000.849714","title":"A comparison of binary quasi-cyclic decoder implementations","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Decoding methods; Computer science; Binary number; Implementation; Software implementation; Binary code; Parallel computing; Algorithm; Software; Theoretical computer science; Arithmetic; Mathematics; Programming language","score_opus":0.0691039774980396,"score_gpt":0.34691746281167474,"score_spread":0.27781348531363514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952935518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2798073,0.00020463232,0.6988045,0.0009291967,0.00015698308,0.00011111883,0.0000020720202,0.0001880015,0.01979623],"genre_scores_gemma":[0.97121346,0.0000056370973,0.02846212,0.00014405658,0.000008830054,0.000006286847,7.484557e-7,0.0000024472997,0.00015643136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993797,0.000042902197,0.00019801731,0.00014027512,0.00011119565,0.00012794038],"domain_scores_gemma":[0.9994796,0.00009631344,0.000055691427,0.00030271575,0.000025376285,0.000040302064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010342309,0.0000583576,0.000101576465,0.000114459835,0.0000839091,0.000028278713,0.00038106536,0.000017027502,0.0007585788],"category_scores_gemma":[0.000006536982,0.00005242192,0.0000664721,0.00041590616,0.000031117455,0.00018357902,0.0000924024,0.000041616528,0.000056372493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029821783,0.0006940355,0.025908051,0.0000102598215,0.000029719393,0.0000014921599,0.003529391,0.000038606267,0.0035848857,0.89944935,0.014531182,0.052220035],"study_design_scores_gemma":[0.0028362342,0.0028151139,0.07363247,0.00006869667,0.000078034056,0.000030093077,0.0032116324,0.6633783,0.04366226,0.15053888,0.058399558,0.0013487375],"about_ca_topic_score_codex":0.000010647478,"about_ca_topic_score_gemma":0.000015452997,"teacher_disagreement_score":0.7489105,"about_ca_system_score_codex":0.0000046140876,"about_ca_system_score_gemma":0.000004063097,"threshold_uncertainty_score":0.83059067},"labels":[],"label_agreement":null},{"id":"W1954084529","doi":"10.1109/isit.2015.7282495","title":"A modified KZ reduction algorithm","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reduction (mathematics); Computer science; Matrix (chemical analysis); Algorithm; Cryptography; Zhàng; Basis (linear algebra); Mathematics; Materials science","score_opus":0.038154335452357725,"score_gpt":0.24811471898646761,"score_spread":0.2099603835341099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1954084529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044267597,0.000028146706,0.953851,0.00046224424,0.00050014927,0.00003667766,1.4861448e-7,0.00029720005,0.04039771],"genre_scores_gemma":[0.76194596,0.0000020160114,0.23640835,0.00016031248,0.00012324468,0.000007388024,6.5457266e-7,0.0000034582304,0.001348623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995204,0.000033777476,0.00006500737,0.0001561946,0.00011798528,0.00010662837],"domain_scores_gemma":[0.99956626,0.0000085065685,0.00001678719,0.00027683633,0.000046113895,0.00008549433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025928998,0.00004823462,0.000046819507,0.00006567881,0.000040304218,0.00006830398,0.00030398535,0.000022749078,0.000008815284],"category_scores_gemma":[0.000008010312,0.00004097627,0.000033061482,0.0003009577,0.000019568768,0.00027914753,0.00007829234,0.0000428938,0.00006944168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028792042,0.000027168091,0.0000040974123,5.532627e-7,0.000004627762,0.0000020746725,0.0004403993,0.000053964897,0.00013017555,0.70569056,0.0039100186,0.2897335],"study_design_scores_gemma":[0.0005228393,0.0001846263,0.00007621709,0.000005450254,0.000004454754,0.00008550318,0.00018582349,0.1685848,0.0038542538,0.80738044,0.018868443,0.00024716722],"about_ca_topic_score_codex":0.000012060372,"about_ca_topic_score_gemma":3.4681946e-7,"teacher_disagreement_score":0.7575192,"about_ca_system_score_codex":0.000009975589,"about_ca_system_score_gemma":0.000023011704,"threshold_uncertainty_score":0.16709638},"labels":[],"label_agreement":null},{"id":"W1957179350","doi":"10.1109/ismvl.1993.289552","title":"Current-mode CMOS Galois field circuits","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Electronic circuit; Galois theory; CMOS; Field (mathematics); Computer science; Class (philosophy); Mode (computer interface); Mathematics; Electronic engineering; Electrical engineering; Discrete mathematics; Pure mathematics; Engineering; Artificial intelligence","score_opus":0.025878167016577216,"score_gpt":0.2523016721746787,"score_spread":0.22642350515810147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1957179350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013489619,0.0005837115,0.86793387,0.0014092618,0.00082103093,0.00008345408,6.7159243e-7,0.00049454905,0.11518385],"genre_scores_gemma":[0.997046,0.00004885571,0.0015192742,0.00082826003,0.00006942726,0.000006100174,2.2087345e-7,0.0000033936712,0.00047844503],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929845,0.0000306661,0.00010171122,0.00023466666,0.00013425255,0.00020024877],"domain_scores_gemma":[0.99934787,0.00009410559,0.000022549759,0.0004385665,0.000023443064,0.000073481584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085525055,0.000082246734,0.00007432771,0.000078045174,0.000090929956,0.000097138596,0.00065272476,0.000030043955,0.0007813099],"category_scores_gemma":[0.000021685226,0.00007282258,0.000080045415,0.0003417061,0.00001552816,0.00026479375,0.000109699926,0.00010611017,0.00040010066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.424524e-7,0.00006102747,0.0006845008,0.000005038158,0.000005003347,0.0000029577757,0.0003701161,0.0000022238673,0.00015996183,0.4585613,0.019522255,0.5206252],"study_design_scores_gemma":[0.0012032178,0.0005056354,0.002475716,0.00011243854,0.000023502724,0.00006518093,0.00005196547,0.10452976,0.017511327,0.3512105,0.5209036,0.0014071638],"about_ca_topic_score_codex":0.000006642469,"about_ca_topic_score_gemma":0.000004131208,"teacher_disagreement_score":0.9835564,"about_ca_system_score_codex":0.0000054371703,"about_ca_system_score_gemma":0.000004261752,"threshold_uncertainty_score":0.85547954},"labels":[],"label_agreement":null},{"id":"W1964452015","doi":"10.1016/j.jsc.2015.03.001","title":"A simple and fast online power series multiplication and its analysis","year":2015,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Multiplication (music); Mathematics; Multiplication algorithm; Simple (philosophy); Arithmetic; Field (mathematics); Series (stratigraphy); Constant (computer programming); Power analysis; Algorithm; Computer science; Combinatorics; Pure mathematics; Cryptography","score_opus":0.020161471587159207,"score_gpt":0.2764404523851909,"score_spread":0.2562789807980317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964452015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6880744,0.00028096905,0.31107992,0.00043049955,0.000049703653,0.000031789517,0.0000013469158,0.000014761671,0.000036576694],"genre_scores_gemma":[0.99155146,0.00002768442,0.008299585,0.00006583305,0.000042082604,5.13076e-7,0.0000023525586,0.000002765922,0.000007721301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993192,0.00006785106,0.00024548394,0.00011438668,0.00017494628,0.00007812332],"domain_scores_gemma":[0.99919933,0.00006225751,0.00023739539,0.000078904086,0.00030466085,0.00011744998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000385444,0.00007102099,0.00016950748,0.00034982656,0.00005678301,0.000107387554,0.00012860303,0.000027007669,0.0000012489178],"category_scores_gemma":[0.00004842841,0.00006181513,0.000051533356,0.0006240651,0.00002306238,0.00059244025,0.00006617398,0.00007456234,6.7222203e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006019333,0.0009871286,0.098132424,0.00011890087,0.0024396616,0.00008433811,0.08517985,0.052052308,0.008506099,0.23574045,0.0013200843,0.5148368],"study_design_scores_gemma":[0.0016706933,0.00090255175,0.38215703,0.000039369792,0.0003055054,0.00042201488,0.0018508594,0.5120813,0.00035378878,0.09876828,0.0011201291,0.00032848032],"about_ca_topic_score_codex":0.000003120032,"about_ca_topic_score_gemma":0.000005420907,"teacher_disagreement_score":0.5145083,"about_ca_system_score_codex":0.000012826002,"about_ca_system_score_gemma":0.000028445967,"threshold_uncertainty_score":0.2520748},"labels":[],"label_agreement":null},{"id":"W1964481900","doi":"10.1016/j.ic.2006.01.004","title":"Aperiodic propagation criteria for Boolean functions","year":2006,"lang":"en","type":"article","venue":"Information and Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Aperiodic graph; Computer science; Boolean function; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.011230163330921864,"score_gpt":0.24283167020348362,"score_spread":0.23160150687256176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964481900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029927058,0.000015008837,0.9671438,0.00045292673,0.0002112346,0.00021120723,0.0000050436315,0.00015741652,0.0018763065],"genre_scores_gemma":[0.97861797,0.000001081741,0.020834079,0.00029032107,0.000049331542,0.000042418476,0.00013110467,0.000002017357,0.00003169432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995262,0.000018150831,0.00020171294,0.000081009326,0.00008576674,0.00008712962],"domain_scores_gemma":[0.9996704,0.000033955814,0.00008784672,0.00007427566,0.00011022568,0.000023311995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017314477,0.00006309658,0.0000525738,0.00014396237,0.0002455474,0.00035536438,0.000074505435,0.000028626342,0.0000039099546],"category_scores_gemma":[0.000009995328,0.00006234157,0.000030701944,0.00019204617,0.000020120518,0.001678226,0.000020861857,0.000028392942,0.0000191086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023849741,0.00002904018,0.00014277027,0.000051253886,0.0000062622144,1.0555578e-7,0.00088428723,0.0017626712,0.00026685218,0.5119044,0.0045233495,0.48040515],"study_design_scores_gemma":[0.000764064,0.00016543425,0.009868255,0.000016036633,0.0000087077615,0.000013763913,0.0001585098,0.83968323,0.00029714752,0.10130831,0.047517072,0.00019946911],"about_ca_topic_score_codex":0.0000071054837,"about_ca_topic_score_gemma":0.0000020334385,"teacher_disagreement_score":0.9486909,"about_ca_system_score_codex":0.000011020619,"about_ca_system_score_gemma":0.00001727503,"threshold_uncertainty_score":0.3426787},"labels":[],"label_agreement":null},{"id":"W1965279733","doi":"10.3934/amc.2007.1.307","title":"The asymptotic behavior of N-adic complexity","year":2007,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; National Science Foundation","keywords":"Mathematics; Stream cipher; Sequence (biology); Ternary operation; Shift register; Set (abstract data type); Interval (graph theory); Binary number; Pseudorandom binary sequence; Linear feedback shift register; Discrete mathematics; Carry (investment); Arithmetic; Combinatorics; Algorithm; Cryptography; Computer science","score_opus":0.039815873919961234,"score_gpt":0.34066048356685463,"score_spread":0.3008446096468934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965279733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06361873,0.009211714,0.88467485,0.00060116436,0.00016014812,0.0004985247,0.0000068515183,0.0000765464,0.04115149],"genre_scores_gemma":[0.7614536,0.00069797167,0.2378149,0.000007219048,0.0000019518855,0.00001212176,7.8711895e-7,0.000002878391,0.000008538453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999118,0.000068373236,0.00045724373,0.00007243329,0.0001548655,0.00012910512],"domain_scores_gemma":[0.9956398,0.0019054761,0.0002712218,0.0020704125,0.00009051174,0.000022549462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013082084,0.00006338035,0.00014037485,0.00009695973,0.00014897838,0.000013459237,0.0028008774,0.000021732494,0.0000025588222],"category_scores_gemma":[0.00012554697,0.00004993844,0.00006292333,0.000525496,0.00063556625,0.00022487144,0.000426264,0.00011569821,0.0000018572306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014589688,0.00022773376,0.00091867335,0.000020497879,0.0000038800154,1.0199225e-7,0.0007490092,0.000010816977,0.00018068848,0.98154545,0.0000020169077,0.016339663],"study_design_scores_gemma":[0.00012142511,0.000042618238,0.0032329354,0.000082788,0.000009664539,0.000003466367,0.00039258218,0.002486751,0.0015196209,0.99008137,0.0019532198,0.00007353651],"about_ca_topic_score_codex":0.0000037103034,"about_ca_topic_score_gemma":0.00018017321,"teacher_disagreement_score":0.6978349,"about_ca_system_score_codex":0.000010293538,"about_ca_system_score_gemma":0.0000168466,"threshold_uncertainty_score":0.5204774},"labels":[],"label_agreement":null},{"id":"W1965958808","doi":"10.1007/s10623-004-4037-6","title":"Near-Extremal Formally Self-Dual Even Codes of Lengths 24 and 32","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Academy of Finland","keywords":"Dual (grammatical number); Circulant matrix; Code (set theory); Mathematics; Minimum weight; Combinatorics; Extremal length; Discrete mathematics; Computer science; Geometry","score_opus":0.016447524583158974,"score_gpt":0.22581679748399616,"score_spread":0.20936927290083718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965958808","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7280128,0.0030371414,0.26530477,0.00042816234,0.00010694091,0.00031985535,0.000023857368,0.00037167064,0.0023947856],"genre_scores_gemma":[0.85691863,0.00046343694,0.14227614,0.00023230026,0.000063126165,0.000017228576,0.00000310931,0.000014979706,0.0000110428755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818397,0.00015153555,0.00039189457,0.0005094231,0.0003055272,0.00045764016],"domain_scores_gemma":[0.9988039,0.0002614576,0.0001543613,0.00046716246,0.000102122765,0.00021097682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065118325,0.00030257087,0.0003780672,0.0003280143,0.00037373646,0.00029121534,0.00046241377,0.0001276194,0.000020723766],"category_scores_gemma":[0.0000144128135,0.0002749689,0.00019876662,0.00075846975,0.00034370733,0.000695649,0.00023270577,0.00019019398,0.0000035278476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016521174,0.00046968233,0.020574795,0.00016416669,0.0003575125,0.000019192781,0.006386811,0.00013943887,0.004379246,0.81671894,0.0012247514,0.14940025],"study_design_scores_gemma":[0.012126332,0.008562685,0.10206911,0.0008760547,0.0010057738,0.0011339646,0.002835291,0.24875088,0.02732216,0.34920153,0.23943079,0.0066854507],"about_ca_topic_score_codex":0.000014179084,"about_ca_topic_score_gemma":0.000016240681,"teacher_disagreement_score":0.4675174,"about_ca_system_score_codex":0.000006525927,"about_ca_system_score_gemma":0.00004623744,"threshold_uncertainty_score":0.99997026},"labels":[],"label_agreement":null},{"id":"W1966045745","doi":"10.1016/j.tcs.2005.11.044","title":"On linear complexity of sequences over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mtext>GF</mml:mtext><mml:mo stretchy=\"false\">(</mml:mo><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo stretchy=\"false\">)</mml:mo></mml:math>","year":2006,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Concordia University","funders":"","keywords":"Scroll; Mathematics; Algorithm; Computer science; Theology; Philosophy","score_opus":0.019594513761659143,"score_gpt":0.24566742363757352,"score_spread":0.22607290987591439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966045745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80471176,0.0010816532,0.021100292,0.0013937044,0.00464714,0.000127702,0.0005859108,0.000629361,0.16572246],"genre_scores_gemma":[0.9790492,0.00053740066,0.0132228285,0.002567644,0.002846811,0.0005567481,0.0004830901,0.0006482993,0.000087947294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98041373,0.0013046713,0.003297328,0.0043092375,0.005942989,0.004732022],"domain_scores_gemma":[0.985859,0.0040104254,0.002889103,0.0044851094,0.0005628242,0.002193552],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0057401056,0.0017657474,0.00082643994,0.0012278436,0.0035880632,0.0039329133,0.008150856,0.002793329,0.091706805],"category_scores_gemma":[0.0018957442,0.002961716,0.0030266726,0.003984679,0.013386203,0.0031706966,0.006177713,0.0031789849,0.0024908087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017798257,0.00084040145,0.000026924463,0.0009192102,0.0009679523,0.0013352439,0.0025277245,0.0043377276,0.0021535263,0.93387884,0.04451171,0.0067209234],"study_design_scores_gemma":[0.002096602,0.0039650667,0.00015036759,0.0016219296,0.0009513655,0.0014571644,0.00076316786,0.37214404,0.58565146,0.027467197,0.001234897,0.002496763],"about_ca_topic_score_codex":0.0017967662,"about_ca_topic_score_gemma":0.0006179989,"teacher_disagreement_score":0.90641165,"about_ca_system_score_codex":0.000049188893,"about_ca_system_score_gemma":0.0025817368,"threshold_uncertainty_score":0.9995088},"labels":[],"label_agreement":null},{"id":"W1966109782","doi":"10.1109/tit.2008.2008140","title":"On the Existence of $(10, 2, 7, 488)$ Resilient Functions","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Heuristic; Algebraic number; Degree (music); Computer science; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence","score_opus":0.011092172589970398,"score_gpt":0.2137632879363156,"score_spread":0.20267111534634522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966109782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00665994,0.0000065987333,0.96188694,0.00077336794,0.000402176,0.00017007781,0.000012121319,0.00015463319,0.029934155],"genre_scores_gemma":[0.9973334,0.0000067256897,0.000644822,0.0014356406,0.000009475106,0.000023367014,0.0000011694825,0.0000024885073,0.0005429158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898523,0.00014899773,0.000311964,0.000115728486,0.00028445965,0.00015361619],"domain_scores_gemma":[0.998587,0.00047677563,0.00013194047,0.0006512742,0.00010418086,0.000048821697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069248787,0.000120345605,0.00009690512,0.00028755222,0.0003797126,0.00007659646,0.0005327879,0.00005045429,0.00028809623],"category_scores_gemma":[0.000021667793,0.000086073924,0.00014827217,0.0006309907,0.000093287636,0.0008986886,0.0000016915942,0.00019503724,0.00035575702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012419146,0.00009912072,1.3749509e-7,0.000004332893,0.000013792608,1.6569457e-7,0.0012526734,0.0063427435,0.00009092017,0.88936317,0.0007172237,0.1019915],"study_design_scores_gemma":[0.0009951453,0.0022090217,0.00043952873,0.00017552308,0.000050633313,0.000025080612,0.0014930905,0.014619461,0.0551224,0.9131428,0.01117205,0.0005552791],"about_ca_topic_score_codex":0.0000011575161,"about_ca_topic_score_gemma":5.370253e-7,"teacher_disagreement_score":0.9906735,"about_ca_system_score_codex":0.000025343346,"about_ca_system_score_gemma":0.00003421971,"threshold_uncertainty_score":0.45726553},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013745695310094954,"score_gpt":0.2152243456784864,"score_spread":0.20147865036839144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966244415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32944918,0.0012404582,0.6590968,0.0015764525,0.00039758463,0.0005447243,0.0000044734097,0.00040033108,0.007290022],"genre_scores_gemma":[0.9864939,0.00014258835,0.011560484,0.0016175107,0.000065426255,0.00007544414,0.0000015714866,0.000014513019,0.000028579294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840385,0.00020167315,0.00023956811,0.0004551745,0.00026079948,0.0004389402],"domain_scores_gemma":[0.9985997,0.0003376523,0.0000897203,0.0007259489,0.000079301826,0.00016764796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004372962,0.00025505744,0.00020995784,0.00028178684,0.00045922506,0.0006854261,0.00089814235,0.00008750314,0.00014108587],"category_scores_gemma":[0.000019607443,0.00016845272,0.00023911032,0.0011355338,0.0003561104,0.00050674035,0.00020565777,0.0002351155,0.000045115263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010087494,0.00005330015,0.004489075,0.000012866402,0.0000873571,0.0000057752554,0.00085265056,0.0000060866623,0.0025072335,0.91010034,0.0062512276,0.075623974],"study_design_scores_gemma":[0.00118065,0.0006492014,0.07652598,0.00010628751,0.00008042141,0.00008654466,0.0011513648,0.011852882,0.0027367647,0.85461926,0.049694285,0.0013163441],"about_ca_topic_score_codex":0.000086903085,"about_ca_topic_score_gemma":0.000008604629,"teacher_disagreement_score":0.6570447,"about_ca_system_score_codex":0.000006175336,"about_ca_system_score_gemma":0.000017587943,"threshold_uncertainty_score":0.68693024},"labels":[],"label_agreement":null},{"id":"W1966250211","doi":"10.1016/j.disc.2005.10.002","title":"Extensions of the Critical Theorem","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Matroid; Discrete mathematics; Combinatorics; Identity (music)","score_opus":0.015465550735839117,"score_gpt":0.26586045480771964,"score_spread":0.25039490407188053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966250211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04546786,0.00009619761,0.91909367,0.006568247,0.0002323713,0.00014637192,0.000005330665,0.00012852573,0.028261453],"genre_scores_gemma":[0.9048495,0.0000033125643,0.09477496,0.00025454795,0.00003131149,0.0000036250108,1.2352531e-7,0.0000053913977,0.00007718025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999284,0.000050928476,0.00019405237,0.00012138837,0.00020196683,0.0001476349],"domain_scores_gemma":[0.99874866,0.00034422384,0.00005585949,0.00075808173,0.0000518688,0.000041330026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029727636,0.00008034325,0.000114773866,0.000033323744,0.000115892086,0.000038740767,0.0008304585,0.000030008765,0.000037241032],"category_scores_gemma":[0.0002353397,0.00004755732,0.00014240685,0.00026125016,0.0001844493,0.00012604624,0.0002748975,0.00008706405,0.000022941846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.568153e-7,0.00004938853,0.0000189746,0.000016494152,0.0000052073224,3.6983428e-7,0.0012918473,0.000010978497,0.000495324,0.9957907,0.0002183779,0.0021016507],"study_design_scores_gemma":[0.000086205175,0.000025973333,0.00025336607,0.000086999986,0.000018184148,0.000019357314,0.00017582407,0.028700149,0.0063227643,0.9622388,0.001954415,0.00011794515],"about_ca_topic_score_codex":3.9394922e-7,"about_ca_topic_score_gemma":0.0000010093545,"teacher_disagreement_score":0.8593817,"about_ca_system_score_codex":0.000004910997,"about_ca_system_score_gemma":0.000015229969,"threshold_uncertainty_score":0.19393313},"labels":[],"label_agreement":null},{"id":"W1966477666","doi":"10.1016/j.laa.2011.03.031","title":"The eigenstructure of finite field trigonometric transforms","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Finite field; Sine; Eigenvalues and eigenvectors; Discrete cosine transform; Trigonometric functions; Field (mathematics); Trigonometry; Sine and cosine transforms; Pure mathematics; Pythagorean trigonometric identity; Trigonometric substitution; Discrete sine transform; Differentiation of trigonometric functions; Algebra over a field; Mathematical analysis; Discrete mathematics; Fourier transform; Fourier analysis; Computer science; Fractional Fourier transform; Geometry","score_opus":0.016520453796969616,"score_gpt":0.2185858912432884,"score_spread":0.20206543744631877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966477666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03812526,0.0015451912,0.9493254,0.00051467586,0.00007693558,0.00036766852,0.000008910271,0.00008136448,0.009954629],"genre_scores_gemma":[0.995155,0.00029560667,0.004277751,0.0001152369,0.0000286178,0.000044070523,0.0000010215834,0.0000030747328,0.00007963832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995612,0.00001262421,0.00013616662,0.00013276166,0.000058012905,0.000099216886],"domain_scores_gemma":[0.99937534,0.00021917059,0.00004519258,0.00027962535,0.00003844962,0.000042205775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011230211,0.00005909396,0.000067273715,0.000078701174,0.00019950463,0.000019976407,0.0004036646,0.00003722542,0.00002262041],"category_scores_gemma":[0.000017336684,0.0000379413,0.000049107788,0.0006914036,0.00003806641,0.00009066688,0.000039808303,0.0000743461,0.000006876493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045423867,0.000016031465,0.00008044132,0.000005612614,0.0000102023305,6.392614e-8,0.00042351914,5.064612e-7,0.00011198876,0.87942684,0.000023875551,0.119896404],"study_design_scores_gemma":[0.00055980776,0.00040426795,0.00833472,0.000014889473,0.00004851761,0.00001356936,0.0001929769,0.007513055,0.059128303,0.7850808,0.13831136,0.00039775082],"about_ca_topic_score_codex":0.0000025633049,"about_ca_topic_score_gemma":0.0000016501842,"teacher_disagreement_score":0.9570297,"about_ca_system_score_codex":0.0000012169149,"about_ca_system_score_gemma":0.000011382228,"threshold_uncertainty_score":0.15472013},"labels":[],"label_agreement":null},{"id":"W1967002960","doi":"10.1142/s1793042110003290","title":"MULTIPLICATIVE ORDER OF GAUSS PERIODS","year":2010,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Multiplicative function; Upper and lower bounds; Gauss; Order (exchange); Gauss sum; Pure mathematics; Mathematical analysis; Physics","score_opus":0.006283978535805887,"score_gpt":0.27889246631938786,"score_spread":0.272608487783582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967002960","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51656115,0.00004529383,0.4571137,0.0012443385,0.0036299636,0.0000652134,0.000028322898,0.00003488899,0.021277113],"genre_scores_gemma":[0.96527374,0.0000070457077,0.034144774,0.00019740529,0.00022764396,0.0000016325705,9.040259e-7,0.000005642157,0.00014124287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989982,0.0000998164,0.00032969235,0.000106466476,0.00037174136,0.00009404766],"domain_scores_gemma":[0.9979523,0.00044572444,0.00039980444,0.00022464071,0.00091446773,0.000063078915],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00080966053,0.00008302525,0.00013352331,0.00014254365,0.00003138354,0.000054518747,0.0015716644,0.00004512563,0.0013062969],"category_scores_gemma":[0.00030709934,0.000067221685,0.00015965631,0.00017846379,0.00014339498,0.00037944244,0.00015704887,0.00029031318,0.000028300896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001218704,0.0001697501,0.0024878131,0.0000023000703,0.00017990611,0.00002555617,0.0014823792,0.000009620783,0.01264712,0.9368927,0.0006539704,0.045327026],"study_design_scores_gemma":[0.0012231038,0.00014159465,0.013590792,0.00009777317,0.000023117018,0.0011318208,0.00030023916,0.0005407782,0.019638078,0.9130316,0.05001756,0.00026356275],"about_ca_topic_score_codex":0.0000019942956,"about_ca_topic_score_gemma":0.0000017374759,"teacher_disagreement_score":0.44871256,"about_ca_system_score_codex":0.000011115285,"about_ca_system_score_gemma":0.000071876835,"threshold_uncertainty_score":0.99960667},"labels":[],"label_agreement":null},{"id":"W1967737635","doi":"10.1587/transfun.e95.a.567","title":"Oblivious Transfer Based on the McEliece Assumptions","year":2012,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade Federal de Ouro Preto; University of California, San Diego; Université de Montréal; Universiteit van Amsterdam; Universidade de Brasília","keywords":"McEliece cryptosystem; Generalization; Cryptosystem; Decoding methods; Oblivious transfer; Binary number; Reduction (mathematics); Mathematics; Matrix (chemical analysis); Transfer (computing); Computer science; Arithmetic; Theoretical computer science; Discrete mathematics; Algorithm; Cryptography; Parallel computing","score_opus":0.03781384633451661,"score_gpt":0.2701927737982126,"score_spread":0.23237892746369598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967737635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02833394,0.0012062471,0.9621323,0.006207138,0.00015727335,0.00024708628,0.00001025682,0.00009832148,0.0016074687],"genre_scores_gemma":[0.97761315,0.0005678865,0.02045964,0.001265008,0.0000134190395,0.000059854934,0.000001383065,0.0000062950667,0.000013339799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843353,0.0003195821,0.00026572007,0.00026698137,0.00032564419,0.00038855994],"domain_scores_gemma":[0.99738264,0.0011017611,0.000066666136,0.0013025887,0.000050568902,0.00009576624],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001072337,0.00017184387,0.00015037303,0.00026639656,0.001488746,0.00020814668,0.0021008758,0.000046708352,0.000031769214],"category_scores_gemma":[0.000002883922,0.00012891839,0.00013737979,0.0009547875,0.0006245453,0.00047298934,0.00004221055,0.00031288093,0.000010479797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011756796,0.0011114032,0.00019259172,0.0000073271494,0.000044176708,7.902471e-8,0.0007922369,0.0017568034,0.00039964222,0.9050095,0.0000564462,0.09061801],"study_design_scores_gemma":[0.0012823587,0.0054085054,0.0042256843,0.0002732933,0.00014187196,0.00004498481,0.00056635006,0.9223138,0.012341228,0.022877393,0.029353954,0.0011705601],"about_ca_topic_score_codex":0.000013215461,"about_ca_topic_score_gemma":0.000023736711,"teacher_disagreement_score":0.94927925,"about_ca_system_score_codex":0.00003463574,"about_ca_system_score_gemma":0.000081789454,"threshold_uncertainty_score":0.9998112},"labels":[],"label_agreement":null},{"id":"W1967804748","doi":"10.1109/cwit.2013.6621620","title":"Translation schemes and LP bounds","year":2013,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Translation (biology); Scheme (mathematics); Extension (predicate logic); Computer science; Upper and lower bounds; Classification scheme; Class (philosophy); Linear programming; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Artificial intelligence; Machine learning; Programming language","score_opus":0.010677007252253864,"score_gpt":0.19720084046783012,"score_spread":0.18652383321557625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967804748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20776461,0.00016019485,0.76377964,0.0014375412,0.00006228902,0.00006110349,6.116812e-8,0.00016200234,0.02657253],"genre_scores_gemma":[0.96307504,0.000005548178,0.0365376,0.00021459264,0.000010461893,0.000004446081,1.4137272e-7,0.0000011307004,0.00015103354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974066,0.000011404309,0.00004222838,0.00009531326,0.00004427823,0.0000661337],"domain_scores_gemma":[0.9998115,0.000026461648,0.0000073842984,0.0001141387,0.000012224889,0.000028341956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006443868,0.00003278791,0.000029530527,0.000034028642,0.00005370075,0.00014031559,0.00011557014,0.0000145975855,0.00009373598],"category_scores_gemma":[0.0000018954712,0.000026415137,0.000015529116,0.00010823153,0.000021515678,0.00039853147,0.000021630533,0.000022611963,0.000033726978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.907877e-7,0.0000073837623,0.00056137523,0.0000023192433,0.0000031577472,1.4136343e-7,0.00023993295,4.2555422e-7,0.0012794922,0.6122498,0.0003334063,0.3853221],"study_design_scores_gemma":[0.00049535505,0.00013776789,0.016059307,0.000012754307,0.0000054476377,0.000013342566,0.00007252588,0.06203189,0.0063742753,0.838062,0.0763896,0.00034576908],"about_ca_topic_score_codex":0.0000066860607,"about_ca_topic_score_gemma":0.0000014990298,"teacher_disagreement_score":0.7553104,"about_ca_system_score_codex":9.713524e-7,"about_ca_system_score_gemma":0.0000033448175,"threshold_uncertainty_score":0.13530664},"labels":[],"label_agreement":null},{"id":"W1967990110","doi":"10.1016/s1071-5797(03)00040-6","title":"Low complexity normal bases in F2n","year":2003,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Arithmetic","score_opus":0.02155343808712097,"score_gpt":0.2275598749627338,"score_spread":0.20600643687561282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967990110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016494798,0.00009784173,0.9649175,0.00047702412,0.000032335116,0.00014005983,0.000009139319,0.000059915958,0.017771408],"genre_scores_gemma":[0.9945236,0.000022299619,0.004754268,0.00055111985,0.000015612442,0.00008458383,0.000003408697,0.0000024938176,0.00004260249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995178,0.00004060966,0.00010312119,0.00017650891,0.000035157187,0.00012678171],"domain_scores_gemma":[0.99940985,0.00019676119,0.000024689913,0.00030725895,0.000016486627,0.000044933466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014893942,0.000071299066,0.00007503105,0.00006979018,0.00012956411,0.000050023827,0.00022202157,0.000041132007,0.000045609406],"category_scores_gemma":[0.00001115862,0.00006158584,0.000032397293,0.0003385771,0.000049751965,0.00010081089,0.000052719053,0.00010165858,0.000012223953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001230328,0.000060836064,0.00077074586,0.0000062553763,0.0000021818125,3.5014017e-7,0.0002956317,0.000013608544,0.000030986812,0.9833758,0.00006283345,0.015379556],"study_design_scores_gemma":[0.00026006557,0.00005610691,0.0042299246,0.000015078538,0.000002136142,0.0000056899958,0.00009251245,0.0033512341,0.001657719,0.93725073,0.052876383,0.00020238997],"about_ca_topic_score_codex":0.000010356388,"about_ca_topic_score_gemma":0.00004011363,"teacher_disagreement_score":0.97802883,"about_ca_system_score_codex":0.00000281048,"about_ca_system_score_gemma":0.000013239408,"threshold_uncertainty_score":0.25113973},"labels":[],"label_agreement":null},{"id":"W1968759207","doi":"10.1016/j.jcta.2006.11.005","title":"Maximum distance separable codes and arcs in projective spaces","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of New Brunswick","funders":"","keywords":"Mathematics; Projective test; Separable space; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.004965791969250566,"score_gpt":0.21562679224028844,"score_spread":0.21066100027103787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968759207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92940503,0.0022266724,0.054342538,0.0006911447,0.0036364554,0.00023278946,0.0000040822706,0.000062725376,0.009398555],"genre_scores_gemma":[0.99743736,0.00006405151,0.0021708838,0.00002508845,0.00020264156,0.0000032985672,1.9954537e-7,0.0000067023166,0.00008977713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987506,0.00030481003,0.0003398757,0.000159306,0.00023158237,0.0002137858],"domain_scores_gemma":[0.99905634,0.00029467727,0.00028235037,0.00018490992,0.00012805637,0.00005367249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001418543,0.0001378917,0.00029123324,0.00019536636,0.000111841466,0.00021648512,0.0004393311,0.00005548695,0.0000062384092],"category_scores_gemma":[0.00007989986,0.00011484802,0.000081223545,0.0004642193,0.00017978619,0.00096179976,0.000099614226,0.00022469368,6.469449e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061650184,0.00011126766,0.0019073666,0.000012863581,0.000017574603,0.000052022493,0.0006213833,0.000027180868,0.00031853683,0.99504334,0.00013671706,0.001135228],"study_design_scores_gemma":[0.00083885546,0.00045807427,0.0014782072,0.000070545175,0.000007996781,0.00009733955,0.00026834809,0.00003329949,0.0016822511,0.98694825,0.007979973,0.00013687913],"about_ca_topic_score_codex":0.000011741522,"about_ca_topic_score_gemma":0.000011153802,"teacher_disagreement_score":0.06803232,"about_ca_system_score_codex":0.00003679435,"about_ca_system_score_gemma":0.00007103398,"threshold_uncertainty_score":0.46833664},"labels":[],"label_agreement":null},{"id":"W1968809051","doi":"10.1145/384101.384111","title":"Computing all factorizations in ***","year":2001,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Factorization; Unique factorization domain; Discriminant; Multiplication (music); Prime (order theory); Time complexity; Mathematics; Factorization of polynomials; Prime factor; Polynomial; Domain (mathematical analysis); Dixon's factorization method; Combinatorics; Degree (music); Computational complexity theory; Discrete mathematics; Computer science; Algorithm; Matrix polynomial; Artificial intelligence","score_opus":0.024260265366140902,"score_gpt":0.26046708758365156,"score_spread":0.23620682221751066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968809051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08246802,0.000009955477,0.8875077,0.00039182,0.000112843656,0.000027935002,5.9298394e-8,0.00014770566,0.029334003],"genre_scores_gemma":[0.9860908,0.0000036075155,0.013408465,0.0003690405,0.000016319107,5.9426077e-7,4.404535e-7,0.0000015332882,0.00010923211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959934,0.000024727433,0.000078232675,0.000120316894,0.000056062272,0.00012134369],"domain_scores_gemma":[0.99972785,0.000054295106,0.000012754484,0.00016656709,0.000010926357,0.000027593342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116075425,0.000039235583,0.000041360123,0.00009507095,0.00003695681,0.00005202667,0.0002986744,0.000015521382,0.000036710848],"category_scores_gemma":[0.000008837955,0.00003598244,0.000021512857,0.00050546584,0.000008546878,0.000157697,0.00007948149,0.000043887398,0.000025647374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.3225053e-7,0.00003092665,0.024150027,6.2483156e-7,0.000002163909,0.000006727724,0.0004953891,0.00018170783,0.00015489852,0.95443076,0.00011120115,0.020434933],"study_design_scores_gemma":[0.0010285105,0.00014094361,0.17937735,0.00004277183,0.000004699687,0.000058834506,0.00021188492,0.30784434,0.0010214129,0.3927071,0.11680528,0.0007568673],"about_ca_topic_score_codex":0.000013579674,"about_ca_topic_score_gemma":0.000021239981,"teacher_disagreement_score":0.90362275,"about_ca_system_score_codex":0.0000064708215,"about_ca_system_score_gemma":0.000006755972,"threshold_uncertainty_score":0.14673214},"labels":[],"label_agreement":null},{"id":"W1969032791","doi":"10.1016/j.ffa.2005.08.004","title":"On Ritt's decomposition theorem in the case of finite fields","year":2005,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Univariate; Generalization; Decomposition; Polynomial; Finite field; Factor theorem; Pure mathematics; Decomposition theorem; Discrete mathematics; Fundamental theorem; Mathematical analysis; Multivariate statistics; Statistics; Fixed-point theorem","score_opus":0.010888143069672264,"score_gpt":0.2522877109278614,"score_spread":0.24139956785818914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969032791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0795242,0.00012939016,0.907164,0.0033429828,0.000025085488,0.0002507012,0.00001556073,0.00003705936,0.009511046],"genre_scores_gemma":[0.9970225,0.000033321216,0.0016296515,0.001144664,0.000046252597,0.00010311207,0.0000047054555,0.0000028485106,0.000012908661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994432,0.000073136,0.0001565669,0.00017478938,0.0000436545,0.00010866256],"domain_scores_gemma":[0.99826473,0.0011792047,0.000051718693,0.00045582445,0.000022279217,0.000026260017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002890322,0.00008540758,0.00008739655,0.00009633612,0.000151149,0.00004833218,0.00034927684,0.00006997657,0.000019731968],"category_scores_gemma":[0.00001312783,0.00005788531,0.00005472691,0.00033516082,0.00004712804,0.00009061648,0.00005495091,0.00016807692,0.000007151809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061845935,0.00009517097,0.00001789554,0.000005255195,0.000004861072,0.000003825681,0.0019779888,0.00026976882,0.0000148447325,0.8887507,0.00008069227,0.10877282],"study_design_scores_gemma":[0.00034517387,0.00022145292,0.00037608534,0.000033778513,0.000008128693,0.0001027537,0.0003685507,0.033648454,0.0007864037,0.9539749,0.009953092,0.00018120531],"about_ca_topic_score_codex":0.000017429902,"about_ca_topic_score_gemma":0.000081599515,"teacher_disagreement_score":0.91749835,"about_ca_system_score_codex":0.00000319847,"about_ca_system_score_gemma":0.000007532862,"threshold_uncertainty_score":0.23604944},"labels":[],"label_agreement":null},{"id":"W1969105360","doi":"10.1016/s0019-3577(07)00013-4","title":"Distribution of matrices with restricted entries over finite fields","year":2007,"lang":"en","type":"article","venue":"Indagationes Mathematicae","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Finite field; Rank (graph theory); Prime (order theory); Distribution (mathematics); Field (mathematics); Combinatorics; Polynomial; Matrix (chemical analysis); Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.009608625576830149,"score_gpt":0.23566452859488654,"score_spread":0.2260559030180564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969105360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33964902,0.00002738034,0.65920126,0.000112474576,0.00003797102,0.00008087071,0.0000037712948,0.00007238879,0.0008148361],"genre_scores_gemma":[0.9863008,0.0000053833264,0.013588796,0.00002713852,0.000022717646,0.000004729613,0.000008902878,0.0000039789593,0.000037548914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991364,0.000027339425,0.0002752762,0.00014538578,0.0002617991,0.0001537819],"domain_scores_gemma":[0.9987145,0.00061697955,0.00019103989,0.00032277635,0.000113617134,0.000041084844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034640526,0.00009206787,0.00013042695,0.00012215445,0.000089603505,0.000056022225,0.00031577595,0.000054697884,0.0000286798],"category_scores_gemma":[0.00011795573,0.00007115382,0.00004508979,0.0008520348,0.00007158438,0.00029959017,0.000058363952,0.00007012601,0.0000097442835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000414419,0.000117374286,0.002255948,0.00009030196,0.00003126356,0.0000069988682,0.0015495166,0.000051626062,0.0001763791,0.99017316,0.00016477372,0.005341219],"study_design_scores_gemma":[0.0014471937,0.00070978986,0.14224136,0.0005248003,0.000090666785,0.00005213198,0.00049740414,0.008545885,0.039085254,0.8031594,0.0029277517,0.0007183325],"about_ca_topic_score_codex":0.0000042692427,"about_ca_topic_score_gemma":0.000004450654,"teacher_disagreement_score":0.6466518,"about_ca_system_score_codex":0.000010791719,"about_ca_system_score_gemma":0.000024149824,"threshold_uncertainty_score":0.29015687},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01953647114672561,"score_gpt":0.2727223051112659,"score_spread":0.25318583396454025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969341770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23265405,0.000065846936,0.7663129,0.0004529505,0.00022187662,0.00006305123,3.7017313e-7,0.000012500249,0.00021644276],"genre_scores_gemma":[0.9650514,0.000023364737,0.034628626,0.00013935151,0.00012615103,0.0000027912224,0.0000011878403,0.0000031358427,0.000023967936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929106,0.000052864496,0.00032412226,0.00008785182,0.00014121382,0.000102889506],"domain_scores_gemma":[0.99944085,0.00020830234,0.00015058983,0.00007318987,0.00009242625,0.00003463936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047482635,0.000058032438,0.00011933693,0.0002429182,0.00004454766,0.00006489635,0.00021700774,0.000037700276,0.000018617546],"category_scores_gemma":[0.000024749907,0.00005536953,0.00009389047,0.00031936434,0.0000088528805,0.0004118713,0.00001124353,0.000088774075,0.000003875929],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050727096,0.00009838067,0.00032140213,0.000011282195,0.000015423822,0.0000067417286,0.0023011405,0.04473567,0.00009256605,0.008317469,0.00027100975,0.9437782],"study_design_scores_gemma":[0.0017387776,0.00051726855,0.02225335,0.00009911087,0.0000135132195,0.00006029259,0.00007092069,0.7321569,0.0003856062,0.24018231,0.0023425221,0.0001794472],"about_ca_topic_score_codex":0.000002742545,"about_ca_topic_score_gemma":0.000001638489,"teacher_disagreement_score":0.94359875,"about_ca_system_score_codex":0.000017884968,"about_ca_system_score_gemma":0.000028438693,"threshold_uncertainty_score":0.2257904},"labels":[],"label_agreement":null},{"id":"W1969941659","doi":"10.1145/2755996.2756653","title":"Output-Sensitive Algorithms for Sumset and Sparse Polynomial Multiplication","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Center for Hierarchical Manufacturing, National Science Foundation; National Science Foundation","keywords":"Integer (computer science); Mathematics; Multiplication (music); Univariate; Interpolation (computer graphics); Algorithm; Polynomial; Discrete mathematics; Computer science; Combinatorics; Multivariate statistics","score_opus":0.06220555721406493,"score_gpt":0.2792299283462728,"score_spread":0.21702437113220788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969941659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035060473,0.00002747812,0.9618714,0.00091080175,0.00022518731,0.00020826167,0.0000065320937,0.00014035846,0.0015495274],"genre_scores_gemma":[0.8700176,0.0000021714038,0.12924841,0.00034238066,0.00010096053,0.00001949337,0.0000044372305,0.0000042971496,0.0002602643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944335,0.000028533217,0.00008531124,0.00023543903,0.00007470958,0.0001326552],"domain_scores_gemma":[0.9994551,0.00010217741,0.000030991494,0.00021704262,0.00008725409,0.000107466374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032094668,0.00007122557,0.00007762147,0.00006133283,0.000065177344,0.000078737416,0.00016405723,0.000033704007,6.694322e-7],"category_scores_gemma":[0.00003940037,0.00006262704,0.000034384197,0.00011474171,0.00004064573,0.00021536568,0.00009481364,0.00003217425,0.000010378843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014231943,0.00012978778,0.00090875773,0.000009902789,0.000043159976,0.0000042023566,0.004009979,0.000037226746,0.0011023214,0.4190984,0.023975391,0.55053854],"study_design_scores_gemma":[0.0058306647,0.0011275784,0.011621125,0.00002652153,0.00004319862,0.00008765263,0.0008969223,0.72061896,0.02577068,0.107976414,0.12489047,0.0011097986],"about_ca_topic_score_codex":0.000019362391,"about_ca_topic_score_gemma":0.000006491599,"teacher_disagreement_score":0.8349571,"about_ca_system_score_codex":0.0000098841665,"about_ca_system_score_gemma":0.000021862823,"threshold_uncertainty_score":0.25538567},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01494183587803234,"score_gpt":0.26282765396283936,"score_spread":0.24788581808480703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971255859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12936418,0.000055555553,0.8648428,0.0042203986,0.00016141648,0.00022945566,0.000017820004,0.000076249205,0.0010321504],"genre_scores_gemma":[0.97964746,0.000072815514,0.018516459,0.0013787536,0.000049382816,0.0000074788586,4.9459356e-7,0.000010320708,0.00031684057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823654,0.00019931851,0.0004983272,0.00032086528,0.00041150232,0.00033346695],"domain_scores_gemma":[0.99786687,0.0007034443,0.00038542176,0.0008634531,0.000076795164,0.00010402337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004839671,0.00023289368,0.0004555601,0.000044109092,0.00037839747,0.00009482253,0.0009603141,0.00009224659,0.00030553943],"category_scores_gemma":[0.000051979187,0.00017493842,0.0012203653,0.0012261166,0.00072875584,0.00022788427,0.000029349727,0.0003801908,0.000030937383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026009625,0.004850971,0.00024053823,0.00068006216,0.0013120672,0.0000040495997,0.060847737,0.014445334,0.011793959,0.46960923,0.004055384,0.4319006],"study_design_scores_gemma":[0.0009997409,0.0015124361,0.01040184,0.00044083284,0.00070136436,0.000026178215,0.0019492949,0.21591459,0.006965562,0.7594895,0.00069088384,0.00090777397],"about_ca_topic_score_codex":0.000025591471,"about_ca_topic_score_gemma":0.000001302573,"teacher_disagreement_score":0.85028327,"about_ca_system_score_codex":0.00004135385,"about_ca_system_score_gemma":0.00007261033,"threshold_uncertainty_score":0.7133782},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nonlinear system; Shift register; Computer science; Control theory (sociology); Mathematics; Arithmetic; Artificial intelligence; Telecommunications; Control (management); Physics","score_opus":0.025460061474614406,"score_gpt":0.2705732151522423,"score_spread":0.2451131536776279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971882628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17248154,0.00000964542,0.8217026,0.0005425467,0.0011732198,0.00006151884,0.0000048839593,0.000020728325,0.0040032878],"genre_scores_gemma":[0.77647394,0.0000030377837,0.22325002,0.00012184104,0.00012155741,9.836451e-7,0.0000010751454,0.0000051517322,0.00002239071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781704,0.000070376685,0.0005946143,0.00026998465,0.0010619478,0.00018602127],"domain_scores_gemma":[0.9970114,0.00018728519,0.000815946,0.00046150543,0.0014077937,0.00011605352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010990788,0.00014314037,0.00022257422,0.0009972475,0.00017276817,0.00019138257,0.002875426,0.000025934189,0.00006581066],"category_scores_gemma":[0.00005642512,0.0001180669,0.00016362238,0.0010386818,0.000877137,0.0016418176,0.00027129144,0.00017989076,0.000018329587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014875913,0.0032144154,0.011827985,0.000041046984,0.0010214034,0.00012365216,0.019653793,0.020854648,0.012310874,0.65089864,0.00061308953,0.27795288],"study_design_scores_gemma":[0.017696388,0.020144295,0.23505464,0.0049977186,0.00041364116,0.003798533,0.0006461024,0.4811477,0.08293122,0.13734461,0.0124799805,0.0033451645],"about_ca_topic_score_codex":0.00001497839,"about_ca_topic_score_gemma":0.00000276613,"teacher_disagreement_score":0.6039924,"about_ca_system_score_codex":0.00006246733,"about_ca_system_score_gemma":0.00040965652,"threshold_uncertainty_score":0.5343305},"labels":[],"label_agreement":null},{"id":"W1972160534","doi":"10.1007/3-540-39799-x_26","title":"An M3 Public-Key Encryption Scheme","year":2007,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Key (lock); Public-key cryptography; Encryption; Scheme (mathematics); Computer security; Computer network; Mathematics","score_opus":0.015816510688001204,"score_gpt":0.26450771388122,"score_spread":0.2486912031932188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972160534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13267913,0.0000586109,0.86509466,0.0006415506,0.0009922533,0.00011756298,3.3713206e-7,0.0002933154,0.00012256586],"genre_scores_gemma":[0.59047925,0.0000014480961,0.40845045,0.00089875486,0.00016245591,0.00000219625,6.5620964e-7,0.000004606058,1.8244916e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997119,0.00009208289,0.00031083636,0.0009713934,0.00066568697,0.00084098725],"domain_scores_gemma":[0.9979516,0.00030359777,0.00009801802,0.0011884704,0.00018056446,0.00027770008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034418073,0.00022075011,0.00017685661,0.0008506585,0.00039593247,0.0008183669,0.0031890618,0.00010598882,0.000013519812],"category_scores_gemma":[0.00013189025,0.00020159732,0.00007298676,0.0043894765,0.00045383137,0.0021451984,0.00050063763,0.00034193316,0.000024668108],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073690453,0.00012234351,0.0054885987,0.000005334369,0.0000025999766,0.000025288638,0.0014980171,0.001285349,0.012339324,0.086129494,0.0000032813232,0.893093],"study_design_scores_gemma":[0.00043436306,0.0005524907,0.0205902,0.000047604994,0.0000020745035,0.0000841688,0.0000032960552,0.680543,0.0319341,0.26443005,0.0007244377,0.00065420964],"about_ca_topic_score_codex":0.000015118058,"about_ca_topic_score_gemma":0.000068504516,"teacher_disagreement_score":0.89243877,"about_ca_system_score_codex":0.00009520774,"about_ca_system_score_gemma":0.00016158598,"threshold_uncertainty_score":0.82208997},"labels":[],"label_agreement":null},{"id":"W1972236022","doi":"10.1007/s10623-014-0022-x","title":"Quadratic zero-difference balanced functions, APN functions and strongly regular graphs","year":2014,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zero (linguistics); Mathematics; Combinatorics; Zero set; Quadratic equation; Integer (computer science); Planar; Function (biology); Square (algebra); Discrete mathematics; Geometry","score_opus":0.015122074362369288,"score_gpt":0.2129378142574608,"score_spread":0.19781573989509152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972236022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15376055,0.0008938478,0.8428082,0.00020513733,0.0002521859,0.00021051675,0.000010416555,0.00033565483,0.0015234717],"genre_scores_gemma":[0.9812854,0.00015708197,0.018096121,0.00023191104,0.000047134392,0.000072598225,0.000011418566,0.000018208106,0.000080110185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978609,0.0002912691,0.00032327714,0.00076533057,0.00027951307,0.00047968057],"domain_scores_gemma":[0.99844635,0.00029155752,0.00012916031,0.0007541458,0.00009827461,0.00028049047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005744972,0.000353328,0.0003576225,0.0005363109,0.0007711441,0.00046982366,0.00045231194,0.00012684852,0.000016931019],"category_scores_gemma":[0.000032251268,0.0003196655,0.00019617224,0.0011898489,0.00038211027,0.0003849525,0.00014811808,0.00023849285,0.0000089507075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048521473,0.000119387936,0.01665692,0.000051131334,0.00011761625,0.0000030984593,0.00033575154,0.000029444105,0.005376739,0.8857236,0.0007605659,0.09077722],"study_design_scores_gemma":[0.0023134798,0.0021634547,0.11884157,0.00019794102,0.00025915267,0.0001128127,0.00070881314,0.020995632,0.00087022886,0.8382244,0.013567839,0.0017446672],"about_ca_topic_score_codex":0.000016622022,"about_ca_topic_score_gemma":0.000013869915,"teacher_disagreement_score":0.82752484,"about_ca_system_score_codex":0.0000063164694,"about_ca_system_score_gemma":0.000021870428,"threshold_uncertainty_score":0.99992555},"labels":[],"label_agreement":null},{"id":"W1973942261","doi":"10.1007/s10623-013-9875-7","title":"Computing in degree $$2^k$$ 2 k -extensions of finite fields of odd characteristic","year":2013,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Degree (music); Mathematics; Finite field; Pure mathematics; Mathematical analysis; Discrete mathematics; Physics","score_opus":0.03390598249201207,"score_gpt":0.23676410062538492,"score_spread":0.20285811813337284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973942261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48123294,0.00025985992,0.5176432,0.00009124853,0.00006777598,0.00015269441,0.0000037814032,0.000035921825,0.000512568],"genre_scores_gemma":[0.9639718,0.0000938287,0.035752133,0.00014875967,0.000012753433,0.000009964296,0.0000021172084,0.0000066318953,0.0000020431887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99875003,0.00012426925,0.0004199455,0.00028926422,0.00015642996,0.00026005716],"domain_scores_gemma":[0.9986738,0.0005384672,0.00018342602,0.00039794945,0.00012289073,0.00008349268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003497581,0.00016047835,0.00034065935,0.0005200324,0.00007877466,0.000053355358,0.00043019984,0.00008459086,0.000029820445],"category_scores_gemma":[0.00004639526,0.00014568819,0.00014931004,0.0010197542,0.00017927201,0.00021654817,0.00015757575,0.0001444259,0.0000023382306],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060881728,0.0005665245,0.1105742,0.0003032428,0.00014332907,0.00001961494,0.004518295,0.0002092416,0.027347784,0.61301523,0.00036689918,0.24287474],"study_design_scores_gemma":[0.001240716,0.00094083993,0.7231068,0.0005658811,0.000049818616,0.00002370527,0.0004350207,0.06577484,0.005834237,0.20097585,0.0003052649,0.0007470366],"about_ca_topic_score_codex":0.00011395053,"about_ca_topic_score_gemma":0.000012615143,"teacher_disagreement_score":0.61253256,"about_ca_system_score_codex":0.000002425368,"about_ca_system_score_gemma":0.000017771958,"threshold_uncertainty_score":0.5940992},"labels":[],"label_agreement":null},{"id":"W1974742228","doi":"10.48550/arxiv.1310.8369","title":"On the inverses of some classes of permutations of finite fields","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Permutation (music); Linear subspace; Bijection; Finite field; Inverse; Polynomial; Field (mathematics); Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis","score_opus":0.07526124733767775,"score_gpt":0.18317625787613456,"score_spread":0.10791501053845681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974742228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8747026,0.000023580238,0.12219416,0.000118235585,0.00018022048,0.00013840983,0.000017351322,0.000028214012,0.0025972319],"genre_scores_gemma":[0.9994453,0.00007975899,0.00024070943,0.000066117136,0.0000098650235,6.213599e-7,0.000001987795,0.000003963343,0.00015163363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921536,0.00014054321,0.00017630849,0.000285764,0.00007525536,0.00010673594],"domain_scores_gemma":[0.9977202,0.0009059559,0.0003367278,0.0008412416,0.00016193312,0.000033938515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016112279,0.00012621332,0.0002217034,0.00025033733,0.000054165648,0.000014088302,0.0012497318,0.0001236422,0.000068640955],"category_scores_gemma":[0.00008567493,0.000108374305,0.0002355382,0.000434711,0.0002130142,0.00015807613,0.00063873327,0.00023430142,0.0000074118752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012181846,0.00007284497,0.00061672635,0.00006806496,0.00006623959,0.000003013995,0.00047487667,0.04627728,0.00007204372,0.9520656,0.00017167248,0.00009948753],"study_design_scores_gemma":[0.00016297544,0.00014327896,0.0012687973,0.00016913553,0.00005529485,2.8593678e-7,0.00024713762,0.057348203,0.0026713673,0.937729,0.000053282827,0.00015123886],"about_ca_topic_score_codex":0.00008176041,"about_ca_topic_score_gemma":0.00000851215,"teacher_disagreement_score":0.124742754,"about_ca_system_score_codex":0.000011371322,"about_ca_system_score_gemma":0.00008822225,"threshold_uncertainty_score":0.4419376},"labels":[],"label_agreement":null},{"id":"W1975694774","doi":"10.1109/isbmsb.2010.5463166","title":"Geometric capacity studies for DTV transmitter identification using Kasami sequences","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Transmitter; Pseudorandom number generator; Interference (communication); Mathematics; SIGNAL (programming language); Transmission (telecommunications); Electronic engineering; Computer science; Topology (electrical circuits); Telecommunications; Algorithm; Engineering; Channel (broadcasting); Combinatorics","score_opus":0.09780511101685986,"score_gpt":0.32202154796440313,"score_spread":0.22421643694754329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975694774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44352984,0.000042936295,0.55533785,0.0002690844,0.0005339448,0.00009619726,0.0000012671677,0.00007902959,0.000109878565],"genre_scores_gemma":[0.9149003,0.0000067317023,0.08476837,0.0001725215,0.00006768115,0.000018275641,4.3689337e-7,0.0000033954848,0.000062251784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992192,0.000030505853,0.00017221061,0.00027313523,0.00013108015,0.0001738799],"domain_scores_gemma":[0.99921465,0.00022745023,0.000059603262,0.00031597447,0.00014533963,0.0000369588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058781885,0.00008756756,0.000107975,0.00027288348,0.0002393362,0.0001441674,0.00048009682,0.000041306488,0.000012500469],"category_scores_gemma":[0.00008298814,0.00007068764,0.00009446929,0.000824181,0.0001052358,0.0005009463,0.000036933307,0.00008904987,0.0000066144235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008137785,0.00007953938,0.001592079,0.00007129298,0.00009254478,0.0000010354349,0.002006773,0.00004143567,0.24355079,0.6929182,0.00040152026,0.05923666],"study_design_scores_gemma":[0.0006256814,0.00015709305,0.010839199,0.000027885051,0.000071539595,0.00003338811,0.00039967903,0.035098627,0.24917935,0.6969498,0.0058959825,0.000721817],"about_ca_topic_score_codex":0.0000140872025,"about_ca_topic_score_gemma":0.000025142235,"teacher_disagreement_score":0.4713705,"about_ca_system_score_codex":0.000008994231,"about_ca_system_score_gemma":0.000014332282,"threshold_uncertainty_score":0.2882558},"labels":[],"label_agreement":null},{"id":"W1976248130","doi":"10.1007/s00200-008-0058-0","title":"Maximal AMDS codes","year":2008,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of New Brunswick","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics","score_opus":0.009820394412748035,"score_gpt":0.20382458648276036,"score_spread":0.19400419207001232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976248130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40056476,0.0007964188,0.59687495,0.00019785562,0.000031280862,0.000098096774,2.1881716e-7,0.00031500307,0.0011214484],"genre_scores_gemma":[0.92709255,0.0001665166,0.07257595,0.00011818752,0.00001431064,0.000013635314,0.0000021610294,0.000008567002,0.000008133509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992055,0.000043067812,0.00020991321,0.00022264285,0.000096068434,0.00022274829],"domain_scores_gemma":[0.99899167,0.00023035752,0.000046283592,0.0006502991,0.000022077827,0.00005933148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035635292,0.00011999473,0.00014996143,0.00014300003,0.0002139886,0.000064056425,0.00076198933,0.00004654283,0.0000025686331],"category_scores_gemma":[0.000016575697,0.00013496856,0.000032983025,0.0005337462,0.00005203272,0.00019058387,0.0004856635,0.00022170918,0.00000623346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004789394,0.000084180196,0.0071103335,0.00003554758,0.000017033924,0.000007890582,0.0016157156,0.0090034185,0.0014418458,0.9419191,0.00007206178,0.038688105],"study_design_scores_gemma":[0.0005291639,0.00004235594,0.028680827,0.00009352925,0.0000034954858,0.00013566687,0.00006179553,0.9516287,0.0012519655,0.012313446,0.004832929,0.00042616593],"about_ca_topic_score_codex":0.00002571906,"about_ca_topic_score_gemma":0.0000015053639,"teacher_disagreement_score":0.9426252,"about_ca_system_score_codex":0.00001636389,"about_ca_system_score_gemma":0.000011036856,"threshold_uncertainty_score":0.55038583},"labels":[],"label_agreement":null},{"id":"W1976360479","doi":"10.1142/s1793042109002742","title":"BOUNDED STEP FUNCTIONS AND FACTORIAL RATIO SEQUENCES","year":2009,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Factorial; Bounded function; Quotient; Gravitational singularity; Sequence (biology); Factorial experiment; Square (algebra); Combinatorics; Upper and lower bounds; Discrete mathematics; Pure mathematics; Mathematical analysis; Statistics; Geometry","score_opus":0.011967821897041217,"score_gpt":0.26965936899694404,"score_spread":0.25769154709990283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976360479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09005044,0.0001098323,0.8871459,0.002495852,0.0053927284,0.000050376864,0.000015926224,0.00005254995,0.014686414],"genre_scores_gemma":[0.99378854,0.000019999632,0.0046956223,0.0005262109,0.0007308746,6.319537e-7,0.0000015783274,0.0000026148728,0.00023391139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990638,0.00012816033,0.00025149502,0.00010956631,0.00035249745,0.00009451023],"domain_scores_gemma":[0.99907166,0.00027423445,0.0002032401,0.00010848633,0.00027228953,0.000070078684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055854867,0.0000820199,0.00010323868,0.00012561875,0.00008022471,0.0002727784,0.00064390927,0.00003511106,0.00033522493],"category_scores_gemma":[0.00010659659,0.00006729139,0.00010087661,0.000109101675,0.00006528936,0.0007662181,0.00004803584,0.0001524197,0.000017172943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001175443,0.00006427069,0.00035240006,6.202015e-7,0.00009892956,0.000041946132,0.00055041484,0.000008963534,0.0006580832,0.93457246,0.0028313657,0.060702987],"study_design_scores_gemma":[0.0005227811,0.00016317025,0.0023804645,0.00003604248,0.00001282272,0.0006210197,0.00013151724,0.00016294482,0.00030020927,0.97073007,0.024825072,0.00011388631],"about_ca_topic_score_codex":0.0000011933472,"about_ca_topic_score_gemma":0.0000010159833,"teacher_disagreement_score":0.90373814,"about_ca_system_score_codex":0.000030119301,"about_ca_system_score_gemma":0.00006396257,"threshold_uncertainty_score":0.3670478},"labels":[],"label_agreement":null},{"id":"W1976832500","doi":"10.3934/amc.2013.7.475","title":"Correlation of binary sequence families derived from the multiplicative characters of finite fields","year":2013,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Multiplicative function; Combinatorics; Sequence (biology); Finite field; Binary number; Bounded function; Pseudorandom binary sequence; Mathematical analysis; Arithmetic","score_opus":0.030275667235170986,"score_gpt":0.29019393864652504,"score_spread":0.25991827141135404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976832500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5072752,0.0022194767,0.48664814,0.001215174,0.000059021004,0.0004985975,0.000028974808,0.00003166078,0.0020237397],"genre_scores_gemma":[0.85588574,0.0015997372,0.1424319,0.000023948485,0.0000015899637,0.00004411912,0.0000071590484,0.0000026569846,0.0000031410755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999222,0.00011690188,0.00040092046,0.00008478772,0.000108160224,0.00006726215],"domain_scores_gemma":[0.99384576,0.003981739,0.00044602974,0.0015714006,0.00014278619,0.000012259448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021454041,0.00006879373,0.00016788395,0.00007076785,0.00005690392,0.000008067829,0.00183881,0.000032687327,0.0000071877203],"category_scores_gemma":[0.00023258994,0.000053777232,0.00005452695,0.00037913406,0.0003944989,0.000489165,0.00034892326,0.000115118615,0.0000027540966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008728498,0.0005778119,0.00845334,0.00012125355,0.00005262276,9.7684904e-8,0.04458991,0.004172865,0.030137125,0.8836353,0.000011562485,0.028239395],"study_design_scores_gemma":[0.00022756893,0.00007342967,0.02533349,0.0004511314,0.000015157298,4.2397e-7,0.0029379528,0.22426172,0.0065519256,0.73991674,0.000102246835,0.00012820656],"about_ca_topic_score_codex":0.00006764139,"about_ca_topic_score_gemma":0.00003682647,"teacher_disagreement_score":0.34861052,"about_ca_system_score_codex":0.000005701246,"about_ca_system_score_gemma":0.00001710049,"threshold_uncertainty_score":0.34169972},"labels":[],"label_agreement":null},{"id":"W1977254982","doi":"10.1007/s10623-007-9079-0","title":"Coprimitive sets and inextendable codes","year":2007,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of New Brunswick","funders":"","keywords":"Mathematics; Projective test; Combinatorics; Discrete mathematics; Linear code; Block code; Pure mathematics; Algorithm; Decoding methods","score_opus":0.02021273117929976,"score_gpt":0.2559072444882321,"score_spread":0.23569451330893235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977254982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1956594,0.00208245,0.79623294,0.0001660895,0.0001311266,0.0002019676,0.000010917874,0.0002699591,0.005245126],"genre_scores_gemma":[0.93686837,0.0004345738,0.062013477,0.0006043367,0.00003636495,0.000011822756,0.0000039489028,0.000013969386,0.0000131090555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832755,0.00009825232,0.00026473674,0.000565346,0.00022864563,0.0005154894],"domain_scores_gemma":[0.99875593,0.00040443253,0.00009201383,0.00038431532,0.000094236144,0.00026904317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010845158,0.00026825335,0.0002811635,0.00047235136,0.0004306586,0.00031547152,0.00037977946,0.00010988367,0.000014669428],"category_scores_gemma":[0.000022143144,0.00024277893,0.00011816025,0.00095086166,0.0003617661,0.00043268545,0.00019753586,0.00018490772,0.0000042057763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068966685,0.00009222486,0.010646952,0.000033044627,0.00008822685,0.000046755726,0.0011074943,0.000002045064,0.003850978,0.88326955,0.0005144998,0.10027924],"study_design_scores_gemma":[0.0026449172,0.0017066366,0.13679685,0.0002338934,0.0001481642,0.00040646605,0.0016384489,0.0032072924,0.01840532,0.80070925,0.032006983,0.002095798],"about_ca_topic_score_codex":0.00002698592,"about_ca_topic_score_gemma":0.000023415485,"teacher_disagreement_score":0.741209,"about_ca_system_score_codex":0.000006761885,"about_ca_system_score_gemma":0.000019247533,"threshold_uncertainty_score":0.99002373},"labels":[],"label_agreement":null},{"id":"W1977484544","doi":"10.1007/s10623-009-9293-z","title":"On the maximality of linear codes","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Hungarian Scientific Research Fund","keywords":"Mathematics; Extension (predicate logic); Linear code; Affine transformation; Discrete mathematics; Code (set theory); Combinatorics; Block code; Pure mathematics; Algorithm; Computer science; Set (abstract data type); Decoding methods","score_opus":0.02901893960513942,"score_gpt":0.250039343507198,"score_spread":0.22102040390205857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977484544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36090982,0.0004965648,0.63184386,0.0015705702,0.000090566784,0.0002466489,0.000011848612,0.00017537604,0.0046547055],"genre_scores_gemma":[0.98483473,0.0001045013,0.013779389,0.0012369495,0.000024813266,0.0000081550625,0.000001281928,0.0000051496777,0.000005033579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870205,0.0002042134,0.00023952305,0.00033847833,0.00025250265,0.00026323134],"domain_scores_gemma":[0.9986431,0.00045021498,0.00011018292,0.00063633797,0.00007280948,0.000087370376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007466544,0.00018960157,0.00023005337,0.0002059108,0.00030324288,0.000099992816,0.0006923692,0.00006516738,0.00002186021],"category_scores_gemma":[0.000034591212,0.00012601551,0.00021419139,0.0008587768,0.00023005872,0.00014405233,0.000061136525,0.00015887796,0.000003553913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004397552,0.000119297896,0.00046626612,0.0000072469534,0.00002961251,0.000003084319,0.00032297842,0.000015699121,0.00231204,0.98062587,0.0004202887,0.01563362],"study_design_scores_gemma":[0.0003369635,0.0010883865,0.010961438,0.00006170952,0.0000255149,0.000010614246,0.00009777124,0.002637577,0.008822129,0.97398055,0.0016719323,0.00030543172],"about_ca_topic_score_codex":0.0000073448637,"about_ca_topic_score_gemma":0.000001424679,"teacher_disagreement_score":0.6239249,"about_ca_system_score_codex":0.000002959352,"about_ca_system_score_gemma":0.00001479245,"threshold_uncertainty_score":0.5138763},"labels":[],"label_agreement":null},{"id":"W1977757757","doi":"10.1007/s10623-015-0041-2","title":"Foreword: Computer Algebra in Coding Theory and Cryptography","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Cryptography; Abstract algebra; Coding theory; Computer science; Bulgarian; Session (web analytics); Algebra over a field; Symbolic computation; Mathematics; Theoretical computer science; World Wide Web; Algorithm; Pure mathematics; Linguistics","score_opus":0.028816172066018175,"score_gpt":0.24556147321964908,"score_spread":0.21674530115363091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977757757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19168092,0.0021404058,0.804217,0.00018282847,0.00026376257,0.0003003934,0.000009167028,0.00027341495,0.00093213446],"genre_scores_gemma":[0.9067495,0.0003250216,0.09186799,0.00087124814,0.00009684312,0.000051162126,0.0000052838514,0.000027850881,0.000005084407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706453,0.0005809065,0.00044996018,0.0008674043,0.00035928597,0.0006779325],"domain_scores_gemma":[0.99810016,0.000586461,0.00013661594,0.0006101909,0.00010693398,0.00045962643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023395398,0.00043826946,0.00048329867,0.0012452035,0.0002673202,0.0004183293,0.00070055533,0.00017876574,0.00001047223],"category_scores_gemma":[0.000037380385,0.00040440288,0.00020904139,0.0019963179,0.000460572,0.00073376525,0.00039280808,0.0003359395,0.000004945214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110878325,0.000102561135,0.020203743,0.00003119799,0.000065445725,0.000042018022,0.001976028,0.000014237905,0.00018234212,0.9297909,0.0005514821,0.046929173],"study_design_scores_gemma":[0.0019765866,0.0007480882,0.017693017,0.00015798531,0.000043513992,0.000117486816,0.00062313833,0.007382995,0.00030030028,0.96638274,0.0036575499,0.00091658725],"about_ca_topic_score_codex":0.000025047151,"about_ca_topic_score_gemma":0.000022619095,"teacher_disagreement_score":0.7150686,"about_ca_system_score_codex":0.000013214804,"about_ca_system_score_gemma":0.000041270414,"threshold_uncertainty_score":0.9998408},"labels":[],"label_agreement":null},{"id":"W1978031380","doi":"10.1080/10586458.2011.544565","title":"Spot-Based Generations for Meta-Fibonacci Sequences","year":2011,"lang":"en","type":"article","venue":"Experimental Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; IBM (Canada)","funders":"","keywords":"Fibonacci number; Partition (number theory); Sequence (biology); Mathematics; Class (philosophy); Chaotic; Combinatorics; Algorithm; Computer science; Artificial intelligence","score_opus":0.15471344021039327,"score_gpt":0.30160337816468596,"score_spread":0.1468899379542927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978031380","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02374331,0.0003324853,0.97010195,0.00010028048,0.00022293875,0.0003248711,0.0000069459775,0.00020822107,0.0049590166],"genre_scores_gemma":[0.42872858,6.927618e-7,0.5706664,0.00018999714,0.000022332919,0.00032270726,0.0000017817306,0.0000074697673,0.00006007904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992521,0.000026330139,0.00020223003,0.00020928019,0.00013609906,0.00017398842],"domain_scores_gemma":[0.999324,0.000096452735,0.000079812795,0.00040594584,0.00003255012,0.00006124249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021793412,0.00013692363,0.00017846061,0.00007431959,0.00017910218,0.00007681584,0.00053104904,0.00003322663,0.00023363772],"category_scores_gemma":[0.000013791452,0.00011009194,0.00022416985,0.00016223866,0.000055137953,0.00022458847,0.00006310607,0.000035003308,0.000025415891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004093247,0.00033848028,0.000004747457,0.000014548508,0.00010450128,0.0000017643954,0.0033244914,0.0000076282736,0.015695097,0.9799111,0.000383724,0.00020984872],"study_design_scores_gemma":[0.00023834371,0.00021191082,0.0000050273134,0.00000782329,0.00007702607,0.0000069685434,0.00034705698,0.01440301,0.8035113,0.1800274,0.0009483977,0.0002157136],"about_ca_topic_score_codex":0.0000039693323,"about_ca_topic_score_gemma":0.0000014166089,"teacher_disagreement_score":0.79988366,"about_ca_system_score_codex":0.000014500898,"about_ca_system_score_gemma":0.000026263015,"threshold_uncertainty_score":0.4489419},"labels":[],"label_agreement":null},{"id":"W1978143507","doi":"10.1007/s00200-008-0067-z","title":"Highly nonlinear balanced S-boxes with improved bound on unrestricted and generalized nonlinearity","year":2008,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nonlinear system; Upper and lower bounds; Bounded function; Mathematics; Class (philosophy); Combinatorics; Algebraic number; Degree (music); Discrete mathematics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.00833267848137081,"score_gpt":0.20799081302570027,"score_spread":0.19965813454432946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978143507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8504028,0.00048156458,0.14825435,0.0002334566,0.000023023136,0.00019336668,9.833449e-7,0.00025969066,0.00015079105],"genre_scores_gemma":[0.86060166,0.00024369413,0.13892989,0.00016038964,0.000021123144,0.000017497472,0.000007733607,0.000012735432,0.000005267401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901783,0.000059201644,0.00023276106,0.0003305722,0.000111619345,0.00024798364],"domain_scores_gemma":[0.9988161,0.00031076706,0.000076808945,0.0006730256,0.000038856182,0.000084450905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026956675,0.00018266217,0.00022547862,0.00015962461,0.00027755203,0.000108034044,0.0005013758,0.00006393905,7.3193434e-7],"category_scores_gemma":[0.000020954565,0.00017468522,0.000023609733,0.00062414934,0.0000803787,0.00015577082,0.0003076773,0.00029965746,0.00000104881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003067043,0.0010233306,0.0389112,0.00029308256,0.00023558909,0.00004616388,0.004508843,0.050078977,0.028402582,0.78489244,0.000089887624,0.09121121],"study_design_scores_gemma":[0.0010992116,0.00012395106,0.021094503,0.000082000195,0.0000048598195,0.000043363347,0.000017446106,0.97431713,0.0011727773,0.00096894,0.0007768465,0.0002989792],"about_ca_topic_score_codex":0.00007350877,"about_ca_topic_score_gemma":0.000007724581,"teacher_disagreement_score":0.92423815,"about_ca_system_score_codex":0.00001909154,"about_ca_system_score_gemma":0.00002094057,"threshold_uncertainty_score":0.71234566},"labels":[],"label_agreement":null},{"id":"W1978418793","doi":"10.1016/j.aim.2008.04.001","title":"Poisson statistics via the Chinese Remainder Theorem","year":2008,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Modulo; Chinese remainder theorem; Mathematics; Poisson distribution; Remainder; Compound Poisson distribution; Coprime integers; Combinatorics; Modulo operation; Prime (order theory); Infinity; Primitive root modulo n; Poisson binomial distribution; Polynomial; Discrete mathematics; Compound Poisson process; Arithmetic; Poisson regression; Mathematical analysis; Statistics; Poisson process; Algorithm","score_opus":0.008861752692216352,"score_gpt":0.26104060375079174,"score_spread":0.2521788510585754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978418793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014858742,0.00064967887,0.9763753,0.00023148557,0.00022858196,0.00014331793,0.000002639105,0.000093552764,0.0074167093],"genre_scores_gemma":[0.66247505,0.0006496671,0.33634913,0.0002961717,0.00005238989,0.000019498737,0.0000012151307,0.000013799427,0.00014308836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989419,0.00008248868,0.00026905464,0.00020141878,0.00026330288,0.00024182787],"domain_scores_gemma":[0.9983293,0.00078057556,0.000118283926,0.0006917785,0.000041721592,0.000038340393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051519315,0.00014908898,0.00017301197,0.0000762149,0.00020300268,0.000035940644,0.0009443398,0.000035419293,0.00002390039],"category_scores_gemma":[0.00015606653,0.000091595444,0.00005171201,0.00065150583,0.00019253399,0.00040435084,0.00015194231,0.00017360471,0.000034506753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035402559,0.00009561963,0.0012406905,0.000030601,0.0000058335954,0.000028150233,0.004112518,0.0002176707,0.000024106828,0.97934484,0.00009066459,0.014805746],"study_design_scores_gemma":[0.00014043381,0.00003006953,0.0014633277,0.000024461435,0.0000026789767,0.000085167885,0.00007820115,0.021114767,0.000050536546,0.9753984,0.0014756327,0.00013632093],"about_ca_topic_score_codex":0.0000012838035,"about_ca_topic_score_gemma":0.00001380284,"teacher_disagreement_score":0.64761627,"about_ca_system_score_codex":0.000015930358,"about_ca_system_score_gemma":0.000017864393,"threshold_uncertainty_score":0.3735154},"labels":[],"label_agreement":null},{"id":"W1978793076","doi":"10.1016/j.disc.2008.02.024","title":"A trace representation of binary Jacobi sequences","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; TRACE (psycholinguistics); Hadamard transform; Combinatorics; Binary number; Prime (order theory); Representation (politics); Discrete mathematics; Function (biology); Arithmetic; Mathematical analysis","score_opus":0.03788848420678235,"score_gpt":0.278392634844204,"score_spread":0.24050415063742167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978793076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64499223,0.00011777785,0.3467007,0.00023480877,0.000095316405,0.00012899104,0.0000029936755,0.00012586454,0.007601315],"genre_scores_gemma":[0.9063624,0.00004973121,0.09340404,0.000023847375,0.00001457577,0.00000798635,0.0000011742155,0.000005158819,0.00013106354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992165,0.000045503984,0.00023356332,0.00016269217,0.000219922,0.00012182409],"domain_scores_gemma":[0.99917793,0.00014778647,0.00013895778,0.00045306026,0.00004420372,0.00003806021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017370978,0.000085063766,0.0001577665,0.00008880371,0.0000941071,0.000020732732,0.00048303875,0.000030855037,0.000017875547],"category_scores_gemma":[0.0000485907,0.00007131648,0.00010320793,0.00050210685,0.000121357385,0.00027232157,0.000089769324,0.000054779197,0.000013436464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009957051,0.00019904737,0.0009983418,0.00015210237,0.000047426893,0.000044340966,0.022914719,0.00019056628,0.016702415,0.9553535,0.0007258342,0.0026617313],"study_design_scores_gemma":[0.0008048996,0.0005929144,0.0052265213,0.0003795054,0.000057416695,0.00035382502,0.002757545,0.11188616,0.082116276,0.79422116,0.00081480254,0.0007889744],"about_ca_topic_score_codex":0.0000054317243,"about_ca_topic_score_gemma":6.1381866e-7,"teacher_disagreement_score":0.2613702,"about_ca_system_score_codex":0.0000053182716,"about_ca_system_score_gemma":0.000022944027,"threshold_uncertainty_score":0.29082015},"labels":[],"label_agreement":null},{"id":"W1979595178","doi":"10.1007/s00607-009-0032-0","title":"Discrete logarithms for finite groups","year":2009,"lang":"en","type":"article","venue":"Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Discrete logarithm; Multiset; Mathematics; Generalization; Cryptography; Logarithm; Abelian group; Prime (order theory); Cryptographic primitive; Group (periodic table); Finite group; Discrete mathematics; Cryptographic protocol; Finite field; Algebra over a field; Pure mathematics; Combinatorics; Computer science; Algorithm; Public-key cryptography; Encryption; Mathematical analysis","score_opus":0.016501538301748064,"score_gpt":0.25995526874435926,"score_spread":0.2434537304426112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979595178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011898313,0.00008514019,0.98441964,0.00068401307,0.00033798016,0.00010783594,8.0191603e-7,0.00029867026,0.0021676216],"genre_scores_gemma":[0.89700204,0.000001053058,0.10200823,0.0007821572,0.00017205306,0.0000013464102,0.0000017535002,0.0000039120678,0.00002744452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917626,0.000032249616,0.00014631868,0.0002801872,0.00009039466,0.00027457927],"domain_scores_gemma":[0.99922913,0.0002942983,0.000058753387,0.00032273523,0.000036698835,0.000058368314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036688885,0.00010007453,0.00011397288,0.00007857776,0.00025188565,0.0001513687,0.0006279328,0.00003388354,0.000002086855],"category_scores_gemma":[0.000053564534,0.000094840805,0.00011383638,0.0002876063,0.000021759148,0.00016315308,0.00011770028,0.0000839207,0.000009538913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065372815,0.000024098923,0.00014741883,0.0000062009585,0.000006784535,0.0000037496181,0.00051276054,0.00065067003,0.00016975365,0.6963557,0.00033759893,0.3017787],"study_design_scores_gemma":[0.00048803742,0.00031206207,0.0038397438,0.000052414794,0.0000068075524,0.000010796369,0.0000227273,0.607985,0.0005192721,0.37932235,0.0071417084,0.00029906444],"about_ca_topic_score_codex":5.143453e-7,"about_ca_topic_score_gemma":2.3761534e-7,"teacher_disagreement_score":0.88510376,"about_ca_system_score_codex":0.00000852339,"about_ca_system_score_gemma":0.000010642051,"threshold_uncertainty_score":0.3867496},"labels":[],"label_agreement":null},{"id":"W1979827374","doi":"10.1109/82.959871","title":"A low latency architecture for computing multiplicative inverses and divisions in GF(2/sup m/)","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Saskatchewan","funders":"","keywords":"Finite field; Multiplicative inverse; Latency (audio); Division (mathematics); Computer science; Inverse; Multiplicative function; Architecture; Arithmetic; Multiplication (music); Galois theory; Inversion (geology); Finite field arithmetic; Mathematics; Discrete mathematics; Parallel computing; Combinatorics; Telecommunications; Mathematical analysis","score_opus":0.02076734642915752,"score_gpt":0.23861013843088077,"score_spread":0.21784279200172324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979827374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20875031,0.00046835296,0.79010624,0.00006394553,0.00003615397,0.00021078253,0.00001554652,0.000060573406,0.00028808624],"genre_scores_gemma":[0.99968076,0.000031866315,0.00013246671,0.00006478172,0.000024234592,0.000019376774,0.0000014150826,0.000008706661,0.000036414192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890417,0.00003801174,0.0002503738,0.00043634334,0.00011910024,0.0002519858],"domain_scores_gemma":[0.99937606,0.0002609529,0.00007615769,0.00010172447,0.000054518645,0.00013058151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020036259,0.00017875177,0.0002335612,0.00024311796,0.0007180256,0.0005509482,0.00012564534,0.00007234558,5.678538e-7],"category_scores_gemma":[0.0000064212504,0.00015148238,0.000051678355,0.00038987177,0.00011755143,0.0005524624,0.000007847348,0.00016330478,2.7247893e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019164965,0.00013698237,0.00060726673,0.00016069369,0.000021650727,0.000007785781,0.0035839328,0.0035740521,0.00038740374,0.0014198165,0.000002702022,0.99007857],"study_design_scores_gemma":[0.0025807442,0.0011586366,0.001805739,0.0018785642,0.00005005429,0.00044803807,0.0022518332,0.96755975,0.00036377844,0.020201284,0.00068952027,0.0010120249],"about_ca_topic_score_codex":0.000018193461,"about_ca_topic_score_gemma":0.000013801859,"teacher_disagreement_score":0.98906654,"about_ca_system_score_codex":0.000011366739,"about_ca_system_score_gemma":0.000026283667,"threshold_uncertainty_score":0.6177272},"labels":[],"label_agreement":null},{"id":"W1980470481","doi":"10.1007/s10801-012-0399-4","title":"On the permutation groups of cyclic codes","year":2012,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cyclic permutation; Sylow theorems; Combinatorics; Partial permutation; Permutation (music); Permutation group; Finite field; Bit-reversal permutation; Prime (order theory); Discrete mathematics; BCH code; Permutation graph; Symmetric group; Group (periodic table); Finite group; Algorithm; Decoding methods","score_opus":0.012770590631806958,"score_gpt":0.22774035244815669,"score_spread":0.21496976181634972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980470481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9622176,0.00044019325,0.03413862,0.0008901163,0.0012180245,0.000051417177,3.9125675e-7,0.000015056992,0.0010285599],"genre_scores_gemma":[0.99936706,0.000030427116,0.00032817142,0.00018264278,0.0000717113,9.58575e-7,1.1515551e-7,0.000005211006,0.000013681367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988451,0.00017360966,0.0003309585,0.00006650386,0.0004120203,0.00017179725],"domain_scores_gemma":[0.99822426,0.0008093851,0.0004415511,0.00027586494,0.00016496216,0.00008399058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392659,0.000091392234,0.00016937325,0.00017127232,0.00010111718,0.000042286243,0.00071435334,0.00003999684,0.000017287952],"category_scores_gemma":[0.00022443106,0.00005900623,0.0001656378,0.000577792,0.000054128926,0.00041542243,0.000074045216,0.0002324093,0.0000063527923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012873581,0.00020331425,0.001394291,0.0000068259133,0.000029433808,0.0000019986464,0.0012023711,0.000008294939,0.0003998227,0.994207,0.0005606474,0.0019730788],"study_design_scores_gemma":[0.00034109506,0.00046979767,0.015536772,0.0000458644,0.000022720602,0.000065205706,0.00014667975,0.00018358386,0.0032089043,0.9792314,0.00065058895,0.000097388285],"about_ca_topic_score_codex":6.627316e-7,"about_ca_topic_score_gemma":1.0652818e-7,"teacher_disagreement_score":0.03714946,"about_ca_system_score_codex":0.00003022722,"about_ca_system_score_gemma":0.000033860215,"threshold_uncertainty_score":0.24062043},"labels":[],"label_agreement":null},{"id":"W1980613467","doi":"10.1016/s0893-9659(99)00159-7","title":"New linear codes over GF(8)","year":2000,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Hamming code; Hamming distance; Minimum distance; Dimension (graph theory); Combinatorics; Linear code; Discrete mathematics; GF(2); Finite field; Block code; Algorithm; Decoding methods","score_opus":0.00933888417098147,"score_gpt":0.2142473338696172,"score_spread":0.20490844969863573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980613467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078811444,0.000016280088,0.8884873,0.001326533,0.000078341676,0.00015611839,9.930724e-7,0.00036657834,0.03075641],"genre_scores_gemma":[0.11855701,0.000012869395,0.8731164,0.0074423905,0.00020603943,0.000021905205,0.0000024603137,0.000028939961,0.00061202387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990273,0.000009902577,0.00020294444,0.0002639335,0.00022943248,0.00026647988],"domain_scores_gemma":[0.9990711,0.00012567808,0.00005389146,0.0006408834,0.000006427822,0.000101968944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019123078,0.00015914424,0.00017337178,0.00007336574,0.000097789285,0.000107953274,0.0007506145,0.00004351367,0.00054917333],"category_scores_gemma":[0.00000388326,0.00014604366,0.000087237066,0.00031166067,0.000040907584,0.00012549084,0.00007704483,0.00011928995,0.0005493119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007478269,0.00006407696,0.000005644394,0.00003121746,0.000036217516,0.000007755872,0.0017257276,0.00015353473,0.018557042,0.9022744,0.021460138,0.055676732],"study_design_scores_gemma":[0.0020423494,0.000093520364,0.00020896907,0.0001258233,0.00008301516,0.000055817345,0.00009216239,0.020661525,0.030682888,0.82689136,0.11744927,0.0016132738],"about_ca_topic_score_codex":0.0000039106826,"about_ca_topic_score_gemma":6.963747e-7,"teacher_disagreement_score":0.09598913,"about_ca_system_score_codex":0.0000114511495,"about_ca_system_score_gemma":0.000014740343,"threshold_uncertainty_score":0.70604765},"labels":[],"label_agreement":null},{"id":"W1980687521","doi":"10.1016/s0012-365x(01)00292-8","title":"On interleaved sequences over finite fields","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Mathematics; Sequence (biology); Combinatorics; Polynomial; Discrete mathematics; Field (mathematics); Mathematical analysis; Pure mathematics","score_opus":0.025723502834655305,"score_gpt":0.24486290502364497,"score_spread":0.21913940218898967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980687521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06917385,0.000058085745,0.85503936,0.0009602092,0.00033640853,0.00013609708,0.0000041829967,0.00030530844,0.07398648],"genre_scores_gemma":[0.981992,0.000016433525,0.016500752,0.00073717703,0.000032698474,0.000009233006,7.0732983e-7,0.000008081519,0.00070288335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991781,0.000035421665,0.00018273582,0.00020611756,0.00020351629,0.00019410165],"domain_scores_gemma":[0.99891925,0.0003733703,0.00007267028,0.00055854913,0.000017816146,0.000058329926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016054843,0.00013068128,0.00013711186,0.000088824345,0.00009263136,0.00015464713,0.0006790108,0.00005290372,0.00039813828],"category_scores_gemma":[0.00008819226,0.00010236379,0.00011151162,0.0002490893,0.000051138908,0.0001820762,0.0001174964,0.00013048002,0.00022913204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018114754,0.00006642027,0.000023186092,0.000027460326,0.000017024362,0.000011603092,0.0039948407,0.000057338904,0.000035483845,0.9896254,0.0018965603,0.004242892],"study_design_scores_gemma":[0.00020057376,0.00022064218,0.000037019996,0.00013036771,0.0000094102315,0.000008263566,0.00011262113,0.24095927,0.00064498896,0.75588405,0.0015194746,0.0002733009],"about_ca_topic_score_codex":0.0000014019807,"about_ca_topic_score_gemma":0.0000017941509,"teacher_disagreement_score":0.9128182,"about_ca_system_score_codex":0.0000084906105,"about_ca_system_score_gemma":0.0000032383077,"threshold_uncertainty_score":0.4359335},"labels":[],"label_agreement":null},{"id":"W1981011717","doi":"10.1016/s0020-0190(00)00103-4","title":"Computing the cycles in the perfect shuffle permutation","year":2000,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Permutation (music); Computer science; Combinatorics; Theoretical computer science; Mathematics; Parallel computing; Algorithm","score_opus":0.007141469881151602,"score_gpt":0.2216170375375544,"score_spread":0.2144755676564028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981011717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7722051,0.00003708645,0.20879315,0.0141494665,0.0000702226,0.00014662658,3.3904652e-7,0.00013020315,0.0044677695],"genre_scores_gemma":[0.9842021,0.0000017874928,0.0012649855,0.014482409,0.000032314794,0.000008632243,0.0000030943627,0.0000019069212,0.0000028044815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992229,0.00010506388,0.00021391409,0.00008025718,0.00022089538,0.00015701618],"domain_scores_gemma":[0.9995775,0.0001130096,0.0000812732,0.00019400862,0.00002211579,0.00001208838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008042594,0.00007727794,0.00005141154,0.00009347174,0.00043109595,0.0007031081,0.0006506111,0.000019924453,0.000011953606],"category_scores_gemma":[0.000017160492,0.00004618257,0.000036906633,0.0005793081,0.000057506328,0.0020915985,0.000024520992,0.0001499529,0.00005064562],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006228231,0.000010879293,0.000501916,0.0000228578,0.0000025145341,0.0000010382715,0.053453732,0.00775838,0.000074573196,0.006818657,0.00051293225,0.93083626],"study_design_scores_gemma":[0.0010138525,0.00007858734,0.09043026,0.00025101667,0.000016904,0.00016555985,0.004697525,0.85018677,0.00045374347,0.011252392,0.040817708,0.00063569495],"about_ca_topic_score_codex":0.000009372001,"about_ca_topic_score_gemma":0.0000013683189,"teacher_disagreement_score":0.9302006,"about_ca_system_score_codex":0.000015387455,"about_ca_system_score_gemma":0.00001966393,"threshold_uncertainty_score":0.67800874},"labels":[],"label_agreement":null},{"id":"W1981209126","doi":"10.1016/j.dam.2006.06.004","title":"Formulas for cube roots in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si710.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msub></mml:math>","year":2006,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scroll; Mathematics; Cube (algebra); Algorithm; Computer science; Database; Combinatorics; Theology","score_opus":0.017826701568944153,"score_gpt":0.23815581394651023,"score_spread":0.22032911237756608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981209126","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18899965,0.0013869267,0.0127572045,0.0009924141,0.0038960066,0.0001450196,0.000717203,0.0006187125,0.7904869],"genre_scores_gemma":[0.9655497,0.0012449895,0.018514397,0.0022099887,0.0032435355,0.004166826,0.0024041852,0.0019069576,0.0007594233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97990626,0.0006987593,0.004470522,0.004011733,0.0051318323,0.0057808645],"domain_scores_gemma":[0.98297006,0.003905589,0.004575397,0.0059525566,0.0003686488,0.002227722],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0047054375,0.0021308074,0.0008587216,0.0016070844,0.003234559,0.0043910085,0.0065289726,0.004755902,0.731571],"category_scores_gemma":[0.001898742,0.004354307,0.0042675342,0.003521461,0.0033006533,0.0033279671,0.0051515726,0.0033413856,0.0034684206],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024339235,0.00063056516,0.000011150395,0.0028086787,0.0019254598,0.0015257775,0.00356347,0.00242435,0.002871619,0.6082466,0.37112772,0.0024306374],"study_design_scores_gemma":[0.005307708,0.002453605,0.0000924508,0.0023796044,0.0027324755,0.00242488,0.0035921794,0.073345564,0.89536303,0.0022065355,0.0061000106,0.0040019834],"about_ca_topic_score_codex":0.00199105,"about_ca_topic_score_gemma":0.00307778,"teacher_disagreement_score":0.8924914,"about_ca_system_score_codex":0.000041083767,"about_ca_system_score_gemma":0.0029605033,"threshold_uncertainty_score":0.9994118},"labels":[],"label_agreement":null},{"id":"W1981994820","doi":"10.1007/s10623-010-9471-z","title":"Quaternary Golay sequence pairs I: even length","year":2010,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; Simon Fraser University; University of Alberta","funders":"","keywords":"Binary Golay code; Sequence (biology); Mathematics; Complementary sequences; Phase (matter); Ternary Golay code; Combinatorics; Physics; Statistics; Biology; Genetics; Decoding methods; Quantum mechanics","score_opus":0.027995046925660447,"score_gpt":0.25297110904851516,"score_spread":0.2249760621228547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981994820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5246651,0.00034525144,0.47026053,0.000491769,0.0006302596,0.00023035082,0.000012174626,0.00054880074,0.002815775],"genre_scores_gemma":[0.9432515,0.00012868419,0.056010474,0.00043795435,0.00009452198,0.000036316327,0.000003941934,0.000017773822,0.000018845452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815166,0.00014910127,0.0002714033,0.00064426975,0.00029346693,0.00049007783],"domain_scores_gemma":[0.9985243,0.00022526932,0.00010547172,0.00080399745,0.000079399055,0.00026153112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007037483,0.00029797203,0.00025531507,0.0003716067,0.00039356246,0.00036484294,0.0010329725,0.0001468261,0.000049718907],"category_scores_gemma":[0.00002451923,0.00026460143,0.00022821566,0.0009033534,0.00031733915,0.00058598036,0.00020932038,0.00042976503,0.000021361848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000291663,0.00010873009,0.027133306,0.000024943593,0.00007264136,0.000047748174,0.0007884362,0.0000041471494,0.067302264,0.8420763,0.00066982216,0.061742503],"study_design_scores_gemma":[0.0017385699,0.0013400429,0.0361753,0.00014287027,0.00010950757,0.0004833961,0.0003745049,0.01610269,0.024412131,0.8505496,0.06601641,0.0025549904],"about_ca_topic_score_codex":0.000043356606,"about_ca_topic_score_gemma":0.000022228254,"teacher_disagreement_score":0.4185864,"about_ca_system_score_codex":0.000004494603,"about_ca_system_score_gemma":0.000037130998,"threshold_uncertainty_score":0.9999806},"labels":[],"label_agreement":null},{"id":"W1982654704","doi":"10.1016/j.ins.2014.07.026","title":"A general construction of binary interleaved sequences of period 4N with optimal autocorrelation","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Autocorrelation; Binary number; Autocorrelation technique; Pseudorandom binary sequence; Mathematics; Autocorrelation matrix; Complementary sequences; Period (music); Statistics; Algorithm; Physics; Arithmetic","score_opus":0.01000664072589551,"score_gpt":0.22704436950104015,"score_spread":0.21703772877514463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982654704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57216257,0.0000040531268,0.4255577,0.00008686238,0.00010563266,0.000055307013,8.130781e-7,0.000029826839,0.0019972322],"genre_scores_gemma":[0.8954105,0.0000010890687,0.10453981,0.000030240108,0.000008540439,0.000004777907,0.000001160938,6.066375e-7,0.0000032918913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917394,0.00005233839,0.00028558873,0.000091387075,0.0003022877,0.000094469615],"domain_scores_gemma":[0.9993264,0.000048144848,0.0003246738,0.00013975217,0.0001358137,0.000025221572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066006684,0.0000623979,0.00009801279,0.00026885193,0.00012419993,0.00008961408,0.00040940807,0.000026442756,0.000013913859],"category_scores_gemma":[0.000029762083,0.000045565066,0.000034652072,0.00068129384,0.00053036044,0.0028554779,0.00005162463,0.000040902614,0.0000045757984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041136536,0.000021880438,0.0072200145,0.000040425995,0.000009810915,1.5721872e-7,0.0092258705,0.027665898,0.0043296735,0.83940345,0.000023317023,0.11201839],"study_design_scores_gemma":[0.00046291406,0.0015670834,0.014431189,0.000111123714,0.000008548158,0.00006180882,0.0019349103,0.9524873,0.019239565,0.008645732,0.00083076337,0.0002190815],"about_ca_topic_score_codex":0.000014169184,"about_ca_topic_score_gemma":0.0000011817637,"teacher_disagreement_score":0.9248214,"about_ca_system_score_codex":0.000006624494,"about_ca_system_score_gemma":0.000074708325,"threshold_uncertainty_score":0.20701525},"labels":[],"label_agreement":null},{"id":"W1983388978","doi":"10.1109/tit.2006.872862","title":"On the existence of (9,3,5,240) resilient functions","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Boolean function; Degree (music); Heuristic; Mathematics; Algebraic number; Variable (mathematics); Discrete mathematics; Algebra over a field; Computer science; Theoretical computer science; Mathematical optimization; Pure mathematics","score_opus":0.008200829568955056,"score_gpt":0.19622747674530677,"score_spread":0.1880266471763517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983388978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015733402,0.0000061493097,0.95370674,0.00035948533,0.00052587857,0.0001640315,0.000017583005,0.00014708456,0.029339662],"genre_scores_gemma":[0.9983284,0.000003466083,0.00066671026,0.000527827,0.000013410261,0.00004801546,0.0000017476181,0.0000035787423,0.00040686596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989813,0.00014815996,0.00032898656,0.000111123634,0.00028053264,0.00014987375],"domain_scores_gemma":[0.9985405,0.0006029251,0.00013648665,0.00059476844,0.000094307885,0.000031016443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064607104,0.000114980015,0.00008927487,0.00028199627,0.00038738814,0.000075967895,0.00047220674,0.0000480885,0.00014127874],"category_scores_gemma":[0.000011521509,0.000082868944,0.00014482511,0.00060762407,0.00012920768,0.0007796539,0.0000024634135,0.00018346818,0.000245737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006577033,0.00008580014,8.8870945e-7,0.0000073206493,0.000010552827,1.461072e-7,0.0005470951,0.015322316,0.00009413072,0.96448094,0.00063617795,0.018748878],"study_design_scores_gemma":[0.0007541334,0.0006568444,0.0005045262,0.00011972758,0.00004009278,0.000019505524,0.0010509636,0.012147779,0.055711027,0.9196813,0.008877927,0.00043613176],"about_ca_topic_score_codex":0.0000097429975,"about_ca_topic_score_gemma":0.0000033935569,"teacher_disagreement_score":0.98259497,"about_ca_system_score_codex":0.000026737993,"about_ca_system_score_gemma":0.00003090225,"threshold_uncertainty_score":0.33792976},"labels":[],"label_agreement":null},{"id":"W1983551238","doi":"10.1007/s00200-007-0044-y","title":"The trace spectra of polynomial bases for $${\\mathbb{F}}_{2^{n}}$$","year":2007,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"TRACE (psycholinguistics); Polynomial; Mathematics; Combinatorics; Basis (linear algebra); Spectral line; Physics; Mathematical analysis; Geometry; Quantum mechanics","score_opus":0.0068226015167159254,"score_gpt":0.2261474540274668,"score_spread":0.21932485251075087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983551238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123747304,0.0012939967,0.8739768,0.00029718888,0.00005104687,0.0002072472,4.7009962e-7,0.000097493255,0.00032843792],"genre_scores_gemma":[0.9182327,0.00007592728,0.08159975,0.000041857827,0.000024034332,0.000012323364,9.378096e-7,0.000007734457,0.0000047643593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991985,0.000025167243,0.0003012151,0.00015748572,0.00007967588,0.00023796393],"domain_scores_gemma":[0.9976382,0.0016222458,0.000090211135,0.00057747343,0.00003149736,0.000040331044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014775686,0.00009696235,0.00012942265,0.00009416831,0.00020699813,0.00007123136,0.00078636134,0.00003836076,4.1342787e-7],"category_scores_gemma":[0.000048440404,0.000088197434,0.000048664075,0.00038184773,0.000051027422,0.00009855222,0.00021852231,0.00013635587,4.0666558e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020661191,0.000053146545,0.00041288257,0.00004550448,0.00001607831,3.5005255e-7,0.00077755016,0.0023722886,0.0039023166,0.83513516,0.00006211501,0.15720192],"study_design_scores_gemma":[0.0012700463,0.00014199488,0.012146342,0.00018272894,0.000013652879,0.000022405633,0.00051900005,0.90610695,0.025833774,0.020864312,0.03238575,0.0005130438],"about_ca_topic_score_codex":0.00001715474,"about_ca_topic_score_gemma":0.000008494663,"teacher_disagreement_score":0.9037347,"about_ca_system_score_codex":0.000014755011,"about_ca_system_score_gemma":0.000011058438,"threshold_uncertainty_score":0.3596587},"labels":[],"label_agreement":null},{"id":"W1983671061","doi":"10.1109/vetecf.2011.6092944","title":"Adaptive Reed-Solomon Coding in Eigen-MIMO with Non-Adaptive Modulation","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Link adaptation; Computer science; Codec; MIMO; Coding (social sciences); Adaptive coding; Decoding methods; Encoder; Coding gain; Spectral efficiency; Code rate; Algorithm; Quadrature amplitude modulation; Precoding; Electronic engineering; Bit error rate; Telecommunications; Channel (broadcasting); Mathematics; Fading; Data compression; Engineering; Statistics","score_opus":0.03460450987460366,"score_gpt":0.21335931859778726,"score_spread":0.1787548087231836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983671061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10514912,0.0000098010205,0.8302997,0.000023849754,0.0000808549,0.00016727891,4.9007747e-7,0.00012923963,0.06413972],"genre_scores_gemma":[0.9269476,0.000002952963,0.07283788,0.000084107334,0.000017653945,0.000016311347,5.057282e-7,0.000007326444,0.00008566618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989661,0.000068715686,0.00016319804,0.00037955883,0.0001657891,0.00025662206],"domain_scores_gemma":[0.9993832,0.000056348184,0.000073387484,0.00036003874,0.00006290458,0.00006408794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031454067,0.00014204855,0.00014205532,0.0002251546,0.000091548856,0.000038348167,0.00043679896,0.00005603282,0.000037631362],"category_scores_gemma":[0.0000060331736,0.000115856805,0.00004444881,0.0006990361,0.000061544044,0.00063490955,0.00012186089,0.00013366049,0.000025698606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024285543,0.00012792855,0.008166742,0.0000036509243,0.00002909531,0.000036301124,0.008923428,0.00023302024,0.00060703873,0.95937264,0.000033982487,0.022223303],"study_design_scores_gemma":[0.0019898135,0.0028254637,0.19379663,0.00023222434,0.00002239084,0.000035336067,0.0023287283,0.55295306,0.018119715,0.22646713,0.00006028971,0.0011692179],"about_ca_topic_score_codex":0.00022198285,"about_ca_topic_score_gemma":0.00026306568,"teacher_disagreement_score":0.8217985,"about_ca_system_score_codex":0.000031188352,"about_ca_system_score_gemma":0.000028780587,"threshold_uncertainty_score":0.47245032},"labels":[],"label_agreement":null},{"id":"W1984035421","doi":"10.4153/cmb-2011-160-x","title":"Maximal Sets of Pairwise Orthogonal Vectors in Finite Fields","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Finite field; Cardinality (data modeling); Pairwise comparison; Bilinear form; Combinatorics; Integer (computer science); Field (mathematics); Degenerate energy levels; Discrete mathematics; Pure mathematics; Statistics","score_opus":0.024997099397091393,"score_gpt":0.20283217604733456,"score_spread":0.17783507665024317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984035421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7648435,0.00009123378,0.11734018,0.002974662,0.00024135175,0.00034442422,0.000019511386,0.000117325726,0.11402779],"genre_scores_gemma":[0.9885497,0.000001411408,0.010939089,0.00039203253,0.00000934298,0.000010544595,8.5583446e-7,0.0000065819236,0.00009040406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990258,0.00006976677,0.00025739401,0.00020268722,0.00012313711,0.00032120245],"domain_scores_gemma":[0.9990726,0.00020866648,0.000043821055,0.00036238087,0.000028854713,0.00028366022],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000399369,0.00010931176,0.000179853,0.0002415493,0.000037461712,0.000019208022,0.0005483556,0.00008761965,0.0055600405],"category_scores_gemma":[0.00017055307,0.000103921186,0.00008672977,0.00030558935,0.00008549782,0.000040654482,0.000062597835,0.00015119734,0.0006728793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010606215,0.00008296991,0.0015124633,0.000055577915,0.0000109536095,0.00012585052,0.0019959286,0.0000042565553,0.000008252955,0.9902659,0.0011876257,0.004739594],"study_design_scores_gemma":[0.00044765207,0.0002447739,0.01295826,0.00021444912,0.000012202628,0.000035457186,0.00012092025,0.0030100322,0.0005207246,0.97304046,0.008924222,0.0004708508],"about_ca_topic_score_codex":0.0005047514,"about_ca_topic_score_gemma":0.0012988923,"teacher_disagreement_score":0.22370622,"about_ca_system_score_codex":0.000022544911,"about_ca_system_score_gemma":0.00010886201,"threshold_uncertainty_score":0.995349},"labels":[],"label_agreement":null},{"id":"W1984081854","doi":"10.1017/s0963548311000101","title":"Lower Bounds for the Cop Number when the Robber is Fast","year":2011,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science","score_opus":0.04472043208422285,"score_gpt":0.24861083978108775,"score_spread":0.2038904076968649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984081854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07642003,0.00024091729,0.9057793,0.002736563,0.003763088,0.0012598219,0.00000377639,0.0004352944,0.009361191],"genre_scores_gemma":[0.9874383,0.0000035154346,0.011277309,0.0009646094,0.0000999141,0.000046046534,7.3891346e-7,0.000019072646,0.00015047776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978338,0.00022100878,0.00041568125,0.00062857196,0.0003376016,0.0005633251],"domain_scores_gemma":[0.99637353,0.0012713769,0.00019966986,0.0017080926,0.00035339087,0.00009395582],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026369863,0.00026502783,0.00023463438,0.000036821617,0.00133676,0.00035619768,0.0027521718,0.00009917802,0.000059477414],"category_scores_gemma":[0.00018960475,0.00016637365,0.00031294563,0.000682805,0.00031602205,0.000274916,0.0010136494,0.00037381976,0.000040292365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002000008,0.0002563542,0.005572054,0.000032862885,0.000054767774,0.0000011013647,0.00811838,0.000019431998,0.0000037003085,0.9668977,0.0030279236,0.015995707],"study_design_scores_gemma":[0.00036755027,0.00011548978,0.0025119393,0.0000220191,0.000027355432,0.000011258352,0.00008134911,0.022145802,0.00022734069,0.9583558,0.015868757,0.00026533465],"about_ca_topic_score_codex":0.000031967567,"about_ca_topic_score_gemma":0.0000040129185,"teacher_disagreement_score":0.9110183,"about_ca_system_score_codex":0.00007593037,"about_ca_system_score_gemma":0.00008776564,"threshold_uncertainty_score":0.99996334},"labels":[],"label_agreement":null},{"id":"W1984205450","doi":"10.1109/isit.2007.4557331","title":"Some Open Problems on Quasi-Twisted and Related Code Constructions and Good Quaternary Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Construct (python library); Block code; Computer science; Linear code; Coding (social sciences); Code (set theory); Theoretical computer science; Mathematics; Discrete mathematics; Algorithm; Programming language; Decoding methods; Set (abstract data type)","score_opus":0.020540217363204688,"score_gpt":0.26136904937987865,"score_spread":0.24082883201667396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984205450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87537336,0.00040239704,0.08069684,0.0017567052,0.00048121967,0.0006258487,0.000009190143,0.00048474016,0.040169686],"genre_scores_gemma":[0.99063903,0.000052296637,0.008410867,0.00026250942,0.00001682678,0.0000063173543,0.0000016818977,0.0000064823603,0.00060399063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905556,0.000066921115,0.00020902287,0.00035795735,0.00010533542,0.00020520271],"domain_scores_gemma":[0.9993077,0.00018493122,0.000062949744,0.0003010081,0.000026417956,0.00011698483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064892374,0.000119883625,0.00014289907,0.00013757161,0.00024033242,0.0002844906,0.00042785183,0.00006330583,0.00001684546],"category_scores_gemma":[0.000012747791,0.000101139965,0.000025498615,0.00028069038,0.00018404672,0.0005024083,0.0003346635,0.00012910491,0.000010795155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022081611,0.00007481893,0.004006071,0.000007738419,0.00002850384,0.000012084336,0.00042019945,0.0000032336932,0.0007324363,0.979631,0.00006718762,0.014994663],"study_design_scores_gemma":[0.0023932764,0.0012354736,0.026628204,0.00016150455,0.000029582556,0.0006506074,0.00042221352,0.009005615,0.003250911,0.95133764,0.004223985,0.0006610135],"about_ca_topic_score_codex":0.00006508819,"about_ca_topic_score_gemma":0.000057350047,"teacher_disagreement_score":0.11526565,"about_ca_system_score_codex":0.000008944066,"about_ca_system_score_gemma":0.000015875641,"threshold_uncertainty_score":0.4124368},"labels":[],"label_agreement":null},{"id":"W1984848208","doi":"10.1007/s00022-010-0041-3","title":"On the non-existence of a projective (75, 4,12, 5) set in PG(3, 7)","year":2010,"lang":"en","type":"article","venue":"Journal of Geometry","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Mathematics; Projective test; Automorphism group; Set (abstract data type); Combinatorics; Existential quantification; Automorphism; Coding (social sciences); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.013771281312936295,"score_gpt":0.2497187881563516,"score_spread":0.2359475068434153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984848208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873857,0.000026175661,0.00868676,0.00057935686,0.00047762986,0.00007183007,0.0000012389315,0.0000054396637,0.0027658541],"genre_scores_gemma":[0.99691373,0.0000064848277,0.0028012446,0.00018510097,0.00006178413,0.0000012811666,3.9764906e-8,0.0000032214016,0.000027141654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907345,0.00007509391,0.0002878091,0.00010910034,0.00030892354,0.00014565085],"domain_scores_gemma":[0.9986788,0.0004965122,0.00033018735,0.00032436772,0.00012352396,0.000046623052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016241242,0.00008071611,0.00017241348,0.00052216277,0.000049228525,0.00004144969,0.0009807476,0.000049311933,0.000027104305],"category_scores_gemma":[0.0003043794,0.00004962687,0.00013605416,0.0010438828,0.00008559427,0.00022640149,0.00010194103,0.0005979803,0.000004973182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062456704,0.001270492,0.056103703,0.00008651734,0.00022366703,0.00022688645,0.0120033985,0.00017352476,0.04770113,0.8221182,0.0043701306,0.055097785],"study_design_scores_gemma":[0.0027147117,0.0045664185,0.3918254,0.00073740206,0.000046303063,0.00070729683,0.0019536866,0.0032583468,0.049317658,0.5406359,0.0035524021,0.0006844707],"about_ca_topic_score_codex":0.000006419539,"about_ca_topic_score_gemma":0.0000081724465,"teacher_disagreement_score":0.3357217,"about_ca_system_score_codex":0.0000124344815,"about_ca_system_score_gemma":0.000068845366,"threshold_uncertainty_score":0.259796},"labels":[],"label_agreement":null},{"id":"W1985536357","doi":"10.1016/s0012-365x(00)00026-1","title":"Cyclic inequivalence of cascaded GMW-sequences","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Autocorrelation; Finite field; Discrete mathematics; Combinatorics; Integer (computer science); Statistics","score_opus":0.015459221939473657,"score_gpt":0.24904263574729807,"score_spread":0.2335834138078244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985536357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7771426,0.00020710658,0.16918255,0.00043194875,0.00011630325,0.00020136722,0.000008725715,0.00024798754,0.05246142],"genre_scores_gemma":[0.9457601,0.000074714466,0.053778037,0.00008317275,0.000021968093,0.000008628366,9.940429e-7,0.000007785134,0.00026461258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989444,0.000046202553,0.0003168713,0.0002113951,0.00026592237,0.00021518079],"domain_scores_gemma":[0.9990158,0.00014491005,0.00011211381,0.00063149544,0.00003157397,0.00006411128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031197685,0.00013121785,0.00021225466,0.0000787174,0.00007350235,0.00005796545,0.0009952006,0.000046031742,0.00025252867],"category_scores_gemma":[0.000028455423,0.00010631749,0.00012077211,0.00047339112,0.00013801739,0.00027176598,0.00008912191,0.000085482505,0.00006882785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056543745,0.00009196465,0.00015880704,0.00014358487,0.000028685776,0.000009497589,0.004135919,0.00006330475,0.002979834,0.96623254,0.00013383443,0.026016364],"study_design_scores_gemma":[0.00041095092,0.00025781378,0.00066789985,0.0003597461,0.000040733285,0.00007523174,0.00038824585,0.022837365,0.028402422,0.94382477,0.002167214,0.00056760607],"about_ca_topic_score_codex":0.0000074266677,"about_ca_topic_score_gemma":0.0000015146529,"teacher_disagreement_score":0.1686175,"about_ca_system_score_codex":0.000006606365,"about_ca_system_score_gemma":0.000019559851,"threshold_uncertainty_score":0.43355015},"labels":[],"label_agreement":null},{"id":"W1985780997","doi":"10.1007/s12095-015-0131-z","title":"Linear complexity profile and correlation measure of interleaved sequences","year":2015,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Measure (data warehouse); Correlation; Linear correlation; Distance correlation; Statistics; Mathematics; Computer science; Data mining; Geometry","score_opus":0.09925557996039795,"score_gpt":0.2913021286730739,"score_spread":0.19204654871267596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985780997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1448898,0.0060707573,0.83323306,0.0020319053,0.00015716054,0.00039055824,0.000025544554,0.0002447933,0.012956404],"genre_scores_gemma":[0.8837617,0.00016033526,0.11598122,0.000054753324,0.000007404392,0.00001811611,0.000010420958,0.0000033071358,0.0000027268586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914104,0.00024471566,0.00020559883,0.00017387638,0.00012757437,0.00010718015],"domain_scores_gemma":[0.99850595,0.00016029323,0.00011741474,0.0009248798,0.00018416764,0.00010728729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052920484,0.00009732119,0.00014263272,0.00017832161,0.00024888467,0.00005644996,0.0007690801,0.000051928746,0.0000037268246],"category_scores_gemma":[0.00004933106,0.00009087268,0.00005608847,0.00062041025,0.0008068885,0.00032048766,0.00040679265,0.00015004736,0.0000016270845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013596101,0.00007693583,0.010576011,0.000011264774,0.000029314944,1.6485468e-7,0.0035229975,0.000003148545,0.00020098491,0.9688298,0.00009958936,0.016636172],"study_design_scores_gemma":[0.00077125116,0.00037222353,0.021228064,0.00013183246,0.000045813125,0.000024397268,0.0019076979,0.032349773,0.000551162,0.93903065,0.0032502154,0.0003369363],"about_ca_topic_score_codex":0.00004415505,"about_ca_topic_score_gemma":0.00003389126,"teacher_disagreement_score":0.73887193,"about_ca_system_score_codex":0.000003971892,"about_ca_system_score_gemma":0.000032550524,"threshold_uncertainty_score":0.37056804},"labels":[],"label_agreement":null},{"id":"W1986190964","doi":"10.1145/2790282.2790287","title":"Optimizing and parallelizing the modular GCD algorithm","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Modular design; Computer science; Computation; Parallel computing; Modular arithmetic; Algorithm; Polynomial; Theoretical computer science; Mathematics; Programming language","score_opus":0.028347683229368564,"score_gpt":0.2328361945423773,"score_spread":0.20448851131300874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986190964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005290321,0.00055805506,0.9850396,0.0012579226,0.00014216972,0.000051542254,1.2140448e-7,0.00014135432,0.007518926],"genre_scores_gemma":[0.45584032,0.000024540102,0.5430018,0.00086534076,0.00006495775,0.000006958528,2.2317572e-7,0.0000047649646,0.00019113439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943364,0.000055622713,0.00007340555,0.00017161021,0.00012120298,0.0001445044],"domain_scores_gemma":[0.9995022,0.00005421618,0.00001960154,0.0003139571,0.00002999983,0.000080071404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005080554,0.00006673739,0.000061588704,0.00003568183,0.00012717777,0.00018261712,0.00042496732,0.000020341977,0.0000037895456],"category_scores_gemma":[0.000013194192,0.000041673622,0.00002950105,0.00018365483,0.000045999604,0.00025356357,0.00024746225,0.0000679702,0.000010328038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024826086,0.000015810487,0.00008409799,0.0000017708039,0.000016668146,0.0000089326695,0.0027464086,0.00045444214,0.00008868716,0.7362197,0.0008707375,0.25949025],"study_design_scores_gemma":[0.0004370098,0.00010171825,0.00022723958,0.000011736913,0.000008045643,0.00005882931,0.0006362879,0.7274921,0.00056535174,0.23902489,0.031182822,0.00025398267],"about_ca_topic_score_codex":0.000011983583,"about_ca_topic_score_gemma":0.0000012134905,"teacher_disagreement_score":0.72703767,"about_ca_system_score_codex":0.000004701619,"about_ca_system_score_gemma":0.000012987509,"threshold_uncertainty_score":0.17609811},"labels":[],"label_agreement":null},{"id":"W1986692294","doi":"10.1016/s0012-365x(02)00570-8","title":"Construction of new extremal self-dual codes","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Combinatorics; Discrete mathematics","score_opus":0.017297621776683324,"score_gpt":0.2378547598035444,"score_spread":0.22055713802686108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986692294","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092012525,0.00005906415,0.88908845,0.000071707706,0.00018713712,0.000098521785,0.0000022823845,0.00017629494,0.018304],"genre_scores_gemma":[0.3508055,0.000010492868,0.6490362,0.000023337629,0.000019689911,0.000002175106,6.730711e-7,0.00000687127,0.00009503335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923056,0.000047706926,0.0002344667,0.00015221415,0.00018529457,0.00014977794],"domain_scores_gemma":[0.99926573,0.00009873345,0.00013018114,0.00040060346,0.000037266076,0.0000674802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027345205,0.000105077146,0.00016854056,0.000074461605,0.0000588493,0.00005133196,0.00025847487,0.00004142327,0.000043656346],"category_scores_gemma":[0.000056620545,0.00009137171,0.00009251045,0.0002975493,0.000060920458,0.00016789362,0.0000522281,0.000061849154,0.000013463378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012323101,0.00003971451,0.00015923326,0.000041601164,0.000022531618,0.0000015007129,0.0021599762,0.000004931507,0.0003493451,0.99560785,0.00014619647,0.0014658923],"study_design_scores_gemma":[0.00033799853,0.00009371061,0.00007726082,0.00006453851,0.0000353294,0.000104126215,0.0006768099,0.005057725,0.015619941,0.9753807,0.002325447,0.00022639736],"about_ca_topic_score_codex":0.0000016386601,"about_ca_topic_score_gemma":9.0245794e-7,"teacher_disagreement_score":0.25879297,"about_ca_system_score_codex":0.000007150095,"about_ca_system_score_gemma":0.000049441234,"threshold_uncertainty_score":0.37260303},"labels":[],"label_agreement":null},{"id":"W1987347588","doi":"10.1002/rsa.20494","title":"The solution space geometry of random linear equations","year":2013,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; National Science Foundation","keywords":"Sequence (biology); Mathematics; Sigma; Space (punctuation); Random variable; Parity (physics); Omega; Combinatorics; Cluster analysis; Discrete mathematics; Physics; Computer science; Quantum mechanics; Statistics","score_opus":0.01376655750895992,"score_gpt":0.24812262774930283,"score_spread":0.2343560702403429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987347588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021430822,0.0053758943,0.9696888,0.0009562574,0.0015420417,0.00063731486,0.000030509344,0.00010018652,0.00023822606],"genre_scores_gemma":[0.93752664,0.0018754185,0.059696715,0.00006976169,0.00052972464,0.00008507843,0.000023396331,0.000021724527,0.00017155752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998244,0.0002502363,0.00040966467,0.00045836458,0.00034218334,0.00029555507],"domain_scores_gemma":[0.9974561,0.0011500088,0.000356455,0.0007817764,0.00016052705,0.0000951397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008249448,0.0002797523,0.0004687497,0.0001726581,0.00050039444,0.00032014493,0.000899994,0.0002101755,0.000017131717],"category_scores_gemma":[0.00019354018,0.00017882824,0.0002882107,0.00028299,0.00026177324,0.00013275025,0.00087513187,0.00048042092,0.000002274161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004206538,0.00005049959,0.00005637874,0.00022674467,0.00051675446,0.000004315621,0.0015531592,0.002790142,0.00074810896,0.6003589,0.0010056866,0.39226866],"study_design_scores_gemma":[0.0059531266,0.0000875022,0.00072405813,0.00010932662,0.00009946881,0.0000143451225,0.00006552829,0.25965372,0.0012209746,0.7285864,0.0030277928,0.0004577911],"about_ca_topic_score_codex":0.00011556714,"about_ca_topic_score_gemma":0.0000058815044,"teacher_disagreement_score":0.9160958,"about_ca_system_score_codex":0.000012220429,"about_ca_system_score_gemma":0.000065523665,"threshold_uncertainty_score":0.7292404},"labels":[],"label_agreement":null},{"id":"W1987443014","doi":"10.1007/s00026-011-0075-8","title":"2-Cell Embeddings with Prescribed Face Lengths and Genus","year":2010,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Integer (computer science); Graph; Embedding; Euler characteristic; Sequence (biology); Genus; Degree (music); Discrete mathematics; Physics","score_opus":0.014079248861447784,"score_gpt":0.2432337552056802,"score_spread":0.2291545063442324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987443014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97405696,0.00042749458,0.018556971,0.0006601373,0.0003071859,0.00011066717,0.0000019993763,0.000099824814,0.005778733],"genre_scores_gemma":[0.99787384,0.000065066146,0.0017140188,0.00016736808,0.0000121964285,0.0000042764273,4.5363137e-7,0.000008251212,0.00015452919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991439,0.000032660242,0.00014217095,0.0002432817,0.00021831796,0.00021965812],"domain_scores_gemma":[0.9990088,0.00012408388,0.00010790842,0.0004751658,0.00017216413,0.000111900044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033284383,0.00012566776,0.00015886631,0.0000998678,0.00009146603,0.00007944561,0.0005761062,0.00006661007,0.000005176618],"category_scores_gemma":[0.000032263255,0.00010863768,0.0000469198,0.00040380206,0.00010302396,0.00032599448,0.00017006382,0.00021385019,0.000003664137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020729787,0.00017409828,0.0017018392,0.000036263857,0.000017676037,0.000007113048,0.0010872623,0.0000035242367,0.002176023,0.9881462,0.0015372869,0.005091968],"study_design_scores_gemma":[0.0017540858,0.0017439497,0.0074588116,0.00006771256,0.000032545464,0.000046619378,0.00015408715,0.0029948484,0.20398797,0.6975076,0.083361246,0.000890523],"about_ca_topic_score_codex":0.0000070365027,"about_ca_topic_score_gemma":0.0000011312144,"teacher_disagreement_score":0.29063863,"about_ca_system_score_codex":0.0000012484726,"about_ca_system_score_gemma":0.0000287505,"threshold_uncertainty_score":0.4430116},"labels":[],"label_agreement":null},{"id":"W1988825410","doi":"10.1155/2013/625912","title":"On Maximum Lee Distance Codes","year":2013,"lang":"en","type":"article","venue":"Journal of Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Singleton; Algorithm; Combinatorics; Computer science; Mathematics","score_opus":0.011713277315717037,"score_gpt":0.23453029728225067,"score_spread":0.22281701996653364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988825410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09573937,0.00007198164,0.89644706,0.0010546866,0.00024467244,0.000080048834,0.0000012084888,0.00003126958,0.006329672],"genre_scores_gemma":[0.8799495,0.000020697862,0.11960549,0.00022734435,0.00006559938,0.0000025968675,1.2808457e-7,0.000009321625,0.00011933435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989464,0.000042629377,0.0003935508,0.00009553203,0.0003490816,0.00017275756],"domain_scores_gemma":[0.99875206,0.000271358,0.0003820269,0.00036875726,0.0001230321,0.00010277179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040185056,0.00011821979,0.00022680048,0.00011438232,0.00007601018,0.00021856827,0.0008368128,0.00003362668,0.00007212825],"category_scores_gemma":[0.00010066255,0.00008059955,0.00017312095,0.00021151101,0.000051588548,0.00045358934,0.00007649466,0.00017721941,0.00007216616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006851289,0.00012789952,0.00006644097,0.000045844572,0.000042854612,0.000014298204,0.0011048276,0.000051970528,0.00047495228,0.98922724,0.0034643486,0.0053724474],"study_design_scores_gemma":[0.00021200861,0.00026714854,0.00020963702,0.00017766276,0.000012262176,0.00006564747,0.00015303491,0.0046254224,0.00068423623,0.99283797,0.0006302532,0.00012472682],"about_ca_topic_score_codex":6.2740907e-7,"about_ca_topic_score_gemma":4.397763e-7,"teacher_disagreement_score":0.7842101,"about_ca_system_score_codex":0.000017366405,"about_ca_system_score_gemma":0.000020226295,"threshold_uncertainty_score":0.32867542},"labels":[],"label_agreement":null},{"id":"W1989168989","doi":"10.1109/tit.2015.2389248","title":"On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences","keywords":"Code (set theory); Computer science; Algorithm; Programming language; Set (abstract data type)","score_opus":0.023123655678070294,"score_gpt":0.2397847676655345,"score_spread":0.2166611119874642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989168989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055800624,0.000005852461,0.92891943,0.00037206252,0.00030027548,0.00017360937,0.000008737623,0.00008931887,0.014330109],"genre_scores_gemma":[0.9968975,0.000005608248,0.002326719,0.00067906216,0.000007783426,0.000027658567,9.291501e-7,0.0000036041783,0.000051101448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988129,0.00025209814,0.000359218,0.0001077221,0.0003108043,0.00015724613],"domain_scores_gemma":[0.99829704,0.00093733385,0.000116615134,0.0004557706,0.0001279799,0.000065262466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001261319,0.000118783006,0.0001273842,0.0002909133,0.00010208453,0.00006020433,0.0005728168,0.0000667238,0.00003277972],"category_scores_gemma":[0.00006365939,0.00008650854,0.00008965381,0.00058553385,0.00013637952,0.0008324778,0.000003613271,0.00022795452,0.000113042785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015895898,0.00012317533,0.0000069066705,0.000012723613,0.00001569997,4.7383654e-7,0.003225666,0.008451516,0.000051325813,0.96999466,0.000044608038,0.01791428],"study_design_scores_gemma":[0.0023059093,0.0015976651,0.0006436408,0.00030353354,0.000036255835,0.000021692837,0.0038538065,0.06617176,0.06571693,0.85676545,0.001961492,0.00062188774],"about_ca_topic_score_codex":0.0000051277852,"about_ca_topic_score_gemma":0.00000477926,"teacher_disagreement_score":0.9410969,"about_ca_system_score_codex":0.00003292096,"about_ca_system_score_gemma":0.000083818166,"threshold_uncertainty_score":0.35277158},"labels":[],"label_agreement":null},{"id":"W1989290453","doi":"10.1016/j.tcs.2010.12.012","title":"Optimization techniques for small matrix multiplication","year":2010,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Mitacs; Canada Research Chairs","keywords":"Strassen algorithm; Matrix multiplication; Multiplication (music); Mathematics; Multiplication algorithm; Matrix (chemical analysis); Base (topology); Arithmetic; Algebra over a field; Algorithm; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.009235530333444139,"score_gpt":0.2618025722920485,"score_spread":0.25256704195860435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989290453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005333558,0.0000035459684,0.99149704,0.0007726742,0.0005156602,0.0003595644,0.0000013771266,0.0005541776,0.0009624152],"genre_scores_gemma":[0.45178404,7.719303e-7,0.54793096,0.00015120067,0.000095784686,0.000029614088,8.536498e-7,0.0000043205023,0.0000024524015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985686,0.000039400784,0.00019877472,0.0005859024,0.00024246857,0.00036488738],"domain_scores_gemma":[0.99839234,0.00028307483,0.000067898094,0.0008254215,0.00027283322,0.00015842616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00166776,0.00013384846,0.000117778305,0.0002202479,0.00046228335,0.0004309265,0.0021825496,0.00006896419,0.000016258487],"category_scores_gemma":[0.00012168447,0.00011563471,0.000077725315,0.00091054436,0.0012696792,0.0004803994,0.0004495267,0.00017010732,0.0000096208305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066416933,0.00003655985,0.000014407066,0.0000040541663,0.000001156032,2.8162063e-7,0.00007817716,0.00019480522,0.006504249,0.8971135,0.0000112143825,0.09603498],"study_design_scores_gemma":[0.00009151302,0.00011334441,0.000054776334,0.000006096894,0.0000025205081,0.000010187771,9.297655e-7,0.66069597,0.023462994,0.315067,0.00035779335,0.00013691388],"about_ca_topic_score_codex":7.2780693e-7,"about_ca_topic_score_gemma":4.898814e-7,"teacher_disagreement_score":0.6605011,"about_ca_system_score_codex":0.000013637245,"about_ca_system_score_gemma":0.000058527086,"threshold_uncertainty_score":0.47154468},"labels":[],"label_agreement":null},{"id":"W1989463939","doi":"10.1109/itwitwn.2007.4318052","title":"Correlation of Multiple Bent Function Signal Sets","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bent molecular geometry; Hadamard transform; Function (biology); SIGNAL (programming language); Correlation function (quantum field theory); Bent function; Mathematics; Set (abstract data type); Correlation; TRACE (psycholinguistics); Mathematical analysis; Algorithm; Computer science; Geometry; Boolean function; Statistics; Spectral density; Engineering","score_opus":0.012738735259974517,"score_gpt":0.22265554441439867,"score_spread":0.20991680915442415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989463939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09685395,0.000013876369,0.89648527,0.000024636205,0.00021688925,0.000040323997,1.9594785e-7,0.00007092302,0.00629394],"genre_scores_gemma":[0.99030787,4.7376062e-7,0.009546532,0.00006542161,0.000015255296,6.1412874e-7,0.0000011569728,0.0000014410633,0.000061219835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9995637,0.00001621701,0.000115158866,0.000104095394,0.00011337665,0.0000874464],"domain_scores_gemma":[0.99963516,0.00011458981,0.0000431181,0.00014004344,0.00003815866,0.000028934415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003901132,0.000039435225,0.000042931573,0.00008469139,0.000041599636,0.000011752741,0.0001298592,0.000025902578,0.000063394524],"category_scores_gemma":[0.000007877149,0.00003480814,0.000041867654,0.00024199486,0.0000151296435,0.00016213485,0.00003694717,0.00003709129,0.000015772961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066693334,0.000101989055,0.0269425,0.000006311407,0.000014503616,0.0000013740025,0.0003989533,0.00074082246,0.0068434156,0.71583575,0.00035109365,0.24869661],"study_design_scores_gemma":[0.0012177591,0.0008217186,0.41320747,0.000034285014,0.00002159882,0.000011182699,0.00019642148,0.38309324,0.047783572,0.14754502,0.005684683,0.00038304046],"about_ca_topic_score_codex":0.0000079492165,"about_ca_topic_score_gemma":0.000012435118,"teacher_disagreement_score":0.89345396,"about_ca_system_score_codex":0.0000058784294,"about_ca_system_score_gemma":0.000006092546,"threshold_uncertainty_score":0.14194348},"labels":[],"label_agreement":null},{"id":"W1990421674","doi":"10.1016/j.disc.2013.03.024","title":"Non-uniqueness of minimal superpermutations","year":2013,"lang":"fr","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Guelph","keywords":"Uniqueness; Mathematics; Substring; Combinatorics; String (physics); Discrete mathematics; Computer science; Data structure; Mathematical analysis","score_opus":0.022879062862262132,"score_gpt":0.25911542624361955,"score_spread":0.23623636338135742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990421674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42485365,0.0005250628,0.5494704,0.0031229157,0.0006942532,0.000515372,0.000035232402,0.00007780318,0.020705296],"genre_scores_gemma":[0.85973424,0.000060056038,0.13710757,0.00013503642,0.00008075132,0.000059901522,0.0000066224443,0.000027642063,0.0027881535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845016,0.00007577019,0.00054370204,0.00027022255,0.00028573888,0.00037441737],"domain_scores_gemma":[0.99822277,0.00041501937,0.0002039299,0.00074689416,0.00026822463,0.0001431524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034056316,0.00023409176,0.00034980068,0.00013902762,0.00013276553,0.00021024702,0.00079896906,0.00012649588,0.00074333436],"category_scores_gemma":[0.00010491203,0.00022327091,0.00024281176,0.0006092167,0.00038497918,0.0007111732,0.0002496692,0.00015574462,0.000311787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020824189,0.00027434266,0.0003063101,0.00077435013,0.00005346695,0.0000057350394,0.01772088,0.000048819875,0.0020360067,0.9717301,0.0013620945,0.005685801],"study_design_scores_gemma":[0.00046194217,0.00034709525,0.0030210325,0.0009686505,0.00014857856,0.00006910065,0.0033282111,0.176237,0.010041326,0.8028428,0.0018568377,0.0006774251],"about_ca_topic_score_codex":0.00009711031,"about_ca_topic_score_gemma":0.000006137169,"teacher_disagreement_score":0.4348806,"about_ca_system_score_codex":0.00001620122,"about_ca_system_score_gemma":0.00008444841,"threshold_uncertainty_score":0.91047233},"labels":[],"label_agreement":null},{"id":"W1990642595","doi":"10.1007/s10623-005-6404-3","title":"New Results on Codes with Covering Radius 1 and Minimum Distance 2","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Combinatorics; Minimum distance; RADIUS; Cardinality (data modeling); Mathematics; Code (set theory); Discrete mathematics; Physics; Computer science; Set (abstract data type)","score_opus":0.015201802352448014,"score_gpt":0.22175734341733538,"score_spread":0.20655554106488738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990642595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1014503,0.0014846176,0.8915637,0.00084252935,0.00007848032,0.00022335106,0.000021410406,0.00026231728,0.0040732995],"genre_scores_gemma":[0.8942138,0.00038797973,0.10472688,0.000485773,0.000095957104,0.000012650535,0.0000036063818,0.000016249129,0.00005712238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834543,0.00008401298,0.00024644248,0.0006643321,0.0002618771,0.00039791164],"domain_scores_gemma":[0.9987786,0.00028585127,0.000109044166,0.00050953403,0.000039169296,0.00027781876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032586543,0.00029897367,0.00027461632,0.00027873676,0.00032934325,0.00040261436,0.0003970143,0.00007363145,0.000006322715],"category_scores_gemma":[0.0000135833525,0.00024282794,0.000086150816,0.0007219089,0.00019356814,0.0004158232,0.00008739329,0.0001689192,0.0000036158267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093324616,0.000120837045,0.0024329594,0.000034549423,0.00012367417,0.000034780554,0.0020216082,0.00017175924,0.0014159638,0.7891043,0.0028627615,0.20074356],"study_design_scores_gemma":[0.021807533,0.012358045,0.052382044,0.0019016529,0.00038279576,0.0006212617,0.0011748859,0.029321158,0.025261417,0.2683471,0.57975477,0.0066873366],"about_ca_topic_score_codex":0.000018714416,"about_ca_topic_score_gemma":0.00004669576,"teacher_disagreement_score":0.7927635,"about_ca_system_score_codex":0.000009279593,"about_ca_system_score_gemma":0.000029293738,"threshold_uncertainty_score":0.9902236},"labels":[],"label_agreement":null},{"id":"W1990777780","doi":"10.1016/j.ejc.2003.10.014","title":"Addendum to James Singer’s theorem on difference sets","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Addendum; Mathematics; Combinatorics; Calculus (dental); Discrete mathematics; Philosophy","score_opus":0.018173515733292876,"score_gpt":0.22998907846145933,"score_spread":0.21181556272816646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990777780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64633375,0.00026795105,0.31791505,0.0032713218,0.0034483823,0.00010869097,0.0000015238334,0.00013002603,0.028523285],"genre_scores_gemma":[0.995679,0.000020488329,0.003229068,0.0008591502,0.00013726045,2.7565534e-7,1.2178863e-7,0.000016970143,0.00005764427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983918,0.00037963092,0.00035239386,0.00019336659,0.00043636275,0.0002464336],"domain_scores_gemma":[0.99873775,0.0001263075,0.0002477117,0.000449563,0.00018591051,0.0002527773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011953934,0.00016608006,0.00020070407,0.00028042812,0.00013856406,0.00019653665,0.0015506856,0.00001817064,0.0000070916753],"category_scores_gemma":[0.00015728483,0.00013433726,0.00015278328,0.0006230343,0.000042351898,0.0001987005,0.00020405656,0.00034152623,0.00012513106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003914403,0.0002280845,0.00012022502,0.000004594916,0.00002076252,0.00037891523,0.0012911048,0.00015814992,0.00034212417,0.97007793,0.0013092876,0.026029691],"study_design_scores_gemma":[0.0024204026,0.005676752,0.012772731,0.00053786533,0.00002746571,0.0002593447,0.000139718,0.000045409837,0.0049970266,0.947473,0.025024144,0.00062613067],"about_ca_topic_score_codex":2.6142501e-7,"about_ca_topic_score_gemma":6.512287e-8,"teacher_disagreement_score":0.34934524,"about_ca_system_score_codex":0.0000563839,"about_ca_system_score_gemma":0.00005580949,"threshold_uncertainty_score":0.54781145},"labels":[],"label_agreement":null},{"id":"W1991278353","doi":"10.1504/ijsn.2011.045227","title":"On the (in)security of two Joint Encryption and Error Correction schemes","year":2011,"lang":"en","type":"article","venue":"International Journal of Security and Networks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Vulnerability (computing); Block (permutation group theory); Cryptography; Decoding methods; Computer security; Theoretical computer science; Algorithm; Mathematics; Combinatorics","score_opus":0.024728075717921395,"score_gpt":0.2484381630192168,"score_spread":0.2237100873012954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991278353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.964452,0.00038789978,0.033048812,0.00033948707,0.0010655981,0.000042119656,6.2593386e-7,0.0000062543027,0.0006571601],"genre_scores_gemma":[0.99910015,0.0003331829,0.00032481988,0.00013782804,0.00009942116,9.175114e-7,2.1268194e-7,0.0000019438885,0.0000015085095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928635,0.00009288212,0.00025699986,0.00009499951,0.00019274167,0.00007603656],"domain_scores_gemma":[0.9993417,0.00016186957,0.00024292122,0.000079361525,0.0001381891,0.000035945755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007753718,0.00006718271,0.00010739781,0.00014458015,0.00004160837,0.000040690753,0.0002821481,0.000033198867,0.000020931819],"category_scores_gemma":[0.00004627968,0.00004830882,0.00005865107,0.000110606125,0.000086803266,0.00028222584,0.000083862345,0.00026685937,2.8098978e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037115856,0.00028572357,0.0070355893,0.0000071634217,0.00010399577,0.000036181875,0.01001548,0.00017065318,0.00014677615,0.9570925,0.0002757495,0.024458993],"study_design_scores_gemma":[0.0010473323,0.0005420359,0.018358277,0.0004389166,0.000017028928,0.00033917735,0.0004646664,0.08727659,0.0018172988,0.88926363,0.00027446638,0.00016057922],"about_ca_topic_score_codex":0.000022731952,"about_ca_topic_score_gemma":0.000025320243,"teacher_disagreement_score":0.08710594,"about_ca_system_score_codex":0.000012049007,"about_ca_system_score_gemma":0.000011923087,"threshold_uncertainty_score":0.19699764},"labels":[],"label_agreement":null},{"id":"W1991405149","doi":"10.1090/s0025-5718-00-01246-1","title":"A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Algebraic function; Algebraic number; Rational function; Function field of an algebraic variety; Polynomial; Logarithm; Newton polygon; Function (biology); Real algebraic geometry; Field (mathematics); Algebraic surface; Singular point of an algebraic variety; Algebraic extension; Power series; Algebraic element; Upper and lower bounds; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.026861764522192456,"score_gpt":0.2551159990401332,"score_spread":0.22825423451794075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991405149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52448,0.000033218028,0.4748885,0.00006406744,0.00008140172,0.00034133677,0.000006105112,0.000018707926,0.000086686974],"genre_scores_gemma":[0.9497571,0.0000016003987,0.050162923,0.00001993213,0.000021267993,0.0000092544615,0.000008460472,0.0000089743,0.000010511678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985714,0.00014898031,0.0006470726,0.0001643168,0.0003534742,0.0001147619],"domain_scores_gemma":[0.9980406,0.0005455257,0.00069523224,0.00041720388,0.0002771568,0.000024238825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008181677,0.00012050781,0.00029854348,0.000097605174,0.0001377127,0.000027518523,0.00047551672,0.00005026599,0.000014916777],"category_scores_gemma":[0.00005141895,0.000085275286,0.00019411261,0.00045559122,0.00026078825,0.00020874519,0.00006009565,0.00005330145,0.0000010873626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007627998,0.002704085,0.00015458805,0.0023629374,0.00049713114,3.9371656e-7,0.026187373,0.1769376,0.068911664,0.22882812,0.000812758,0.49184057],"study_design_scores_gemma":[0.0005156751,0.0004488577,0.0017580308,0.00017895248,0.00007852977,0.0000026293421,0.0001211532,0.73322445,0.013284658,0.25026444,0.000034054283,0.00008857237],"about_ca_topic_score_codex":0.000015662572,"about_ca_topic_score_gemma":0.000002778298,"teacher_disagreement_score":0.5562869,"about_ca_system_score_codex":0.000010483991,"about_ca_system_score_gemma":0.00005544587,"threshold_uncertainty_score":0.34774253},"labels":[],"label_agreement":null},{"id":"W1991749034","doi":"10.1007/bf01237471","title":"The Lunelli-Sce hyperoval inPG(2, 16)","year":2000,"lang":"en","type":"article","venue":"Journal of Geometry","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Conic section; Mathematical proof; Intersection (aeronautics); Automorphism; Group (periodic table); Plane (geometry); Combinatorics; Pure mathematics; Algebra over a field; Geometry","score_opus":0.00620122086169886,"score_gpt":0.21129248506419535,"score_spread":0.2050912642024965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991749034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9017125,0.0032664954,0.06975092,0.0035373762,0.0014411975,0.000058541147,7.660082e-7,0.00005244186,0.020179814],"genre_scores_gemma":[0.99432284,0.0004483592,0.0030124867,0.000510092,0.0003291939,5.0432857e-7,6.621709e-8,0.0000060189423,0.0013704167],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892086,0.000094755174,0.0003110867,0.00010284732,0.00035439667,0.00021604398],"domain_scores_gemma":[0.99901766,0.00028552784,0.00016389982,0.0003446253,0.00009021366,0.00009807284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011806823,0.00008780834,0.0001361719,0.0001781809,0.0002495093,0.00020528429,0.0012641464,0.00003951607,0.00022295391],"category_scores_gemma":[0.000054800523,0.00005474158,0.00020363013,0.0008834092,0.000069997295,0.00036119414,0.00006511325,0.00029999233,0.000074680385],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009099148,0.00011235063,0.0012663398,0.0000055729924,0.00008826291,0.00005848045,0.0002582588,0.00012150864,0.00033087796,0.043871284,0.011086958,0.9427091],"study_design_scores_gemma":[0.00094970857,0.0007549709,0.011593108,0.00007137943,0.000037749644,0.0013370777,0.00015131487,0.0007319342,0.002016951,0.12476507,0.8572541,0.00033665306],"about_ca_topic_score_codex":0.0000015005751,"about_ca_topic_score_gemma":7.454961e-7,"teacher_disagreement_score":0.94237244,"about_ca_system_score_codex":0.00002378765,"about_ca_system_score_gemma":0.000044718203,"threshold_uncertainty_score":0.2441189},"labels":[],"label_agreement":null},{"id":"W1992704551","doi":"10.1016/j.ffa.2007.11.001","title":"Near bent functions on a hyperplane","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Hyperplane; Bent molecular geometry; Mathematics; TRACE (psycholinguistics); Combinatorics; Function (biology); Bent function; Boolean function; Discrete mathematics","score_opus":0.016561114137719136,"score_gpt":0.20230978912080855,"score_spread":0.18574867498308942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992704551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030896157,0.00011768459,0.95119715,0.001454069,0.00006447892,0.00016859635,0.000020727946,0.00016460702,0.01591651],"genre_scores_gemma":[0.99684113,0.00005468884,0.0018992964,0.0006938692,0.000055147175,0.00012786234,0.000009986171,0.000003595235,0.000314425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954796,0.00001546815,0.00008471103,0.000196398,0.000048316462,0.000107170745],"domain_scores_gemma":[0.9993244,0.00018654548,0.000023666207,0.00038604953,0.000019942992,0.00005941778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053937518,0.000076753655,0.000067837915,0.000050030365,0.0005162872,0.000045382614,0.00021234267,0.000045240067,0.000032105265],"category_scores_gemma":[0.000004799257,0.000061259314,0.000043298074,0.0002468794,0.00005606952,0.000060030256,0.00005794172,0.00011041975,0.00008674484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009527332,0.00019014404,0.000562017,0.0000060472403,0.00002667372,0.0000021934275,0.001597603,0.00015142284,0.00007687622,0.9239805,0.0025710617,0.07082594],"study_design_scores_gemma":[0.0003620072,0.00037310793,0.00490072,0.00001622425,0.000008780257,0.00007941665,0.0000995982,0.011195609,0.0002979806,0.10983022,0.8724963,0.00034003097],"about_ca_topic_score_codex":0.0000059525505,"about_ca_topic_score_gemma":0.0000027870449,"teacher_disagreement_score":0.96594495,"about_ca_system_score_codex":0.0000027037347,"about_ca_system_score_gemma":0.000014432577,"threshold_uncertainty_score":0.3970916},"labels":[],"label_agreement":null},{"id":"W1993611337","doi":"10.4028/www.scientific.net/amm.490-491.1436","title":"An Efficient Stream Cipher WG-16 and its Application for Securing 4G-LTE Networks","year":2014,"lang":"en","type":"article","venue":"Applied Mechanics and Materials","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Computer science; Cipher; Block cipher; Computer network; Keystream; LTE Advanced; Cryptography; Computer security; Block cipher mode of operation; Stream cipher attack; Encryption; Telecommunications link","score_opus":0.006250283241257533,"score_gpt":0.21058576065736245,"score_spread":0.20433547741610492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993611337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18307298,0.000039525516,0.8160822,0.000025617359,0.00017878528,0.00039642188,0.0000050220838,0.00008967967,0.000109763365],"genre_scores_gemma":[0.9923974,0.000027440017,0.007090392,0.00016429751,0.00012706527,0.0001675802,0.000009694806,0.000012814163,0.0000032650162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991478,0.00003061457,0.00016050373,0.00037832023,0.00007087657,0.00021193415],"domain_scores_gemma":[0.9994625,0.00005109541,0.00008855097,0.0002828087,0.000026508502,0.00008857278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072233635,0.00012963955,0.00016586103,0.000042154446,0.00017341973,0.0001691914,0.00021635146,0.00007356965,0.0000041569947],"category_scores_gemma":[0.000004302558,0.000119885146,0.00001812613,0.00007755226,0.000007022439,0.0000631033,0.0001244594,0.000030248337,0.0000017254164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016549124,0.000022339633,2.2391436e-7,0.000025396028,0.0000057926804,4.9763823e-8,0.00009026821,0.00010548945,0.075594015,0.90678215,0.0000061248074,0.01735162],"study_design_scores_gemma":[0.00080532755,0.0002217351,0.000021010139,0.000023451817,0.000031356747,0.000004177799,0.00004101207,0.2340359,0.14071093,0.6209129,0.0028042689,0.0003879257],"about_ca_topic_score_codex":0.0000021640533,"about_ca_topic_score_gemma":0.0000013636866,"teacher_disagreement_score":0.80932444,"about_ca_system_score_codex":0.000006116749,"about_ca_system_score_gemma":0.0000049596965,"threshold_uncertainty_score":0.48887742},"labels":[],"label_agreement":null},{"id":"W1993844643","doi":"10.1090/s0025-5718-03-01559-x","title":"The arithmetic of certain cubic function fields","year":2003,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Ideal (ethics); Jacobian matrix and determinant; Ideal class group; Arithmetic; Arithmetic function; Algebraic number theory; Cryptography; Function field; Field (mathematics); Class (philosophy); Class field theory; Algebraic number; Function (biology); Discrete mathematics; Pure mathematics; Algebra over a field; Algorithm; Applied mathematics; Mathematical analysis; Computer science; Law","score_opus":0.01313094937652154,"score_gpt":0.23349545416482226,"score_spread":0.22036450478830072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993844643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060514577,0.00007414649,0.9364806,0.00008048265,0.00014917314,0.00008122627,1.8853817e-7,0.000025475687,0.002594144],"genre_scores_gemma":[0.94375724,0.000004190311,0.056182887,0.000013973905,0.0000049411187,0.0000033370916,3.6255278e-7,0.0000029251644,0.000030127918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934286,0.00007525579,0.00025201618,0.000080076024,0.00016970544,0.00008008588],"domain_scores_gemma":[0.99894595,0.0005278371,0.00018526525,0.0002251452,0.00009980088,0.000016018806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056948804,0.00005704549,0.000100626814,0.00006671908,0.000078063356,0.000030034513,0.00021897203,0.00002852924,0.0000032535163],"category_scores_gemma":[0.00009636801,0.000042430678,0.00006384923,0.00029739068,0.000044921315,0.000081610866,0.000025937738,0.000046587986,0.0000030042818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026880664,0.000060164228,0.00002203808,0.00004954422,0.0000149215575,1.18111636e-7,0.0006907338,0.0016799219,0.00026708937,0.97866005,0.000053756175,0.018498948],"study_design_scores_gemma":[0.000120606885,0.00011438134,0.0001589212,0.0000267418,0.000011015832,0.0000028674592,0.00012821888,0.08941771,0.0038723317,0.9059314,0.00016534748,0.000050462146],"about_ca_topic_score_codex":0.0000012107557,"about_ca_topic_score_gemma":0.0000011446783,"teacher_disagreement_score":0.88324267,"about_ca_system_score_codex":0.0000043394934,"about_ca_system_score_gemma":0.00001817297,"threshold_uncertainty_score":0.17302728},"labels":[],"label_agreement":null},{"id":"W1994036294","doi":"10.14569/ijacsa.2014.050533","title":"Solving for the RC4 stream cipher state register using a genetic algorithm","year":2014,"lang":"en","type":"article","venue":"International Journal of Advanced Computer Science and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; RC4; Stream cipher; Keystream; Algorithm; Cryptanalysis; Permutation (music); Transposition cipher; Cipher; Encryption; Genetic algorithm; Running key cipher; Cryptography; Theoretical computer science; Computer security; Machine learning","score_opus":0.013266659436945338,"score_gpt":0.2829219701691825,"score_spread":0.2696553107322372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994036294","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053735976,0.00012461489,0.9928699,0.00094416976,0.0004839017,0.00014827448,0.0000022137438,0.000015739157,0.00003760379],"genre_scores_gemma":[0.18064155,0.000047355228,0.8181448,0.00067135814,0.0004582556,0.000020230671,1.9478e-7,0.0000049214586,0.000011318146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889404,0.000019644347,0.00026785047,0.00022282834,0.00043224613,0.00016340864],"domain_scores_gemma":[0.99820954,0.00026968957,0.0002761767,0.0002680832,0.0008974978,0.00007903127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007063069,0.0000853264,0.0000945301,0.00017138514,0.00034162952,0.00041605378,0.001686568,0.000013002079,9.313086e-7],"category_scores_gemma":[0.000027043625,0.0000614168,0.000067078974,0.00035637835,0.00023900793,0.0006705704,0.00023651287,0.00008495509,7.2565297e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044744224,0.00002356181,0.000031016833,0.0000014858208,0.000017630813,6.9117885e-7,0.00016896192,0.009650282,0.00086040265,0.025679642,0.00002328559,0.9635386],"study_design_scores_gemma":[0.00047110094,0.00014013251,0.0014557966,0.000040794566,0.000012465513,0.00019680521,0.000027471873,0.8622278,0.0008620091,0.09651961,0.037904575,0.00014146697],"about_ca_topic_score_codex":0.0000018238397,"about_ca_topic_score_gemma":5.3693407e-7,"teacher_disagreement_score":0.9633971,"about_ca_system_score_codex":0.00003698816,"about_ca_system_score_gemma":0.00009879781,"threshold_uncertainty_score":0.4012016},"labels":[],"label_agreement":null},{"id":"W1994156427","doi":"10.1016/j.disc.2009.04.002","title":"Research problems on Gray codes and universal cycles","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Gray code; Gray (unit); Mathematics; De Bruijn sequence; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.039846901217051485,"score_gpt":0.30825031101059897,"score_spread":0.2684034097935475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994156427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4689785,0.00023745456,0.4397287,0.005128279,0.00017447953,0.00066067645,0.00001006655,0.0005968165,0.084485024],"genre_scores_gemma":[0.9763072,0.000040548104,0.023411235,0.000079723155,0.000024601699,0.000003270259,0.0000010284499,0.000005535577,0.00012684356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902654,0.00008797003,0.000120646524,0.00022130366,0.00029807963,0.00024547093],"domain_scores_gemma":[0.9991718,0.0002521018,0.000036908645,0.00041469585,0.000046251193,0.00007827449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075834984,0.000100397054,0.00012155659,0.00017036205,0.00021226463,0.00019219372,0.00048663197,0.000040120085,0.0000053798317],"category_scores_gemma":[0.000037148806,0.000078959485,0.000041061758,0.00038373706,0.00011424723,0.00016256509,0.000107100925,0.0001639197,0.000020592566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035167645,0.000058983183,0.000027642005,0.000028038761,0.0000062041036,0.0000037509926,0.0024561274,0.000014951142,0.00029904564,0.99168164,0.0002940829,0.0051260153],"study_design_scores_gemma":[0.00017200237,0.00036663187,0.00055099593,0.00015014439,0.000004668693,0.000009210498,0.0005353812,0.010243532,0.00067774125,0.9862179,0.0009181858,0.00015361654],"about_ca_topic_score_codex":0.00000237879,"about_ca_topic_score_gemma":0.0000017674959,"teacher_disagreement_score":0.5073287,"about_ca_system_score_codex":0.000011234484,"about_ca_system_score_gemma":0.000012729171,"threshold_uncertainty_score":0.32198745},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011533567343500301,"score_gpt":0.24152224109198725,"score_spread":0.22998867374848694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994268719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24159442,0.000088132976,0.70172244,0.00031407573,0.0004983705,0.00028752792,0.0000061936084,0.0007003232,0.054788508],"genre_scores_gemma":[0.92858595,0.000010759709,0.07041902,0.0006398763,0.0000384416,0.000012818761,0.0000012680589,0.000015080834,0.0002767937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990055,0.000067903355,0.00019275911,0.00023297759,0.0002549737,0.00024587105],"domain_scores_gemma":[0.99890167,0.00027909764,0.000077700555,0.00064467354,0.000020915408,0.00007591844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035363674,0.00015560907,0.00017028415,0.00008043839,0.00011940401,0.00012808427,0.00040814918,0.00006957536,0.00005862758],"category_scores_gemma":[0.00008210646,0.00012703228,0.000115522955,0.0002144143,0.000033546512,0.00021601024,0.00008241579,0.00013586087,0.000078237856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015594552,0.0001037923,0.000015631327,0.000024710698,0.000023758237,0.000006374236,0.0013843913,0.000010998426,0.00008111771,0.9975518,0.0005716913,0.0002241538],"study_design_scores_gemma":[0.00024295681,0.00014312459,0.000043693268,0.000047111254,0.000015658554,0.0000138813,0.00005948094,0.0070063877,0.004882426,0.9852001,0.002091508,0.00025365918],"about_ca_topic_score_codex":9.619932e-7,"about_ca_topic_score_gemma":7.608052e-7,"teacher_disagreement_score":0.6869915,"about_ca_system_score_codex":0.000014316601,"about_ca_system_score_gemma":0.00002540201,"threshold_uncertainty_score":0.5180226},"labels":[],"label_agreement":null},{"id":"W1996830797","doi":"10.1016/j.jpaa.2006.08.006","title":"On the Wronskian combinants of binary forms","year":2006,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of British Columbia","funders":"University of British Columbia","keywords":"Wronskian; Mathematics; Grassmannian; Binary number; Invariant (physics); Pure mathematics; Corollary; Sequence (biology); Polynomial; Discrete mathematics; Mathematical analysis; Mathematical physics; Arithmetic","score_opus":0.007565681681731881,"score_gpt":0.20299056051534597,"score_spread":0.1954248788336141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996830797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880404,0.00017859286,0.006210853,0.0009308838,0.000086425964,0.000056085453,6.583915e-7,0.000008355144,0.0044877757],"genre_scores_gemma":[0.9992613,0.0000130342005,0.00042879677,0.00022591167,0.000046503174,0.000001029169,1.4355432e-7,0.000003304284,0.000019955189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993795,0.000021645646,0.00022541248,0.000078100435,0.00018290873,0.0001124315],"domain_scores_gemma":[0.9994083,0.00013574955,0.00022295237,0.00016850959,0.000029237255,0.000035234807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040948272,0.00007735372,0.00014378123,0.00009466179,0.00009887625,0.000044755085,0.00040515463,0.000032295855,0.000009993865],"category_scores_gemma":[0.0000048840166,0.00004241596,0.00008142752,0.00020968002,0.0000628717,0.00010187106,0.00006108832,0.0001503649,0.000002217415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028414604,0.00009541548,0.00008995866,0.0000054151415,0.00001355582,0.0000056097133,0.00010301568,0.000014053131,0.0034918345,0.9890767,0.0014351823,0.005640871],"study_design_scores_gemma":[0.0004478971,0.00035472706,0.006729547,0.000044288463,0.000012605482,0.00004325651,0.00009024813,0.00006934733,0.008004655,0.983193,0.00092546485,0.00008500458],"about_ca_topic_score_codex":5.576805e-7,"about_ca_topic_score_gemma":7.211994e-7,"teacher_disagreement_score":0.0112209525,"about_ca_system_score_codex":0.000003867599,"about_ca_system_score_gemma":0.000016920696,"threshold_uncertainty_score":0.17296727},"labels":[],"label_agreement":null},{"id":"W1998347421","doi":"10.4064/aa140-4-5","title":"Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin–Shapiro sequences","year":2009,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Sequence (biology); Autocorrelation; Combinatorics; Alphabet; Discrete mathematics; Statistics","score_opus":0.02151816095719357,"score_gpt":0.27013935555273366,"score_spread":0.2486211945955401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998347421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48578376,0.0012225988,0.4796945,0.024785323,0.000779397,0.0011022701,0.00004027707,0.0002478677,0.006344016],"genre_scores_gemma":[0.9860566,0.000115766634,0.013082953,0.0006279496,0.000045841378,0.000018973347,0.0000028867444,0.0000039537153,0.00004502584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990283,0.000082218736,0.00021851226,0.0002685891,0.00020362214,0.00019874476],"domain_scores_gemma":[0.9985379,0.0008554488,0.00012555343,0.00036878214,0.00006070038,0.000051620627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004939913,0.00013069426,0.00016897327,0.00010349699,0.0002784448,0.0001786731,0.00052282546,0.00005527657,0.000008800558],"category_scores_gemma":[0.000121442994,0.00008598035,0.000088617206,0.00033853174,0.00022196562,0.0002768134,0.000054941564,0.000097476,0.0000014097441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052015672,0.000034008266,0.00029876904,0.000009085894,0.00003286122,0.0000011618458,0.000718241,0.000089110006,0.0035998279,0.96103454,0.000199414,0.033930983],"study_design_scores_gemma":[0.0009239532,0.0020152982,0.013556289,0.00012721526,0.000097532065,0.000024888852,0.0001317555,0.08991907,0.0064538745,0.87656814,0.009737855,0.00044411712],"about_ca_topic_score_codex":0.000013045015,"about_ca_topic_score_gemma":0.0000033196661,"teacher_disagreement_score":0.50027287,"about_ca_system_score_codex":0.000008308519,"about_ca_system_score_gemma":0.000030319017,"threshold_uncertainty_score":0.35061768},"labels":[],"label_agreement":null},{"id":"W1998634522","doi":"10.1155/ijmms.2005.2631","title":"On some permutation polynomials over finite fields","year":2005,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science","score_opus":0.02046431334987847,"score_gpt":0.2977287348421196,"score_spread":0.2772644214922411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998634522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4661123,0.00011955509,0.52163506,0.0070083765,0.00040322877,0.0000707023,0.0000018432728,0.000025080273,0.0046239044],"genre_scores_gemma":[0.90229017,0.00004058746,0.09675243,0.0007178335,0.0001495964,0.0000013774712,9.196718e-8,0.0000030025742,0.000044924178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986825,0.000024984492,0.00041365842,0.00012043965,0.0006339401,0.00012448152],"domain_scores_gemma":[0.9984527,0.000983879,0.000278067,0.00010098236,0.00010374023,0.00008060427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011112,0.00009321181,0.00016318778,0.00021699909,0.00008882384,0.00030470104,0.00081036275,0.000037950736,0.000104015206],"category_scores_gemma":[0.0004084074,0.000062819,0.00009668205,0.000115262366,0.00012652247,0.0006720351,0.00010483537,0.00010395709,0.000020361414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044550857,0.0001602609,0.000007935355,0.000008521967,0.000022412334,0.0000057090533,0.0008584812,0.00021676152,0.00015727646,0.9841635,0.00018534137,0.014209297],"study_design_scores_gemma":[0.00023682293,0.00020303158,0.0000479596,0.00012506389,0.000007600412,0.00009728042,0.00008171936,0.045838747,0.0006770395,0.95225084,0.00034792995,0.00008598651],"about_ca_topic_score_codex":4.627156e-7,"about_ca_topic_score_gemma":4.5077869e-7,"teacher_disagreement_score":0.43617788,"about_ca_system_score_codex":0.000017103215,"about_ca_system_score_gemma":0.000034847,"threshold_uncertainty_score":0.2938239},"labels":[],"label_agreement":null},{"id":"W1998762286","doi":"10.1090/s0025-5718-2012-02591-9","title":"Tabulation of cubic function fields via polynomial binary cubic forms","year":2012,"lang":"lv","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Algorithm; Type (biology); Annotation; Artificial intelligence; Computer science; Mathematics; Biology","score_opus":0.019360540611317284,"score_gpt":0.2518147950766555,"score_spread":0.2324542544653382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998762286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42936978,0.00023783652,0.5688781,0.000056444762,0.0006906196,0.00020265173,0.0000029977055,0.000039152652,0.00052240567],"genre_scores_gemma":[0.97140545,0.000010852646,0.028282495,0.000026652398,0.00019502119,0.0000068581,0.00002015141,0.000018670062,0.00003387125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799997,0.00011468933,0.0008765067,0.00021750989,0.00047019406,0.0003211104],"domain_scores_gemma":[0.9979846,0.00038185754,0.0009049178,0.00040934153,0.00022260196,0.00009668887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096192124,0.00023684665,0.00041667887,0.00039763286,0.00012765329,0.00004851326,0.000341619,0.00019373455,0.000048989423],"category_scores_gemma":[0.00004626627,0.00023429419,0.0002424718,0.00067294633,0.00010883921,0.0008809476,0.00015782028,0.00016094053,0.000034221033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053233874,0.0055321055,0.0048390045,0.0054790243,0.0006582784,0.0000024034468,0.048956666,0.054964237,0.042406533,0.5823249,0.0016324661,0.25267202],"study_design_scores_gemma":[0.0008951535,0.0010498224,0.010370833,0.00043976295,0.00024380288,0.000017449052,0.00034532472,0.78652847,0.01152707,0.18804035,0.00010568252,0.00043630722],"about_ca_topic_score_codex":0.000011721624,"about_ca_topic_score_gemma":0.0000013663888,"teacher_disagreement_score":0.7315642,"about_ca_system_score_codex":0.000033158485,"about_ca_system_score_gemma":0.000046374913,"threshold_uncertainty_score":0.955424},"labels":[],"label_agreement":null},{"id":"W1999879389","doi":"10.1109/bsc.2010.5472985","title":"New transmission-decoding schemes based on Reed-Solomon codes","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Computer science; Reed–Solomon error correction; Erasure; Code word; List decoding; Sequential decoding; Algorithm; Transmission (telecommunications); Transmitter; Fountain code; Luby transform code; Block code; Theoretical computer science; Concatenated error correction code; Telecommunications","score_opus":0.009335214823427812,"score_gpt":0.23482049400859198,"score_spread":0.22548527918516417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999879389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014914148,0.000012622647,0.94804096,0.0016070054,0.00033514499,0.00006820286,3.554008e-7,0.0004095511,0.034611996],"genre_scores_gemma":[0.72752863,0.0000019784502,0.27128506,0.00073388236,0.000060650287,0.0000025807024,6.23397e-7,0.000006135871,0.000380435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99908537,0.000034187717,0.00013255098,0.0003254944,0.00019926147,0.00022313056],"domain_scores_gemma":[0.9990293,0.00019729928,0.000032278047,0.0005363238,0.000024442134,0.00018040281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032015727,0.00012216126,0.00011139533,0.00014671488,0.00016377892,0.00014653188,0.00073962647,0.0000743323,0.00046273324],"category_scores_gemma":[0.000026596574,0.00010152548,0.000110500965,0.00035710412,0.000030262228,0.00021755039,0.000044534896,0.00023743193,0.000055345685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020510193,0.000045747183,0.00037635944,0.0000048685815,0.0000049036057,0.000004509114,0.00011560778,0.000017084825,0.028284555,0.5836858,0.001445593,0.38599443],"study_design_scores_gemma":[0.0017953252,0.00063998246,0.0019870473,0.00014385128,0.000019366993,0.000016991347,0.00003792669,0.30425692,0.33845064,0.18493976,0.16663592,0.0010762681],"about_ca_topic_score_codex":0.000014720781,"about_ca_topic_score_gemma":0.00001078478,"teacher_disagreement_score":0.7126145,"about_ca_system_score_codex":0.0000041955873,"about_ca_system_score_gemma":0.00005995234,"threshold_uncertainty_score":0.50666046},"labels":[],"label_agreement":null},{"id":"W2000061862","doi":"10.1016/j.ffa.2011.09.003","title":"A generalization of the Hansen–Mullen conjecture on irreducible polynomials over finite fields","year":2011,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Conjecture; Finite field; Generalization; Degree (music); Field (mathematics); Combinatorics; TRACE (psycholinguistics); Order (exchange); Pure mathematics; Constant (computer programming); Zero (linguistics); Prime (order theory); Discrete mathematics; Mathematical analysis","score_opus":0.02334978394381537,"score_gpt":0.22113503908946147,"score_spread":0.1977852551456461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000061862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03343995,0.00018851564,0.9530397,0.0012224579,0.00017094454,0.00039785678,0.000042127478,0.0000715585,0.011426885],"genre_scores_gemma":[0.9975105,0.000047850008,0.0011649033,0.00093516824,0.000059176633,0.00008185214,0.0000045745965,0.0000057140346,0.00019028407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993557,0.000054549982,0.00016755996,0.00023262315,0.000067634865,0.00012196097],"domain_scores_gemma":[0.99892926,0.00023887343,0.00009982319,0.0006581274,0.00003398156,0.000039935087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012767651,0.0001110647,0.00011587733,0.00007276848,0.00019331777,0.000035268185,0.0004649051,0.00011335463,0.00007862436],"category_scores_gemma":[0.00001758932,0.00007370197,0.000089646026,0.0003464662,0.000063888845,0.00007002057,0.00012145998,0.00012725515,0.000005014197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016959906,0.00012157885,0.0006019831,0.000019107545,0.000038185586,2.1088955e-7,0.004777673,0.00020811017,0.00042393146,0.9753504,0.00096992357,0.017471934],"study_design_scores_gemma":[0.0010018445,0.0005646596,0.012399664,0.00013623686,0.000055324785,0.00001065945,0.00022855597,0.016348777,0.04775205,0.83865315,0.08214315,0.00070593023],"about_ca_topic_score_codex":0.000042976906,"about_ca_topic_score_gemma":0.0000200759,"teacher_disagreement_score":0.9640705,"about_ca_system_score_codex":0.0000031035106,"about_ca_system_score_gemma":0.000022953736,"threshold_uncertainty_score":0.30054793},"labels":[],"label_agreement":null},{"id":"W2000470138","doi":"10.1016/j.ffa.2008.12.003","title":"On inverse permutation polynomials","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Permutation (music); Inverse; Finite field; Polynomial; Combinatorics; Field (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.01837467303147693,"score_gpt":0.2194095155721322,"score_spread":0.20103484254065526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000470138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05842571,0.000048148966,0.93090224,0.0008913045,0.000042454914,0.00014964976,0.000007877185,0.00011047747,0.009422123],"genre_scores_gemma":[0.99689835,0.00004590153,0.0018433342,0.00093308307,0.0000419786,0.00008527242,0.000005482305,0.0000030454464,0.00014356677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999595,0.000021359068,0.00008375862,0.00017202484,0.0000412186,0.000086638],"domain_scores_gemma":[0.9993759,0.00024086796,0.00003125215,0.00028532685,0.000019995456,0.000046669855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068892194,0.000067524896,0.00006288228,0.0000716084,0.00027644687,0.00002882051,0.00019302327,0.000044975503,0.000021269074],"category_scores_gemma":[0.0000101841,0.000055768905,0.000038023987,0.00020656943,0.000043562643,0.00008988328,0.000044811844,0.00007596524,0.00004437924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045440406,0.000046750432,0.000099016885,0.000003133362,0.000008019653,7.7694295e-7,0.0015701907,0.00004513995,0.00015704366,0.9713881,0.00094830716,0.025728956],"study_design_scores_gemma":[0.0005071282,0.00027172462,0.0032919864,0.000017884473,0.0000070998562,0.000037542446,0.0001417327,0.01460306,0.002160445,0.90022135,0.07835282,0.00038722187],"about_ca_topic_score_codex":0.0000047344993,"about_ca_topic_score_gemma":0.0000026638695,"teacher_disagreement_score":0.9384726,"about_ca_system_score_codex":0.0000031321754,"about_ca_system_score_gemma":0.000012819128,"threshold_uncertainty_score":0.22741899},"labels":[],"label_agreement":null},{"id":"W2000760108","doi":"10.1016/j.jsc.2011.12.009","title":"Efficient algorithms for order basis computation","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Basis (linear algebra); Order (exchange); Degree (music); Computation; Algorithm; Matrix (chemical analysis); Row; Field (mathematics); Exponent; Matrix multiplication; Normal basis; Row and column spaces; Combinatorics; Discrete mathematics; Computer science; Pure mathematics; Geometry; Galois theory","score_opus":0.04028607635485304,"score_gpt":0.2782715342282155,"score_spread":0.23798545787336245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000760108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1181038,0.00007041769,0.8803029,0.00016782305,0.000768618,0.00013859615,0.0000011106657,0.000043811568,0.0004029104],"genre_scores_gemma":[0.70789486,0.0000026308408,0.2918818,0.000092663235,0.00011203898,0.0000031510285,0.0000010327942,0.0000068985278,0.000004944547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988165,0.00008610889,0.00047538223,0.00016430701,0.0002803295,0.0001773883],"domain_scores_gemma":[0.998447,0.00019428447,0.00046092572,0.0001103831,0.00069485954,0.00009252498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007737046,0.00011816913,0.00020928342,0.0003758604,0.00013179974,0.000076662014,0.0003602827,0.000047108522,0.0000073784463],"category_scores_gemma":[0.000053044478,0.00010564674,0.00017285241,0.0006050514,0.00003347585,0.00020082806,0.000048638976,0.000107862994,0.000006055114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016009361,0.00069461117,0.0003829032,0.00005867708,0.00016999763,0.000019324587,0.012522354,0.085644774,0.0004851657,0.08035469,0.000951783,0.81855565],"study_design_scores_gemma":[0.0013115582,0.00067232235,0.0088296,0.000062689825,0.000044465545,0.0001336197,0.00019626126,0.8973155,0.0007455114,0.09023398,0.00024594445,0.00020854596],"about_ca_topic_score_codex":0.0000039978418,"about_ca_topic_score_gemma":4.5583073e-7,"teacher_disagreement_score":0.8183471,"about_ca_system_score_codex":0.000033819782,"about_ca_system_score_gemma":0.0000761643,"threshold_uncertainty_score":0.4308149},"labels":[],"label_agreement":null},{"id":"W2000812989","doi":"10.1049/ip-com:20050493","title":"Improved tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN and block fading channels","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Mathematics; Fading; Additive white Gaussian noise; Decoding methods; Algorithm; Block code; Bounding overwatch; Combinatorics; Topology (electrical circuits); Computer science; Statistics; White noise; Mathematical analysis","score_opus":0.036291317200137244,"score_gpt":0.2669017111565289,"score_spread":0.23061039395639166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000812989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9926556,0.00041735542,0.00074123254,0.002963875,0.00008402598,0.00055453175,0.000007464384,0.0001204277,0.002455505],"genre_scores_gemma":[0.987203,0.000051949653,0.012477744,0.00007142771,0.00004537213,0.0001022094,0.0000023772407,0.000012628897,0.00003330336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870074,0.00007720969,0.00041798176,0.00035135783,0.00017003421,0.00028268326],"domain_scores_gemma":[0.9982873,0.0003889014,0.00023672551,0.00085403514,0.00018248433,0.000050538925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100009,0.00018461967,0.00022022564,0.00016195686,0.0006347608,0.00018536708,0.001830491,0.00008549997,0.0000054010634],"category_scores_gemma":[0.00012918752,0.00015609412,0.00008675773,0.0008867134,0.0003752794,0.0003436746,0.0007809358,0.000348255,0.0000019173278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009695353,0.0013355933,0.014821434,0.00021563843,0.00008478683,0.0000013214207,0.0090035,0.00046344002,0.09404475,0.8761546,0.00066109217,0.0031169052],"study_design_scores_gemma":[0.0020510063,0.00093185646,0.0140576735,0.0010734996,0.0001255726,0.000063345986,0.0023210857,0.58103067,0.046490684,0.34504429,0.0054025017,0.0014078339],"about_ca_topic_score_codex":0.00014676503,"about_ca_topic_score_gemma":0.00015041385,"teacher_disagreement_score":0.5805672,"about_ca_system_score_codex":0.000042910287,"about_ca_system_score_gemma":0.00004466189,"threshold_uncertainty_score":0.6365333},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Computer science; Artificial intelligence","score_opus":0.03504730502769028,"score_gpt":0.24502691892162096,"score_spread":0.20997961389393066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000840326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85054976,0.00047945263,0.14688802,0.0006665012,0.00012424833,0.00032199087,0.000006084907,0.000020512167,0.00094344787],"genre_scores_gemma":[0.9573113,0.000008074733,0.042510763,0.000086484535,0.000030994328,0.0000036732447,1.8608537e-7,0.000008777182,0.000039756258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874085,0.00008643536,0.0005245334,0.00016966846,0.0003355156,0.00014300559],"domain_scores_gemma":[0.99886024,0.00013076572,0.00049004826,0.0003397485,0.00014448485,0.000034684443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006316702,0.00014268523,0.00025441492,0.00006865941,0.00009734302,0.000053773758,0.00040046952,0.00005586334,0.0000073916162],"category_scores_gemma":[0.000047070243,0.00009894112,0.00012065404,0.00026139314,0.0002701187,0.0001734173,0.0002290197,0.00007880965,0.000003461963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081053375,0.0017026187,0.0017751616,0.0039588665,0.00022462965,3.841091e-7,0.09957519,0.0028601862,0.013842033,0.72598803,0.00025081274,0.14974101],"study_design_scores_gemma":[0.0007658994,0.0002501457,0.0033558595,0.0014954499,0.00011450926,0.000016916576,0.0008147842,0.66328627,0.060505662,0.26839665,0.0006723909,0.0003254586],"about_ca_topic_score_codex":0.000009518064,"about_ca_topic_score_gemma":0.000009771411,"teacher_disagreement_score":0.6604261,"about_ca_system_score_codex":0.00001568277,"about_ca_system_score_gemma":0.000044196888,"threshold_uncertainty_score":0.4034702},"labels":[],"label_agreement":null},{"id":"W2001572656","doi":"10.1145/1358183.1358185","title":"Irreducible polynomials and barker sequences","year":2007,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Computing and Communication Foundations","keywords":"Mathematics; Irreducibility; Combinatorics; Sequence (biology); Conjecture; Prime (order theory); Modulo; Integer (computer science); Discrete mathematics; Polynomial; Degree (music); Pure mathematics","score_opus":0.038182062635979064,"score_gpt":0.30782306990029473,"score_spread":0.26964100726431567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001572656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2257479,0.0023096653,0.76035094,0.006417675,0.00044038313,0.00026128776,0.0000018111034,0.00032805704,0.004142287],"genre_scores_gemma":[0.65788347,0.00014678555,0.3413469,0.0005617522,0.00003485957,0.000008484163,0.0000021306466,0.0000051220686,0.000010532552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987069,0.0001928928,0.00034276125,0.00033959936,0.00012764714,0.00029023804],"domain_scores_gemma":[0.99498177,0.0011410997,0.000080164355,0.0036585794,0.000048739428,0.000089657704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015984518,0.0001368775,0.00016479255,0.0003502819,0.00025615696,0.00020183738,0.0042462265,0.000065573484,0.000008162772],"category_scores_gemma":[0.000059088616,0.00013939239,0.00005155926,0.00084809423,0.00025173445,0.0005034807,0.0029102324,0.00023548547,0.000018856384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067893593,0.00014742,0.010185028,0.0000074442146,0.000023973047,0.0000065311538,0.001919491,0.000013825391,0.00034599734,0.6067245,0.0005590008,0.38006],"study_design_scores_gemma":[0.0010325247,0.0002135215,0.17607448,0.00017664694,0.0000168528,0.00015556277,0.00016655565,0.029877149,0.0013401821,0.76094985,0.029087579,0.00090911664],"about_ca_topic_score_codex":0.000051595493,"about_ca_topic_score_gemma":0.0000825243,"teacher_disagreement_score":0.43213555,"about_ca_system_score_codex":0.000027392665,"about_ca_system_score_gemma":0.000039269795,"threshold_uncertainty_score":0.7890616},"labels":[],"label_agreement":null},{"id":"W2003148723","doi":"10.1145/1838599.1838614","title":"Abstract only","year":2010,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplicative function; Finite field; Univariate; Mathematics; Binomial (polynomial); Constant (computer programming); Order (exchange); Degree (music); Polynomial; Combinatorics; Discrete mathematics; Applied mathematics; Computer science; Statistics; Multivariate statistics; Mathematical analysis","score_opus":0.027788230282145096,"score_gpt":0.29051167572209324,"score_spread":0.26272344543994813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003148723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49284866,0.00028978792,0.47786868,0.013511942,0.0016534051,0.00036057027,0.000003731165,0.00091404445,0.012549178],"genre_scores_gemma":[0.63704354,0.000026001759,0.36236843,0.00048418227,0.000046645207,0.000013466252,0.000004129297,0.000006225023,0.0000073732535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989199,0.000097460084,0.00029467818,0.00029959404,0.00014229969,0.00024603464],"domain_scores_gemma":[0.99188936,0.00074211025,0.000079569756,0.007149907,0.00006306642,0.000076001896],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00059853966,0.00013752753,0.00013966937,0.00026648244,0.00022648083,0.00021707106,0.009341316,0.000084604864,0.000035178884],"category_scores_gemma":[0.00006803376,0.00014370926,0.00008741031,0.00074994407,0.00016867867,0.0004929038,0.0032269654,0.00070305454,0.00012956445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000132158,0.00019047986,0.003908031,0.0000030386789,0.000008858259,0.0000028376744,0.00044171594,0.0000068897425,0.00040560044,0.7088483,0.00046795313,0.28571498],"study_design_scores_gemma":[0.0005608385,0.00006224401,0.26034248,0.0000494155,0.000005310083,0.00006750666,0.00001343233,0.026884435,0.00024048149,0.66535,0.04590149,0.00052233884],"about_ca_topic_score_codex":0.000027772321,"about_ca_topic_score_gemma":0.00026325035,"teacher_disagreement_score":0.28519267,"about_ca_system_score_codex":0.000013014042,"about_ca_system_score_gemma":0.000070538736,"threshold_uncertainty_score":0.99601865},"labels":[],"label_agreement":null},{"id":"W2003290576","doi":"10.4310/atmp.2011.v15.n6.a7","title":"Codes and supersymmetry in one dimension","year":2011,"lang":"en","type":"article","venue":"Advances in Theoretical and Mathematical Physics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Central Florida; U.S. Department of Energy; National Science Foundation","keywords":"Dimension (graph theory); Topology (electrical circuits); Enumeration; Code (set theory); Computation","score_opus":0.014491706537410855,"score_gpt":0.23449860894627372,"score_spread":0.22000690240886286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003290576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34360027,0.0010005285,0.6314151,0.00015058534,0.00007143184,0.00018013154,0.0000013305203,0.00007393897,0.023506636],"genre_scores_gemma":[0.95815134,0.00025579808,0.041452903,0.00011180308,0.000013050209,0.0000078644625,2.2402577e-7,0.0000045911356,0.0000024042545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992123,0.00006653514,0.00016932873,0.00024670528,0.00010586473,0.00019922588],"domain_scores_gemma":[0.9992962,0.00040883487,0.000019888641,0.00018734511,0.000015663301,0.000072089024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000301638,0.000107303444,0.00020560075,0.00004637026,0.00003274697,0.00002195008,0.00017507987,0.00004091677,0.00002746154],"category_scores_gemma":[0.00008988766,0.00008460377,0.000024072348,0.0002410641,0.00060226757,0.00035229573,0.00019741675,0.00013651403,0.0000077739805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017363882,0.00019759238,0.00040857305,0.000050852996,0.0000022017039,0.000004831526,0.00092233135,4.5919774e-7,0.00007453078,0.9665762,6.045662e-7,0.03174441],"study_design_scores_gemma":[0.0002183022,0.00009162209,0.00051393034,0.00010430682,0.0000040508976,0.000003781225,0.000072629155,0.0037900014,0.0012214226,0.9938491,0.0000113852275,0.00011947918],"about_ca_topic_score_codex":6.798361e-7,"about_ca_topic_score_gemma":0.0000010224048,"teacher_disagreement_score":0.6145511,"about_ca_system_score_codex":0.0000046338005,"about_ca_system_score_gemma":0.000003599552,"threshold_uncertainty_score":0.34500417},"labels":[],"label_agreement":null},{"id":"W2004251193","doi":"10.1016/j.jda.2012.04.006","title":"Quasi-cyclic codes over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:math> and enumeration of defining polynomials","year":2012,"lang":"lv","type":"article","venue":"Journal of Discrete Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hamming distance; Mathematics; Circulant matrix; Hamming code; Combinatorics; Minimum distance; Discrete mathematics; Code (set theory); Algorithm; Computer science; Block code","score_opus":0.018735499125186666,"score_gpt":0.2489108541747267,"score_spread":0.23017535504954004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004251193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78742796,0.004059608,0.010560522,0.00067713874,0.0041136364,0.000043694912,0.00028777166,0.00011431368,0.19271533],"genre_scores_gemma":[0.9843287,0.0014734629,0.010262171,0.00086778594,0.0022808146,0.00014796563,0.00019817917,0.00033514522,0.00010577364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9920916,0.0005763043,0.0021259892,0.001091516,0.0022459268,0.0018686868],"domain_scores_gemma":[0.9925372,0.0014306309,0.0031759744,0.0015835816,0.00020056155,0.0010720325],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0035889156,0.0007187771,0.000444773,0.00067125045,0.0012790661,0.0016715475,0.0019473605,0.0013786386,0.12546863],"category_scores_gemma":[0.0007921825,0.0012164849,0.0016574961,0.0011105546,0.0011676992,0.0030822768,0.0014537153,0.0014522419,0.00038990792],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00223379,0.00048168979,0.00011487275,0.0008387512,0.002246765,0.00075613405,0.005841002,0.0008689479,0.0063852076,0.87774354,0.09299895,0.009490365],"study_design_scores_gemma":[0.002990435,0.002685714,0.00059928227,0.0015744946,0.0014935791,0.002558395,0.0016931976,0.08677646,0.8959108,0.00039068094,0.001956357,0.0013706215],"about_ca_topic_score_codex":0.00082315505,"about_ca_topic_score_gemma":0.00031472818,"teacher_disagreement_score":0.8895256,"about_ca_system_score_codex":0.000015827169,"about_ca_system_score_gemma":0.0010696473,"threshold_uncertainty_score":0.9999178},"labels":[],"label_agreement":null},{"id":"W2004773548","doi":"10.1016/j.ffa.2005.05.008","title":"On the structure of uniform one-factorizations from starters in finite fields","year":2005,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Factorization; Graph; Complete graph; Integer (computer science); Combinatorics; Construct (python library); Discrete mathematics; Existential quantification; Computer science; Algorithm","score_opus":0.012452315119829494,"score_gpt":0.20865475686960527,"score_spread":0.19620244174977577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004773548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11205203,0.00005994388,0.8817404,0.0034883143,0.00003800641,0.0002231274,0.00013469784,0.000038020706,0.0022254754],"genre_scores_gemma":[0.9971621,0.00003665705,0.001932265,0.00075515435,0.000046106128,0.000024104978,0.000019560432,0.0000037218308,0.000020300467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994511,0.000030962954,0.00016224607,0.00017946011,0.0000672407,0.0001089772],"domain_scores_gemma":[0.9984394,0.00096865447,0.00006115799,0.00047082567,0.000026558015,0.000033440483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000651174,0.000091535345,0.00009735406,0.00008507077,0.00013025675,0.000044045402,0.00040333706,0.00008364088,0.000106147665],"category_scores_gemma":[0.000018390541,0.00006414545,0.00004179519,0.000374424,0.00004374506,0.00009925704,0.000069339265,0.00018986182,0.000004171233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058088,0.00006513507,0.0003000475,0.00000360855,0.00001744558,7.5194066e-8,0.0026936778,0.0010101905,0.00027527314,0.9671038,0.00007079527,0.028454175],"study_design_scores_gemma":[0.00029004764,0.00010677391,0.0031483194,0.000048348975,0.000008398824,3.9896926e-7,0.00023540482,0.022178056,0.0032263699,0.95845217,0.012105379,0.00020032036],"about_ca_topic_score_codex":0.000033564622,"about_ca_topic_score_gemma":0.00027045707,"teacher_disagreement_score":0.8851101,"about_ca_system_score_codex":0.000005542337,"about_ca_system_score_gemma":0.000016640983,"threshold_uncertainty_score":0.26157755},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Binary Golay code; Mathematics; Combinatorics; Autocorrelation; Binary number; Complementary sequences; Algorithm; Discrete mathematics; Arithmetic; Statistics","score_opus":0.05357796670888526,"score_gpt":0.27789686899951727,"score_spread":0.224318902290632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006138621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111036606,0.000014946494,0.88770115,0.000058109406,0.00016828906,0.00030109525,0.0000047789335,0.000042822503,0.0006722108],"genre_scores_gemma":[0.63401884,4.748631e-7,0.36592025,0.000021449385,0.000005340273,0.000011187726,0.000001940088,0.0000048148436,0.000015718699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914885,0.00005599446,0.00035277513,0.00014500758,0.00017872718,0.0001186651],"domain_scores_gemma":[0.9989686,0.00034936194,0.00020768828,0.00022939342,0.00020584099,0.000039105773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006204232,0.00008840716,0.00020044019,0.00017864443,0.000050126626,0.00003124003,0.00025261845,0.00003015222,0.0000038204835],"category_scores_gemma":[0.00014272232,0.00008816369,0.0001010953,0.0003593993,0.000027136402,0.00015140428,0.000033375687,0.000029711196,0.0000048833417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011281061,0.0001211528,0.000030381709,0.0002745334,0.000022827424,1.2376825e-7,0.0054070707,0.0029191368,0.008733336,0.9760274,0.0003715287,0.0060811904],"study_design_scores_gemma":[0.0004954455,0.0003904218,0.000174277,0.00012921078,0.000020106034,0.00000451816,0.0003538713,0.18212548,0.010720538,0.804759,0.00066682487,0.00016028342],"about_ca_topic_score_codex":0.0000014629303,"about_ca_topic_score_gemma":0.0000010821644,"teacher_disagreement_score":0.52298224,"about_ca_system_score_codex":0.000011684912,"about_ca_system_score_gemma":0.000022177039,"threshold_uncertainty_score":0.3595211},"labels":[],"label_agreement":null},{"id":"W2006913132","doi":"10.1007/s00224-013-9486-8","title":"The Coolest Way to Generate Binary Strings","year":2013,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Lexicographical order; De Bruijn sequence; Combinatorics; Binary number; Mathematics; Order (exchange); String (physics); Discrete mathematics; Type (biology); Arithmetic","score_opus":0.012509218171598212,"score_gpt":0.2153810577082891,"score_spread":0.20287183953669088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006913132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6608177,0.0003917171,0.33453983,0.00026273122,0.0010955763,0.00034903674,7.812557e-7,0.00021150958,0.0023311467],"genre_scores_gemma":[0.99785954,0.000003272086,0.001498717,0.00012592555,0.0001589839,0.000013695368,3.7665077e-7,0.000012121258,0.00032734495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811614,0.0005512384,0.00041027842,0.00029643415,0.00025528303,0.000370653],"domain_scores_gemma":[0.99782336,0.0008652864,0.00020135414,0.0008204146,0.00017097338,0.000118632204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024349608,0.00016505235,0.00023311576,0.00012282832,0.00044604237,0.00034120955,0.0015911497,0.00004401572,0.0000048909774],"category_scores_gemma":[0.000055552824,0.00011534688,0.00009762104,0.0005411806,0.00011589229,0.00016053997,0.000438377,0.00012294344,0.0001452707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010391614,0.000022113907,0.00010673303,0.000027021317,0.000032071803,0.0000016487031,0.0013050425,0.0030343856,0.0037448693,0.9580069,0.0011599198,0.03254886],"study_design_scores_gemma":[0.0019817569,0.0021892232,0.03550705,0.0020453536,0.00007392517,0.00022647,0.0046749623,0.4891239,0.019803675,0.41133693,0.030291442,0.0027452877],"about_ca_topic_score_codex":0.000039400253,"about_ca_topic_score_gemma":4.9973846e-7,"teacher_disagreement_score":0.54667,"about_ca_system_score_codex":0.00001878281,"about_ca_system_score_gemma":0.000021882854,"threshold_uncertainty_score":0.47037092},"labels":[],"label_agreement":null},{"id":"W2006968455","doi":"10.1023/b:desi.0000012442.78414.e4","title":"On the Minimum Weight of Codes over F5 Constructed from Certain Conference Matrices","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Minimum weight; Minimum distance; Mathematics; Combinatorics; Linear code; Discrete mathematics; Block code; Algorithm; Decoding methods","score_opus":0.02001607963608638,"score_gpt":0.22646405881484927,"score_spread":0.2064479791787629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006968455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72210246,0.0006207432,0.27475503,0.0004286766,0.00015503787,0.00022674011,0.000064050946,0.00012287902,0.0015243667],"genre_scores_gemma":[0.98351526,0.00021669903,0.015804714,0.00038509167,0.000034858447,0.00002241954,0.000006678277,0.000011540757,0.0000027285932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982578,0.00021208615,0.00034352636,0.00050382066,0.00034744997,0.0003353141],"domain_scores_gemma":[0.9979531,0.00093934755,0.00021413079,0.0006590525,0.00011106785,0.00012326676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034026583,0.00029307563,0.00034388455,0.0003145418,0.00030151228,0.00024230962,0.00091461773,0.00011320052,0.00012695056],"category_scores_gemma":[0.000031014068,0.00020279898,0.00021956285,0.001059675,0.0005999988,0.00022902423,0.00013678783,0.00019841638,0.000005507096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075717624,0.00010454824,0.0031139532,0.000013905214,0.000118989235,0.000008737345,0.0008620891,0.000017068674,0.009532866,0.9830467,0.0003333552,0.0027720497],"study_design_scores_gemma":[0.0010481378,0.00043186685,0.008181108,0.00019019649,0.000060714156,0.000009397247,0.00044277808,0.00076197815,0.017661788,0.97023803,0.00054799026,0.00042599218],"about_ca_topic_score_codex":0.00017114214,"about_ca_topic_score_gemma":0.000026297272,"teacher_disagreement_score":0.2614128,"about_ca_system_score_codex":0.0000076285423,"about_ca_system_score_gemma":0.00006131915,"threshold_uncertainty_score":0.82699025},"labels":[],"label_agreement":null},{"id":"W2007194092","doi":"10.4236/jis.2013.41001","title":"Frequency Hopping Spread Spectrum Security Improvement with Encrypted Spreading Codes in a Partial Band Noise Jamming Environment","year":2013,"lang":"en","type":"article","venue":"Journal of Information Security","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Iran Telecommunication Research Center; Federation for the Humanities and Social Sciences","keywords":"Frequency-hopping spread spectrum; Spread spectrum; Computer science; Encryption; Jamming; Interference (communication); Code (set theory); Noise (video); Computer network; Vulnerability (computing); Telecommunications; Computer security; Code division multiple access; Channel (broadcasting)","score_opus":0.004401177650393814,"score_gpt":0.18768612030615933,"score_spread":0.1832849426557655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007194092","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87368745,0.00004704582,0.1241909,0.0006040409,0.0001624823,0.00026447658,0.0000026657808,0.00002919711,0.0010117599],"genre_scores_gemma":[0.9948313,0.000050070055,0.00483051,0.0002024201,0.000066370754,0.0000124588605,0.0000019104423,0.000004100405,8.499062e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809504,0.00009013879,0.0008492601,0.00013076297,0.0005075499,0.00032726346],"domain_scores_gemma":[0.9986159,0.000088132336,0.00075656665,0.00027679585,0.00010374762,0.0001588442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010508565,0.00018463566,0.00027016888,0.00042778451,0.0001385374,0.00036179062,0.0005117278,0.00006882606,0.00009094875],"category_scores_gemma":[0.000046100948,0.00014962652,0.000106370215,0.00036104783,0.000060345013,0.005408195,0.00009733189,0.00039516506,0.000027346656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090506725,0.0021653313,0.13354918,0.0009677689,0.0008228079,0.00023905237,0.2827032,0.006324885,0.042204846,0.377712,0.0013806924,0.15102516],"study_design_scores_gemma":[0.015136555,0.006805322,0.09472726,0.0024643505,0.00017756621,0.0010080631,0.010819485,0.12023672,0.18636212,0.55277246,0.006238929,0.0032511444],"about_ca_topic_score_codex":0.00010740851,"about_ca_topic_score_gemma":0.000017324906,"teacher_disagreement_score":0.2718837,"about_ca_system_score_codex":0.00015449237,"about_ca_system_score_gemma":0.000075055716,"threshold_uncertainty_score":0.6101592},"labels":[],"label_agreement":null},{"id":"W2007520294","doi":"10.1007/s10878-008-9194-5","title":"Periodic complementary binary sequences and Combinatorial Optimization algorithms","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Formalism (music); Autocorrelation; Combinatorial optimization; Theory of computation; Algorithm; Binary number; Mathematics; Optimization problem; Computer science; Theoretical computer science","score_opus":0.01615915097400654,"score_gpt":0.2401402947344964,"score_spread":0.2239811437604899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007520294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024421992,0.0005542338,0.96290886,0.00072502013,0.010640633,0.00024009192,0.0000038428557,0.00009558118,0.00040976005],"genre_scores_gemma":[0.658083,0.0007167142,0.34023413,0.00013167544,0.0007870735,0.000004670954,0.000013707297,0.000020558933,0.000008444444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788237,0.00029262865,0.0006932239,0.00026073426,0.0006228711,0.0002481731],"domain_scores_gemma":[0.99824905,0.00015900095,0.0006427518,0.00025240378,0.0005133608,0.00018345588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075814535,0.00022010405,0.0003772433,0.0004038619,0.0005321428,0.00019494722,0.00063833216,0.000113961665,0.00005247808],"category_scores_gemma":[0.00008818183,0.000208394,0.00013894068,0.0007385272,0.00019234707,0.0016425094,0.00016993357,0.00026039337,0.0000013601882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039617007,0.0006481174,0.0024191898,0.00003504055,0.00017013239,0.00020338902,0.0024567721,0.82265747,0.00020545197,0.1667306,0.001931213,0.0021464566],"study_design_scores_gemma":[0.009146118,0.0032594174,0.00064566365,0.00014369728,0.00011310563,0.0010837249,0.00022788685,0.9264815,0.0006036775,0.05522406,0.0022999865,0.0007712044],"about_ca_topic_score_codex":0.0000089679415,"about_ca_topic_score_gemma":6.676575e-8,"teacher_disagreement_score":0.63366103,"about_ca_system_score_codex":0.000077565586,"about_ca_system_score_gemma":0.00020255076,"threshold_uncertainty_score":0.8498061},"labels":[],"label_agreement":null},{"id":"W2009069065","doi":"10.1016/j.dam.2015.03.001","title":"Charm bracelets and their application to the construction of periodic Golay pairs","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Wilfrid Laurier University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Modulo; Binary Golay code; Combinatorics; Ring of integers; Charm (quantum number); Discrete mathematics; Arithmetic; Algorithm; Algebraic number field; Particle physics; Physics","score_opus":0.013737063935454489,"score_gpt":0.22188586029084437,"score_spread":0.20814879635538988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009069065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10347734,0.000046081383,0.89201397,0.00079314987,0.000052832802,0.00036093107,0.0000041873022,0.000078728175,0.0031728055],"genre_scores_gemma":[0.9264669,0.0000073888536,0.07328974,0.00012124936,0.00002814359,0.00007045263,0.0000020092484,0.0000078255725,0.0000062995437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930274,0.000022832679,0.00019677186,0.000194375,0.00015201708,0.00013127484],"domain_scores_gemma":[0.99911547,0.00009523068,0.00012388226,0.0005310272,0.00004636995,0.00008799613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005919642,0.00011620348,0.00015539803,0.00005957454,0.0000945412,0.00006847872,0.00043255003,0.000036833368,0.0000021741182],"category_scores_gemma":[0.000019446306,0.000074416996,0.000038131435,0.00031462,0.000116464675,0.00007376747,0.00017953703,0.0000711614,0.000015940215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069679945,0.000023291566,0.000012248625,0.0000371191,0.000013367289,8.7891145e-8,0.027769236,0.000021140915,0.003419885,0.94201934,0.00014868545,0.026528629],"study_design_scores_gemma":[0.0005878433,0.00016089962,0.00012187476,0.00005512579,0.000034421235,0.00004942308,0.026596183,0.030068276,0.025097935,0.9054465,0.011326438,0.00045507064],"about_ca_topic_score_codex":0.0000025473435,"about_ca_topic_score_gemma":0.000002037306,"teacher_disagreement_score":0.8229896,"about_ca_system_score_codex":0.0000091642305,"about_ca_system_score_gemma":0.000020542051,"threshold_uncertainty_score":0.3034637},"labels":[],"label_agreement":null},{"id":"W2009435168","doi":"10.1016/j.aim.2009.01.001","title":"Counting hyperelliptic curves","year":2009,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Hyperelliptic curve; Genus; Hyperelliptic curve cryptography; Integer (computer science); Product (mathematics); Twist; Finite field; Combinatorics; Pure mathematics; Discrete mathematics; Geometry; Botany","score_opus":0.010168322270105104,"score_gpt":0.2613373034918693,"score_spread":0.2511689812217642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009435168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015735883,0.014345022,0.89083815,0.0009839395,0.00029668378,0.00020338272,5.455016e-7,0.00032311212,0.07727329],"genre_scores_gemma":[0.6333311,0.005501403,0.35929772,0.0016572908,0.00004969345,0.000009377518,6.631272e-7,0.000008592169,0.00014409953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992944,0.000020286714,0.00019666314,0.00015507427,0.00015362568,0.00017997937],"domain_scores_gemma":[0.99936944,0.00017066565,0.00007114051,0.00034191483,0.000021459347,0.000025379815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035045555,0.00008744174,0.0001325781,0.00007423933,0.000047136095,0.00004063943,0.0005431145,0.00002057757,0.000010545306],"category_scores_gemma":[0.00007889545,0.00007854611,0.00003871009,0.00047896645,0.000026694444,0.0006092466,0.000040691393,0.00008891934,0.000026324862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.6792734e-7,0.000088088425,0.00014585955,0.00010390409,0.0000013955668,0.000006416129,0.00039655186,0.000094197436,0.000074005555,0.9414846,0.000038168786,0.057566192],"study_design_scores_gemma":[0.00010104796,0.00004598927,0.0002739336,0.0004605434,0.0000031233558,0.000013925876,0.000046240257,0.011781986,0.00024680726,0.9821457,0.0047319513,0.00014874624],"about_ca_topic_score_codex":1.8887735e-7,"about_ca_topic_score_gemma":0.0000011637524,"teacher_disagreement_score":0.61759526,"about_ca_system_score_codex":0.000009388949,"about_ca_system_score_gemma":0.000007953786,"threshold_uncertainty_score":0.3203017},"labels":[],"label_agreement":null},{"id":"W2009890571","doi":"10.3934/amc.2010.4.485","title":"Efficient list decoding of a class of algebraic-geometry codes","year":2010,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; List decoding; Algebraic number; Interpolation (computer graphics); Class (philosophy); Decoding methods; Block code; Algebraic geometry; Algebra over a field; Hermitian matrix; Discrete mathematics; Algorithm; Concatenated error correction code; Geometry; Computer science; Pure mathematics; Image (mathematics); Mathematical analysis","score_opus":0.015261916361586416,"score_gpt":0.30217363692952365,"score_spread":0.28691172056793723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009890571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6503437,0.0021989476,0.32947052,0.00028893788,0.00014062745,0.00023353295,0.00001724085,0.000045859622,0.017260617],"genre_scores_gemma":[0.6574439,0.00018590094,0.34234866,0.0000049428895,0.0000017810889,0.000007656047,9.380488e-7,0.0000032971122,0.0000029730693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990177,0.000060874027,0.0005383635,0.00010115212,0.00017427972,0.00010759272],"domain_scores_gemma":[0.99571925,0.0016124954,0.0004391843,0.002059361,0.00014393518,0.000025756144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078353105,0.000080328646,0.0002558756,0.00028448764,0.00005715464,0.000009889511,0.0024254527,0.00004043947,0.000009468916],"category_scores_gemma":[0.00035478748,0.000077651595,0.00008562453,0.0008631944,0.00044661138,0.00014083816,0.00053915626,0.00018115819,8.763138e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017689357,0.00041080927,0.0007354621,0.00012696488,0.000008405157,6.2125835e-8,0.0013911912,0.00041875266,0.009084174,0.9830107,0.0000016931964,0.0048100045],"study_design_scores_gemma":[0.00029887116,0.00007514286,0.00045532704,0.00039838182,0.000017415165,0.0000042700053,0.0005835402,0.13147627,0.026889581,0.83870655,0.000923497,0.00017116251],"about_ca_topic_score_codex":0.000004676786,"about_ca_topic_score_gemma":0.0000855943,"teacher_disagreement_score":0.14430417,"about_ca_system_score_codex":0.0000052562864,"about_ca_system_score_gemma":0.000028065615,"threshold_uncertainty_score":0.45071352},"labels":[],"label_agreement":null},{"id":"W2011044835","doi":"10.1142/s1793042108001249","title":"ON SOME CLASSES OF PERMUTATION POLYNOMIALS","year":2008,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Permutation (music); Combinatorics; Finite field; Cyclic permutation; Class (philosophy); Prime (order theory); Discrete mathematics; Symmetric group","score_opus":0.016238615781079935,"score_gpt":0.2759407172787741,"score_spread":0.2597021014976942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011044835","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9290521,0.00007999215,0.061028402,0.00059678534,0.0016662122,0.000034474193,0.000015339343,0.000022136486,0.0075045372],"genre_scores_gemma":[0.9967307,0.000032211214,0.002440532,0.00045951872,0.00020002408,8.467652e-7,0.0000012934845,0.0000051268858,0.00012973645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883705,0.00015895549,0.00035996886,0.000092577626,0.0004680219,0.000083406456],"domain_scores_gemma":[0.9983328,0.00072530116,0.00041412012,0.00013772454,0.00034313512,0.00004691397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054199534,0.00007768626,0.00013933054,0.00022194184,0.000041490697,0.000028517883,0.00089309434,0.000033493587,0.00040473577],"category_scores_gemma":[0.00021818599,0.00006525964,0.00018513114,0.000107629334,0.00009179186,0.00056191743,0.00006209944,0.00012375264,0.00003522377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021596783,0.0001535689,0.00060622307,0.0000019783981,0.00012644775,0.000083170424,0.0007216052,0.00009104155,0.0017145621,0.9839767,0.0022324587,0.010076274],"study_design_scores_gemma":[0.00061973056,0.0002294912,0.005525474,0.00009497519,0.000009268581,0.00094320596,0.000059736445,0.00008621192,0.008772172,0.98130745,0.00224186,0.000110429944],"about_ca_topic_score_codex":0.0000011387926,"about_ca_topic_score_gemma":1.3153004e-7,"teacher_disagreement_score":0.067678586,"about_ca_system_score_codex":0.000032322256,"about_ca_system_score_gemma":0.000080036916,"threshold_uncertainty_score":0.44315726},"labels":[],"label_agreement":null},{"id":"W2011798878","doi":"10.1006/ffta.2001.0332","title":"Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions","year":2002,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Divisibility rule; Mathematics; Boolean function; Correlation; Nonlinear system; Property (philosophy); Mathematical proof; Algebraic number; Domain (mathematical analysis); Discrete mathematics; Mathematical analysis","score_opus":0.009731903311448296,"score_gpt":0.19865844804746582,"score_spread":0.18892654473601753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011798878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05296427,0.0005041505,0.941877,0.00043342618,0.000022845517,0.000108941946,0.000021055494,0.00003509803,0.0040332205],"genre_scores_gemma":[0.99749,0.000090678106,0.0021516136,0.00004978143,0.000014892202,0.000033745164,0.0000118952075,0.0000021713913,0.00015522978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995179,0.000023759052,0.00015075899,0.00017822151,0.0000456544,0.0000836691],"domain_scores_gemma":[0.99938476,0.00015937716,0.000062303625,0.00032967853,0.000024419222,0.000039457344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010913985,0.000066620196,0.00011509131,0.00020211967,0.00017518831,0.000034920577,0.0001296196,0.000044280143,0.000058837606],"category_scores_gemma":[0.000004762575,0.000057378784,0.0000729831,0.0008324415,0.000055847762,0.00007969611,0.000055427543,0.000077298806,0.000003944412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005740765,0.00009970424,0.0023135287,0.00000886617,0.00024023387,2.28793e-7,0.002953699,0.0007254466,0.00039310864,0.94243884,0.0001439845,0.05067663],"study_design_scores_gemma":[0.00067464064,0.0003569606,0.089083575,0.000029246534,0.00043303805,0.000010687954,0.00093768875,0.5286103,0.0004999823,0.33980894,0.03902097,0.00053401024],"about_ca_topic_score_codex":0.00001027422,"about_ca_topic_score_gemma":0.000014279552,"teacher_disagreement_score":0.9445257,"about_ca_system_score_codex":0.0000036400543,"about_ca_system_score_gemma":0.000002936461,"threshold_uncertainty_score":0.23398389},"labels":[],"label_agreement":null},{"id":"W2011959959","doi":"10.1016/s0166-218x(02)00440-7","title":"Higher weights and graded rings for binary self-dual codes","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Binary number; Combinatorics; Discrete mathematics; Arithmetic; Linguistics","score_opus":0.014709663999998299,"score_gpt":0.23082972422446046,"score_spread":0.21612006022446217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011959959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26455086,0.00021683624,0.6966769,0.00032384857,0.00031989918,0.0011442901,0.000011522387,0.0009406206,0.03581521],"genre_scores_gemma":[0.5435943,0.000017138604,0.4559743,0.00014493214,0.000030063706,0.0001038312,0.0000027504018,0.000020191954,0.00011247057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901235,0.000017365213,0.0002155933,0.00031658733,0.00015885783,0.00027925125],"domain_scores_gemma":[0.9991088,0.00025337038,0.000096893455,0.00042304775,0.000024610632,0.00009326792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003261203,0.00019040109,0.00022608001,0.00008507934,0.00020828488,0.00013665539,0.00029587827,0.00006794102,0.000010438616],"category_scores_gemma":[0.000010669638,0.00015787248,0.00007605789,0.000221401,0.00006670484,0.0001309572,0.000101081896,0.0000807444,0.000010718219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004424027,0.00007167777,0.000011307795,0.00011786622,0.000034303182,0.000001565192,0.0013985896,0.0000010076077,0.0015213655,0.99635077,0.0002351821,0.00025196892],"study_design_scores_gemma":[0.0005430166,0.000074000134,0.00006671465,0.00002451269,0.000040534702,0.000011723771,0.0001391253,0.0016687881,0.0063164677,0.98311704,0.0077007213,0.00029734403],"about_ca_topic_score_codex":3.101865e-7,"about_ca_topic_score_gemma":2.5471394e-7,"teacher_disagreement_score":0.27904347,"about_ca_system_score_codex":0.000009429339,"about_ca_system_score_gemma":0.000015080402,"threshold_uncertainty_score":0.6437853},"labels":[],"label_agreement":null},{"id":"W2012962223","doi":"10.5539/jmr.v4n3p13","title":"Analysis of Algebraic Immunity for Balanced Boolean Function On 4-Variable","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Algebraic function; Boolean function; Complete Boolean algebra; Algebraic number; Two-element Boolean algebra; Real algebraic geometry; Boolean algebra; Variable (mathematics); Parity function; Boolean expression; Function field of an algebraic variety; Discrete mathematics; Dimension of an algebraic variety; Algebra over a field; Pure mathematics; Algebra representation","score_opus":0.09904088756082084,"score_gpt":0.377189389838313,"score_spread":0.27814850227749216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012962223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29096106,0.00013263237,0.7068595,0.00010785197,0.0001625174,0.00010810782,0.0000025473312,0.000008825465,0.0016569389],"genre_scores_gemma":[0.956371,0.000016377053,0.043426577,0.000021460955,0.00007347809,0.000004163308,6.815421e-7,0.0000057597626,0.000080500584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983131,0.00022997503,0.0004116141,0.00007259716,0.0006872252,0.00028543256],"domain_scores_gemma":[0.99695104,0.001618617,0.00029433338,0.0004387527,0.0005905265,0.00010674291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009211462,0.000068696,0.00029766097,0.0010720369,0.00013537527,0.000059429985,0.0007148507,0.000047994876,0.00005065857],"category_scores_gemma":[0.00058240234,0.000052493695,0.0002547101,0.0017173701,0.0000527477,0.00031071517,0.00010471407,0.00030214692,0.0000045708143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001468747,0.0011884455,0.0011004709,0.00017273944,0.0011580437,7.596323e-7,0.0021909592,0.0004435085,0.008464528,0.97809273,0.0010075554,0.006033382],"study_design_scores_gemma":[0.0018745709,0.004004628,0.012941994,0.0004972179,0.0009625159,0.00003217357,0.0022991109,0.10941713,0.018466922,0.8443801,0.0047172676,0.00040640924],"about_ca_topic_score_codex":0.0000020361451,"about_ca_topic_score_gemma":5.2309434e-7,"teacher_disagreement_score":0.66541,"about_ca_system_score_codex":0.00003603734,"about_ca_system_score_gemma":0.000057825728,"threshold_uncertainty_score":0.31925273},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011656878434417484,"score_gpt":0.2669418569395721,"score_spread":0.25528497850515464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013392609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012392029,0.0037077558,0.9802096,0.0027876762,0.00023474543,0.0005116317,0.000007499454,0.0001289251,0.000020159341],"genre_scores_gemma":[0.91614,0.000015894182,0.08343261,0.00020301576,0.00014670042,0.000027386275,0.0000010917347,0.000024713323,0.000008546893],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980795,0.00011004101,0.0007725446,0.00030758767,0.00031588328,0.00041446305],"domain_scores_gemma":[0.9974059,0.000744087,0.00081520394,0.00029055594,0.0006424668,0.00010178471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023658688,0.00027941613,0.00048067517,0.0007722377,0.0005601922,0.0003207804,0.0012304084,0.00022908002,0.0000018898926],"category_scores_gemma":[0.00020808815,0.00018627598,0.00023384074,0.00068363437,0.00033454693,0.0005314896,0.00011060582,0.0004358609,7.936837e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020269311,0.00024267579,0.00006187366,0.0006960259,0.00020828786,0.000032120955,0.0021967269,0.0077957558,0.14205275,0.013502228,0.00066260045,0.830522],"study_design_scores_gemma":[0.0060989894,0.005880684,0.000020355392,0.0031548624,0.0003276431,0.0020502945,0.0016662051,0.21474983,0.052596517,0.71001565,0.0026435289,0.0007954644],"about_ca_topic_score_codex":0.0000111664895,"about_ca_topic_score_gemma":0.000008580078,"teacher_disagreement_score":0.90374804,"about_ca_system_score_codex":0.000057617173,"about_ca_system_score_gemma":0.00029966913,"threshold_uncertainty_score":0.75961137},"labels":[],"label_agreement":null},{"id":"W2013961570","doi":"10.1109/icecs.2012.6463517","title":"Power efficiency of digit level polynomial basis finite field multipliers in GF(2&lt;sup&gt;283&lt;/sup&gt;)","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Finite field; Very-large-scale integration; Elliptic curve cryptography; GF(2); Multiplier (economics); Critical path method; Computer science; Field (mathematics); Arithmetic; Mathematics; Algorithm; Discrete mathematics; Embedded system; Engineering; Encryption; Public-key cryptography; Pure mathematics","score_opus":0.01825211037285644,"score_gpt":0.23125414793581772,"score_spread":0.2130020375629613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013961570","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66972256,0.00022698786,0.25505358,0.00067004067,0.0008103738,0.00032308063,0.000019698815,0.00023766846,0.07293602],"genre_scores_gemma":[0.98932505,0.000010621816,0.009336569,0.0005862379,0.00007878782,0.000015338646,0.0000020174994,0.000015407639,0.0006299529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976988,0.00012329996,0.0005208165,0.0004887889,0.00039650698,0.00077178876],"domain_scores_gemma":[0.9978141,0.00087105145,0.00012950803,0.00088480493,0.0000696893,0.00023084618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072057307,0.00028850144,0.0003514879,0.00053080864,0.00013416038,0.000104199564,0.0012901244,0.00017903157,0.0003805506],"category_scores_gemma":[0.00021874961,0.00025956178,0.0002703116,0.0012089775,0.00013778072,0.00082085823,0.00048184095,0.00024344216,0.00009607593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078369013,0.0053743394,0.14208041,0.00020170303,0.00031497763,0.000057874364,0.03697072,0.0034070173,0.019920386,0.52008116,0.030659525,0.24014816],"study_design_scores_gemma":[0.01824802,0.005070699,0.24957302,0.0009585696,0.00021510782,0.00014071887,0.0037188502,0.1502947,0.33060375,0.020390224,0.21111229,0.009674054],"about_ca_topic_score_codex":0.000049189737,"about_ca_topic_score_gemma":0.000031721767,"teacher_disagreement_score":0.49969095,"about_ca_system_score_codex":0.00003533726,"about_ca_system_score_gemma":0.00006707804,"threshold_uncertainty_score":0.99998564},"labels":[],"label_agreement":null},{"id":"W2014166022","doi":"10.1109/itw.2011.6089369","title":"Ambiguity and deficiency of permutations from finite fields","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Ambiguity; Bijection; Abelian group; Combinatorics; Discrete mathematics; Mathematics; Computer science; Programming language","score_opus":0.034021544359147594,"score_gpt":0.21763785217321058,"score_spread":0.183616307814063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014166022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34861007,0.00004137316,0.6229488,0.000040888255,0.00004729825,0.000018282053,0.0000016240986,0.000036253772,0.028255345],"genre_scores_gemma":[0.9742112,0.000005653727,0.025641253,0.00009824138,0.000003801313,0.0000013254737,3.2344911e-7,9.008398e-7,0.00003725726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996783,0.000019955125,0.00007714912,0.00011336667,0.000049957252,0.00006127738],"domain_scores_gemma":[0.9996427,0.0000895092,0.000022878488,0.00019622159,0.000022356027,0.000026295891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000078223806,0.000035844278,0.00004866638,0.00004184241,0.000045956444,0.000013808638,0.0002163834,0.000021322228,0.00012479268],"category_scores_gemma":[0.000018773182,0.00003044594,0.00002553712,0.00014453377,0.00004390039,0.00012485485,0.00008354953,0.000032062366,0.0000050123062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000268889,0.00004748088,0.00660161,0.000002730816,0.000004293431,0.0000011034818,0.004209839,0.0000021878618,0.00017950711,0.9742087,0.000045052806,0.014694821],"study_design_scores_gemma":[0.00015049416,0.00012447806,0.1336136,0.000007773629,0.000008104151,0.0000015230944,0.00015990276,0.0044022067,0.004762164,0.85654217,0.00011187229,0.0001156988],"about_ca_topic_score_codex":0.00017433781,"about_ca_topic_score_gemma":0.000026892989,"teacher_disagreement_score":0.6256012,"about_ca_system_score_codex":8.3195044e-7,"about_ca_system_score_gemma":0.000007952808,"threshold_uncertainty_score":0.13663924},"labels":[],"label_agreement":null},{"id":"W2015875314","doi":"10.1007/s12095-013-0082-1","title":"A simple combinatorial treatment of constructions and threshold gaps of ramp schemes","year":2013,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple (philosophy); Code (set theory); Mathematical proof; Dual (grammatical number); Minimum distance; Mathematics; Nonlinear system; Algorithm; Computer science; Combinatorial design; Linear code; Discrete mathematics; Block code; Geometry; Decoding methods; Physics","score_opus":0.01868826974391217,"score_gpt":0.25166845567538865,"score_spread":0.23298018593147649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015875314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9680262,0.0069514476,0.019440718,0.00061461766,0.0001309204,0.00047749144,0.000027309037,0.00010119077,0.0042300774],"genre_scores_gemma":[0.9786192,0.0018697499,0.019404082,0.000016895305,0.00000767285,0.0000702887,0.0000065728027,0.0000039273755,0.0000016093558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993166,0.00007831997,0.0002476304,0.00015953199,0.00007820847,0.00011975037],"domain_scores_gemma":[0.9982707,0.0002404576,0.00012540499,0.0011681995,0.000120424455,0.00007479668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086000844,0.00011065777,0.00020363684,0.0002143524,0.0002717595,0.000054961816,0.00052615104,0.00005107654,0.000017317312],"category_scores_gemma":[0.000009115716,0.000099994,0.00010838117,0.00056885066,0.0008630349,0.00023779883,0.00023601527,0.00006316145,7.0328934e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004113296,0.00023585779,0.015746472,0.000011855431,0.00006816433,4.9538073e-8,0.00072762923,4.203116e-7,0.0013581687,0.9614412,0.00003219555,0.020373836],"study_design_scores_gemma":[0.001182261,0.00052570103,0.014756835,0.000038268776,0.0000605174,0.000010777488,0.00064237224,0.000930625,0.0047055525,0.96960926,0.0073263524,0.00021145133],"about_ca_topic_score_codex":0.000066731845,"about_ca_topic_score_gemma":0.0000060204375,"teacher_disagreement_score":0.020162385,"about_ca_system_score_codex":0.0000032280648,"about_ca_system_score_gemma":0.000021110707,"threshold_uncertainty_score":0.4077637},"labels":[],"label_agreement":null},{"id":"W2016474650","doi":"10.1007/s10623-011-9490-4","title":"Gauss periods as constructions of low complexity normal bases","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Gauss; Gauss sum; TRACE (psycholinguistics); Quadratic Gauss sum; Mathematics; Type (biology); Basis (linear algebra); Finite field; Extension (predicate logic); Normal basis; Pure mathematics; Field (mathematics); Combinatorics; Computer science; Physics; Geometry; Linguistics; Quantum mechanics","score_opus":0.05559605239248062,"score_gpt":0.24208815813270287,"score_spread":0.18649210574022226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016474650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41432557,0.00032946034,0.570058,0.000047012283,0.00022665568,0.00018550007,0.000027227074,0.00020514615,0.014595425],"genre_scores_gemma":[0.9061755,0.00008267371,0.09353597,0.0001505264,0.000021707088,0.00001660749,0.0000029331445,0.000008665905,0.0000054419925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865407,0.00014629638,0.0002995766,0.0003826322,0.00019911517,0.00031833537],"domain_scores_gemma":[0.99895746,0.00010812316,0.00013482063,0.0005059402,0.00012052603,0.00017311418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002986641,0.00021531637,0.0002795977,0.00039120342,0.00033484498,0.00008842367,0.00054382737,0.00007632684,0.00024098757],"category_scores_gemma":[0.000014767565,0.00020079738,0.0002358073,0.00090754905,0.0009547229,0.00037395328,0.0001538437,0.00013363283,0.000006365962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053816108,0.00016215189,0.014635555,0.000044946864,0.000060242877,0.000009197153,0.0013971291,0.0000011788204,0.0017122369,0.97183836,0.00009873292,0.009986447],"study_design_scores_gemma":[0.00157207,0.0019356854,0.085595146,0.00020069155,0.00013562453,0.00038472124,0.0019496462,0.0013684577,0.04161106,0.8614002,0.0025596812,0.0012870398],"about_ca_topic_score_codex":0.000110987225,"about_ca_topic_score_gemma":0.000017618535,"teacher_disagreement_score":0.4918499,"about_ca_system_score_codex":0.00000338212,"about_ca_system_score_gemma":0.000040429346,"threshold_uncertainty_score":0.818828},"labels":[],"label_agreement":null},{"id":"W2017008783","doi":"10.1016/j.jcta.2010.05.006","title":"Symmetric bilinear forms over finite fields of even characteristic","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Bilinear form; Rank (graph theory); Combinatorics; Vector space; Finite field; Space (punctuation); Set (abstract data type); Bilinear interpolation; Distribution (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis; Statistics; Computer science","score_opus":0.006065735391801461,"score_gpt":0.2239817132919832,"score_spread":0.21791597790018172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017008783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9591528,0.000096868745,0.02689279,0.00021840632,0.011727201,0.00009872754,0.000004749683,0.00003444289,0.0017739747],"genre_scores_gemma":[0.99792796,0.00002971481,0.0014107196,0.000068383895,0.000491742,0.0000014323097,4.4224032e-7,0.000009334374,0.00006024703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857765,0.00015008899,0.00057665264,0.00013239385,0.00035882386,0.00020439572],"domain_scores_gemma":[0.99770296,0.00079866464,0.0006342838,0.00044576466,0.00030131673,0.00011700298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018268119,0.00014847692,0.00036880578,0.00037953875,0.00009244629,0.00009151988,0.001047609,0.00013174757,0.00011871123],"category_scores_gemma":[0.00085519877,0.000113588656,0.00028104545,0.0007485367,0.00013054402,0.000846211,0.00017099387,0.00052156055,0.00000334352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043538195,0.00013650532,0.00029909,0.000020584792,0.00005588168,0.000017184173,0.00039457803,0.0000035034775,0.0030373698,0.9895432,0.000062913496,0.0059937853],"study_design_scores_gemma":[0.0008719384,0.0011582978,0.0016641761,0.000039623465,0.000027965632,0.00007789489,0.000038412374,0.00009673823,0.0061806985,0.98020357,0.009481425,0.00015925942],"about_ca_topic_score_codex":0.0000013405449,"about_ca_topic_score_gemma":6.050432e-7,"teacher_disagreement_score":0.038775146,"about_ca_system_score_codex":0.000010315297,"about_ca_system_score_gemma":0.00010824635,"threshold_uncertainty_score":0.4632011},"labels":[],"label_agreement":null},{"id":"W2017533742","doi":"10.1109/tc.2012.95","title":"Multiway Splitting Method for Toeplitz Matrix Vector Product","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Toeplitz matrix; Mathematics; Generalization; Matrix (chemical analysis); Matrix multiplication; Levinson recursion; Product (mathematics); Integer (computer science); Combinatorics; Computational complexity theory; Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.024640510700493345,"score_gpt":0.2999153595971561,"score_spread":0.27527484889666276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017533742","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024017973,0.00006815972,0.9918887,0.0005486827,0.004097054,0.00043369233,0.000010223506,0.0004670819,0.000084617335],"genre_scores_gemma":[0.49841243,0.0000021509024,0.5010155,0.0002189022,0.00020061055,0.00006145324,6.5563546e-7,0.0000147812025,0.00007355259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984363,0.0001493875,0.0002520873,0.00046047638,0.00018798784,0.00051380164],"domain_scores_gemma":[0.9983999,0.0006489093,0.0000788468,0.00063618086,0.00006352497,0.00017264739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081389677,0.00021643595,0.00020864348,0.00023074515,0.00037137626,0.000121208366,0.00061544654,0.00005563328,0.000011578504],"category_scores_gemma":[0.000006772193,0.00021096479,0.00028854996,0.0005007857,0.000033572906,0.00053961365,0.000005492815,0.00019599372,0.000037304075],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010435751,0.0007034525,0.000034897574,0.00008936977,0.00018723996,0.000001960749,0.0029648547,0.019185623,0.006289359,0.047892738,0.0010445787,0.9215016],"study_design_scores_gemma":[0.0028214504,0.0008974645,0.0006433499,0.00021516939,0.0001748552,0.00012824785,0.00013974872,0.7279465,0.22042653,0.0046437485,0.04013353,0.0018293957],"about_ca_topic_score_codex":0.000009949658,"about_ca_topic_score_gemma":0.0000014367643,"teacher_disagreement_score":0.9196722,"about_ca_system_score_codex":0.000046987832,"about_ca_system_score_gemma":0.000025921125,"threshold_uncertainty_score":0.86028945},"labels":[],"label_agreement":null},{"id":"W2018066889","doi":"10.1007/s10958-012-1054-2","title":"Skew linear recurring sequences of maximal period over galois rings","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematical Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Order (exchange); Sequence (biology); Ring (chemistry); Rank (graph theory); Dimension (graph theory); Skew; Discrete mathematics; Physics","score_opus":0.032937257832583604,"score_gpt":0.29383372801603536,"score_spread":0.26089647018345175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018066889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8881651,0.00047305904,0.106696166,0.0004244992,0.00028158337,0.000039439718,4.1160078e-7,0.000017596383,0.0039021233],"genre_scores_gemma":[0.8577012,0.000012587946,0.14211246,0.000044033877,0.00011558832,5.9859883e-7,9.410916e-9,0.0000023500347,0.000011168545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983041,0.00008283991,0.0004879473,0.00011747927,0.00070020347,0.0003074309],"domain_scores_gemma":[0.9988905,0.00028897097,0.00040396908,0.00015634968,0.000088679786,0.00017152338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032469563,0.00010184734,0.0002631785,0.00016954764,0.00014470445,0.00009725202,0.0011102005,0.00003913353,0.00014902109],"category_scores_gemma":[0.00027019499,0.00006538144,0.00018371189,0.00055391825,0.00040145253,0.0012304554,0.00016443813,0.00015542253,0.000014445205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012160112,0.0002875985,0.006796972,0.0000825158,0.000024744058,0.000012774469,0.004941985,0.000026018984,0.0068951817,0.9741906,0.00009289755,0.0066365744],"study_design_scores_gemma":[0.000564654,0.0015236827,0.008852319,0.0010544253,0.0000707192,0.0016698691,0.0013245346,0.0048129177,0.044677824,0.9332215,0.0016656702,0.0005618895],"about_ca_topic_score_codex":0.0000011991824,"about_ca_topic_score_gemma":1.6330164e-7,"teacher_disagreement_score":0.04096908,"about_ca_system_score_codex":0.00001529583,"about_ca_system_score_gemma":0.00006511019,"threshold_uncertainty_score":0.26661777},"labels":[],"label_agreement":null},{"id":"W2018206679","doi":"10.1145/2576802.2576817","title":"A parallel algorithm to compute the greatest common divisor of sparse multivariate polynomials","year":2014,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multivariate statistics; Divisor (algebraic geometry); Mathematics; Greatest common divisor; Combinatorics; Algorithm; Statistics","score_opus":0.038761719089005574,"score_gpt":0.2948750600822716,"score_spread":0.25611334099326605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018206679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019606875,0.0001336341,0.97145265,0.0074662254,0.00029466648,0.00047230473,0.0000076071956,0.00018206576,0.00038394536],"genre_scores_gemma":[0.5034875,0.00002255584,0.4953342,0.0010320136,0.000047110436,0.000051920324,0.0000066297384,0.000011204694,0.0000068168024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720323,0.0010768403,0.0006686749,0.00043204892,0.00024293899,0.00037623866],"domain_scores_gemma":[0.98940647,0.0026583108,0.00023796939,0.0074576703,0.00012042211,0.00011916153],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001356087,0.00025681788,0.00042869349,0.00033616365,0.00036756918,0.00018955504,0.010962027,0.00008023695,0.000004837885],"category_scores_gemma":[0.000103886116,0.00021315015,0.00016002204,0.0012804883,0.00026756292,0.00028428863,0.0065541132,0.00036240456,0.000051877712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012767725,0.00045803667,0.0028508324,0.000009836297,0.000063257976,0.0000015921428,0.0031930453,0.001641997,0.00009262435,0.342382,0.0006266881,0.6486673],"study_design_scores_gemma":[0.0011760484,0.00035257183,0.06388675,0.00017653893,0.0000239829,0.000022603354,0.000026138769,0.7687775,0.00021337505,0.15142551,0.013385806,0.0005331504],"about_ca_topic_score_codex":0.0003128901,"about_ca_topic_score_gemma":0.00014481341,"teacher_disagreement_score":0.7671355,"about_ca_system_score_codex":0.000032738422,"about_ca_system_score_gemma":0.000037594717,"threshold_uncertainty_score":0.9943891},"labels":[],"label_agreement":null},{"id":"W2019616249","doi":"10.1109/tit.2011.2176914","title":"Binary Kloosterman Sums Modulo 256 and Coefficients of the Characteristic Polynomial","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kloosterman sum; Modulo; Mathematics; Binary number; Notation; Polynomial; Discrete mathematics; Cryptography; Exponential function; Coding theory; Number theory; Primitive root modulo n; Combinatorics; Arithmetic; Algorithm; Mathematical analysis","score_opus":0.007425260864609705,"score_gpt":0.20348652576179313,"score_spread":0.19606126489718342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019616249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30246395,0.000012815147,0.69550437,0.00006507004,0.0010210377,0.0001312097,0.000019754598,0.000055183933,0.00072662893],"genre_scores_gemma":[0.9994109,0.0000063796883,0.00018660851,0.0003060972,0.000018917626,0.000013445194,0.0000012519401,0.0000036014933,0.000052797295],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922895,0.00012423536,0.00023943276,0.00007112572,0.00016542085,0.0001708068],"domain_scores_gemma":[0.99929565,0.00011711137,0.00012588275,0.00035978024,0.000037394755,0.00006418537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004693377,0.000101898855,0.000093829236,0.00018281506,0.00025362906,0.000053116328,0.00033783933,0.000049686154,0.000028120025],"category_scores_gemma":[0.0000057845723,0.000076776065,0.00008240176,0.00029106316,0.00012020182,0.0014172852,0.000007795015,0.00013123568,0.00003477838],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005777649,0.0007780012,0.0005227332,0.0002089076,0.0001562598,4.4552536e-7,0.035915572,0.0029467815,0.005383226,0.24640265,0.00035950184,0.7067481],"study_design_scores_gemma":[0.013244431,0.0029925173,0.24620289,0.0012926655,0.0007314,0.00055688404,0.0057806787,0.147874,0.49126256,0.038428567,0.04671953,0.0049138875],"about_ca_topic_score_codex":0.000002002671,"about_ca_topic_score_gemma":2.3463794e-7,"teacher_disagreement_score":0.70183426,"about_ca_system_score_codex":0.000015638989,"about_ca_system_score_gemma":0.00001724305,"threshold_uncertainty_score":0.3130837},"labels":[],"label_agreement":null},{"id":"W2020012988","doi":"10.3934/amc.2013.7.103","title":"Generalizations of Verheul's theorem to asymmetric pairings","year":2013,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Discrete mathematics; Crystallography; Crystal structure","score_opus":0.016959126994329065,"score_gpt":0.2840770749925573,"score_spread":0.26711794799822824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020012988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01832076,0.0018977362,0.94657457,0.0009167795,0.00005282061,0.0003769041,0.0000043459536,0.000058164307,0.03179791],"genre_scores_gemma":[0.5904018,0.00043661808,0.4090602,0.000032279346,0.0000016686407,0.00004630774,0.000001255286,0.000003870245,0.000015943928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991592,0.000076894445,0.00040679792,0.00010210167,0.00014151956,0.000113458074],"domain_scores_gemma":[0.99698925,0.0007402301,0.00018785529,0.0018730098,0.00017176752,0.0000379125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035177203,0.00007631237,0.00017560767,0.0003807285,0.00006241994,0.000021039728,0.00231545,0.000024255667,0.000016310174],"category_scores_gemma":[0.00024299764,0.00007270003,0.000056973335,0.0016913008,0.00012864564,0.0005024968,0.00054456154,0.00007064608,0.000014488509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.5527506e-7,0.00018034165,0.0005466927,0.00003370911,0.0000056178988,2.3798481e-8,0.0013709349,0.0004141252,0.00030542986,0.9846029,0.000034457593,0.012505358],"study_design_scores_gemma":[0.00010765996,0.00004934622,0.0008247141,0.00012343128,0.0000053533304,0.0000010298857,0.00024589646,0.017140064,0.0021439602,0.97723573,0.0020133406,0.00010947389],"about_ca_topic_score_codex":0.000014930262,"about_ca_topic_score_gemma":0.00002099752,"teacher_disagreement_score":0.5720811,"about_ca_system_score_codex":0.000010328659,"about_ca_system_score_gemma":0.000017160726,"threshold_uncertainty_score":0.43027207},"labels":[],"label_agreement":null},{"id":"W2020692437","doi":"10.1016/s0012-365x(02)00622-2","title":"Optimal linear rate 12 codes over F5 and F7","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Separable space; Discrete mathematics; Linear code; Minimum distance; Block code; Algorithm; Decoding methods; Mathematical analysis","score_opus":0.01614580043218577,"score_gpt":0.2490812867798957,"score_spread":0.2329354863477099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020692437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23548318,0.00009388115,0.7548856,0.00011157391,0.00010642051,0.000114130075,0.00000415687,0.0001326061,0.009068422],"genre_scores_gemma":[0.5617948,0.000045191347,0.43741718,0.00024404826,0.000033728036,0.000010980925,0.0000016672707,0.000018594,0.0004338103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991809,0.000073837036,0.00017875932,0.00021845737,0.00013370816,0.0002143184],"domain_scores_gemma":[0.9992268,0.00017190735,0.00007047652,0.000423589,0.00002286697,0.000084326806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051614427,0.0001402544,0.00016851287,0.000060755043,0.00012352162,0.00014820545,0.00030255504,0.00004476091,0.00004167602],"category_scores_gemma":[0.00008471318,0.000115172996,0.00006728563,0.00017352836,0.00008172372,0.00020811902,0.000112926224,0.00009252207,0.000024197805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027669696,0.000039069557,0.00014336065,0.000049467417,0.000022167202,0.000007198679,0.0018820157,0.000051365503,0.00045372994,0.99672914,0.00016563476,0.00045410046],"study_design_scores_gemma":[0.0009683279,0.00024587754,0.0005260936,0.00016682428,0.00006430678,0.000091509995,0.00057877053,0.15844701,0.0104948925,0.81340855,0.014136225,0.0008716015],"about_ca_topic_score_codex":9.155902e-7,"about_ca_topic_score_gemma":0.0000010044197,"teacher_disagreement_score":0.32631162,"about_ca_system_score_codex":0.0000052749165,"about_ca_system_score_gemma":0.000014730883,"threshold_uncertainty_score":0.46966186},"labels":[],"label_agreement":null},{"id":"W2020806681","doi":"10.1090/s0025-5718-00-01247-3","title":"Irreducibility testing over local fields","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Irreducibility; Irreducible polynomial; Laurent series; Polynomial ring; Laurent polynomial; Field (mathematics); Minimal polynomial (linear algebra); Finite field; Polynomial; Rational number; Bivariate analysis; Ring (chemistry); Pure mathematics; Rational function; Discrete mathematics; Series (stratigraphy); Algebra over a field; Square-free polynomial; Matrix polynomial; Mathematical analysis; Statistics","score_opus":0.024501179995209718,"score_gpt":0.26311842031686306,"score_spread":0.23861724032165332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020806681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34366915,0.000009208973,0.65230983,0.0000494355,0.000036401067,0.000049530016,3.489867e-7,0.00006842192,0.003807712],"genre_scores_gemma":[0.8158536,3.2895534e-7,0.18406561,0.000033214536,0.00001170645,0.0000017954221,6.5030446e-7,0.0000029276398,0.000030161847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999308,0.0000330499,0.00023942858,0.00015556166,0.00016487548,0.00009908493],"domain_scores_gemma":[0.99922043,0.00033510113,0.00007967636,0.0002741806,0.000061201805,0.000029405186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003483538,0.000070342394,0.00011611711,0.000051797277,0.00005100937,0.000038303944,0.0002648734,0.000034485252,0.000054085776],"category_scores_gemma":[0.0000453125,0.0000671549,0.000051674953,0.00032751172,0.000048233822,0.00016969217,0.000040252424,0.000057699643,0.000017303377],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059043714,0.00027804525,0.00019543793,0.00013390006,0.000015359832,0.000001774909,0.0025371425,0.023483261,0.00019581059,0.12337681,0.00018305887,0.8495935],"study_design_scores_gemma":[0.00010001692,0.00005711233,0.0012142332,0.000036098765,0.000003972917,0.0000046119976,0.00002117936,0.55460995,0.00056186295,0.44329202,0.00003201712,0.000066897046],"about_ca_topic_score_codex":0.0000058901574,"about_ca_topic_score_gemma":7.2939963e-7,"teacher_disagreement_score":0.8495266,"about_ca_system_score_codex":0.000007946553,"about_ca_system_score_gemma":0.000017223405,"threshold_uncertainty_score":0.27384973},"labels":[],"label_agreement":null},{"id":"W2021947009","doi":"10.1007/s00200-012-0170-z","title":"Cryptanalysis of a key exchange protocol based on the endomorphisms ring End $${(\\mathbb{Z}_{p} \\times \\mathbb{Z}_{p^2})}$$","year":2012,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Endomorphism; Key exchange; Mathematics; Polynomial ring; Ring (chemistry); Combinatorics; Polynomial; Cryptanalysis; Discrete mathematics; Homogeneous; Endomorphism ring; Algorithm; Computer science; Public-key cryptography; Mathematical analysis; Cryptography","score_opus":0.011929259732617716,"score_gpt":0.2280390128712923,"score_spread":0.2161097531386746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021947009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051818952,0.00050916953,0.9321057,0.0008773174,0.00006542901,0.009640314,0.0000020102784,0.00040301232,0.0045781],"genre_scores_gemma":[0.9621374,0.000010356311,0.033648904,0.00019171619,0.000028216607,0.003958322,0.0000022570966,0.000017802744,0.0000050417843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998511,0.00018607847,0.00042412733,0.0002516995,0.00024411612,0.00038298787],"domain_scores_gemma":[0.99717796,0.0012258942,0.00019817028,0.0012654457,0.000043679236,0.000088865134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017925767,0.0002182183,0.00028451768,0.00028938154,0.00021847553,0.00010039336,0.0011424772,0.00006809124,0.000025944986],"category_scores_gemma":[0.000070309194,0.00018549987,0.00009861311,0.0010069975,0.00008183702,0.00023026207,0.00051732874,0.00031756377,0.0000055524442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017944045,0.00028698024,0.0022055737,0.00019070234,0.00004891635,8.2450896e-7,0.0021162233,0.017285207,0.0019926757,0.9496744,0.000042132557,0.026138408],"study_design_scores_gemma":[0.0006047282,0.00005021723,0.0026168241,0.00025219476,0.000014657785,0.000005643137,0.000092847215,0.9853021,0.00427097,0.0027777134,0.0037258037,0.00028629886],"about_ca_topic_score_codex":0.000029268254,"about_ca_topic_score_gemma":0.0000015082085,"teacher_disagreement_score":0.9680169,"about_ca_system_score_codex":0.00003293309,"about_ca_system_score_gemma":0.000015256457,"threshold_uncertainty_score":0.75644654},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science","score_opus":0.02183615666117088,"score_gpt":0.2576651709614648,"score_spread":0.2358290143002939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022705034","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26469252,0.0037310533,0.006193665,0.0029743854,0.009405326,0.00019035439,0.0012745962,0.0008142894,0.7107238],"genre_scores_gemma":[0.9606906,0.0046563367,0.0113139665,0.0052294233,0.007993363,0.0038494375,0.002075486,0.003224862,0.0009665181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.95731485,0.0025220304,0.009373786,0.0069972305,0.013817571,0.009974507],"domain_scores_gemma":[0.96356785,0.010636961,0.011347801,0.007166938,0.0014412871,0.0058391704],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.012933405,0.003989774,0.0016413169,0.003895367,0.007207983,0.009326895,0.014483366,0.008910487,0.8134551],"category_scores_gemma":[0.011449101,0.0077255727,0.009361506,0.006549969,0.010928008,0.0074963975,0.01053243,0.007724826,0.005531538],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042751585,0.0015769334,0.000034819477,0.003309763,0.0058938325,0.004095671,0.0052937157,0.002958441,0.004591886,0.494313,0.46833965,0.005317137],"study_design_scores_gemma":[0.0068117813,0.007327941,0.00016943802,0.0064715417,0.0061730733,0.01318164,0.008304548,0.021084934,0.910465,0.0055385293,0.007447729,0.007023868],"about_ca_topic_score_codex":0.004545972,"about_ca_topic_score_gemma":0.0039753825,"teacher_disagreement_score":0.9058731,"about_ca_system_score_codex":0.00010832073,"about_ca_system_score_gemma":0.0072768205,"threshold_uncertainty_score":0.998351},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007711190744757583,"score_gpt":0.22308248098698208,"score_spread":0.21537129024222448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022989647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008982811,0.00003137828,0.98861384,0.0005168108,0.00006818594,0.00076540525,0.0000044937337,0.00037333101,0.0006437296],"genre_scores_gemma":[0.31974596,0.0000026547425,0.67970544,0.00030072252,0.00003643317,0.00007368452,0.000007319719,0.000021028787,0.00010673972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851114,0.000020539785,0.00028901643,0.00047545705,0.0003327733,0.00037108603],"domain_scores_gemma":[0.99803567,0.00023907534,0.00018537954,0.0011943233,0.00010791147,0.00023764701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003383932,0.0002481555,0.00024985726,0.00020167309,0.00021697134,0.00014397626,0.00098434,0.000055571458,0.0000127778585],"category_scores_gemma":[0.0000026306302,0.00019071171,0.0000679462,0.0009880116,0.00010966274,0.00012932271,0.00015780512,0.00015701968,0.00008811218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000460437,0.00040267227,0.00009169066,0.00012753412,0.00013270482,0.000023901644,0.0039720996,0.001668488,0.00017495095,0.93631566,0.0017050175,0.055339262],"study_design_scores_gemma":[0.0046667885,0.0009009572,0.0023215166,0.000647267,0.00028801712,0.00061183824,0.00068303273,0.7981461,0.0008825777,0.17036903,0.018304782,0.0021780834],"about_ca_topic_score_codex":0.0000111777745,"about_ca_topic_score_gemma":0.000015934314,"teacher_disagreement_score":0.7964776,"about_ca_system_score_codex":0.00004993266,"about_ca_system_score_gemma":0.000076401484,"threshold_uncertainty_score":0.77769977},"labels":[],"label_agreement":null},{"id":"W2023200896","doi":"10.1006/jsco.2001.0493","title":"Factoring Polynomials Over Local Fields","year":2001,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Factoring; Divisor (algebraic geometry); Prime factor; Irreducible polynomial; Basis (linear algebra); Prime (order theory); Factorization of polynomials; Polynomial; Greatest common divisor; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.015358704786723486,"score_gpt":0.26642591801028304,"score_spread":0.25106721322355957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023200896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3721622,0.00007645747,0.6264761,0.0003344578,0.0004876057,0.000020328544,9.6860205e-8,0.000020299713,0.00042243296],"genre_scores_gemma":[0.995354,0.00002168533,0.0040981397,0.00022019542,0.00028046753,3.563382e-7,1.9094868e-7,0.0000040205405,0.00002092655],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99913883,0.000058775622,0.00032770738,0.00009792591,0.00023907235,0.00013769668],"domain_scores_gemma":[0.999321,0.0001355039,0.00024427983,0.000111122165,0.00010702007,0.00008109245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036392457,0.00008107452,0.00015907222,0.00022707669,0.00007140453,0.00010539658,0.00033496897,0.000046241516,0.000021050375],"category_scores_gemma":[0.000020882511,0.00007168444,0.00012760988,0.0003352456,0.000022263634,0.0004920725,0.00005520006,0.00015312713,0.0000067793635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007567707,0.00014557077,0.005942963,0.000013999113,0.00008815379,0.0001143507,0.0043629482,0.018158011,0.0013186263,0.037729025,0.0010094316,0.93104124],"study_design_scores_gemma":[0.0053057675,0.002241018,0.34272584,0.0005083045,0.00011928363,0.003011057,0.00076017005,0.25852898,0.0057914234,0.3393726,0.040302772,0.0013327698],"about_ca_topic_score_codex":0.000007390172,"about_ca_topic_score_gemma":0.0000010814588,"teacher_disagreement_score":0.9297085,"about_ca_system_score_codex":0.000032611053,"about_ca_system_score_gemma":0.000041877098,"threshold_uncertainty_score":0.29232067},"labels":[],"label_agreement":null},{"id":"W2023845030","doi":"10.1090/s0002-9939-06-08611-4","title":"Sequences of consecutive smooth polynomials over a finite field","year":2006,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Mathematics; Field (mathematics); Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.008015191550753458,"score_gpt":0.23347816049446432,"score_spread":0.22546296894371087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023845030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9672206,0.000042267147,0.023200992,0.001244697,0.00003236772,0.00015713283,0.000004966687,0.0000631667,0.008033797],"genre_scores_gemma":[0.96370757,0.000006569887,0.035744667,0.0004518894,0.0000266511,0.00000916305,6.749189e-8,0.0000056307463,0.000047769696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989725,0.000013172449,0.00032239524,0.00020015873,0.00028875173,0.00020302598],"domain_scores_gemma":[0.99851716,0.00063648564,0.0005233384,0.00017405688,0.000112922884,0.00003604793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039797358,0.00012454408,0.00033435703,0.000024777693,0.000084164516,0.000040845098,0.0009135293,0.00003490281,0.00002270496],"category_scores_gemma":[0.00015541761,0.00008290175,0.00040046268,0.0006289877,0.000763254,0.00014882153,0.0002924551,0.00011770868,0.0000020902296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021873868,0.00018782937,0.004825789,0.0001649512,0.00006087736,1.4626548e-7,0.0020334157,0.000004669464,0.061529677,0.9257023,0.004269007,0.0011994655],"study_design_scores_gemma":[0.00020185093,0.00024480032,0.0039239647,0.00015710399,0.000042341835,0.0000046317396,0.00080794684,0.0025557384,0.14618863,0.84544265,0.00021653737,0.00021380668],"about_ca_topic_score_codex":0.0000563613,"about_ca_topic_score_gemma":2.6895486e-7,"teacher_disagreement_score":0.08465895,"about_ca_system_score_codex":0.000013747791,"about_ca_system_score_gemma":0.000029133598,"threshold_uncertainty_score":0.33806354},"labels":[],"label_agreement":null},{"id":"W2026608328","doi":"10.5555/1756384.1756394","title":"Prime decompositions of regular prefix codes","year":2002,"lang":"en","type":"article","venue":"International Conference on Implementation and application of automata","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Prefix code; Prefix; Prime (order theory); Computer science; Automaton; Decomposition; Code (set theory); Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Linear code; Combinatorics; Block code; Programming language; Decoding methods","score_opus":0.03602243854098058,"score_gpt":0.33652188973629704,"score_spread":0.30049945119531646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026608328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09139343,0.000034535977,0.87399256,0.005219958,0.0001276296,0.00045555757,0.00014010018,0.00016295478,0.028473245],"genre_scores_gemma":[0.98858577,0.00005061533,0.011159625,0.00008705245,0.000009743589,0.000036805286,0.000037359456,0.0000028179904,0.000030214085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992258,0.00003262047,0.00027581435,0.00018289771,0.00021645734,0.00006641085],"domain_scores_gemma":[0.999297,0.000048155864,0.00022275618,0.00024203617,0.00015774541,0.00003230163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012893857,0.00006981974,0.00009028045,0.00014541898,0.00005173553,0.000040481194,0.00038733715,0.000021193053,0.0002318642],"category_scores_gemma":[0.0000052484343,0.00007110001,0.00003389854,0.00013974027,0.00006222295,0.00019880688,0.00007013172,0.000033625864,0.000009010656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048618926,0.00007875245,0.0002988441,0.000005662389,0.00001883666,8.238945e-8,0.0002211043,0.0000030402232,0.015660195,0.8838255,0.00012073691,0.09976239],"study_design_scores_gemma":[0.003082794,0.0007980612,0.03139309,0.00013977924,0.000043090913,0.000027289887,0.0012254538,0.36227092,0.28122333,0.30873087,0.010501878,0.0005634649],"about_ca_topic_score_codex":0.0000124259695,"about_ca_topic_score_gemma":0.0000042484057,"teacher_disagreement_score":0.89719236,"about_ca_system_score_codex":0.000010103035,"about_ca_system_score_gemma":0.000008748131,"threshold_uncertainty_score":0.28993744},"labels":[],"label_agreement":null},{"id":"W2026640529","doi":"10.2748/tmj/1309952085","title":"On Oda's strong factorization conjecture","year":2011,"lang":"en","type":"article","venue":"Tohoku Mathematical Journal","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Conjecture; Mathematics; Factorization; Sequence (biology); Decomposition; Pure mathematics; Combinatorics; Algorithm","score_opus":0.03626312718531713,"score_gpt":0.24117101254655554,"score_spread":0.2049078853612384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026640529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020657416,0.000013749713,0.9515899,0.00016070639,0.00026172688,0.000058987964,5.583838e-7,0.00009994676,0.027157042],"genre_scores_gemma":[0.96903133,0.000002696401,0.030617751,0.00016339814,0.00009453289,0.0000020176783,2.4309912e-7,0.000008232157,0.00007978056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990098,0.00008729555,0.00023088929,0.00015212479,0.00028701246,0.00023286986],"domain_scores_gemma":[0.9992566,0.00014581595,0.00010341317,0.00028733176,0.00004614315,0.00016068586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038281977,0.00012425639,0.00014588062,0.00011296377,0.00016678202,0.00015859114,0.0005955938,0.000061043575,0.0009022237],"category_scores_gemma":[0.00009066579,0.00008914211,0.000112625574,0.00018761268,0.000041102838,0.00027453245,0.00006697989,0.00030656133,0.00018265861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009909945,0.00010249518,0.0000373637,0.0000067004025,0.000017914155,0.000022369051,0.0011616708,0.0000049790806,0.00008502148,0.9922002,0.00023645903,0.006114921],"study_design_scores_gemma":[0.00020532787,0.000244868,0.00032755325,0.00005158053,0.000009285537,0.00020559233,0.000035583314,0.0012206391,0.0010013694,0.99641114,0.0001612798,0.0001257465],"about_ca_topic_score_codex":2.5126437e-7,"about_ca_topic_score_gemma":1.146987e-7,"teacher_disagreement_score":0.9483739,"about_ca_system_score_codex":0.000019351353,"about_ca_system_score_gemma":0.000024986122,"threshold_uncertainty_score":0.98787165},"labels":[],"label_agreement":null},{"id":"W2027233581","doi":"10.1016/j.ffa.2013.07.004","title":"Existence and properties of k -normal elements over finite fields","year":2013,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Element (criminal law); Prime (order theory); Divisor (algebraic geometry); Degree (music); Combinatorics; Basis (linear algebra); Discrete mathematics; Geometry; Physics","score_opus":0.017728857083650736,"score_gpt":0.21196420681937672,"score_spread":0.19423534973572598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027233581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32534185,0.0007052521,0.6671084,0.000967691,0.000049092727,0.00047264033,0.000012676371,0.00007593008,0.005266464],"genre_scores_gemma":[0.9958963,0.00010463896,0.0032907971,0.00035518018,0.00002394994,0.00018211923,0.0000018990328,0.0000031650231,0.00014194951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994456,0.00002041063,0.00016519919,0.00018638003,0.00005711502,0.00012528311],"domain_scores_gemma":[0.99939394,0.00012667703,0.00006125973,0.0003200892,0.000046325986,0.00005170609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009372693,0.000088926776,0.00009905671,0.00005715309,0.00013635207,0.000075154225,0.00026129727,0.0000595162,0.00004628992],"category_scores_gemma":[0.000010935523,0.00006687252,0.000033337048,0.00016826463,0.000077837874,0.00021301697,0.00017751877,0.000092030255,0.0000066832895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011234749,0.00014705732,0.0050287778,0.00012609395,0.00005917885,3.4253557e-7,0.0043864474,0.000012913306,0.0015507354,0.7962997,0.00034310043,0.19203445],"study_design_scores_gemma":[0.001130218,0.0006528894,0.02580505,0.00022335346,0.000035400382,0.000015432022,0.0008252588,0.059304554,0.0148887625,0.8445942,0.05157821,0.00094669085],"about_ca_topic_score_codex":0.000033243592,"about_ca_topic_score_gemma":0.000006490259,"teacher_disagreement_score":0.67055446,"about_ca_system_score_codex":0.0000013856667,"about_ca_system_score_gemma":0.000009499919,"threshold_uncertainty_score":0.27269822},"labels":[],"label_agreement":null},{"id":"W2027498302","doi":"10.1109/isit.2012.6284696","title":"An algorithm for list decoding number field codes","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Decoding methods; Computer science; List decoding; Algorithm; Field (mathematics); Berlekamp–Welch algorithm; Sequential decoding; Concatenated error correction code; Mathematics; Block code","score_opus":0.01894112619763092,"score_gpt":0.29846814453240456,"score_spread":0.2795270183347736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027498302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007595769,0.00002422863,0.97985935,0.00017689056,0.0004224153,0.00007076462,0.000001364888,0.00019517905,0.0116540585],"genre_scores_gemma":[0.5722396,0.0000018795241,0.4266219,0.0007724875,0.00017368341,0.000013321204,0.0000010731007,0.0000037538634,0.00017232086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994032,0.000028012537,0.000087794986,0.00014848792,0.00007131217,0.0002612209],"domain_scores_gemma":[0.99931294,0.0002218548,0.00002250421,0.00030293112,0.000028774431,0.00011097463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037158377,0.0000727917,0.000074352,0.00003323697,0.00014408957,0.00011818913,0.00041985506,0.000038731272,0.0001672247],"category_scores_gemma":[0.000015061926,0.000062786225,0.000067694506,0.00013971401,0.00001399778,0.00069104723,0.000059138296,0.000044199947,0.000028044671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020202117,0.000058079386,0.0032045946,0.000002735443,0.000006819632,2.618491e-7,0.00028442443,3.7292867e-7,0.00015840822,0.58363074,0.0020283035,0.41062322],"study_design_scores_gemma":[0.0013740441,0.00073273806,0.0029160024,0.00004878547,0.00004749548,0.000095443895,0.00050771143,0.3735983,0.10447217,0.3137305,0.2008873,0.0015894839],"about_ca_topic_score_codex":0.000012133364,"about_ca_topic_score_gemma":0.0000049231503,"teacher_disagreement_score":0.5646438,"about_ca_system_score_codex":0.000005131988,"about_ca_system_score_gemma":0.000006649921,"threshold_uncertainty_score":0.2560348},"labels":[],"label_agreement":null},{"id":"W2028343756","doi":"10.1016/j.ffa.2008.07.002","title":"On ternary Kloosterman sums modulo 12","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kloosterman sum; Mathematics; Modulo; Ternary operation; Class (philosophy); Combinatorics; Discrete mathematics; Characterization (materials science); Arithmetic; Computer science","score_opus":0.01683112379226085,"score_gpt":0.2086362918083391,"score_spread":0.19180516801607825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028343756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042434804,0.000100412435,0.93606055,0.00087078015,0.000060100712,0.00016980535,0.000011538066,0.00015098436,0.020141054],"genre_scores_gemma":[0.99720967,0.000064762724,0.0012836765,0.0009127927,0.00005892302,0.00009707507,0.0000059508207,0.000004618122,0.00036252697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994883,0.000019330848,0.000093356386,0.0002227568,0.000054163607,0.00012210305],"domain_scores_gemma":[0.9992337,0.00018657034,0.000031198324,0.00047257784,0.000015196776,0.00006073217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057957783,0.000090693815,0.00007755148,0.000069775255,0.0002912404,0.00003592665,0.00035107342,0.00005192494,0.00001926823],"category_scores_gemma":[0.0000036722306,0.0000727885,0.00005051167,0.0001525348,0.000050236904,0.0000935304,0.0001024672,0.0001140397,0.00004023372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072999496,0.000107852924,0.0005452017,0.0000068026466,0.000016508173,0.0000035112798,0.0013338308,0.000035830893,0.000101777005,0.93515515,0.0010786405,0.06160759],"study_design_scores_gemma":[0.0005320808,0.00039416397,0.00949563,0.000035539975,0.000007727823,0.000090920825,0.000054587763,0.018722132,0.0012704325,0.81723464,0.15163949,0.0005226848],"about_ca_topic_score_codex":0.0000045712827,"about_ca_topic_score_gemma":0.000002547055,"teacher_disagreement_score":0.95477486,"about_ca_system_score_codex":0.0000025394345,"about_ca_system_score_gemma":0.000008141411,"threshold_uncertainty_score":0.29682288},"labels":[],"label_agreement":null},{"id":"W2028643223","doi":"10.1007/s12095-013-0089-7","title":"Resilience to distinguishing attacks on WG-7 cipher and their generalizations","year":2013,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Stream cipher attack; Computer science; Cipher; Cryptography; Correlation attack; Transposition cipher; Resilience (materials science); Computer security; Theoretical computer science; Arithmetic; Running key cipher; Mathematics; Encryption","score_opus":0.020968303989266152,"score_gpt":0.252730133834662,"score_spread":0.2317618298453958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028643223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2640152,0.0018094955,0.7001642,0.011273144,0.00013982343,0.0005980847,0.000014695181,0.00040693575,0.021578403],"genre_scores_gemma":[0.9566643,0.00027982096,0.041374296,0.0014811286,0.000020919399,0.00014328591,0.000005685861,0.000008546527,0.000022005956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902165,0.00016052794,0.00018558842,0.00032303348,0.00008867505,0.0002205434],"domain_scores_gemma":[0.99761814,0.0003630072,0.00005723092,0.0016718508,0.00010459718,0.00018514945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021177878,0.00015555495,0.00012728102,0.0002418411,0.0009960878,0.0004624203,0.0013010028,0.0000476048,0.000016789278],"category_scores_gemma":[0.000070222835,0.00013402579,0.0000628795,0.0010245158,0.00026670904,0.0003491212,0.0007115349,0.00016844699,0.000011600881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017974312,0.000070416834,0.005221395,0.0000050196795,0.0000175525,1.3871555e-7,0.0026223103,0.000020655989,0.0004710334,0.93156236,0.0010297674,0.058977537],"study_design_scores_gemma":[0.00057139684,0.0004667744,0.15105559,0.0002769946,0.00003045978,0.000022520779,0.0020479595,0.0149313295,0.000750668,0.7314282,0.09722742,0.0011907079],"about_ca_topic_score_codex":0.000054218162,"about_ca_topic_score_gemma":0.00003760061,"teacher_disagreement_score":0.6926491,"about_ca_system_score_codex":0.0000050537888,"about_ca_system_score_gemma":0.0000116367455,"threshold_uncertainty_score":0.76612025},"labels":[],"label_agreement":null},{"id":"W2028694851","doi":"10.1007/s10623-010-9476-7","title":"Swan-like results for binomials and trinomials over finite fields of odd characteristic","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"","keywords":"Trinomial; Finite field; Mathematics; Combinatorics; Prime (order theory); Prime power; Field (mathematics); Discrete mathematics; Pure mathematics","score_opus":0.057652087838254415,"score_gpt":0.2505242201161221,"score_spread":0.19287213227786765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028694851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28844985,0.0005926449,0.7085864,0.000075122516,0.0002988616,0.0004878735,0.00012089405,0.00010625471,0.0012820746],"genre_scores_gemma":[0.96424484,0.0003373128,0.034989998,0.00029445335,0.000047146532,0.000051675528,0.0000074275413,0.000011822189,0.0000152977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984799,0.000114369555,0.0004681451,0.0004936482,0.00012732571,0.0003165801],"domain_scores_gemma":[0.9983689,0.0006941381,0.00024346716,0.00046686918,0.00008622958,0.00014040535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076043565,0.000232404,0.00040167235,0.00039595904,0.00018147746,0.00010721549,0.00039910545,0.00013542721,0.000013060919],"category_scores_gemma":[0.00006441379,0.00020879408,0.0002037072,0.00043367443,0.00021896345,0.00026772873,0.0001263425,0.000094280105,8.285861e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026321253,0.00048749038,0.009077579,0.00038561475,0.0004392396,0.000020546722,0.00850523,0.0000047239328,0.012146246,0.8702496,0.0027023845,0.093349196],"study_design_scores_gemma":[0.014263578,0.008472965,0.21213426,0.00060073304,0.00059619837,0.00006957114,0.0005445086,0.007282012,0.05296423,0.66448766,0.035351068,0.003233216],"about_ca_topic_score_codex":0.000030891955,"about_ca_topic_score_gemma":0.0000067254405,"teacher_disagreement_score":0.675795,"about_ca_system_score_codex":0.000002747388,"about_ca_system_score_gemma":0.000023063323,"threshold_uncertainty_score":0.85143757},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016872427647273036,"score_gpt":0.2551459051146664,"score_spread":0.23827347746739336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028982966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4691582,0.00002869739,0.52938217,0.000018089151,0.00006994913,0.000050223916,9.432345e-8,0.000034285986,0.0012583028],"genre_scores_gemma":[0.8727107,0.0000010300855,0.12725063,0.000011867397,0.0000145877175,0.0000036540416,5.6958913e-7,0.000003839998,0.0000031232973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993988,0.000032479154,0.00022450615,0.00007593597,0.00012704862,0.00014119166],"domain_scores_gemma":[0.9995157,0.0001700147,0.00010357483,0.00015774718,0.000023148064,0.000029799889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005166944,0.00006173936,0.000114266986,0.00017171467,0.000022342843,0.000022817934,0.00022840941,0.00002514354,0.0000027570575],"category_scores_gemma":[0.000022047458,0.00006170766,0.00003967426,0.00031435888,0.000017028167,0.0003262278,0.00007013509,0.00004889237,0.00001328119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024557708,0.0002653865,0.005156086,0.00010522161,0.0000069048588,5.4753593e-7,0.0074729025,0.0016420753,0.0012597367,0.97084284,0.000018961096,0.013226893],"study_design_scores_gemma":[0.00035062403,0.0000475813,0.022053514,0.00010628547,0.0000061720943,0.000010905777,0.00018550268,0.3318522,0.004283464,0.6408924,0.000030427373,0.00018091364],"about_ca_topic_score_codex":0.000002963958,"about_ca_topic_score_gemma":9.198795e-7,"teacher_disagreement_score":0.4035525,"about_ca_system_score_codex":0.000013199751,"about_ca_system_score_gemma":0.0000067897904,"threshold_uncertainty_score":0.25163653},"labels":[],"label_agreement":null},{"id":"W2029378260","doi":"10.1109/tit.2003.814487","title":"Linear transformation shift registers","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shift register; Primitive polynomial; Transformation (genetics); Linear feedback shift register; Enumeration; Linear map; Order (exchange); Computer science; Algorithm; Mathematics; Discrete mathematics; Arithmetic; Finite field; Combinatorics; Biology; Pure mathematics; Genetics","score_opus":0.011209562116979564,"score_gpt":0.22122789059540562,"score_spread":0.21001832847842605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029378260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018783816,0.0000071893946,0.96465826,0.00023989384,0.0007673084,0.00019313396,0.000007794962,0.00036662738,0.03188141],"genre_scores_gemma":[0.9937816,0.000013886381,0.0049844934,0.0010606276,0.000009178057,0.000043205127,0.0000029126454,0.0000060847397,0.00009798383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988249,0.00020681377,0.00036901172,0.00012816406,0.00025338924,0.00021770854],"domain_scores_gemma":[0.9991345,0.00015091272,0.00010355934,0.00046314512,0.000058025773,0.00008990276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089242787,0.00015562301,0.00011164511,0.00040946578,0.0003526095,0.00014199005,0.00036791828,0.000085618,0.00013028401],"category_scores_gemma":[0.000010080931,0.00014935581,0.00015765362,0.00056877785,0.00006203714,0.003443428,7.080357e-7,0.0002179037,0.00045351568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047128295,0.000044702214,6.099133e-7,0.0000180996,0.000020465417,3.2974197e-7,0.005320906,0.0050355126,0.00002169094,0.9186925,0.00004731273,0.07075072],"study_design_scores_gemma":[0.003866856,0.0008823316,0.0001234059,0.0001562885,0.000090494286,0.00011579681,0.0024458023,0.02760686,0.10471035,0.7086034,0.1497924,0.0016060144],"about_ca_topic_score_codex":0.000001502536,"about_ca_topic_score_gemma":0.0000011033276,"teacher_disagreement_score":0.99190325,"about_ca_system_score_codex":0.00003846643,"about_ca_system_score_gemma":0.000046177935,"threshold_uncertainty_score":0.6090553},"labels":[],"label_agreement":null},{"id":"W2030638761","doi":"10.1145/1576702.1576731","title":"On factorization of multivariate polynomials over algebraic number and function fields","year":2009,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Factorization; Algebraic number; Factorization of polynomials; Mathematics; Algebra over a field; Multivariate statistics; Algebraic function; Difference polynomials; Function (biology); Finite field; Pure mathematics; Discrete mathematics; Polynomial; Algorithm; Orthogonal polynomials; Statistics; Mathematical analysis; Matrix polynomial","score_opus":0.00914723466052212,"score_gpt":0.2399271721599932,"score_spread":0.2307799374994711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030638761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2846668,0.0000049501664,0.70954853,0.00014652163,0.00014605088,0.000041366467,2.848273e-7,0.000052462485,0.005393031],"genre_scores_gemma":[0.9980522,0.0000023429702,0.0012895995,0.0005032285,0.00002093421,6.147139e-7,6.4887087e-7,0.0000013952088,0.00012902766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995886,0.000032032298,0.00009400502,0.00013729162,0.00007705274,0.00007098154],"domain_scores_gemma":[0.9996842,0.00007676679,0.000040026905,0.00015569593,0.000017146049,0.000026169748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000990808,0.00005643228,0.00006816543,0.000046977468,0.00003771185,0.000031344724,0.00009267394,0.000043624223,0.00009154246],"category_scores_gemma":[0.000017026452,0.000046432837,0.000029033517,0.0001487305,0.000009931163,0.00019192786,0.000020016696,0.000037921014,0.000005338683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023189334,0.000034747383,0.0006226699,0.0000016815952,0.00000552964,1.8858077e-7,0.00014812006,0.0000118604785,0.003957622,0.96328545,0.00020016593,0.031708777],"study_design_scores_gemma":[0.00064545847,0.0005268928,0.18605217,0.000020593303,0.000009455598,0.000001860804,0.000007354901,0.003645634,0.016418995,0.7917716,0.0007133773,0.00018660224],"about_ca_topic_score_codex":0.000011266945,"about_ca_topic_score_gemma":0.0000011881577,"teacher_disagreement_score":0.7133854,"about_ca_system_score_codex":0.0000032574071,"about_ca_system_score_gemma":0.0000051157867,"threshold_uncertainty_score":0.18934761},"labels":[],"label_agreement":null},{"id":"W2031833962","doi":"10.1016/j.dam.2006.11.007","title":"Generalized hyper-bent functions over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mtext>GF</mml:mtext><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>","year":2007,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bent molecular geometry; Mathematics; Quadratic equation; Function (biology); Quadratic function; Combinatorics; Scroll; Algorithm; Discrete mathematics; Geometry; Theology","score_opus":0.019055043462171014,"score_gpt":0.24291491727254108,"score_spread":0.22385987381037006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031833962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9427976,0.0010501925,0.03777335,0.00043648682,0.0024169544,0.00034071977,0.00048232696,0.0007743311,0.013928062],"genre_scores_gemma":[0.9728166,0.0008047328,0.020645346,0.0016400744,0.00177267,0.0008799098,0.00051974505,0.0006973356,0.00022359555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9874096,0.0003134276,0.003003359,0.002753511,0.0032588867,0.0032612535],"domain_scores_gemma":[0.9902709,0.0018912635,0.002507863,0.003603735,0.00029176407,0.001434484],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.003473887,0.0017557486,0.0010295921,0.0007759467,0.002504649,0.0023248906,0.0035565167,0.0021905592,0.0014496566],"category_scores_gemma":[0.0005644651,0.0024069236,0.002433494,0.0021154948,0.0016211865,0.001341465,0.002803512,0.0021928456,0.003434023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000837597,0.0009226155,0.000012616502,0.0012434836,0.0016091147,0.00033330673,0.0051836325,0.0016088042,0.005064972,0.96748775,0.008034564,0.0076615503],"study_design_scores_gemma":[0.005774013,0.002378282,0.00007772962,0.0022412115,0.0037127407,0.0011564735,0.008301986,0.58870316,0.13600242,0.23303755,0.013463026,0.0051513813],"about_ca_topic_score_codex":0.00042857477,"about_ca_topic_score_gemma":0.00037761364,"teacher_disagreement_score":0.7344502,"about_ca_system_score_codex":0.000080536345,"about_ca_system_score_gemma":0.0008434135,"threshold_uncertainty_score":0.9995188},"labels":[],"label_agreement":null},{"id":"W2032009701","doi":"10.1016/j.ffa.2008.12.001","title":"On permutation polynomials of prescribed shape","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"","keywords":"Mathematics; Permutation (music); Monomial; Combinatorics; Cyclic permutation; Discrete mathematics; Symmetric group","score_opus":0.01871378267860119,"score_gpt":0.22158749130205907,"score_spread":0.20287370862345788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032009701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14144301,0.00011192329,0.8512573,0.00049464835,0.00003127813,0.00019574109,0.000016108856,0.00006765275,0.0063823303],"genre_scores_gemma":[0.9980254,0.00004018856,0.0015508357,0.00022814379,0.000023904402,0.00006651537,0.0000048171437,0.0000027154185,0.000057454225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995964,0.000021615451,0.00011349555,0.00014899785,0.00004637317,0.000073081326],"domain_scores_gemma":[0.999324,0.00028697136,0.00004968118,0.00027638243,0.000030398925,0.000032514014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007157842,0.00006126522,0.00007987568,0.000068725014,0.0001449075,0.000014174455,0.00020937603,0.000042325446,0.0000246906],"category_scores_gemma":[0.000012118629,0.00005023438,0.000042163014,0.00019337934,0.000048078266,0.000070874805,0.00004449695,0.00005916703,0.000007765191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000923374,0.0000769522,0.0001289171,0.000008103458,0.000012229287,3.014444e-7,0.0017675662,0.000038522023,0.0007813898,0.9547824,0.0002681263,0.04212621],"study_design_scores_gemma":[0.0008128701,0.00063470047,0.012449691,0.000050350467,0.000015315894,0.000029373203,0.0001665791,0.036072552,0.015680896,0.9086536,0.024953023,0.0004810062],"about_ca_topic_score_codex":0.00000461023,"about_ca_topic_score_gemma":8.9791666e-7,"teacher_disagreement_score":0.8565824,"about_ca_system_score_codex":0.0000017735648,"about_ca_system_score_gemma":0.00001247164,"threshold_uncertainty_score":0.20484985},"labels":[],"label_agreement":null},{"id":"W2033410192","doi":"10.4153/cmb-2007-007-2","title":"Polynomials for Kloosterman Sums","year":2007,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Kloosterman sum; Modulo; Multiplicative function; Finite field; Multiplicative inverse; Combinatorics; Polynomial; Factorization; Integer (computer science); Quadratic residue; Discrete mathematics; Inverse; Mathematical analysis; Algorithm","score_opus":0.012777083185492638,"score_gpt":0.2359168955431471,"score_spread":0.22313981235765445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033410192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024395736,0.00006208783,0.9114553,0.008861641,0.00025867845,0.0004458403,0.000011520991,0.00015537093,0.05435385],"genre_scores_gemma":[0.95148814,7.705042e-7,0.043043815,0.00358717,0.00015786239,0.000028324064,0.000003020957,0.000018263985,0.0016726403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884653,0.000023730207,0.00023450793,0.0002420207,0.00010675092,0.0005464616],"domain_scores_gemma":[0.9984607,0.00046490185,0.000039101295,0.00042630598,0.000042038297,0.0005669716],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010987082,0.0001192436,0.00016017379,0.00019022217,0.00016496201,0.00012053002,0.00064704206,0.00007680734,0.0011246805],"category_scores_gemma":[0.00017352369,0.000112772635,0.00011704835,0.00017334224,0.00006291124,0.00004259597,0.000045544242,0.00007869219,0.0021964991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053341605,0.000016949125,0.000014222855,0.000027228323,0.0000092628325,0.00001931596,0.00022973542,2.910512e-7,0.00011538664,0.9678979,0.017822966,0.01384143],"study_design_scores_gemma":[0.00033982922,0.00009341313,0.00022541631,0.000047378686,0.000010815244,0.000041319112,0.000047899306,0.0003159881,0.0015016478,0.37141058,0.6256399,0.00032579637],"about_ca_topic_score_codex":0.00009639746,"about_ca_topic_score_gemma":0.00051552354,"teacher_disagreement_score":0.9270924,"about_ca_system_score_codex":0.000050938197,"about_ca_system_score_gemma":0.00007633048,"threshold_uncertainty_score":0.9997884},"labels":[],"label_agreement":null},{"id":"W2035855915","doi":"10.1016/j.laa.2008.09.003","title":"An application of lattice basis reduction to polynomial identities for algebraic structures","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Universidade de São Paulo; University of Saskatchewan","keywords":"Mathematics; Hermite polynomials; Gröbner basis; Lattice reduction; Lattice (music); Algebraic number; Basis (linear algebra); Degree (music); Combinatorics; Reduction (mathematics); Pure mathematics; Commutative property; Matrix (chemical analysis); Degree of a polynomial; Row; Polynomial; Discrete mathematics; Algebra over a field; Mathematical analysis; Geometry; Computer science; Statistics","score_opus":0.0152494029441316,"score_gpt":0.2670228281900699,"score_spread":0.2517734252459383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035855915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3008625,0.0001129883,0.6979373,0.00030580914,0.00004704614,0.0005326612,0.000021328233,0.00008961982,0.00009071843],"genre_scores_gemma":[0.9606952,0.000033565033,0.03849987,0.000115957926,0.00020855915,0.00036193398,0.00001964655,0.000008913051,0.000056361798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923146,0.000023642497,0.00019843073,0.00031407498,0.000103422564,0.00012895581],"domain_scores_gemma":[0.99924326,0.00006170858,0.00008206953,0.0003948544,0.00012376749,0.000094358526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011754584,0.00009523832,0.00011833214,0.00014758007,0.00031412652,0.00003276277,0.00036666903,0.00005090921,0.000004731571],"category_scores_gemma":[0.000013165704,0.000097127595,0.000050836945,0.00042541727,0.000055702814,0.00031250872,0.000051277366,0.00004775412,0.0000065726267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020301575,0.00007195152,0.00008914595,0.000029244133,0.000017521657,6.072783e-8,0.0009748531,0.000076088814,0.0263207,0.9425306,0.000289807,0.029579725],"study_design_scores_gemma":[0.0016061135,0.0011414003,0.019101204,0.000028713925,0.00016731002,0.00017417166,0.00061239226,0.06689513,0.2919198,0.55354995,0.06349634,0.0013074962],"about_ca_topic_score_codex":0.0000087244525,"about_ca_topic_score_gemma":0.0000020930315,"teacher_disagreement_score":0.6598327,"about_ca_system_score_codex":0.0000068046184,"about_ca_system_score_gemma":0.000024312627,"threshold_uncertainty_score":0.39607486},"labels":[],"label_agreement":null},{"id":"W2036466669","doi":"10.1109/tit.2014.2361347","title":"Prefactor Reduction of the Guruswami–Sudan Interpolation Step","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Interpolation (computer graphics); Univariate; Polynomial; Monomial; Applied mathematics; Modulo; Projection (relational algebra); Reduction (mathematics); Discrete mathematics; Algebra over a field; Algorithm; Pure mathematics; Computer science; Mathematical analysis; Multivariate statistics","score_opus":0.006828599215914099,"score_gpt":0.2012428588132299,"score_spread":0.19441425959731579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036466669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012995884,0.0000024087633,0.9783321,0.00013491791,0.0013442041,0.00017540797,0.0000061815804,0.00013749882,0.0068714023],"genre_scores_gemma":[0.9974471,0.000002824813,0.0022439854,0.00016461338,0.000021250895,0.000019433668,0.0000011264053,0.0000041093244,0.00009558213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896765,0.00025073517,0.000331586,0.00010283275,0.00022883076,0.00011835859],"domain_scores_gemma":[0.99897355,0.00013366464,0.00020925075,0.0005520525,0.00009439616,0.000037111062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066689093,0.000107362845,0.000094403214,0.00023506524,0.0002338659,0.000068803325,0.00049387215,0.00006447502,0.000052202362],"category_scores_gemma":[0.000015592646,0.00008089749,0.00014660657,0.0004581464,0.000087099914,0.0015651342,0.0000040888635,0.00017194376,0.000048574522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083748775,0.000062536266,0.000006999449,0.000027249815,0.000029291583,1.1083516e-8,0.0032761986,0.0033160879,0.0012334554,0.6551437,0.00009600363,0.33672473],"study_design_scores_gemma":[0.0024444214,0.0011238107,0.0025984717,0.00040082814,0.00013121104,0.000058821286,0.0019793299,0.2350616,0.33421254,0.3993805,0.021554453,0.0010539974],"about_ca_topic_score_codex":0.0000045019246,"about_ca_topic_score_gemma":0.0000014284883,"teacher_disagreement_score":0.9844512,"about_ca_system_score_codex":0.00002691332,"about_ca_system_score_gemma":0.000025721169,"threshold_uncertainty_score":0.32989037},"labels":[],"label_agreement":null},{"id":"W2037565534","doi":"10.1016/j.jcta.2012.05.003","title":"Weil sums of binomials, three-level cross-correlation, and a conjecture of Helleseth","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Integer (computer science); Prime (order theory); Coprime integers; Discrete mathematics; Prime power; Sequence (biology); Character (mathematics); Binary number; Arithmetic","score_opus":0.015578767243669647,"score_gpt":0.24843029463459676,"score_spread":0.23285152739092713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037565534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9350047,0.0018895773,0.05687139,0.00012738764,0.005440416,0.00010698855,0.000009308583,0.000016314996,0.00053390133],"genre_scores_gemma":[0.9974052,0.00005730067,0.0021476613,0.000020776193,0.0003295948,9.618319e-7,3.7640658e-7,0.000008911074,0.000029244464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847496,0.00025369663,0.0006328741,0.000108103144,0.00031926244,0.00021110201],"domain_scores_gemma":[0.9978396,0.00052276184,0.0008540121,0.0002952058,0.00036252802,0.00012586797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025353178,0.00015270183,0.0004367862,0.00019620969,0.00010382164,0.000058905174,0.00055746024,0.000120928074,0.000034268618],"category_scores_gemma":[0.00027606366,0.00012158374,0.00018572004,0.0003571805,0.00035860937,0.0010846815,0.00017133493,0.00023471407,7.4777176e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072432315,0.000110272966,0.011567809,0.000036685433,0.00009295986,0.0000022122367,0.0017398373,0.000016590266,0.0020394134,0.98131627,0.00007948805,0.0022741128],"study_design_scores_gemma":[0.0015813544,0.00082422094,0.0116194915,0.0000875112,0.000041923056,0.0001261866,0.00015310643,0.000022969081,0.016540267,0.96675086,0.0020971852,0.00015495175],"about_ca_topic_score_codex":0.0000034959278,"about_ca_topic_score_gemma":8.4287e-7,"teacher_disagreement_score":0.062400457,"about_ca_system_score_codex":0.0000149339285,"about_ca_system_score_gemma":0.000106003994,"threshold_uncertainty_score":0.4958041},"labels":[],"label_agreement":null},{"id":"W2038133289","doi":"10.1109/ccece.2010.5575253","title":"Retimed two-step CRC computation on FPGA","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Western University","funders":"","keywords":"Retiming; Field-programmable gate array; Computer science; Cyclic redundancy check; Computation; Parallel computing; Redundancy (engineering); Architecture; Critical path method; Gate array; Reconfigurable computing; Algorithm; Computer architecture; Embedded system; Engineering","score_opus":0.01017250073737118,"score_gpt":0.25162253981354843,"score_spread":0.24145003907617724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038133289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12632224,0.000002201427,0.7680047,0.0009231798,0.0007915069,0.00007904296,3.292042e-7,0.00038530934,0.10349146],"genre_scores_gemma":[0.9360885,3.1415647e-7,0.06281839,0.00075400993,0.000065466025,0.0000036750814,0.0000010492512,0.0000038380726,0.00026472154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934375,0.000041423227,0.00009731724,0.00022680077,0.00015053079,0.00014018227],"domain_scores_gemma":[0.99940217,0.00012697367,0.000032662567,0.00033732026,0.000038210354,0.00006265523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002750465,0.000076833596,0.00006681299,0.00009375672,0.00010274312,0.00011006124,0.00041655573,0.00003449649,0.00010762072],"category_scores_gemma":[0.000019975787,0.00006469112,0.000053415653,0.00027482517,0.000035990073,0.00016206378,0.00007569653,0.00015951079,0.00023534596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070237375,0.00004190963,0.00010773439,0.0000014712333,0.0000036818865,0.0000029205494,0.00010805243,0.000048874437,0.002615469,0.8676308,0.0018871448,0.12754492],"study_design_scores_gemma":[0.0018878367,0.0006818243,0.0116876345,0.000032693333,0.000013350245,0.00004494946,0.000044358054,0.33908948,0.035388295,0.5711423,0.039111517,0.0008757231],"about_ca_topic_score_codex":0.000007662715,"about_ca_topic_score_gemma":0.0000146747425,"teacher_disagreement_score":0.8097663,"about_ca_system_score_codex":0.0000037253205,"about_ca_system_score_gemma":0.000012513882,"threshold_uncertainty_score":0.30249748},"labels":[],"label_agreement":null},{"id":"W2040499330","doi":"10.5539/jmr.v7n2p18","title":"The Distribution of Zeros of Quadratic Forms over Finite Fields","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Finite field; Prime (order theory); Distribution (mathematics); Field (mathematics); Type (biology); Mathematical analysis; Pure mathematics","score_opus":0.12018099274955318,"score_gpt":0.3836044058321988,"score_spread":0.2634234130826456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040499330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50633126,0.00021228445,0.49201122,0.00051827705,0.000113609975,0.000090559755,0.000002325174,0.0000040656537,0.0007164106],"genre_scores_gemma":[0.9959654,0.00005185677,0.0038916736,0.0000043551668,0.000026350992,0.0000012705264,2.0147623e-7,0.0000028447103,0.000056003268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998138,0.00016393246,0.00049184804,0.00005196904,0.0009847761,0.00016946922],"domain_scores_gemma":[0.99674517,0.0016808583,0.00033585215,0.00035755962,0.0007983324,0.00008222967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066981358,0.000051078296,0.00017081495,0.000121154735,0.00008235974,0.00006822984,0.0009369827,0.00004307382,0.000004771778],"category_scores_gemma":[0.0013957989,0.00002867086,0.00011696247,0.0004661457,0.00014708031,0.0002055703,0.00018302152,0.00028738868,0.0000026103671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065006454,0.0003684739,0.0003151635,0.00018013328,0.00007169283,0.000007941943,0.0044579636,0.00022435951,0.00088705734,0.98357135,0.0035307442,0.0063200844],"study_design_scores_gemma":[0.00042049002,0.0008145985,0.0002871103,0.00019897705,0.000008406777,0.000027338963,0.000955119,0.018767092,0.008091356,0.96947104,0.00090313266,0.000055330707],"about_ca_topic_score_codex":0.0000026048147,"about_ca_topic_score_gemma":0.0000016143723,"teacher_disagreement_score":0.4896342,"about_ca_system_score_codex":0.000023745011,"about_ca_system_score_gemma":0.00015208754,"threshold_uncertainty_score":0.23214535},"labels":[],"label_agreement":null},{"id":"W2042316519","doi":"10.1006/ffta.2000.0294","title":"Intersections of Hyperconics in Projective Planes of Even Order","year":2001,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Projective plane; Projective test; Lift (data mining); Equivalence relation; Pure mathematics; Finite field; Order (exchange); Equivalence (formal languages); Intersection (aeronautics); Complete intersection; Combinatorics; Discrete mathematics; Geometry; Computer science","score_opus":0.012984920197248366,"score_gpt":0.22919723159603048,"score_spread":0.2162123113987821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042316519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15326534,0.00012512966,0.8401434,0.00027474717,0.000027331427,0.00020681633,0.000014214134,0.000024456996,0.0059185917],"genre_scores_gemma":[0.99825275,0.000070023256,0.0015390639,0.000035050703,0.0000089662135,0.00006436969,0.0000023909183,0.0000018199272,0.000025561096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996576,0.0000189048,0.00012325619,0.00011104675,0.000027329892,0.00006188138],"domain_scores_gemma":[0.99951136,0.00018372304,0.00004529925,0.000203353,0.000041331343,0.000014934294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082956205,0.00004731445,0.00008481713,0.00011211989,0.000036207595,0.0000070552337,0.00017215333,0.00003976935,0.000009056088],"category_scores_gemma":[0.000010243772,0.00003948739,0.000026114334,0.0005143807,0.000041565756,0.000064083695,0.00005428071,0.0000698573,8.525421e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002238244,0.00029234117,0.009089455,0.00003399525,0.00003966947,5.327555e-7,0.009019471,0.00016550605,0.000815902,0.8973416,0.00003922057,0.08313992],"study_design_scores_gemma":[0.0011219785,0.0006836226,0.02836381,0.0001690573,0.000024903971,0.000053976586,0.00451755,0.026599513,0.0057459446,0.89115775,0.04103865,0.0005232505],"about_ca_topic_score_codex":0.000055849086,"about_ca_topic_score_gemma":0.00010788929,"teacher_disagreement_score":0.8449874,"about_ca_system_score_codex":0.0000022610545,"about_ca_system_score_gemma":0.000016052125,"threshold_uncertainty_score":0.16102491},"labels":[],"label_agreement":null},{"id":"W2043217677","doi":"10.1007/s00373-010-0980-3","title":"Characterizations of Bent and Almost Bent Function on $${\\mathbb{Z}_p^2}$$","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Centre de Recherches Mathématiques","keywords":"Bent molecular geometry; Combinatorics; Bent function; Mathematics; Permutation group; Degenerate energy levels; Graph; Function (biology); Exponential function; Discrete mathematics; Permutation (music); Boolean function; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.004398247008042404,"score_gpt":0.18300560634441182,"score_spread":0.17860735933636943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043217677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98677164,0.000087687506,0.011076094,0.00026647985,0.00086842594,0.00010308307,0.0000043642835,0.000071527014,0.00075067655],"genre_scores_gemma":[0.9994347,0.00009964211,0.00025622608,0.00016202973,0.00000994586,0.0000086606815,0.0000038020178,0.0000050291605,0.000019953228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993332,0.00003457528,0.00014292376,0.00022262601,0.00013979268,0.00012687212],"domain_scores_gemma":[0.99940324,0.000076843535,0.00007861686,0.00029297895,0.000064411906,0.00008388788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002739431,0.00010485485,0.00011675008,0.00015713756,0.00018026806,0.00007161391,0.00017673151,0.000059708156,0.0000059622666],"category_scores_gemma":[0.00001807146,0.000095891904,0.00004468368,0.00043445217,0.000068545975,0.00015184763,0.000090611116,0.00014376179,0.0000010498875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007604512,0.00011922877,0.0048067747,0.0000143021525,0.000011266542,7.261023e-7,0.00017690139,2.4835452e-7,0.0027878368,0.97556835,0.00004887569,0.016457897],"study_design_scores_gemma":[0.0005156376,0.0008531863,0.14375411,0.000031860218,0.000024641178,0.000009011894,0.00004612176,0.001182699,0.0013703363,0.84514123,0.0068220925,0.00024905914],"about_ca_topic_score_codex":0.0000040434084,"about_ca_topic_score_gemma":0.0000020174916,"teacher_disagreement_score":0.13894734,"about_ca_system_score_codex":0.0000024383219,"about_ca_system_score_gemma":0.000010043677,"threshold_uncertainty_score":0.39103585},"labels":[],"label_agreement":null},{"id":"W2043309691","doi":"10.1049/ip-com:20000663","title":"Acyclic Tanner graphs and maximum-likelihood decoding of linear block codes","year":2000,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tanner graph; Decoding methods; List decoding; Coset; Sequential decoding; Block code; Linear code; Mathematics; Hamming code; Concatenated error correction code; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.018493884401176233,"score_gpt":0.2588540239813282,"score_spread":0.24036013958015195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043309691","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9634989,0.0019209813,0.003501118,0.003315707,0.00007020576,0.00033201868,0.000013766975,0.00048370424,0.026863609],"genre_scores_gemma":[0.9331178,0.001262908,0.065339684,0.00016491681,0.000012844914,0.0000341692,0.000002639358,0.0000121676785,0.00005284083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891734,0.000031839118,0.00033406078,0.00028612782,0.00016802737,0.0002625858],"domain_scores_gemma":[0.9985184,0.00017306104,0.00013644603,0.00088698923,0.00017219706,0.000112911184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004498642,0.00015940197,0.00020789121,0.00021801176,0.00052306824,0.00012925189,0.002125441,0.00007358127,0.00002996453],"category_scores_gemma":[0.000044811844,0.00015970964,0.00009634776,0.00092304824,0.0002980423,0.0005398197,0.00047025477,0.00023756758,0.000014918345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027593316,0.00043567273,0.009700733,0.00007478683,0.000113145004,7.152592e-7,0.007056893,0.0000081307535,0.011415278,0.79846454,0.00090132054,0.1718012],"study_design_scores_gemma":[0.0011469518,0.00033883195,0.007317109,0.00035695508,0.00011840014,0.000117093026,0.00070535194,0.032851595,0.009365157,0.9021941,0.044592936,0.00089555886],"about_ca_topic_score_codex":0.000023659622,"about_ca_topic_score_gemma":0.000009192947,"teacher_disagreement_score":0.17090563,"about_ca_system_score_codex":0.000010580194,"about_ca_system_score_gemma":0.000023178633,"threshold_uncertainty_score":0.651277},"labels":[],"label_agreement":null},{"id":"W2043513759","doi":"10.1007/s10623-013-9820-9","title":"Bent functions on partial spreads","year":2013,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bent molecular geometry; Prime (order theory); Combinatorics; Binary number; Mathematics; Construct (python library); Physics; Discrete mathematics; Arithmetic; Materials science; Computer science","score_opus":0.019956213162082383,"score_gpt":0.22143287092174982,"score_spread":0.20147665775966744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043513759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14418897,0.00025465706,0.84593815,0.0007246542,0.0003862082,0.00033674785,0.0000063632633,0.00039987123,0.0077644046],"genre_scores_gemma":[0.9885187,0.00005932758,0.010377586,0.0007689998,0.00008692846,0.00012964137,0.000004219134,0.000011803742,0.000042767464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859166,0.000114884984,0.00021057334,0.00047743676,0.00022462079,0.00038080927],"domain_scores_gemma":[0.9989431,0.00016812254,0.000061073,0.0005457858,0.00006638115,0.00021557495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022672734,0.00022157693,0.00018321049,0.00034051534,0.00038961935,0.00042520888,0.0004231916,0.00007786332,0.00016888358],"category_scores_gemma":[0.000010544714,0.00018804855,0.00019404606,0.0007539381,0.00014588493,0.00038666202,0.00010371289,0.00015902969,0.00013517274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019564466,0.00018402799,0.0034653428,0.000009619641,0.00006878173,0.000004705842,0.0002951397,0.00002842784,0.002192549,0.91284066,0.0060647507,0.07482645],"study_design_scores_gemma":[0.0023044513,0.004073015,0.07679324,0.00017973699,0.00014235606,0.00007929041,0.0006209085,0.014821166,0.009242418,0.7789903,0.11041413,0.0023389463],"about_ca_topic_score_codex":0.000033516866,"about_ca_topic_score_gemma":0.0000033877202,"teacher_disagreement_score":0.8443298,"about_ca_system_score_codex":0.0000057236184,"about_ca_system_score_gemma":0.0000137086745,"threshold_uncertainty_score":0.76683974},"labels":[],"label_agreement":null},{"id":"W2043992837","doi":"10.1016/j.ffa.2008.01.003","title":"Elliptic curves and explicit enumeration of irreducible polynomials with two coefficients prescribed","year":2008,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Mathematics; Enumeration; Kronecker delta; Finite field; Class (philosophy); Combinatorics; Elliptic curve; Field (mathematics); Pure mathematics; Discrete mathematics","score_opus":0.016508143454731904,"score_gpt":0.21830942351021673,"score_spread":0.20180128005548484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043992837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12576401,0.0009880917,0.8714187,0.00038129327,0.000017404323,0.00028681668,0.000013385756,0.000044729873,0.0010855357],"genre_scores_gemma":[0.9969041,0.0003735403,0.0023571488,0.00017300033,0.000020411675,0.000099597244,0.000006953359,0.000003782062,0.00006147231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948335,0.000025734234,0.00012868058,0.00020801269,0.000059219605,0.00009500051],"domain_scores_gemma":[0.9993738,0.0001594781,0.00006289545,0.00031243003,0.000044719905,0.00004666352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009828088,0.000081779166,0.00011213471,0.00006418625,0.00018507334,0.000025902025,0.00016779901,0.000028819304,0.000007010059],"category_scores_gemma":[0.0000063712982,0.00006282337,0.000021694394,0.0002580567,0.000071995906,0.000120534285,0.000058827634,0.00005801773,0.0000016771788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007103724,0.0005940189,0.0052796076,0.0002543151,0.00012835841,0.000001897124,0.01063167,0.00038184092,0.008680541,0.9005025,0.000993858,0.07248037],"study_design_scores_gemma":[0.0126475,0.0057883426,0.06325115,0.0024989215,0.00040771952,0.00075615646,0.0020910816,0.16484997,0.2509455,0.34493038,0.1465167,0.0053165997],"about_ca_topic_score_codex":0.000016989285,"about_ca_topic_score_gemma":0.0000037520713,"teacher_disagreement_score":0.87114006,"about_ca_system_score_codex":0.0000015914309,"about_ca_system_score_gemma":0.00001778212,"threshold_uncertainty_score":0.25618625},"labels":[],"label_agreement":null},{"id":"W2044689213","doi":"10.1007/s10623-012-9696-0","title":"On self-dual cyclic codes over finite chain rings","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Chain (unit); Dual (grammatical number); Mathematics; Lift (data mining); Finite field; Ring (chemistry); Code (set theory); Cyclic code; Extension (predicate logic); Discrete mathematics; Linear code; Topology (electrical circuits); Pure mathematics; Computer science; Combinatorics; Block code; Physics; Algorithm; Decoding methods; Chemistry; Quantum mechanics","score_opus":0.01801084104784086,"score_gpt":0.23823752730799233,"score_spread":0.22022668626015146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044689213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54729164,0.0013683835,0.4441395,0.00016196822,0.00049096195,0.00032090084,0.000017902019,0.00086364266,0.0053450614],"genre_scores_gemma":[0.9769655,0.00020797986,0.021403935,0.0011722266,0.00015608108,0.000047484606,0.0000050679396,0.000025274818,0.000016452517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977641,0.00023688539,0.00029310767,0.0005435014,0.0003746347,0.0007877531],"domain_scores_gemma":[0.99812514,0.00069007225,0.00012781328,0.0006461099,0.000046254838,0.00036462216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008728925,0.0003813216,0.00032963304,0.0005908019,0.00045739036,0.00028889498,0.00053420634,0.00014343037,0.000043854154],"category_scores_gemma":[0.00003159406,0.00033983815,0.0002709158,0.0011387895,0.00017134739,0.000630023,0.0001962584,0.00027231398,0.000028096805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004678405,0.0003415624,0.014898784,0.0000283076,0.00012218513,0.0000092954715,0.001862521,0.000015946189,0.0012830971,0.97174597,0.0009913268,0.008654228],"study_design_scores_gemma":[0.004908733,0.0034279716,0.17293744,0.00045071176,0.00035780115,0.00019172776,0.00060910574,0.013819834,0.013029383,0.69522274,0.09019706,0.004847482],"about_ca_topic_score_codex":0.000017496644,"about_ca_topic_score_gemma":0.000003684518,"teacher_disagreement_score":0.42967385,"about_ca_system_score_codex":0.0000126948025,"about_ca_system_score_gemma":0.000016554433,"threshold_uncertainty_score":0.99990535},"labels":[],"label_agreement":null},{"id":"W2047352316","doi":"10.1007/s10623-012-9647-9","title":"Composed products and factors of cyclotomic polynomials over finite fields","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Factorization; Finite field; Primitive root modulo n; Multiplicative function; Combinatorics; Root of unity; Mathematics; Cyclotomic polynomial; Prime (order theory); Coprime integers; Modulo; Prime factor; Euler's totient function; Polynomial; Cyclotomic field; Discrete mathematics; Euler's formula; Physics","score_opus":0.028276242320169585,"score_gpt":0.242050483323458,"score_spread":0.2137742410032884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047352316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88825613,0.0017177847,0.109065324,0.00007843822,0.00019832002,0.00019779323,0.000011296402,0.000089461915,0.00038545122],"genre_scores_gemma":[0.9894993,0.00018576799,0.010078567,0.00015432882,0.000055093155,0.000008693802,0.0000032750086,0.00001036521,0.000004654483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99876285,0.00013542578,0.0002579704,0.00031928418,0.00016207703,0.00036238678],"domain_scores_gemma":[0.9988872,0.00036748906,0.00013014206,0.00039860545,0.000046603833,0.00016996555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043097875,0.0002181518,0.00030478876,0.00033649328,0.00016395733,0.000097205346,0.00030617608,0.00009769097,0.000013807569],"category_scores_gemma":[0.000030283425,0.00018498318,0.000113661175,0.0006073581,0.00021847505,0.0004293795,0.0001468241,0.00011936751,8.9459104e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011681232,0.00039549032,0.39752904,0.00019437616,0.00024468574,0.0000033700346,0.005802437,0.000013808747,0.049977988,0.5296405,0.0007817105,0.015299766],"study_design_scores_gemma":[0.00246224,0.0013286485,0.79934263,0.00021135728,0.00021477739,0.000043197855,0.0005511043,0.0023030727,0.10799668,0.07239658,0.0112629775,0.0018867091],"about_ca_topic_score_codex":0.000028752569,"about_ca_topic_score_gemma":0.0000023002833,"teacher_disagreement_score":0.45724395,"about_ca_system_score_codex":0.000003023639,"about_ca_system_score_gemma":0.000014868246,"threshold_uncertainty_score":0.7543395},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020611282187498612,"score_gpt":0.24222856246153893,"score_spread":0.22161728027404032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047782372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20386547,0.001993569,0.7921452,0.0002485813,0.000037410417,0.00048046172,0.000011276691,0.00010834534,0.0011096892],"genre_scores_gemma":[0.9543639,0.00029868228,0.04503243,0.0001637568,0.00001770281,0.00011077812,0.00000532847,0.0000049052833,0.0000025398954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907917,0.00008440187,0.00021071087,0.0003007006,0.00014120064,0.00018380376],"domain_scores_gemma":[0.99932414,0.000112435,0.0000918009,0.0002966436,0.000064046806,0.00011092961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017149336,0.00013676123,0.00018270744,0.00022199721,0.00027454636,0.00015316505,0.00034479974,0.00003808047,0.000057793433],"category_scores_gemma":[0.000001917235,0.000115194605,0.00006960146,0.0004706958,0.00035658825,0.00031773918,0.00015316054,0.00007234304,0.0000024632945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090877265,0.00010330349,0.03183376,0.0000832663,0.00006298897,0.0000010995274,0.0008515932,0.000005767351,0.01763921,0.82814604,0.0005211956,0.120742664],"study_design_scores_gemma":[0.0012093881,0.00084918307,0.07963619,0.00017750663,0.00007746648,0.000057140263,0.0016377561,0.008122165,0.0060140085,0.88339674,0.017927734,0.0008946985],"about_ca_topic_score_codex":0.000085206746,"about_ca_topic_score_gemma":0.000003536189,"teacher_disagreement_score":0.7504984,"about_ca_system_score_codex":0.0000019902907,"about_ca_system_score_gemma":0.000010124876,"threshold_uncertainty_score":0.46975},"labels":[],"label_agreement":null},{"id":"W2048600387","doi":"10.1504/ijwmc.2005.008054","title":"The editing generator and its cryptanalysis","year":2005,"lang":"en","type":"article","venue":"International Journal of Wireless and Mobile Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Stream cipher; Self-shrinking generator; Generator (circuit theory); Cryptanalysis; Shift register; Randomness; Random number generation; Correlation attack; Algorithm; Cryptography; Sequence (biology); Theoretical computer science; Mathematics; Electrical engineering; Telecommunications; Statistics","score_opus":0.0071705195215215215,"score_gpt":0.24902696795747517,"score_spread":0.24185644843595364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048600387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8912584,0.002731644,0.10413839,0.0011483929,0.000599042,0.000026548405,5.542091e-7,0.000012946078,0.00008404504],"genre_scores_gemma":[0.99491954,0.0004214423,0.0033790444,0.00016548803,0.0011006851,7.85183e-7,1.3205334e-7,0.0000035171051,0.000009358334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991503,0.000052246178,0.00030574124,0.00011429328,0.0002619333,0.00011551666],"domain_scores_gemma":[0.9990312,0.00024341061,0.00027632114,0.000072100076,0.0003109956,0.00006598225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069381046,0.00007463679,0.000110294655,0.00010423446,0.00024145207,0.00036862819,0.00053627964,0.000021147556,0.0000023863572],"category_scores_gemma":[0.0000351647,0.000052067106,0.00007220524,0.000100515215,0.00003449802,0.00029306376,0.00022875187,0.00013034139,6.6035403e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009922727,0.00002426334,0.00070204603,0.0000026760372,0.00013963823,0.000017171451,0.0008076441,0.0012682923,0.0020005081,0.07055888,0.00010622846,0.9243627],"study_design_scores_gemma":[0.0010306062,0.00020505874,0.0021258933,0.00021128362,0.000045485896,0.00086220907,0.0006057024,0.9365854,0.0070397398,0.004704021,0.046282485,0.0003020845],"about_ca_topic_score_codex":0.0000010331657,"about_ca_topic_score_gemma":0.0000017422706,"teacher_disagreement_score":0.93531716,"about_ca_system_score_codex":0.000016487525,"about_ca_system_score_gemma":0.000020374058,"threshold_uncertainty_score":0.355469},"labels":[],"label_agreement":null},{"id":"W2048643528","doi":"10.1142/s1793042111004587","title":"SOME FOURTH-ORDER LINEAR DIVISIBILITY SEQUENCES","year":2011,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Divisibility rule; Mathematics; Order (exchange); Class (philosophy); Combinatorics; Pure mathematics; Discrete mathematics; Computer science","score_opus":0.03145186301017809,"score_gpt":0.28481356452991613,"score_spread":0.253361701519738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048643528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28861427,0.00022653525,0.68956023,0.0007561897,0.0051423535,0.00007554393,0.000022680611,0.00009425361,0.015507966],"genre_scores_gemma":[0.9460326,0.0000352407,0.05268624,0.000496882,0.0005902869,0.0000016414895,9.869497e-7,0.0000070877622,0.0001490562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858403,0.00023296605,0.0003917552,0.00016567283,0.0004753887,0.00015015803],"domain_scores_gemma":[0.9984219,0.00031736807,0.00032764827,0.00025529607,0.0005833704,0.00009440396],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014487538,0.00011285785,0.00014577738,0.00014758042,0.00005342622,0.00007326286,0.0019158465,0.000046469508,0.0014746627],"category_scores_gemma":[0.00024084667,0.00008946397,0.00020608929,0.0001695713,0.00012740765,0.0011202109,0.00021623884,0.00022699614,0.000098109136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017930975,0.0002365008,0.0064348127,0.000003160766,0.00026449858,0.00021048312,0.002655419,0.000019520434,0.00019020347,0.9614648,0.0005898202,0.02775143],"study_design_scores_gemma":[0.00030354195,0.000086803106,0.0045546833,0.000049246333,0.000010830043,0.0004308332,0.000085547166,0.00025967197,0.0014293183,0.9900076,0.0026518297,0.00013011153],"about_ca_topic_score_codex":0.0000060798566,"about_ca_topic_score_gemma":0.0000011776373,"teacher_disagreement_score":0.6574183,"about_ca_system_score_codex":0.000033134882,"about_ca_system_score_gemma":0.000085775464,"threshold_uncertainty_score":0.9994381},"labels":[],"label_agreement":null},{"id":"W2049009474","doi":"10.1016/j.tcs.2005.04.011","title":"Results on multiples of primitive polynomials and their products over GF(2)","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Primitive polynomial; Multiple; Mathematics; Cryptosystem; Cryptography; GF(2); Discrete mathematics; Degree (music); Arithmetic; Polynomial; Connection (principal bundle); Combinatorics; Finite field; Algorithm; Physics","score_opus":0.012278168014508201,"score_gpt":0.23608899362235822,"score_spread":0.22381082560785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049009474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.574946,0.000063690655,0.41668618,0.00271807,0.00032070637,0.00027481068,0.000011345839,0.00016816537,0.004811066],"genre_scores_gemma":[0.9389135,0.000007086066,0.06042448,0.00049243507,0.00014921036,0.0000030745155,3.7867045e-7,0.000005326165,0.00000447352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99795544,0.00015005124,0.00031602284,0.00079548714,0.00037447474,0.00040851466],"domain_scores_gemma":[0.99804246,0.00067776494,0.00011370814,0.0008420988,0.00015491198,0.00016907183],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018907691,0.00019665837,0.00023942036,0.00024585996,0.00024769912,0.00017674593,0.001448096,0.000044254844,0.000006139664],"category_scores_gemma":[0.00025219822,0.00013889554,0.0000588205,0.0009145121,0.0031078742,0.00050650735,0.000775723,0.00015157048,0.000010415574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006866817,0.00009236941,0.000020199885,0.0000052412092,0.000003878502,0.0000010514075,0.0015192885,0.000041819214,0.006006246,0.87549996,0.000034776705,0.116706505],"study_design_scores_gemma":[0.0015510486,0.0016378004,0.013789567,0.00020149507,0.000009240388,0.0000404656,0.00003849222,0.21762729,0.5152913,0.2477613,0.0013467382,0.0007052898],"about_ca_topic_score_codex":0.000001519832,"about_ca_topic_score_gemma":4.0395264e-7,"teacher_disagreement_score":0.62773865,"about_ca_system_score_codex":0.000022198657,"about_ca_system_score_gemma":0.00007204911,"threshold_uncertainty_score":0.9996051},"labels":[],"label_agreement":null},{"id":"W2049569453","doi":"10.1007/s10623-010-9472-y","title":"Quaternary Golay sequence pairs II: odd length","year":2010,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; Simon Fraser University; University of Alberta","funders":"","keywords":"Binary Golay code; Sequence (biology); Phase (matter); Mathematics; Complementary sequences; Combinatorics; Physics; Statistics; Biology; Genetics","score_opus":0.027707946345817868,"score_gpt":0.24963169883913697,"score_spread":0.2219237524933191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049569453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6426888,0.00037571078,0.3519854,0.00053580775,0.00067285856,0.0002272466,0.000012267923,0.0005799505,0.0029219594],"genre_scores_gemma":[0.9432401,0.00015812264,0.05589248,0.0005167036,0.000103972816,0.000037491864,0.00000433417,0.000019280042,0.000027503527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979835,0.00013985735,0.0002977672,0.000708261,0.0003282566,0.00054231513],"domain_scores_gemma":[0.9984107,0.00019777479,0.00011616663,0.00090214855,0.0000878341,0.00028535494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007602806,0.00033249907,0.00028841218,0.0004148913,0.00071305974,0.00035603656,0.001101776,0.00016271092,0.000061741695],"category_scores_gemma":[0.000025658699,0.00029534317,0.00025325335,0.0010110497,0.00038357152,0.00063089246,0.00032867794,0.00047403233,0.000015843267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030611154,0.00014427389,0.015043615,0.000023186949,0.000072230614,0.000045378194,0.0010763088,0.0000040873797,0.0655338,0.8601096,0.00089879887,0.057018075],"study_design_scores_gemma":[0.0020310672,0.0023019991,0.021028744,0.00016628472,0.00013078067,0.0005366257,0.00043114973,0.017552942,0.032874916,0.8073422,0.112605676,0.0029976645],"about_ca_topic_score_codex":0.000043630425,"about_ca_topic_score_gemma":0.000023113525,"teacher_disagreement_score":0.3005513,"about_ca_system_score_codex":0.00000483324,"about_ca_system_score_gemma":0.000039034934,"threshold_uncertainty_score":0.9999499},"labels":[],"label_agreement":null},{"id":"W2051279135","doi":"10.1142/s1793042115500803","title":"Construction of all cubic function fields of a given square-free discriminant","year":2015,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Discriminant; Square (algebra); Mathematics; Cubic function; Finite field; Function (biology); Polynomial; Quadratic equation; Discriminant function analysis; Field (mathematics); Degree (music); Function field; Algebraic number field; Quadratic function; Pure mathematics; Discrete mathematics; Combinatorics; Mathematical analysis; Statistics; Geometry; Computer science; Artificial intelligence","score_opus":0.02506257259099395,"score_gpt":0.2749664585732548,"score_spread":0.24990388598226085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051279135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28425708,0.0001264929,0.70410544,0.0010045909,0.003425332,0.00005196849,0.00002371727,0.000017696322,0.0069877086],"genre_scores_gemma":[0.99123204,0.000013768157,0.008443719,0.00009270282,0.00016126812,0.0000010040882,0.0000019302902,0.000004292224,0.00004930105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987341,0.00016308937,0.00043352207,0.000092856804,0.0004941694,0.000082234656],"domain_scores_gemma":[0.9982007,0.00022493003,0.00057377695,0.0002249251,0.0007097895,0.00006584362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008790987,0.00007865292,0.00016297234,0.00018872188,0.000013988124,0.000026129035,0.00097504805,0.000048458216,0.00017847317],"category_scores_gemma":[0.00022783667,0.00006495758,0.0001815471,0.00012504529,0.00011563274,0.0004419485,0.00015983434,0.00013340512,0.00000507484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077156007,0.00019286267,0.002029916,0.000012917918,0.00031853898,0.000024204852,0.002020798,0.000110374065,0.0008656944,0.94047374,0.003643376,0.049536046],"study_design_scores_gemma":[0.00093665527,0.00034797282,0.0015842535,0.00014216018,0.000042549145,0.00040388343,0.00057916786,0.00021777843,0.0033176797,0.9877979,0.0045414213,0.000088586465],"about_ca_topic_score_codex":0.000009660228,"about_ca_topic_score_gemma":0.0000025214958,"teacher_disagreement_score":0.7069749,"about_ca_system_score_codex":0.00003068254,"about_ca_system_score_gemma":0.000080279235,"threshold_uncertainty_score":0.26488933},"labels":[],"label_agreement":null},{"id":"W2052060691","doi":"10.1007/s10623-013-9835-2","title":"A construction for strength-3 covering arrays from linear feedback shift register sequences","year":2013,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Beijing Institute For Brain Disorders","keywords":"Prime power; Prime (order theory); Combinatorics; Mathematics; Finite field; Variable (mathematics); Discrete mathematics; Upper and lower bounds; Shift register; Type (biology); Polynomial; Computer science; Mathematical analysis; Telecommunications","score_opus":0.024201215390169846,"score_gpt":0.23350284474125785,"score_spread":0.209301629351088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052060691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19113338,0.0003401356,0.80677366,0.00033101244,0.00026918447,0.00037648084,0.00003013828,0.00020934429,0.00053663837],"genre_scores_gemma":[0.6998741,0.000102717575,0.29945523,0.00028353115,0.0001245368,0.00012651121,0.000013561531,0.000013846042,0.0000059953272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843377,0.00009290402,0.00030010176,0.0005980372,0.00018913226,0.0003860289],"domain_scores_gemma":[0.9987423,0.00037519427,0.00014943919,0.00046919426,0.00009610576,0.00016775783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023445507,0.00026574702,0.00028134708,0.00024195062,0.00036422332,0.00053915015,0.00050339894,0.000116903546,0.00005609288],"category_scores_gemma":[0.0000209686,0.00023929063,0.00023257294,0.00051866606,0.00029450972,0.0007574252,0.00009378785,0.0001366458,0.00001180118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009733725,0.00012304744,0.012373482,0.000082353115,0.0002799154,0.0000057500065,0.0020897612,0.000059349448,0.012281416,0.8565537,0.0012793748,0.11477456],"study_design_scores_gemma":[0.0014049215,0.00061336084,0.007507736,0.00016416804,0.00007921367,0.00002150119,0.00072601147,0.015335884,0.007345586,0.9547621,0.011063134,0.0009763864],"about_ca_topic_score_codex":0.00015193064,"about_ca_topic_score_gemma":0.00001685611,"teacher_disagreement_score":0.5087407,"about_ca_system_score_codex":0.000007950921,"about_ca_system_score_gemma":0.000024861221,"threshold_uncertainty_score":0.97579885},"labels":[],"label_agreement":null},{"id":"W2052167619","doi":"10.1016/j.ffa.2011.04.002","title":"On coefficients of polynomials over finite fields","year":2011,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Polynomial; Permutation (music); Finite field; Recurrence relation; Upper and lower bounds; Field (mathematics); Combinatorics; Reciprocal polynomial; Relation (database); Matrix polynomial; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.022104913291018904,"score_gpt":0.22909185618093028,"score_spread":0.20698694288991137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052167619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027552327,0.000071620096,0.9528566,0.00012803005,0.00007507153,0.0001776424,0.0000265226,0.00005872268,0.019053467],"genre_scores_gemma":[0.9978312,0.000025081494,0.0014195918,0.0005288463,0.00002571957,0.000058556016,0.0000036798801,0.0000044892167,0.00010282624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993877,0.000028368997,0.00016842941,0.00022158334,0.00006301414,0.0001309342],"domain_scores_gemma":[0.9988821,0.0004379366,0.000076300144,0.0005146109,0.000032578184,0.000056444256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013645805,0.00010043805,0.0001225259,0.00010399955,0.00011996238,0.000025049565,0.00040718916,0.00008953039,0.00010697249],"category_scores_gemma":[0.00001876253,0.00008136086,0.000070588794,0.00027966837,0.00005762155,0.00006703578,0.00011531255,0.000110278335,0.00001629664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017285576,0.00017812451,0.00025015746,0.000011558431,0.000021687827,3.549373e-7,0.0020639806,0.000030003424,0.00008543337,0.96003187,0.00032208778,0.03698748],"study_design_scores_gemma":[0.00085869455,0.0008312311,0.0065251603,0.00008336067,0.000025509373,0.000004166482,0.00014627253,0.009976349,0.011312791,0.9351642,0.03450141,0.0005708353],"about_ca_topic_score_codex":0.0000183905,"about_ca_topic_score_gemma":0.0000044388576,"teacher_disagreement_score":0.97027886,"about_ca_system_score_codex":0.0000021295536,"about_ca_system_score_gemma":0.0000122397805,"threshold_uncertainty_score":0.33177993},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0054742164771853724,"score_gpt":0.2073840663128367,"score_spread":0.20190984983565133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053024959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065619997,0.0000064639858,0.9858391,0.00035966112,0.00025767615,0.00019473028,0.000006501891,0.00041318618,0.0063606715],"genre_scores_gemma":[0.98874795,0.0000048253037,0.01008142,0.0009153798,0.000024452731,0.000055966888,0.0000024357926,0.0000043964546,0.00016318513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991514,0.00008346261,0.00023756466,0.00012157174,0.00023638751,0.00016960001],"domain_scores_gemma":[0.99928534,0.00012888231,0.0001045048,0.00033968853,0.000069313,0.00007226505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039992976,0.00012895974,0.00008317884,0.00034230933,0.0003146834,0.00016763149,0.00032679117,0.00005740798,0.00014829285],"category_scores_gemma":[0.000003052055,0.00010589204,0.00006988101,0.0005050809,0.00007465006,0.0040822253,0.0000011727302,0.00017562567,0.00041597377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013602516,0.00008108745,0.000002632841,0.000010053099,0.000026373578,6.285648e-7,0.002794329,0.07223192,0.000066992274,0.361177,0.000053915195,0.56341904],"study_design_scores_gemma":[0.0065968316,0.002527437,0.00054388324,0.00045748375,0.00014631326,0.0003535077,0.0019861604,0.60851,0.16649204,0.16995482,0.03993253,0.002498942],"about_ca_topic_score_codex":0.0000024667672,"about_ca_topic_score_gemma":0.0000034950215,"teacher_disagreement_score":0.98218596,"about_ca_system_score_codex":0.000043500982,"about_ca_system_score_gemma":0.00005577301,"threshold_uncertainty_score":0.534664},"labels":[],"label_agreement":null},{"id":"W2053450537","doi":"10.1002/jcd.20046","title":"Orthogonal designs, self‐dual codes, and the Leech lattice","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Dual (grammatical number); Orthogonal array; Circulant matrix; Lattice (music); Hadamard transform; Ternary operation; Hadamard matrix; Combinatorial design; Binary number; Combinatorics; Construct (python library); Discrete mathematics; Arithmetic; Computer science; Physics","score_opus":0.02016573371690598,"score_gpt":0.24760062650780465,"score_spread":0.22743489279089868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053450537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28443834,0.003996917,0.6870987,0.009019913,0.009593821,0.0006540023,0.0000042426714,0.00026100242,0.004933092],"genre_scores_gemma":[0.967986,0.00012784792,0.030456856,0.0003828343,0.0010070316,0.000003112112,1.9268802e-7,0.000010586723,0.000025574565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977306,0.00072982255,0.00051819504,0.00018163197,0.0005624888,0.00027724222],"domain_scores_gemma":[0.9976153,0.0012390247,0.00039448024,0.00031174885,0.00026772733,0.00017172367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00375657,0.00017995475,0.00035113213,0.00015975237,0.00029926,0.00031666312,0.0008663853,0.000093724084,0.000010977894],"category_scores_gemma":[0.0001579582,0.00011977204,0.00020220107,0.00041203672,0.00016951142,0.0006840865,0.0001474765,0.0004498067,0.0000089832165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003158524,0.00015376402,0.00014977208,0.00000562991,0.00010229961,0.00003078803,0.0007170117,0.000023561579,0.00035661826,0.99067897,0.0011933806,0.006272359],"study_design_scores_gemma":[0.012869108,0.0014464628,0.0012015074,0.00009519163,0.00026272712,0.0014315251,0.000114920826,0.0039056076,0.0028398489,0.9154961,0.059783492,0.00055348943],"about_ca_topic_score_codex":0.0000023771204,"about_ca_topic_score_gemma":0.0000011200925,"teacher_disagreement_score":0.6835476,"about_ca_system_score_codex":0.00003949825,"about_ca_system_score_gemma":0.00019008825,"threshold_uncertainty_score":0.4884162},"labels":[],"label_agreement":null},{"id":"W2053608075","doi":"10.1006/eujc.2000.0417","title":"Existence and Non-existence of -systems of Polar Spaces","year":2001,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Symplectic geometry; Order (exchange); Polar; Translation (biology); Pure mathematics; Physics; Quantum mechanics","score_opus":0.01614616424244786,"score_gpt":0.21845512575912612,"score_spread":0.20230896151667827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053608075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9115982,0.0022718683,0.075072244,0.000105723055,0.0008350919,0.000052768868,0.0000011027322,0.000013706523,0.010049294],"genre_scores_gemma":[0.99659616,0.00036799436,0.0029127002,0.000015674685,0.000038010647,9.9404716e-8,6.1194434e-8,0.000008288176,0.00006102549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985069,0.0003220278,0.00053404184,0.00012705557,0.0003611196,0.00014887932],"domain_scores_gemma":[0.998287,0.00013121101,0.0007709898,0.00033405307,0.00036081433,0.00011593484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016836089,0.00011247949,0.0002910075,0.00021415915,0.000058880585,0.00006734888,0.00096082175,0.000017862107,0.0000017866269],"category_scores_gemma":[0.00007971054,0.000096268515,0.000103882165,0.0006024495,0.00012849685,0.0003533885,0.0001712279,0.00017087985,0.0000017973086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008578432,0.00031007835,0.048143838,0.00015461427,0.00008112334,0.00048319122,0.002380117,0.000047720467,0.0029871373,0.93904907,0.00026159125,0.0060157483],"study_design_scores_gemma":[0.014015771,0.024512123,0.4481878,0.0054537854,0.00036462164,0.00855942,0.004919665,0.0074088112,0.015738338,0.3806418,0.087245144,0.0029527254],"about_ca_topic_score_codex":0.0000027824938,"about_ca_topic_score_gemma":1.0811867e-7,"teacher_disagreement_score":0.55840725,"about_ca_system_score_codex":0.000009626706,"about_ca_system_score_gemma":0.000035789406,"threshold_uncertainty_score":0.39257163},"labels":[],"label_agreement":null},{"id":"W2054084041","doi":"10.1007/s00453-001-0047-1","title":"Exact Largest and Smallest Size of Components","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Combinatorics; Permutation (music); Mathematics; Theory of computation; Component (thermodynamics); Golomb coding; Discrete mathematics; Physics; Algorithm; Computer science","score_opus":0.012833348501846852,"score_gpt":0.2197760636205042,"score_spread":0.20694271511865733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054084041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8385163,0.00044001333,0.15251733,0.0008256139,0.00031097783,0.000117958676,0.0000051005754,0.00014029532,0.0071264333],"genre_scores_gemma":[0.97985995,0.00008948516,0.01977522,0.000155136,0.0000381306,0.0000024427973,0.0000010619224,0.0000043074233,0.00007424774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993442,0.000041948497,0.0001311666,0.00019847494,0.00012442173,0.00015978512],"domain_scores_gemma":[0.9993599,0.00018491919,0.000051860876,0.00030014108,0.00003466187,0.00006849121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018801227,0.00008311434,0.000120508914,0.000055706794,0.00006693562,0.00003378134,0.00036969717,0.000033715296,0.000038721573],"category_scores_gemma":[0.000025539879,0.00007796516,0.00004575229,0.00024883752,0.000066349785,0.00010936143,0.00016446866,0.00006647425,0.000009515456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007725896,0.00062707893,0.041567717,0.00012766004,0.00015499441,0.00016907274,0.001316981,0.0000061912183,0.016937505,0.53633726,0.00090692815,0.40177137],"study_design_scores_gemma":[0.004443003,0.0011398933,0.60554594,0.00048646086,0.00006518745,0.0006700072,0.00015482356,0.030384513,0.01860544,0.24658148,0.09028665,0.0016366018],"about_ca_topic_score_codex":0.00002219987,"about_ca_topic_score_gemma":0.0000014898096,"teacher_disagreement_score":0.5639782,"about_ca_system_score_codex":0.000004302227,"about_ca_system_score_gemma":0.000009418965,"threshold_uncertainty_score":0.3179327},"labels":[],"label_agreement":null},{"id":"W2055296824","doi":"10.1007/s12095-009-0012-4","title":"A new distinguishing and key recovery attack on NGG stream cipher","year":2009,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Keystream; Stream cipher attack; Computer science; RC4; Key (lock); Computer security; Encryption; Theoretical computer science; Arithmetic; Mathematics","score_opus":0.036578378121658095,"score_gpt":0.282026855152945,"score_spread":0.24544847703128692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055296824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2525286,0.013764407,0.55145305,0.020038005,0.00038698566,0.00067692937,0.000026461574,0.0011891671,0.15993638],"genre_scores_gemma":[0.91203916,0.0008439601,0.08615862,0.00085837924,0.000041301013,0.000009167446,0.000007375627,0.000006713141,0.000035323068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999009,0.00013482035,0.000204052,0.00031683422,0.00011801364,0.00021728658],"domain_scores_gemma":[0.9977509,0.00033710117,0.00009007463,0.0016062838,0.000042109266,0.00017355055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025078614,0.00016657813,0.00015922773,0.00021264712,0.000650162,0.00038719364,0.0011093431,0.00006610222,0.000009910024],"category_scores_gemma":[0.000051248102,0.00016242822,0.00010514616,0.000722819,0.00014095787,0.00035440875,0.0003030225,0.0002558273,0.0000041190756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012782369,0.000085415944,0.001068174,0.0000033246788,0.000022109292,9.92581e-7,0.0009502977,0.0000032879288,0.0000530951,0.71808195,0.0011871852,0.27853137],"study_design_scores_gemma":[0.0007815951,0.0008125406,0.06596614,0.0002324039,0.00005199388,0.00003064289,0.0002985348,0.0010407579,0.00010850716,0.8652429,0.06477244,0.0006615284],"about_ca_topic_score_codex":0.000025350786,"about_ca_topic_score_gemma":0.000023486555,"teacher_disagreement_score":0.65951055,"about_ca_system_score_codex":0.000005783651,"about_ca_system_score_gemma":0.00002257898,"threshold_uncertainty_score":0.66236305},"labels":[],"label_agreement":null},{"id":"W2055645149","doi":"10.1007/s10623-014-0004-z","title":"Sequences with good correlation property based on depth and interleaving techniques","year":2014,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Finite field; Sequence (biology); Operator (biology); Interleaving; Combinatorics; Discrete mathematics; Circulant matrix; Algorithm; Computer science","score_opus":0.014608769873895566,"score_gpt":0.21732769988763004,"score_spread":0.20271893001373448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055645149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021737652,0.000078333156,0.97012514,0.0002015447,0.000040030933,0.00022598055,0.0000012364802,0.000320707,0.007269347],"genre_scores_gemma":[0.90248394,0.000026289828,0.09693839,0.00046811916,0.00002297769,0.000038644866,0.0000020182988,0.0000106968955,0.000008898633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987695,0.0001890432,0.00015530644,0.00045940746,0.00019639889,0.00023034944],"domain_scores_gemma":[0.99920326,0.00021816712,0.00008788751,0.0003275778,0.000056510184,0.00010656715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005326957,0.00021263064,0.00018625896,0.00034177094,0.0002887445,0.00031477716,0.00027670516,0.000071085014,0.000003507733],"category_scores_gemma":[0.000015399293,0.00013088946,0.00005949428,0.000553054,0.00022330794,0.00031913022,0.000051907104,0.00015025673,9.480203e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014409501,0.00011540542,0.057487834,0.00006108942,0.00004020023,0.000007333195,0.000549642,0.00007961872,0.0019111991,0.53905517,0.00008381892,0.40046462],"study_design_scores_gemma":[0.003496752,0.019993095,0.08388606,0.0025009369,0.00024410606,0.00022245052,0.00061830744,0.56583685,0.028202213,0.2586554,0.032652806,0.0036910411],"about_ca_topic_score_codex":0.000022018688,"about_ca_topic_score_gemma":0.000023027314,"teacher_disagreement_score":0.8807463,"about_ca_system_score_codex":0.000005350532,"about_ca_system_score_gemma":0.000015940877,"threshold_uncertainty_score":0.5337517},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02459415622454515,"score_gpt":0.23235201959109733,"score_spread":0.2077578633665522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055862451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41810653,0.000023936724,0.5658869,0.000052462725,0.000072297786,0.00010122288,3.3406928e-7,0.000058996666,0.015697325],"genre_scores_gemma":[0.9879378,0.0000022774718,0.011870894,0.00016959287,0.0000059415065,0.0000046437913,2.3404128e-7,7.855745e-7,0.000007799905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990455,0.00002663886,0.00025133722,0.00008781797,0.00041793592,0.00017078682],"domain_scores_gemma":[0.99941903,0.00008756562,0.00015780573,0.00015960737,0.00013455648,0.000041422078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016686744,0.000069362184,0.00009258319,0.00024657365,0.00019003743,0.00017427777,0.0006268153,0.000020683992,0.000003901173],"category_scores_gemma":[0.000034980898,0.000043076732,0.000030862175,0.001143864,0.00033928608,0.003020319,0.000048061804,0.000033347576,0.00000828921],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006299493,0.00009857453,0.005606299,0.000095968564,0.00003914926,0.0000025510037,0.03625686,0.0034360883,0.008122935,0.4802784,0.00020344635,0.46522978],"study_design_scores_gemma":[0.017831717,0.008116483,0.11228478,0.0012745354,0.000084770174,0.0001756992,0.09315822,0.10130421,0.5909791,0.05104326,0.020334763,0.0034124544],"about_ca_topic_score_codex":0.000024981251,"about_ca_topic_score_gemma":0.000006709533,"teacher_disagreement_score":0.5828562,"about_ca_system_score_codex":0.000006934892,"about_ca_system_score_gemma":0.00009103624,"threshold_uncertainty_score":0.21896584},"labels":[],"label_agreement":null},{"id":"W2057126853","doi":"10.1080/0161-110591893780","title":"THE PUBLIC KEY COVERT CHANNEL","year":2005,"lang":"en","type":"article","venue":"Cryptologia","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Cryptosystem; Key (lock); Computer science; Channel (broadcasting); Public-key cryptography; Computer security; Covert channel; Public key cryptosystem; Cryptography; Covert; Computer network; Encryption","score_opus":0.017580543319137762,"score_gpt":0.22927304074713029,"score_spread":0.2116924974279925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057126853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039561834,0.0018697153,0.8686402,0.046056136,0.0016866185,0.00023053387,0.0000018593155,0.0010015215,0.040951617],"genre_scores_gemma":[0.99216586,0.000060396935,0.006002403,0.0014248185,0.00014036456,0.000020749429,6.7426805e-7,0.0000053202702,0.00017939851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989494,0.000100206424,0.00014771616,0.00025932025,0.00016049267,0.00038285067],"domain_scores_gemma":[0.9988722,0.00024942716,0.00005812716,0.0006796252,0.000058005884,0.00008260897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005419546,0.00011294172,0.000096373304,0.00006368013,0.0005210709,0.00035540495,0.0015246063,0.00006216294,0.000027087],"category_scores_gemma":[0.00011844073,0.00007373703,0.00009194861,0.0004360433,0.00014932334,0.00038611854,0.00029146377,0.00015278657,0.00034568555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039011534,0.000024459065,0.0001759478,0.0000010564036,0.00001032769,0.0000028907925,0.00012584904,0.000005518993,0.0000602958,0.92795175,0.009187883,0.06245011],"study_design_scores_gemma":[0.00024902064,0.00008689073,0.0017482777,0.000005204631,0.0000037129223,0.00004081778,0.000042602143,0.0057865907,0.00082224986,0.20673883,0.7842428,0.00023298872],"about_ca_topic_score_codex":7.563484e-7,"about_ca_topic_score_gemma":0.00000855688,"teacher_disagreement_score":0.95260406,"about_ca_system_score_codex":0.000019154855,"about_ca_system_score_gemma":0.000036948197,"threshold_uncertainty_score":0.44432038},"labels":[],"label_agreement":null},{"id":"W2059355032","doi":"10.4236/ojdm.2012.24032","title":"A Note on Hamiltonian Circulant Digraphs of Outdegree Three","year":2012,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Connection (principal bundle); Integer (computer science); Hamiltonian (control theory); Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.04059337117785439,"score_gpt":0.29666614932892066,"score_spread":0.25607277815106627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059355032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16895209,0.00023470815,0.8071416,0.00072808337,0.0006128794,0.00031460548,0.000008698865,0.000021130381,0.02198617],"genre_scores_gemma":[0.8856677,0.000017259317,0.11412786,0.000087986875,0.00006161501,0.0000018819615,2.389005e-7,0.000011619387,0.000023871333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985049,0.000072165734,0.0005934099,0.00010794583,0.00045037086,0.00027125143],"domain_scores_gemma":[0.99811316,0.00022632671,0.0007435863,0.00062485714,0.000112320224,0.00017973795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015873967,0.0001588821,0.00041644575,0.00019542912,0.00008677034,0.00017061096,0.0021930623,0.000048969345,0.000031000567],"category_scores_gemma":[0.00010028722,0.000111391826,0.00027105643,0.00035194567,0.00007282223,0.0007485397,0.00036456037,0.00020644009,0.000014354267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051226238,0.0005517601,0.0026682976,0.00010327429,0.00016844345,0.000019631632,0.0076199095,0.000033144013,0.00147137,0.97020215,0.0004065929,0.016704189],"study_design_scores_gemma":[0.002832208,0.0023613283,0.01718411,0.0025823533,0.0002976153,0.0008600912,0.0010740265,0.0052252337,0.011357931,0.95056796,0.004614346,0.0010428013],"about_ca_topic_score_codex":0.000002773115,"about_ca_topic_score_gemma":0.0000038008247,"teacher_disagreement_score":0.7167156,"about_ca_system_score_codex":0.000016050577,"about_ca_system_score_gemma":0.000049074857,"threshold_uncertainty_score":0.45424268},"labels":[],"label_agreement":null},{"id":"W2059530475","doi":"10.1107/s0108767302011637","title":"A revised proof of the metric properties of optimally superimposed vector sets","year":2002,"lang":"en","type":"article","venue":"Acta Crystallographica Section A Foundations of Crystallography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Metric (unit); Mathematics; Superposition principle; Square (algebra); Square root; Combinatorics; Pure mathematics; Mathematical analysis; Geometry; Engineering","score_opus":0.02396950355655137,"score_gpt":0.22466196599218105,"score_spread":0.2006924624356297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059530475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96248484,0.0010971103,0.030579465,0.0011056641,0.00061395316,0.0014816127,0.000037258273,0.0002461964,0.0023539336],"genre_scores_gemma":[0.99409825,0.000133545,0.0055498006,0.000055108085,0.00002563232,0.000084300875,0.0000050226126,0.000027473627,0.000020874772],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9966027,0.00045836667,0.001162268,0.0005702547,0.00080494036,0.00040142913],"domain_scores_gemma":[0.99628955,0.00021992004,0.0009948536,0.0015701037,0.0008098955,0.000115684285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007374041,0.00036346196,0.0006130201,0.002392396,0.00035749184,0.00009777846,0.0018538964,0.00019898376,0.000102433834],"category_scores_gemma":[0.00028491093,0.00028445933,0.0011185362,0.01073353,0.0011463411,0.0008856472,0.00032943647,0.00032030503,1.2933748e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110584195,0.001450523,0.005516918,0.00049284706,0.0006247603,0.0000010899399,0.0016522855,0.00024458108,0.96741515,0.020232648,0.00025894103,0.0019996827],"study_design_scores_gemma":[0.023584759,0.018768026,0.35831368,0.0065625985,0.0038616438,0.00070472655,0.004308524,0.056081813,0.25040218,0.10371928,0.16369878,0.009993987],"about_ca_topic_score_codex":0.000042270218,"about_ca_topic_score_gemma":0.000028706647,"teacher_disagreement_score":0.71701294,"about_ca_system_score_codex":0.000021496055,"about_ca_system_score_gemma":0.000086153224,"threshold_uncertainty_score":0.9999608},"labels":[],"label_agreement":null},{"id":"W2060682338","doi":"10.1007/s10623-008-9236-0","title":"Efficient pth root computations in finite fields of characteristic p","year":2008,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Trinomial; Mathematics; Combinatorics; Binomial (polynomial); Irreducible polynomial; Reduction (mathematics); Scalar (mathematics); Polynomial; Field (mathematics); Root (linguistics); Discrete mathematics; Matrix polynomial; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.027032013421401657,"score_gpt":0.23552122986111362,"score_spread":0.20848921643971197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060682338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45701584,0.00019684262,0.54216015,0.000066082015,0.00006210765,0.00008898372,0.0000050578356,0.00004613236,0.0003588191],"genre_scores_gemma":[0.98201096,0.00006467202,0.017759055,0.00012129647,0.000014808275,0.000016310727,0.0000036029783,0.0000062104955,0.0000030799588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99886245,0.000113830065,0.0003033776,0.00030542284,0.0001723095,0.00024261944],"domain_scores_gemma":[0.99909085,0.00035532846,0.000101288926,0.00030630935,0.00006114469,0.000085093234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002591041,0.0001526941,0.0002466086,0.00054079184,0.00017086574,0.000039517516,0.00034027445,0.000067081644,0.000011378228],"category_scores_gemma":[0.000022215196,0.00014573493,0.00012849142,0.0012014041,0.00019778252,0.0000769367,0.00008584096,0.00013344339,0.0000024081287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012431954,0.0010284403,0.1125418,0.00014830336,0.00011699778,0.0001413267,0.010463569,0.013172477,0.0018869181,0.83215094,0.00027210935,0.027952796],"study_design_scores_gemma":[0.0020124002,0.001059843,0.62589854,0.00026191652,0.000043489326,0.000115990224,0.00023279208,0.28340778,0.0013765044,0.0835545,0.0010295496,0.0010066727],"about_ca_topic_score_codex":0.00002394796,"about_ca_topic_score_gemma":0.000013661585,"teacher_disagreement_score":0.74859643,"about_ca_system_score_codex":0.000004154796,"about_ca_system_score_gemma":0.000026933383,"threshold_uncertainty_score":0.5942898},"labels":[],"label_agreement":null},{"id":"W2061027724","doi":"10.1137/s0895480103428053","title":"Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings","year":2004,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Aperiodic graph; Alphabet; Finite field; Ring (chemistry); Physics","score_opus":0.016314807711336768,"score_gpt":0.25113689835429853,"score_spread":0.23482209064296178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061027724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2257147,0.000119765784,0.7699682,0.00094512553,0.00021119967,0.00022506036,0.0000032088394,0.00012130189,0.0026914412],"genre_scores_gemma":[0.94641227,0.0000419384,0.053058818,0.0002961748,0.00011840247,0.000009785254,0.000003198952,0.000023259365,0.000036161677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979375,0.00006186565,0.00045244378,0.00027304183,0.0009093012,0.00036581967],"domain_scores_gemma":[0.9986773,0.0001229388,0.0004309662,0.0004351989,0.00017923568,0.00015434928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012470204,0.00022979706,0.00023220733,0.00050826016,0.0008111668,0.00041147738,0.00064315525,0.000052045754,0.00004690635],"category_scores_gemma":[0.00008084383,0.00017941483,0.0001640713,0.0011935759,0.000052603482,0.0006959268,0.00013581496,0.0004317443,0.00002569647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005480823,0.00055312546,0.00047017675,0.00017184815,0.00040940143,0.00007393663,0.003498856,0.010883077,0.0007570999,0.9697573,0.00021765374,0.013152724],"study_design_scores_gemma":[0.0038624369,0.004353733,0.0019462857,0.0014467187,0.00040490468,0.0008399149,0.0018911461,0.015088338,0.0020491155,0.9633928,0.0037112145,0.0010134195],"about_ca_topic_score_codex":0.000003613948,"about_ca_topic_score_gemma":0.0000016220971,"teacher_disagreement_score":0.7206976,"about_ca_system_score_codex":0.0001597461,"about_ca_system_score_gemma":0.00011546962,"threshold_uncertainty_score":0.7316324},"labels":[],"label_agreement":null},{"id":"W2061184672","doi":"10.4153/cmb-2007-039-2","title":"Discriminants of Complex Multiplication Fields of Elliptic Curves over Finite Fields","year":2007,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología; Canadian Mathematical Society","keywords":"Mathematics; Endomorphism ring; Endomorphism; Discriminant; Elliptic curve; Complex multiplication; Finite field; Algebraic number field; Pure mathematics; Quadratic equation; Prime (order theory); Supersingular elliptic curve; Twists of curves; Schoof's algorithm; Multiplication (music); Field (mathematics); Discrete mathematics; Combinatorics; Quarter period; Geometry","score_opus":0.025636364531189813,"score_gpt":0.25585230432310774,"score_spread":0.23021593979191793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061184672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10611223,0.00016880473,0.871246,0.003720051,0.00008395423,0.00026539815,0.000013626417,0.000038727867,0.018351253],"genre_scores_gemma":[0.99054056,0.00001294296,0.008558565,0.00069402193,0.000015145845,0.0000041921367,0.0000027977856,0.0000053130516,0.00016646154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990425,0.000034819794,0.00034730544,0.00016800423,0.00015879658,0.00024857974],"domain_scores_gemma":[0.99858034,0.0005837363,0.00009988816,0.00047001985,0.000063703264,0.0002023235],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005130211,0.00009590177,0.00020103906,0.0001445428,0.000046610443,0.000013219385,0.0005096564,0.00007944258,0.0015351962],"category_scores_gemma":[0.0002599001,0.00008789201,0.000093503215,0.00023637763,0.00010588333,0.000034079465,0.00005324754,0.00009518597,0.00012764898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013649372,0.00014671734,0.00070928945,0.0007995543,0.000029760864,0.000014322704,0.0012792031,0.000015952348,0.00046884408,0.9755662,0.009529319,0.011427171],"study_design_scores_gemma":[0.0017550682,0.0008788186,0.0685938,0.0035364088,0.00016402868,0.000054696484,0.00051026023,0.0296661,0.021756947,0.8016369,0.06977518,0.0016718316],"about_ca_topic_score_codex":0.00041536253,"about_ca_topic_score_gemma":0.0006657754,"teacher_disagreement_score":0.8844283,"about_ca_system_score_codex":0.000014904721,"about_ca_system_score_gemma":0.000042854386,"threshold_uncertainty_score":0.99937755},"labels":[],"label_agreement":null},{"id":"W2061678397","doi":"10.1007/s10623-008-9171-0","title":"On binary Kloosterman sums divisible by 3","year":2008,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kloosterman sum; Binary number; Mathematics; Combinatorics; Arithmetic","score_opus":0.022137709895698243,"score_gpt":0.22398581557433794,"score_spread":0.2018481056786397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061678397","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56543857,0.0014085094,0.42568773,0.0003947223,0.00024655732,0.00024884782,0.000024206827,0.00050843327,0.0060424116],"genre_scores_gemma":[0.9910325,0.00045899456,0.00700861,0.0013442453,0.000032953267,0.00003039094,0.000010169283,0.000018116152,0.00006405074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833465,0.0001424806,0.00021788891,0.0005747287,0.00029500117,0.00043528242],"domain_scores_gemma":[0.9988355,0.00022255034,0.00007698283,0.00060788303,0.000042730637,0.00021435908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002640763,0.000279163,0.00025199924,0.0004144102,0.0006248868,0.0001599438,0.0006565756,0.00009301767,0.0000305259],"category_scores_gemma":[0.000008962435,0.00024842296,0.00020125088,0.0009898521,0.00027023494,0.00036341464,0.0001559073,0.00018621837,0.000026711406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001026736,0.00048327667,0.007633704,0.000031353215,0.000115603216,0.00012913776,0.0010997186,0.00001833815,0.009640395,0.89683574,0.06503362,0.01887646],"study_design_scores_gemma":[0.0057477457,0.0091002,0.04147066,0.00032603048,0.00013173468,0.00064584706,0.00022781633,0.0064750463,0.026847957,0.67925096,0.22504531,0.0047306935],"about_ca_topic_score_codex":0.000011115604,"about_ca_topic_score_gemma":0.0000012457753,"teacher_disagreement_score":0.42559388,"about_ca_system_score_codex":0.0000059070258,"about_ca_system_score_gemma":0.000018250626,"threshold_uncertainty_score":0.9999968},"labels":[],"label_agreement":null},{"id":"W2061818608","doi":"10.1016/j.ffa.2012.02.001","title":"Dickson polynomials over finite fields","year":2012,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Finite field; Permutation (music); Discrete orthogonal polynomials; Factorization; Difference polynomials; Classical orthogonal polynomials; Orthogonal polynomials; Algebra over a field; Wilson polynomials; Pure mathematics; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.014979619080014842,"score_gpt":0.23719349820474817,"score_spread":0.22221387912473334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061818608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010889271,0.00070050533,0.97575366,0.0010686009,0.00015666572,0.00019582435,0.000019136916,0.00013941502,0.011076886],"genre_scores_gemma":[0.9959759,0.00008936531,0.002017732,0.0012494952,0.00025834868,0.0001420098,0.00000822381,0.0000067876886,0.00025213673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925077,0.000039031405,0.00016045822,0.0002186309,0.00006674863,0.00026435635],"domain_scores_gemma":[0.9986941,0.0005472975,0.000060083614,0.0005453742,0.00002226499,0.00013085722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023119015,0.00013079714,0.00012763469,0.00008808033,0.000252307,0.00009547248,0.0003886521,0.00012379588,0.00010421064],"category_scores_gemma":[0.000018916622,0.00010737631,0.00008202582,0.00030354934,0.00004594204,0.00026762302,0.00017998846,0.00016711846,0.000047467696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068056593,0.00013305925,0.0024982472,0.000015616277,0.00003321529,2.8015907e-7,0.0024387762,0.00001486922,0.00015899244,0.8811672,0.0017776744,0.11175527],"study_design_scores_gemma":[0.00050386594,0.00015392179,0.010310006,0.00003370341,0.000026607391,0.000012132009,0.00015922912,0.005172967,0.0020479036,0.25359988,0.727326,0.0006538026],"about_ca_topic_score_codex":0.000014636153,"about_ca_topic_score_gemma":0.0000051699326,"teacher_disagreement_score":0.9850866,"about_ca_system_score_codex":0.0000043470595,"about_ca_system_score_gemma":0.000012070002,"threshold_uncertainty_score":0.4378679},"labels":[],"label_agreement":null},{"id":"W2063944845","doi":"10.1016/j.ejc.2003.07.006","title":"On the spectrum of non-Denniston maximal arcs in PG(2,2h)","year":2003,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Order (exchange); Degree (music); Type (biology); Spectrum (functional analysis); Projective plane; Discrete mathematics; Geometry; Crystallography; Physics","score_opus":0.010738151867189577,"score_gpt":0.20260787323156165,"score_spread":0.19186972136437208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063944845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83236706,0.00025175166,0.08661292,0.00089225994,0.0014211271,0.00008548992,4.505367e-7,0.000016112375,0.07835281],"genre_scores_gemma":[0.9991495,0.0000352509,0.00058582064,0.00014287332,0.000024929726,1.8058526e-7,3.9261128e-8,0.000011657051,0.000049725575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810034,0.0007877377,0.0004394762,0.00012192119,0.0003548802,0.00019565043],"domain_scores_gemma":[0.99880546,0.00026986218,0.00036909344,0.000401522,0.00008106217,0.00007301742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029696247,0.00011981866,0.00019163947,0.0002442422,0.00007537283,0.00005992307,0.001152966,0.000015853748,0.000020172209],"category_scores_gemma":[0.00017422768,0.00008515804,0.00014827651,0.0007433072,0.00006817505,0.00014568261,0.0000825206,0.0004203682,0.000017150542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027100305,0.00020026808,0.0008292556,0.000005577503,0.000012534948,0.00020117612,0.0004630096,0.000052882817,0.00022885008,0.99657303,0.00060585863,0.00080042554],"study_design_scores_gemma":[0.0018817239,0.00262429,0.022294926,0.00022978458,0.00001694058,0.00025173085,0.00013559511,0.00028546894,0.00652472,0.9540659,0.011380393,0.000308504],"about_ca_topic_score_codex":3.79818e-7,"about_ca_topic_score_gemma":1.7714312e-7,"teacher_disagreement_score":0.16678244,"about_ca_system_score_codex":0.000031430183,"about_ca_system_score_gemma":0.000051704297,"threshold_uncertainty_score":0.34726444},"labels":[],"label_agreement":null},{"id":"W2064133253","doi":"10.1515/integers-2012-0047","title":"Some Monoapparitic Fourth Order Linear Divisibility Sequences","year":2012,"lang":"en","type":"article","venue":"Integers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Divisibility rule; Mathematics; Order (exchange); Combinatorics; Pure mathematics","score_opus":0.02458390484429954,"score_gpt":0.26971433175797566,"score_spread":0.24513042691367612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064133253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46244672,0.0006960151,0.5292706,0.00093791244,0.0017457575,0.0001540163,0.0000022355996,0.00044666717,0.0043000598],"genre_scores_gemma":[0.9794959,0.000010990807,0.019762153,0.00041762224,0.00021637857,0.000010704121,6.392854e-7,0.0000054794864,0.000080129044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893355,0.000099885234,0.00015929491,0.00024754382,0.00017772669,0.00038200882],"domain_scores_gemma":[0.9990968,0.00015758138,0.000039346716,0.00049996615,0.000058976028,0.00014733181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006234978,0.0001214813,0.00012424887,0.00008370569,0.00011127831,0.00007248565,0.0006778284,0.000050774222,0.00003758113],"category_scores_gemma":[0.00011550938,0.00010161877,0.000094852745,0.0004023797,0.00012061287,0.0009541058,0.00015432484,0.00016622843,0.00013740051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014967258,0.00023615776,0.03481443,0.000029177621,0.000058035774,0.0000078707335,0.003905946,0.00013916109,0.0011647994,0.9247493,0.00075122394,0.03412892],"study_design_scores_gemma":[0.001039151,0.000547747,0.027855385,0.00018138291,0.00006472853,0.00008325497,0.0008582709,0.056266375,0.029546034,0.8472872,0.034308787,0.0019617083],"about_ca_topic_score_codex":0.000031609226,"about_ca_topic_score_gemma":0.0000035374353,"teacher_disagreement_score":0.5170492,"about_ca_system_score_codex":0.00002414192,"about_ca_system_score_gemma":0.000033575143,"threshold_uncertainty_score":0.4143893},"labels":[],"label_agreement":null},{"id":"W2064578779","doi":"10.1145/345542.345639","title":"On the design and implementation of Brown's algorithm over the integers and number fields","year":2000,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Implementation; Bivariate analysis; Maple; Heuristic; Computer science; Modular design; Algorithm design; Mathematics; Artificial intelligence; Machine learning","score_opus":0.011895997333376582,"score_gpt":0.25646104485301513,"score_spread":0.24456504751963853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064578779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3396064,0.000019234692,0.6541336,0.0019995729,0.00003450495,0.00014799544,5.9782417e-7,0.00002158833,0.0040365024],"genre_scores_gemma":[0.99207485,0.000029065419,0.006693421,0.0010910939,0.000007639265,0.0000055322457,1.0118877e-7,0.000001455224,0.00009682939],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996332,0.000081332975,0.00006138034,0.00009172413,0.000068991714,0.000063398176],"domain_scores_gemma":[0.9994543,0.0003568287,0.000016529788,0.0001521358,0.000006726412,0.000013446661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030127921,0.0000432899,0.00003627767,0.000012035582,0.000083221654,0.000051758012,0.00015037325,0.000014265817,0.00070352765],"category_scores_gemma":[0.0000025164484,0.000021150461,0.000017206543,0.000099103854,0.00005266602,0.00008443389,0.000031120882,0.000045529196,0.0000029433666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005485164,0.000007196235,0.00021935473,0.0000010866693,0.000010841311,3.0587566e-7,0.0012642198,0.0000067200035,0.000016024866,0.47506654,0.0018366043,0.5215656],"study_design_scores_gemma":[0.00089369214,0.0005129579,0.0297179,0.000028588998,0.000026680787,0.000029701014,0.0012107226,0.04821575,0.009334321,0.90441793,0.005309767,0.0003019841],"about_ca_topic_score_codex":0.00004993398,"about_ca_topic_score_gemma":0.000005336631,"teacher_disagreement_score":0.65246844,"about_ca_system_score_codex":0.0000015649035,"about_ca_system_score_gemma":0.0000050412177,"threshold_uncertainty_score":0.77031344},"labels":[],"label_agreement":null},{"id":"W2064619631","doi":"10.1090/s0025-5718-05-01758-8","title":"Point counting on Picard curves in large characteristic","year":2005,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Mathematics; Cardinality (data modeling); Finite field; Jacobian matrix and determinant; Prime (order theory); Field (mathematics); Discrete mathematics; Point (geometry); Combinatorics; Pure mathematics; Applied mathematics; Geometry","score_opus":0.013230538641358442,"score_gpt":0.2572968505043444,"score_spread":0.24406631186298597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064619631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3039079,0.00004114793,0.6939463,0.00047130912,0.000075773016,0.00011219726,0.000001500847,0.00005902339,0.0013848522],"genre_scores_gemma":[0.9511686,0.000008373464,0.048538174,0.00023472076,0.000029887138,0.000004863669,0.0000029700097,0.0000048870806,0.000007505586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992101,0.000039769107,0.000299572,0.00012840885,0.00019575458,0.00012640396],"domain_scores_gemma":[0.9993489,0.00022924383,0.00016723083,0.00018231153,0.00005172634,0.000020585301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061064126,0.00007847184,0.00015808319,0.00015143547,0.000032508615,0.000032889166,0.00023905297,0.00002286863,0.000007456861],"category_scores_gemma":[0.00007032608,0.00007639107,0.000047800757,0.00025754297,0.000014574904,0.00019941221,0.00005592264,0.000070386945,0.00002452172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009765347,0.00079685997,0.00050643727,0.00062331,0.000017656068,0.0000037935442,0.004493061,0.00224793,0.00069722976,0.9634005,0.00035753605,0.026845962],"study_design_scores_gemma":[0.0006981265,0.00018165806,0.011746033,0.0015263684,0.00001218024,0.0000092909695,0.00011141017,0.788897,0.0018521659,0.1943409,0.00033692713,0.00028796494],"about_ca_topic_score_codex":6.1651514e-7,"about_ca_topic_score_gemma":0.0000017069442,"teacher_disagreement_score":0.78664905,"about_ca_system_score_codex":0.00001609673,"about_ca_system_score_gemma":0.00001106841,"threshold_uncertainty_score":0.31151375},"labels":[],"label_agreement":null},{"id":"W2064998746","doi":"10.1515/jmc-2012-0002","title":"Finding discrete logarithms with a set orbit distinguisher","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Logarithm; Orbit (dynamics); Set (abstract data type); Discrete logarithm; Mathematics; Arithmetic; Computer science; Mathematical analysis; Computer security; Programming language; Public-key cryptography","score_opus":0.028690374475523445,"score_gpt":0.2826695385318816,"score_spread":0.2539791640563581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064998746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10141026,0.00011316245,0.89215714,0.0012355521,0.0003341786,0.000057613604,6.4174986e-7,0.000037661317,0.004653807],"genre_scores_gemma":[0.82353866,0.0000018495135,0.17607792,0.00014195462,0.00020542431,0.000002109285,1.6543925e-7,0.0000090934545,0.000022796332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985757,0.00015450046,0.00043428302,0.00012328138,0.00029376204,0.00041849332],"domain_scores_gemma":[0.998642,0.00038571277,0.00034998686,0.00028521693,0.000108395085,0.00022864429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010948884,0.00015061034,0.0003842618,0.00016258965,0.00009456664,0.00007232847,0.00065638934,0.000082556515,0.00007780689],"category_scores_gemma":[0.0003391745,0.00009449262,0.0001414028,0.0002896103,0.00008975787,0.00045259175,0.00014425372,0.00033451218,0.00004187378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005106285,0.00015635353,0.004324383,0.000046306897,0.000081363556,0.0000848954,0.0015399429,0.000004535446,0.00010418211,0.9914035,0.000699827,0.0015036062],"study_design_scores_gemma":[0.0014616742,0.0013797155,0.0042331764,0.0003521354,0.00016117649,0.010189442,0.0008102332,0.0014356507,0.00076473935,0.9729682,0.0056769126,0.00056690496],"about_ca_topic_score_codex":2.913178e-7,"about_ca_topic_score_gemma":3.1105344e-7,"teacher_disagreement_score":0.7221284,"about_ca_system_score_codex":0.000021618254,"about_ca_system_score_gemma":0.000034674707,"threshold_uncertainty_score":0.38532972},"labels":[],"label_agreement":null},{"id":"W2065463697","doi":"10.1016/j.tcs.2004.02.005","title":"The number of binary words avoiding abelian fourth powers grows exponentially","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Exponential growth; Binary number; Abelian group; Mathematics; Combinatorics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.00792064906453805,"score_gpt":0.24223702468757136,"score_spread":0.2343163756230333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065463697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23148263,0.000033066557,0.76372385,0.0012974993,0.00090491393,0.00011128002,6.7324754e-7,0.0001453499,0.002300754],"genre_scores_gemma":[0.91656834,0.000013765398,0.083057724,0.00026101427,0.000080070444,0.0000051930447,2.0761253e-7,0.00000846037,0.000005210734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972402,0.00018194747,0.00037785078,0.0006321409,0.00085953134,0.0007083669],"domain_scores_gemma":[0.9977956,0.0005199308,0.00012769167,0.0011372877,0.00016848068,0.00025100654],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003352275,0.00021262463,0.00020931411,0.00016928953,0.0012693673,0.00047558485,0.004168345,0.00005292693,0.000023648341],"category_scores_gemma":[0.00011172146,0.00014705896,0.00016870642,0.002112562,0.0046123797,0.0006886302,0.0013390954,0.0003094401,0.000052286447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001960305,0.00006360052,0.00008131861,0.000004627583,0.000008060892,0.00001143674,0.0010433829,0.00022836574,0.0027476957,0.98094475,0.000013132747,0.014834027],"study_design_scores_gemma":[0.0003953789,0.00024212446,0.00082534744,0.00008123122,0.00000774477,0.00006722635,0.000052943997,0.019731758,0.008495491,0.96964264,0.0001693898,0.00028874702],"about_ca_topic_score_codex":0.00000538657,"about_ca_topic_score_gemma":7.336635e-7,"teacher_disagreement_score":0.6850857,"about_ca_system_score_codex":0.00004805957,"about_ca_system_score_gemma":0.00018354115,"threshold_uncertainty_score":0.9980965},"labels":[],"label_agreement":null},{"id":"W2065483996","doi":"10.1515/jmc.2009.016","title":"On the density of some special primes","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computer science; Arithmetic","score_opus":0.016047903562670104,"score_gpt":0.2496530297266319,"score_spread":0.23360512616396178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065483996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6795543,0.000045474197,0.2991902,0.014898222,0.00042135027,0.000082049555,2.705314e-7,0.000017535443,0.005790622],"genre_scores_gemma":[0.9800821,0.000005038035,0.01874292,0.00082796987,0.00033191434,2.673898e-7,1.8877321e-8,0.0000022902832,0.000007511631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890435,0.00017090561,0.000422954,0.000086687745,0.000262292,0.00015281243],"domain_scores_gemma":[0.99853814,0.0006871867,0.00032494252,0.0002881458,0.00010134779,0.00006021192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009002091,0.000087801636,0.0003127718,0.00011509773,0.00005652086,0.000023569706,0.00077670196,0.00006020945,0.00006080774],"category_scores_gemma":[0.00047421156,0.00004928091,0.00020251842,0.00016178591,0.00007821501,0.00013246931,0.00005498197,0.0002441947,0.000023916004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049611717,0.00019823016,0.000023528159,0.000005763326,0.000019718154,0.000021892105,0.00026773888,0.0000026790815,0.0006432534,0.9937172,0.0019340715,0.0031162908],"study_design_scores_gemma":[0.00017490234,0.0006768728,0.0011329412,0.0000350527,0.0000126703835,0.0002235384,0.00003531293,0.00011526759,0.004049796,0.9933542,0.00013894483,0.000050483475],"about_ca_topic_score_codex":4.5821672e-8,"about_ca_topic_score_gemma":5.7759543e-8,"teacher_disagreement_score":0.30052778,"about_ca_system_score_codex":0.000009518072,"about_ca_system_score_gemma":0.000037426245,"threshold_uncertainty_score":0.20096171},"labels":[],"label_agreement":null},{"id":"W2065577091","doi":"10.1007/s10623-012-9791-2","title":"Lexicodes over rings","year":2013,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Dual (grammatical number); Chain (unit); Mathematics; Combinatorics; Discrete mathematics; Binary number; Selection (genetic algorithm); Computer science; Physics; Arithmetic; Quantum mechanics; Philosophy","score_opus":0.014532935874210128,"score_gpt":0.22011310557721267,"score_spread":0.20558016970300255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065577091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2997583,0.00083349965,0.69177234,0.00035290574,0.000165492,0.00028116154,0.0000028581846,0.00046854504,0.0063648843],"genre_scores_gemma":[0.95149153,0.00014553274,0.047331143,0.0008538467,0.000050924344,0.00007630593,0.0000017670144,0.000015054755,0.00003386907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984932,0.00009804718,0.00022796383,0.0005081669,0.00022954703,0.00044308486],"domain_scores_gemma":[0.9989325,0.0001569811,0.000077702374,0.00054277276,0.00007459948,0.00021548275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028107816,0.00025133573,0.00022682379,0.0003774062,0.00031609138,0.0006314795,0.0006509308,0.000090457055,0.00017008522],"category_scores_gemma":[0.0000117437985,0.00021850388,0.00019291718,0.0008839696,0.00020618712,0.00083251594,0.00019794024,0.00015671448,0.000050679497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072831867,0.00007252592,0.012008226,0.000019264466,0.000057473026,0.0000054826214,0.00044393074,0.0000033160295,0.0061128885,0.9270409,0.0026059474,0.05162277],"study_design_scores_gemma":[0.00078339694,0.00043174124,0.08878873,0.00006729629,0.000032744305,0.000044560482,0.00016163105,0.004850109,0.0035973822,0.88190544,0.018392405,0.00094453763],"about_ca_topic_score_codex":0.00007025178,"about_ca_topic_score_gemma":0.000003960484,"teacher_disagreement_score":0.6517333,"about_ca_system_score_codex":0.0000052498954,"about_ca_system_score_gemma":0.000013554409,"threshold_uncertainty_score":0.89103293},"labels":[],"label_agreement":null},{"id":"W2065586216","doi":"10.1007/s12095-013-0091-0","title":"Optimal parameters for the WG stream cipher family","year":2013,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Cipher; Mathematics; Transformation (genetics); Exponent; Finite field; Degree (music); Discrete mathematics; Algebraic number; Sequence (biology); Transposition cipher; Algorithm; Combinatorics; Cryptography; Computer science; Mathematical analysis; Physics","score_opus":0.0336229700315679,"score_gpt":0.25574630739844845,"score_spread":0.22212333736688056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065586216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04999828,0.0045841266,0.9350504,0.0060253064,0.00013886798,0.00074916205,0.000011668869,0.00021523485,0.003226936],"genre_scores_gemma":[0.80676925,0.00072241423,0.19096497,0.0008139351,0.000014234999,0.0006853301,0.000006284435,0.000008232304,0.00001536121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991585,0.00010646058,0.00018128207,0.00022413998,0.00009287989,0.00023675313],"domain_scores_gemma":[0.9965764,0.0010457555,0.00007066146,0.0021155146,0.00010719253,0.000084473446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026052748,0.00013593478,0.00011413797,0.00011724489,0.0009798625,0.000378131,0.0022303616,0.000051860738,0.000012261262],"category_scores_gemma":[0.000021370835,0.00009955902,0.00019241888,0.00060379226,0.00046637683,0.00036715454,0.00045515885,0.000162808,0.000010505981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050247704,0.00009998719,0.0007092892,0.000005891569,0.0001006331,6.156381e-8,0.000934642,0.00004684733,0.00020244946,0.8315063,0.0026416616,0.16374719],"study_design_scores_gemma":[0.0013070848,0.00051258225,0.045040518,0.00006880787,0.00017454455,0.000014062583,0.0040101777,0.059212673,0.00035987145,0.6804932,0.20783672,0.0009698063],"about_ca_topic_score_codex":0.000057086952,"about_ca_topic_score_gemma":0.000008763212,"teacher_disagreement_score":0.75677097,"about_ca_system_score_codex":0.0000034470568,"about_ca_system_score_gemma":0.000016312653,"threshold_uncertainty_score":0.75364095},"labels":[],"label_agreement":null},{"id":"W2066106400","doi":"10.1016/j.jcta.2013.01.010","title":"Advances in the merit factor problem for binary sequences","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Binary number; Skew; Conjecture; Figure of merit; Aperiodic graph; Combinatorics; Complementary sequences; Binary Golay code; Pseudorandom binary sequence; Autocorrelation; Discrete mathematics; Algorithm; Statistics; Computer science; Arithmetic","score_opus":0.010201449082750266,"score_gpt":0.24430902632471282,"score_spread":0.23410757724196257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066106400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7723161,0.012677379,0.1482309,0.017614376,0.02922138,0.0036671308,0.00001731176,0.00024172834,0.016013706],"genre_scores_gemma":[0.99349356,0.0002495612,0.005629207,0.00017614948,0.00037061732,0.00004707444,2.6335744e-7,0.0000075425237,0.0000260141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998462,0.00042407724,0.0004334332,0.00013881948,0.0002973452,0.0002442858],"domain_scores_gemma":[0.9982764,0.00082605454,0.0003597178,0.00025745202,0.00022194555,0.000058419664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016127921,0.00014380147,0.00025590396,0.00015331873,0.00016397637,0.00026173878,0.0014794365,0.000054799828,0.000039031278],"category_scores_gemma":[0.00014452396,0.00008742487,0.00018658722,0.0004399737,0.0001465424,0.0027189862,0.000074619784,0.0002213048,0.000003001705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019234666,0.00008726317,0.00008892525,0.000020326757,0.000014696876,0.000007690484,0.0018023209,0.000013568181,0.0005852437,0.97931993,0.00021717278,0.01765051],"study_design_scores_gemma":[0.0005634274,0.0012837709,0.00017512612,0.000051930092,0.000006440549,0.000057622477,0.0007857318,0.000022862516,0.00058934424,0.9635845,0.03276033,0.00011892501],"about_ca_topic_score_codex":0.0000019553718,"about_ca_topic_score_gemma":8.3842565e-7,"teacher_disagreement_score":0.22117747,"about_ca_system_score_codex":0.000020590123,"about_ca_system_score_gemma":0.00007909576,"threshold_uncertainty_score":0.35650828},"labels":[],"label_agreement":null},{"id":"W2066388619","doi":"10.1007/s10623-006-9000-2","title":"Self-dual codes over $$\\mathbb{Z}_8$$ and $$\\mathbb{Z}_9$$","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Dual (grammatical number); Combinatorics; Mathematics; Torsion (gastropod); Discrete mathematics; Physics; Art","score_opus":0.010690310789131552,"score_gpt":0.21586887644435868,"score_spread":0.20517856565522713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066388619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57142323,0.006523265,0.41309446,0.00035293866,0.00033148663,0.00052898785,0.000035288187,0.0013167734,0.006393546],"genre_scores_gemma":[0.92279303,0.0007247361,0.075795636,0.00040286165,0.00015753055,0.00005096438,0.000012351947,0.000034890323,0.000028023558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734277,0.0002096345,0.00044847105,0.0009067401,0.00039478796,0.00069758284],"domain_scores_gemma":[0.99851286,0.00031924003,0.00016771928,0.000675081,0.00006787282,0.0002572436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055408414,0.00049394334,0.00047105673,0.0005902371,0.0006257885,0.00095467153,0.0005444341,0.00019415228,0.000024991328],"category_scores_gemma":[0.000008993657,0.00045313846,0.0002589279,0.0011951454,0.00040251412,0.0008077783,0.00031127245,0.00025870028,0.000008341779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004262898,0.00025222107,0.010332494,0.00008757911,0.00011907197,0.000053321754,0.00059188256,0.000007916878,0.0045828717,0.9710683,0.0011797477,0.011681938],"study_design_scores_gemma":[0.0034456523,0.0013233145,0.05898215,0.00028568634,0.0003051107,0.0005168993,0.00046973466,0.015242539,0.0062477994,0.8535808,0.056700666,0.002899671],"about_ca_topic_score_codex":0.000047895322,"about_ca_topic_score_gemma":0.00001925055,"teacher_disagreement_score":0.35136974,"about_ca_system_score_codex":0.000009219917,"about_ca_system_score_gemma":0.000030725096,"threshold_uncertainty_score":0.99979204},"labels":[],"label_agreement":null},{"id":"W2067182672","doi":"10.1016/j.jcta.2008.01.009","title":"A bound on the size of separating hash families","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Hash function; Upper and lower bounds; Perfect hash function; Collision resistance; Mathematics; Double hashing; Computer science; Combinatorics; Theoretical computer science; Discrete mathematics; Hash table; Computer security","score_opus":0.014942243950462786,"score_gpt":0.22755504918899902,"score_spread":0.21261280523853623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067182672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9843617,0.00019462801,0.0032162382,0.0006650588,0.0037372368,0.00009455284,0.0000012482749,0.000030111692,0.007699229],"genre_scores_gemma":[0.9985488,0.00006857831,0.0008129706,0.0001661127,0.00029071252,0.00000194296,4.611367e-8,0.000007446313,0.00010336669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982994,0.0004885188,0.0004771808,0.00011444707,0.00043939063,0.00018102194],"domain_scores_gemma":[0.99677885,0.0019654809,0.00054845365,0.00039444902,0.00025059344,0.00006215229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018778234,0.00014215142,0.00030940183,0.00010152719,0.00036021473,0.000078506026,0.001058218,0.000053721134,0.0000381981],"category_scores_gemma":[0.0007263432,0.000091147,0.00025847412,0.00044216655,0.0003651017,0.0005030406,0.00013090228,0.0002920566,0.000002880271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005068137,0.00010245889,0.00010133753,0.0000062123645,0.00006511765,0.000027716229,0.002576081,0.000019407935,0.0013832948,0.99393934,0.0006023612,0.0006698341],"study_design_scores_gemma":[0.0006305832,0.0014121437,0.00036771,0.000073496325,0.000013671243,0.00020667257,0.00056873227,0.000015908514,0.011538253,0.9784373,0.006616938,0.0001185871],"about_ca_topic_score_codex":0.0000012454838,"about_ca_topic_score_gemma":2.468812e-7,"teacher_disagreement_score":0.015502061,"about_ca_system_score_codex":0.00001844944,"about_ca_system_score_gemma":0.00013322337,"threshold_uncertainty_score":0.37168667},"labels":[],"label_agreement":null},{"id":"W2068228420","doi":"10.1145/2016567.2016582","title":"Root lifting techniques and applications to list decoding","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Root (linguistics); Series (stratigraphy); Mathematics; Decoding methods; Polynomial; Root-finding algorithm; Algorithm; Discrete mathematics; Algebra over a field; Applied mathematics; Computer science; Combinatorics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.05913432196443307,"score_gpt":0.30342949215306286,"score_spread":0.24429517018862978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068228420","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013237194,0.0003753369,0.9785299,0.0013654495,0.000057867255,0.00041923166,0.0000014249782,0.00050665054,0.005507003],"genre_scores_gemma":[0.44793952,0.000050833052,0.55147266,0.00031103627,0.000035571542,0.00017663662,0.0000018740395,0.0000074861673,0.000004357386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988566,0.00015385346,0.00031098738,0.00035804248,0.00009231672,0.00022817998],"domain_scores_gemma":[0.99552464,0.0004308521,0.000076108794,0.0037975053,0.00006864985,0.00010226002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056706986,0.00014100282,0.00015035349,0.0003863993,0.00035542142,0.00015930571,0.004679652,0.00005637398,0.0000058309597],"category_scores_gemma":[0.00003392507,0.0001560094,0.000045181394,0.0010442548,0.00011086484,0.00036907144,0.0046608425,0.00023326543,0.000018200972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017490742,0.00009869211,0.005420841,0.0000054877546,0.000008012561,0.000001379244,0.0019031465,0.0000011689326,0.00004038785,0.5116472,0.000080522776,0.48079136],"study_design_scores_gemma":[0.0005204076,0.00031198695,0.025499852,0.00032634134,0.000022878414,0.00013463285,0.00012319288,0.020803269,0.002745582,0.8520774,0.09627481,0.0011596003],"about_ca_topic_score_codex":0.000051878254,"about_ca_topic_score_gemma":0.00010742269,"teacher_disagreement_score":0.47963178,"about_ca_system_score_codex":0.000026751399,"about_ca_system_score_gemma":0.000021468926,"threshold_uncertainty_score":0.8696036},"labels":[],"label_agreement":null},{"id":"W2068652081","doi":"10.1007/s10623-007-9117-y","title":"Construction of MDS self-dual codes over Galois rings","year":2007,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Louisville","keywords":"Dual (grammatical number); Mathematics; Galois theory; Computer science; Discrete mathematics; Linguistics; Philosophy","score_opus":0.011983656679070488,"score_gpt":0.23408336228469123,"score_spread":0.22209970560562076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068652081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4582627,0.00038460843,0.5387403,0.00003061603,0.00017357533,0.00012347847,0.000006772873,0.00024054236,0.0020374304],"genre_scores_gemma":[0.86087215,0.00017268634,0.13875382,0.00012466597,0.00005264855,0.000006332988,0.0000024881735,0.0000117944965,0.0000033986146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983084,0.00009294438,0.00039635532,0.00045901467,0.00032388538,0.00041936603],"domain_scores_gemma":[0.998792,0.00028037888,0.00019234112,0.00044075813,0.00012221547,0.00017229549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010134181,0.0002470175,0.00031030198,0.00061403995,0.00024294574,0.0001357014,0.0003815404,0.00012801451,0.000026513442],"category_scores_gemma":[0.000013951604,0.0002342079,0.00022933703,0.0012943972,0.00036115426,0.00039318038,0.00013092137,0.00016636413,0.000002295639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071484115,0.00013771938,0.035542645,0.000054032873,0.00013872652,0.000014360231,0.0011142842,0.0000032517705,0.011508509,0.9235085,0.00018966259,0.027716802],"study_design_scores_gemma":[0.0039324993,0.0023291255,0.21508195,0.00033186667,0.00034269912,0.0004938577,0.0016163086,0.00316035,0.12003157,0.62936956,0.020867,0.0024432156],"about_ca_topic_score_codex":0.000036585785,"about_ca_topic_score_gemma":0.000013297582,"teacher_disagreement_score":0.40260947,"about_ca_system_score_codex":0.000009728177,"about_ca_system_score_gemma":0.000025961643,"threshold_uncertainty_score":0.9550721},"labels":[],"label_agreement":null},{"id":"W2069444685","doi":"10.1016/s1071-5797(03)00007-8","title":"Homogeneous weights and exponential sums","year":2003,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Sanitarium Association; National Science Foundation","keywords":"Mathematics; Homogeneous; Exponential function; Exponential sum; Algebraic number; Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Mathematical analysis","score_opus":0.008421389931006997,"score_gpt":0.19568288219313698,"score_spread":0.18726149226212999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069444685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032059856,0.00069886993,0.9596441,0.00027621308,0.00005125579,0.00013702478,0.0000060110083,0.00007320473,0.00705346],"genre_scores_gemma":[0.993842,0.00013220072,0.005608473,0.00019233419,0.00003236469,0.00007919794,0.0000024202404,0.000003571026,0.00010741482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952847,0.000029042687,0.00008366254,0.00021051643,0.000035610017,0.00011272369],"domain_scores_gemma":[0.9994544,0.00014460665,0.000024796182,0.00029472006,0.000017465587,0.000064053405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000091733134,0.000078917576,0.000071109105,0.000053055697,0.00023845537,0.00008428876,0.0001600974,0.00005154691,0.000020327334],"category_scores_gemma":[0.000005368047,0.00006383878,0.000031418447,0.00016719445,0.000045963454,0.000072091214,0.000057725945,0.00007146583,0.000007819286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010571646,0.00002455399,0.000120650686,0.0000037627917,0.00000824951,4.606068e-7,0.00038624444,9.775613e-7,0.000115181036,0.9687496,0.000045179542,0.030544095],"study_design_scores_gemma":[0.00020078657,0.000064807435,0.00042777954,0.000006910546,0.0000070493466,0.000037025704,0.000060001625,0.0011275429,0.0021945732,0.78185636,0.21382076,0.00019641193],"about_ca_topic_score_codex":0.0000032408464,"about_ca_topic_score_gemma":0.0000041453945,"teacher_disagreement_score":0.96178216,"about_ca_system_score_codex":0.0000013662835,"about_ca_system_score_gemma":0.000008593252,"threshold_uncertainty_score":0.26032698},"labels":[],"label_agreement":null},{"id":"W2069800452","doi":"10.1109/isit.2003.1228421","title":"Two-tuple-balance of nonbinary sequences with ideal two-level autocorrelation","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Tuple; Ideal (ethics); Balance (ability); Computer science; Mathematics; Statistics; Algorithm; Discrete mathematics; Psychology","score_opus":0.02106402537035717,"score_gpt":0.24937327713575305,"score_spread":0.22830925176539588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069800452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11693959,0.00005349894,0.8328544,0.00014769884,0.00015754471,0.00015438332,0.000001356935,0.00014620456,0.049545348],"genre_scores_gemma":[0.86735857,0.0000021515361,0.13228793,0.00010719287,0.000012343444,0.000011063881,8.017454e-7,0.000004054191,0.00021587533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904495,0.000100347024,0.00017596014,0.0002675254,0.00022124664,0.00018996258],"domain_scores_gemma":[0.9992783,0.0001184156,0.000103727514,0.00037368,0.00007206244,0.000053835796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003926556,0.00011319994,0.00013328882,0.00009817081,0.00009228981,0.00004354245,0.00040638595,0.00002640826,0.000052597297],"category_scores_gemma":[0.00001652158,0.00008597113,0.0000501434,0.0006139352,0.00009922948,0.00042470483,0.000042950443,0.00008721294,0.000015440355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014956789,0.00003875812,0.016371865,0.0000067602878,0.00001206998,0.00000660496,0.00023332344,0.0010981787,0.0010105163,0.97829866,0.000058556565,0.0028497505],"study_design_scores_gemma":[0.0056965877,0.002369724,0.061479606,0.00033347026,0.000060575625,0.0004440284,0.00051500206,0.13542394,0.044514187,0.74466443,0.0028172256,0.0016812382],"about_ca_topic_score_codex":0.00005548203,"about_ca_topic_score_gemma":0.00002801538,"teacher_disagreement_score":0.75041896,"about_ca_system_score_codex":0.000011478635,"about_ca_system_score_gemma":0.000079996506,"threshold_uncertainty_score":0.35058007},"labels":[],"label_agreement":null},{"id":"W2070033202","doi":"10.1016/j.ffa.2014.12.003","title":"A probabilistic approach to value sets of polynomials over finite fields","year":2015,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Coset; Polynomial; Discrete mathematics; Distribution (mathematics); Combinatorics; Random variable; Infinity; Expected value; Value (mathematics); Random field; Finite set; Order (exchange); Statistics; Mathematical analysis","score_opus":0.030584535267437006,"score_gpt":0.252485138880437,"score_spread":0.22190060361299999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070033202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012343255,0.00012129198,0.97111356,0.00062973343,0.00005749625,0.00044432812,0.00003318731,0.00007362466,0.015183512],"genre_scores_gemma":[0.9862151,0.0000075720836,0.012728676,0.000632229,0.000053193507,0.00025443625,0.000008729155,0.000006265925,0.00009379377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916524,0.00005279088,0.00021403003,0.00030458416,0.00009669882,0.00016663187],"domain_scores_gemma":[0.9986914,0.0003925848,0.00007062518,0.0006180308,0.000071273236,0.00015611433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031780163,0.00012491118,0.00017569451,0.00011255583,0.00009341517,0.00006226247,0.0004891242,0.00010197561,0.000007217818],"category_scores_gemma":[0.00006895393,0.000102645885,0.0000673007,0.00048082642,0.000050749724,0.000096795695,0.00021744931,0.00011877239,0.00000998347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001760927,0.00020303979,0.00014769431,0.000040330084,0.000028995184,2.3356563e-7,0.004320553,0.0015290625,0.000054905227,0.97125715,0.0012860114,0.02111441],"study_design_scores_gemma":[0.00069449143,0.0004492628,0.0012273075,0.00004931292,0.000028974602,0.000010228216,0.00029175467,0.06512024,0.0007276367,0.87223893,0.05863139,0.0005304479],"about_ca_topic_score_codex":0.000028726952,"about_ca_topic_score_gemma":0.000004548159,"teacher_disagreement_score":0.9738718,"about_ca_system_score_codex":0.000006228103,"about_ca_system_score_gemma":0.000045740446,"threshold_uncertainty_score":0.4185778},"labels":[],"label_agreement":null},{"id":"W2070485142","doi":"10.4153/cmb-2001-024-7","title":"The Zeta Function of a Pair of Quadratic Forms","year":2001,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Riemann zeta function; Invertible matrix; Function field; Function (biology); Pure mathematics; Field (mathematics); Order (exchange); Quadratic equation; Finite field; Arithmetic zeta function; Combinatorics; Geometry","score_opus":0.009286211904377853,"score_gpt":0.1928825936783488,"score_spread":0.18359638177397097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070485142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3356055,0.00035860407,0.57290983,0.01790004,0.0002532843,0.0005246347,0.0000062334766,0.0001060616,0.07233584],"genre_scores_gemma":[0.9978177,0.0000052630025,0.0015161928,0.00019719967,0.000012629454,0.0000099221215,4.0113244e-7,0.0000047886483,0.000435895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920136,0.000052206557,0.0002583763,0.00011645655,0.00014684633,0.00022475321],"domain_scores_gemma":[0.9989001,0.00035539462,0.00007722772,0.00045108737,0.000055237073,0.00016093727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056966307,0.00007595655,0.00013830652,0.0000844397,0.00011523081,0.00003411514,0.0005034574,0.000040450926,0.0006561222],"category_scores_gemma":[0.00016655149,0.00005011727,0.00009535905,0.00030024894,0.00012723396,0.000034612844,0.000036108213,0.00007102478,0.00029355954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066596735,0.000019896188,0.000063206004,0.000029483683,0.000014265473,0.000003200362,0.00017128729,0.0000022250708,0.000059815018,0.9872333,0.0022630214,0.0101336455],"study_design_scores_gemma":[0.00017092162,0.00018268167,0.00060531776,0.00008331645,0.00001721844,0.000021625778,0.00017465262,0.0018159393,0.00031282683,0.88690704,0.109577216,0.00013125311],"about_ca_topic_score_codex":0.0001257626,"about_ca_topic_score_gemma":0.0004535076,"teacher_disagreement_score":0.6622122,"about_ca_system_score_codex":0.000016818787,"about_ca_system_score_gemma":0.000076515804,"threshold_uncertainty_score":0.7184078},"labels":[],"label_agreement":null},{"id":"W2070626323","doi":"10.1007/s13389-012-0035-1","title":"Sequential multiplier with sub-linear gate complexity","year":2012,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplier (economics); Finite field; Mathematics; Binary number; Arithmetic; Time complexity; Computational complexity theory; Algorithm; Computer science; Discrete mathematics","score_opus":0.020973259563839622,"score_gpt":0.2258844092521239,"score_spread":0.20491114968828428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070626323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40098038,0.0003468492,0.5978943,0.000067112,0.0005017659,0.00004320816,6.139459e-7,0.00007095054,0.000094824216],"genre_scores_gemma":[0.87016237,0.00003282848,0.12938407,0.000044493107,0.00035612064,0.0000018955134,3.172429e-7,0.000016569147,0.0000013355385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985893,0.000050370072,0.00038021134,0.0001316552,0.0004030143,0.00044544885],"domain_scores_gemma":[0.998916,0.00009455064,0.0002361429,0.00030796413,0.00015683191,0.000288536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085330545,0.00020251304,0.0002791878,0.00056755927,0.00009125345,0.00007567294,0.00061115634,0.00006210633,0.000012178677],"category_scores_gemma":[0.000029225397,0.0001599953,0.00024799386,0.00090858346,0.000079624624,0.0009964181,0.00008733954,0.0004075098,0.000004233443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030007216,0.0006800094,0.04209633,0.00021000828,0.0010167097,0.00017576192,0.002775786,0.03559173,0.07962363,0.82832354,0.00021185263,0.008994572],"study_design_scores_gemma":[0.0179555,0.0054071327,0.41483796,0.0027579055,0.001031954,0.011706832,0.00052480877,0.26966763,0.14466022,0.047233894,0.07691675,0.0072994],"about_ca_topic_score_codex":0.0000014183237,"about_ca_topic_score_gemma":7.693916e-7,"teacher_disagreement_score":0.78108966,"about_ca_system_score_codex":0.00001855401,"about_ca_system_score_gemma":0.0000278877,"threshold_uncertainty_score":0.65244186},"labels":[],"label_agreement":null},{"id":"W2071138259","doi":"10.1007/s10623-004-4039-4","title":"On the Number of Trace-One Elements in Polynomial Bases for $$\\mathbb{F}_{2^n}$$","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; TRACE (psycholinguistics); Polynomial; Mathematics; Multiplication (music); Reduction (mathematics); Field (mathematics); Finite field; Basis (linear algebra); Function (biology); Discrete mathematics; Combinatorics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.03357650808782186,"score_gpt":0.2710127222578304,"score_spread":0.23743621417000854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071138259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6781304,0.00030492552,0.3173893,0.0013070505,0.00010095036,0.00058092223,0.000030348405,0.00007737732,0.002078712],"genre_scores_gemma":[0.9559758,0.00006865191,0.04318975,0.00059510424,0.000052577034,0.00009683923,0.0000019323509,0.00001078971,0.000008588485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986718,0.00012571247,0.00034246154,0.00033635888,0.00020139581,0.0003222319],"domain_scores_gemma":[0.9986522,0.0007177934,0.0001207623,0.00039515327,0.000046177876,0.000067921814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007606145,0.00018283442,0.00023564401,0.00024845547,0.00017097539,0.00009233961,0.0005234117,0.00006252821,0.000052392566],"category_scores_gemma":[0.000033265052,0.0001385212,0.00019896148,0.0006488685,0.00013944937,0.00019738887,0.00006547123,0.00011267108,0.0000038884104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016350788,0.0003699503,0.005012037,0.000024119267,0.000057979283,9.970115e-7,0.00055128,0.000022996544,0.0021069914,0.9409335,0.001450273,0.049306326],"study_design_scores_gemma":[0.008299991,0.0024786822,0.030105093,0.0006083175,0.000179393,0.00003597836,0.0008725293,0.024349343,0.04959698,0.8132971,0.068074584,0.002102016],"about_ca_topic_score_codex":0.000011164717,"about_ca_topic_score_gemma":0.000017129296,"teacher_disagreement_score":0.27784535,"about_ca_system_score_codex":0.0000072209887,"about_ca_system_score_gemma":0.000018987472,"threshold_uncertainty_score":0.56487304},"labels":[],"label_agreement":null},{"id":"W2071347182","doi":"10.1016/j.dam.2012.08.013","title":"Cyclotomic orthomorphisms of finite fields","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Prime (order theory); Cyclotomic field; Finite field; Cyclotomic polynomial; Index (typography); Discrete mathematics; Pure mathematics; Algebra over a field; Combinatorics; Mathematical analysis; Polynomial","score_opus":0.014880436468860397,"score_gpt":0.23108414275738287,"score_spread":0.21620370628852248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071347182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07716822,0.000051877774,0.88703763,0.000065426284,0.00018057787,0.00016731562,0.0000036079782,0.00012837851,0.035196975],"genre_scores_gemma":[0.8909673,0.000009597559,0.10879413,0.000108768676,0.000051706043,0.000021256476,0.0000021526823,0.000009957905,0.00003511452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991217,0.000013019785,0.00026841427,0.00013569536,0.00019020404,0.00027092313],"domain_scores_gemma":[0.9988818,0.00024191853,0.0001487783,0.0006199433,0.000019812374,0.00008773608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003624499,0.00013032176,0.00020980075,0.00008287257,0.00005928341,0.000027474485,0.0005673399,0.00006649368,0.000038031074],"category_scores_gemma":[0.000022434017,0.00011128647,0.00009968786,0.00028149807,0.00006366373,0.00015047593,0.00019626616,0.000099492856,0.00005701103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034716486,0.00008596964,0.000116285,0.00006452556,0.000019440797,4.5883553e-7,0.0025800408,0.000019835636,0.0018316989,0.9932378,0.00015964823,0.0018808575],"study_design_scores_gemma":[0.0007407462,0.00011086035,0.0008132159,0.00010124448,0.00008198294,0.000021689653,0.0005935106,0.009061312,0.0495854,0.9336101,0.004499764,0.00078021194],"about_ca_topic_score_codex":0.000001043582,"about_ca_topic_score_gemma":4.461463e-7,"teacher_disagreement_score":0.8137991,"about_ca_system_score_codex":0.0000057299703,"about_ca_system_score_gemma":0.000011720228,"threshold_uncertainty_score":0.45381305},"labels":[],"label_agreement":null},{"id":"W2071480454","doi":"10.5539/jmr.v6n1p100","title":"The Array Structure of Modified Jacobi Sequences","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hubei Provincial Department of Education","keywords":"Mathematics; Autocorrelation; Prime (order theory); Jacobi method; Prime number; Pure mathematics; Combinatorics; Mathematical analysis; Statistics","score_opus":0.06546345803917124,"score_gpt":0.35396414771880813,"score_spread":0.2885006896796369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071480454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43132776,0.00028594935,0.56077164,0.0017201069,0.00031805466,0.00012054611,0.0000012157129,0.000012632872,0.005442076],"genre_scores_gemma":[0.9674045,0.000048203463,0.03237551,0.000010953366,0.00008444444,5.342532e-7,3.0171865e-8,0.000004322292,0.000071520655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978455,0.000391973,0.00041390478,0.00008156442,0.0010365003,0.00023058103],"domain_scores_gemma":[0.9965221,0.0020431199,0.00030375374,0.00045485928,0.0005975336,0.00007860389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057323445,0.00006715578,0.00018207698,0.00021771046,0.00023279917,0.00017390969,0.0019070966,0.000043301872,0.000010164046],"category_scores_gemma":[0.0007525048,0.000036179466,0.00011334423,0.0004888899,0.00024097395,0.00017612423,0.000127813,0.00043992497,0.0000028984434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013590413,0.00006436557,0.000033955865,0.00007169338,0.00004338776,0.00000276625,0.0021724966,0.0001426143,0.058354326,0.92880905,0.00055973534,0.009732005],"study_design_scores_gemma":[0.0001527685,0.0002793138,0.00006932099,0.000096835625,0.000004281332,0.00006067935,0.0003815033,0.0053898417,0.033000533,0.9591897,0.0013232509,0.000051944506],"about_ca_topic_score_codex":0.0000015867215,"about_ca_topic_score_gemma":0.0000028581844,"teacher_disagreement_score":0.5360767,"about_ca_system_score_codex":0.000015205104,"about_ca_system_score_gemma":0.000094150455,"threshold_uncertainty_score":0.35438916},"labels":[],"label_agreement":null},{"id":"W2071813582","doi":"10.1109/cwit.2013.6621585","title":"On selection of optimal parameters for the WG stream cipher family","year":2013,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Selection (genetic algorithm); Cipher; Randomness; Transformation (genetics); Extension (predicate logic); Computer science; Cryptography; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Encryption; Statistics; Programming language; Computer security","score_opus":0.016735014606985274,"score_gpt":0.22876195506026276,"score_spread":0.21202694045327747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071813582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34066752,0.000007660649,0.6565377,0.0002345922,0.00010880118,0.00018397463,3.6149302e-7,0.000052477062,0.0022069362],"genre_scores_gemma":[0.9586829,0.0000017226134,0.040708166,0.00035259043,0.000011272606,0.00004684793,1.7668276e-7,0.0000028291672,0.00019349733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957615,0.000022963137,0.00008102661,0.00012796567,0.00008050922,0.00011140022],"domain_scores_gemma":[0.999324,0.00036861404,0.000032758377,0.00020526412,0.000048747763,0.000020578289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013668221,0.000055529606,0.00005511509,0.000038030084,0.000073153504,0.000054597564,0.00031877245,0.000021623766,0.00004647769],"category_scores_gemma":[0.000015032573,0.00003331137,0.000075797296,0.00019022633,0.000030046236,0.00013335666,0.000031122767,0.000038646194,0.000014687424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003103776,0.00009767452,0.00021761203,0.000006571725,0.000053463795,6.7457236e-8,0.0002820582,0.0031123254,0.0034846603,0.8165848,0.009753269,0.16637644],"study_design_scores_gemma":[0.0010466608,0.0026837662,0.017131576,0.00003242553,0.0000381038,0.0000041048443,0.00046692064,0.6790698,0.054341633,0.24061838,0.0041049505,0.00046168824],"about_ca_topic_score_codex":0.00004373872,"about_ca_topic_score_gemma":0.00000217655,"teacher_disagreement_score":0.6759575,"about_ca_system_score_codex":0.000004486991,"about_ca_system_score_gemma":0.000008407918,"threshold_uncertainty_score":0.13583983},"labels":[],"label_agreement":null},{"id":"W2072057413","doi":"10.1145/2220336.2220343","title":"An Efficient Finite Field Multiplier Using Redundant Representation","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplier (economics); Computer science; Application-specific integrated circuit; Finite field; Representation (politics); CMOS; Binary number; Algorithm; Arithmetic; Computer engineering; Electronic engineering; Computer hardware; Mathematics; Discrete mathematics","score_opus":0.041535145269996805,"score_gpt":0.31572095571479125,"score_spread":0.27418581044479445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072057413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2533739,0.00006280628,0.743645,0.0000504503,0.0021099916,0.00021600522,0.0000019750084,0.0003595285,0.00018034429],"genre_scores_gemma":[0.9507613,0.0000016717603,0.04884856,0.000116489,0.00021803049,0.0000109530365,0.0000019320719,0.00001849548,0.000022525284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788064,0.0003845335,0.00041351767,0.00047358443,0.00035339192,0.00049435894],"domain_scores_gemma":[0.9972905,0.0007609242,0.00016853266,0.0014951931,0.00008650747,0.00019837981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081419625,0.00021723374,0.00022844633,0.0003109655,0.0006301482,0.0002684773,0.00089259684,0.00010951946,0.000010002875],"category_scores_gemma":[0.00005360317,0.00021540087,0.00015546486,0.00076982804,0.000035014946,0.00041647765,0.000026249341,0.00027267833,0.00003142444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035176785,0.00045328517,0.00028969292,0.00002988109,0.00006032901,0.0000040513846,0.0080903275,0.9542695,0.0030093396,0.007742173,0.000019437293,0.025996761],"study_design_scores_gemma":[0.00036564542,0.00015093127,0.0001921742,0.00011590863,0.000026267047,0.000054837874,0.0007838156,0.9928071,0.004815144,0.00024604658,0.0001405952,0.00030153987],"about_ca_topic_score_codex":0.00008004602,"about_ca_topic_score_gemma":9.866446e-7,"teacher_disagreement_score":0.69738746,"about_ca_system_score_codex":0.000071257455,"about_ca_system_score_gemma":0.00002813924,"threshold_uncertainty_score":0.8783793},"labels":[],"label_agreement":null},{"id":"W2072113533","doi":"10.3934/amc.2012.6.347","title":"Cycle structure of permutation functions over finite fields and their applications","year":2012,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Permutation (music); Inverse; Finite field; Order (exchange); Function (biology); Field (mathematics); Pure mathematics; Combinatorics; Discrete mathematics; Geometry","score_opus":0.012029016746072835,"score_gpt":0.27961477844150046,"score_spread":0.26758576169542764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072113533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027128045,0.004433224,0.9643027,0.00018191978,0.000034656085,0.00018494367,0.000026437243,0.000026987966,0.0036810823],"genre_scores_gemma":[0.8914382,0.0004913901,0.108004175,0.000018366365,0.000005942274,0.000025390176,0.0000069780617,0.000003357245,0.0000062334993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994834,0.0000475407,0.00024933886,0.0000686118,0.00006404102,0.00008708469],"domain_scores_gemma":[0.9979035,0.00083402905,0.00016886654,0.0010138435,0.000054202133,0.000025543526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001615259,0.00006609646,0.0001221904,0.00011714725,0.00008627801,0.000009831794,0.00062712305,0.000035221332,0.000009857537],"category_scores_gemma":[0.00004801938,0.00005863987,0.00003482258,0.0003875576,0.00014990613,0.0005425182,0.00021665863,0.00009695778,7.6141885e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.862304e-7,0.00018175262,0.0013429072,0.00006795416,0.000009366322,4.8613034e-9,0.004750679,0.0003525769,0.0007912589,0.9778919,0.000004711383,0.014605904],"study_design_scores_gemma":[0.00014266076,0.000026605016,0.0016218101,0.0000547432,0.0000117681375,0.000002682883,0.0007836935,0.01589155,0.0012442608,0.9762885,0.0038239863,0.000107755506],"about_ca_topic_score_codex":0.0000025105664,"about_ca_topic_score_gemma":0.000028788778,"teacher_disagreement_score":0.86431015,"about_ca_system_score_codex":0.000005275352,"about_ca_system_score_gemma":0.000009532017,"threshold_uncertainty_score":0.23912646},"labels":[],"label_agreement":null},{"id":"W2072234772","doi":"10.4153/cmb-2007-020-0","title":"Every Real Algebraic Integer Is a Difference of Two Mahler Measures","year":2007,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Integer (computer science); Degree (music); Algebraic number; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.016980680062264723,"score_gpt":0.23810430518128378,"score_spread":0.22112362511901906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072234772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30570397,0.00012387472,0.6121236,0.0064970837,0.00022571061,0.00029712357,0.000011801559,0.00015488915,0.07486193],"genre_scores_gemma":[0.9887074,0.000003346814,0.008400185,0.0013315311,0.000040527804,0.0000062104773,6.644816e-7,0.000011800376,0.0014983133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985141,0.00006231891,0.00034235502,0.00030237815,0.00028930645,0.0004895036],"domain_scores_gemma":[0.9983573,0.00037803556,0.00007085244,0.00059428805,0.00009232064,0.0005072357],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009305982,0.00016377767,0.00024944815,0.0002660188,0.00008332414,0.000059845574,0.0008336911,0.00008171301,0.0023476006],"category_scores_gemma":[0.00015922404,0.00014397418,0.00013510582,0.00036747538,0.00011461974,0.000039287028,0.000088928806,0.00017621487,0.0010457985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008494168,0.00004944041,0.00031572356,0.00004551508,0.000027747143,0.000045007135,0.0010708862,6.590671e-7,0.0004981724,0.97720295,0.005941581,0.014793848],"study_design_scores_gemma":[0.00045884453,0.0001273699,0.0030529299,0.0002620528,0.000027291568,0.00006318336,0.000108849636,0.00072555174,0.003377396,0.972877,0.01838353,0.0005359835],"about_ca_topic_score_codex":0.0013161143,"about_ca_topic_score_gemma":0.0016351356,"teacher_disagreement_score":0.6830034,"about_ca_system_score_codex":0.00009053895,"about_ca_system_score_gemma":0.00012827435,"threshold_uncertainty_score":0.999732},"labels":[],"label_agreement":null},{"id":"W2072285126","doi":"10.1109/tit.2013.2243496","title":"New Polyphase Sequence Families With Low Correlation Derived From the Weil Bound of Exponential Sums","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Sequence (biology); Combinatorics; Mathematics; Discrete mathematics; Biology","score_opus":0.007841506769423124,"score_gpt":0.19821105641457804,"score_spread":0.1903695496451549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072285126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15651636,0.00001188612,0.8420663,0.00017537903,0.0003930232,0.00023498184,0.000017335193,0.000111213674,0.0004735266],"genre_scores_gemma":[0.99418795,0.000014604501,0.0053115394,0.0003644289,0.0000206681,0.000036130077,0.000008224718,0.0000050254134,0.000051453702],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990301,0.00012726986,0.000305966,0.00011976625,0.00026768123,0.00014922673],"domain_scores_gemma":[0.9988021,0.00038048034,0.00018063583,0.00045928595,0.000110409004,0.00006705325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022702862,0.00013819711,0.0001123888,0.00015736501,0.00029587914,0.00019743781,0.00046318816,0.000059698436,0.00027099325],"category_scores_gemma":[0.0000063603616,0.0000970559,0.000086721346,0.00040714742,0.00014805082,0.0028933396,0.0000032675125,0.00017044626,0.00015336376],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050584023,0.00014291916,0.000044746612,0.00002400204,0.00016998244,7.837154e-7,0.022941144,0.020108938,0.010874509,0.1311673,0.00036056148,0.81365925],"study_design_scores_gemma":[0.008559978,0.0017540738,0.011483747,0.00070492947,0.0002980294,0.000089580186,0.0144464625,0.15023082,0.47502455,0.33353937,0.0019001617,0.0019682907],"about_ca_topic_score_codex":0.00032697458,"about_ca_topic_score_gemma":0.000020762662,"teacher_disagreement_score":0.8376716,"about_ca_system_score_codex":0.000022609382,"about_ca_system_score_gemma":0.00009827364,"threshold_uncertainty_score":0.39578247},"labels":[],"label_agreement":null},{"id":"W2072368099","doi":"10.1049/iet-com.2012.0491","title":"Convolutional doubly orthogonal codes over <i>GF</i> ( <i>q</i> )","year":2013,"lang":"en","type":"article","venue":"IET Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"GF(2); Convolutional code; Computer science; Mathematics; Combinatorics; Algorithm; Finite field; Decoding methods","score_opus":0.021424821267185524,"score_gpt":0.2547704431675885,"score_spread":0.23334562190040298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072368099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11043534,0.0033699153,0.66999865,0.04269095,0.0009474661,0.0011667482,0.00011162453,0.0018011804,0.16947815],"genre_scores_gemma":[0.9533256,0.00008807871,0.044307873,0.0018619786,0.000033100467,0.00012606061,0.000037028498,0.0000075006224,0.00021276381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897623,0.00016872237,0.00021897478,0.00021154113,0.00019932918,0.0002251736],"domain_scores_gemma":[0.9969377,0.00037208258,0.00007902222,0.002346729,0.00016022722,0.000104239865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025502947,0.00011764897,0.000114617724,0.00008716241,0.000485984,0.00022383267,0.0028040935,0.00005430289,0.00028365751],"category_scores_gemma":[0.000024223968,0.00011567111,0.00011538487,0.00048209104,0.0002820485,0.00064600416,0.00088568474,0.00022213363,0.00045644658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015443011,0.0001181495,0.0017123534,0.0000020671812,0.000021641095,2.4454272e-7,0.00017499429,0.000014116297,0.00097318063,0.9795178,0.0130892275,0.0043746647],"study_design_scores_gemma":[0.0007664999,0.00008037631,0.04279054,0.00004097506,0.000021603182,0.00003627544,0.00006307529,0.025891844,0.00035300487,0.54142636,0.38794675,0.00058266206],"about_ca_topic_score_codex":0.000072675815,"about_ca_topic_score_gemma":0.0000428464,"teacher_disagreement_score":0.84289026,"about_ca_system_score_codex":0.000019447616,"about_ca_system_score_gemma":0.00006891674,"threshold_uncertainty_score":0.58668494},"labels":[],"label_agreement":null},{"id":"W2074001034","doi":"10.1080/09720529.2006.10698064","title":"Some generalizations of Rédei’s theorem","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Mathematical Sciences and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Projective plane; Transversal (combinatorics); Combinatorics; Plane (geometry); Affine plane (incidence geometry); Affine transformation; Line (geometry); Order (exchange); Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.01071572952666049,"score_gpt":0.24236119864046185,"score_spread":0.23164546911380135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074001034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23604275,0.0015560312,0.7557928,0.0009765185,0.000150766,0.00008465291,0.0000028114391,0.00002624548,0.00536744],"genre_scores_gemma":[0.90315664,0.00010137345,0.09653952,0.00007751252,0.000113114234,0.0000014164334,1.7161288e-7,0.0000040726695,0.0000062039126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984508,0.000087262284,0.0005698311,0.00016971785,0.00049727265,0.000225105],"domain_scores_gemma":[0.99898994,0.00020750515,0.00039892137,0.00018810564,0.00010884106,0.00010665901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010964466,0.000127421,0.0002881822,0.00038898937,0.00020580363,0.00018058649,0.0007536525,0.00004309623,0.000028197754],"category_scores_gemma":[0.000038881673,0.00008133667,0.00027712923,0.001098537,0.00071600504,0.00068359746,0.0001129815,0.0000962843,0.0000010031832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041838894,0.000081667706,0.0009838021,0.00002301671,0.000016661317,0.0000026615041,0.00015177099,0.00006145973,0.0009814715,0.9965751,0.00012736412,0.0009908056],"study_design_scores_gemma":[0.00018928241,0.00030632308,0.0013093326,0.00007579813,0.000024513181,0.00005939815,0.000116009964,0.0020435143,0.0009104798,0.9946341,0.00021870356,0.000112567366],"about_ca_topic_score_codex":0.0000033991007,"about_ca_topic_score_gemma":7.8255135e-7,"teacher_disagreement_score":0.66711384,"about_ca_system_score_codex":0.0000034784366,"about_ca_system_score_gemma":0.000034731027,"threshold_uncertainty_score":0.3316813},"labels":[],"label_agreement":null},{"id":"W2074881723","doi":"10.1016/j.jcta.2010.11.005","title":"Relatively prime polynomials and nonsingular Hankel matrices over finite fields","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Invertible matrix; Hankel matrix; Coprime integers; Monic polynomial; Finite field; Rank (graph theory); Prime (order theory); Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field; Polynomial; Mathematical analysis","score_opus":0.005469718997047604,"score_gpt":0.22236128612609604,"score_spread":0.21689156712904845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074881723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94071996,0.00065842125,0.04373117,0.00083345716,0.01135696,0.00012962219,0.0000026938249,0.00006360325,0.0025041301],"genre_scores_gemma":[0.9929914,0.000060020295,0.0060870834,0.00012223583,0.0006138793,0.0000010184924,1.4440626e-7,0.000009911286,0.00011434161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986844,0.00026014727,0.00041534755,0.00016665697,0.00026950423,0.00020396318],"domain_scores_gemma":[0.9980402,0.000856622,0.00047593648,0.00031352157,0.00017538319,0.00013833244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019213838,0.00016341364,0.00031217522,0.00022124327,0.0002151857,0.0002784321,0.0006413166,0.00015158759,0.00006441347],"category_scores_gemma":[0.00050540053,0.0001347153,0.0001583831,0.00030636135,0.00019351378,0.0011902268,0.00020668765,0.0005549216,0.000002704029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039748143,0.000059208545,0.00028617578,0.000007000476,0.0000617462,0.00003246331,0.0010620778,0.000002034426,0.0044475608,0.9888992,0.00017868525,0.0045663896],"study_design_scores_gemma":[0.0009187764,0.000625517,0.0010325318,0.000040753966,0.000031376654,0.00016207303,0.00005663056,0.000038312803,0.0063004307,0.97380126,0.016808296,0.00018402131],"about_ca_topic_score_codex":0.0000021975402,"about_ca_topic_score_gemma":9.62195e-7,"teacher_disagreement_score":0.052271426,"about_ca_system_score_codex":0.000009545762,"about_ca_system_score_gemma":0.00009770752,"threshold_uncertainty_score":0.549353},"labels":[],"label_agreement":null},{"id":"W2075501204","doi":"10.1109/mwscas.2010.5548774","title":"Efficient VLSI implementation of a finite field multiplier using reordered normal basis","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"NIST; Multiplier (economics); Clock rate; Very-large-scale integration; Finite field; Computer science; Elliptic curve cryptography; Normal basis; Domino logic; Cryptography; Arithmetic; Parallel computing; CMOS; Application-specific integrated circuit; Public-key cryptography; Computer hardware; Embedded system; Chip; Logic synthesis; Electronic engineering; Logic gate; Mathematics; Algorithm; Engineering; Galois theory; Discrete mathematics; Encryption; Logic family","score_opus":0.013073163427114945,"score_gpt":0.2767760127203315,"score_spread":0.2637028492932165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075501204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6012269,0.0000018872726,0.39740336,0.00009843248,0.0001861498,0.000059423877,0.0000010143668,0.000035905945,0.0009868833],"genre_scores_gemma":[0.9144028,3.5489794e-7,0.0853899,0.0001650872,0.000020691268,0.0000029529951,5.635198e-7,0.0000028001793,0.000014859288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934596,0.000027217142,0.00017496101,0.00016853202,0.00013191733,0.00015140674],"domain_scores_gemma":[0.999347,0.00016650483,0.00006893488,0.0003197678,0.000057635854,0.00004019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026742287,0.00007005207,0.00007802411,0.000120932695,0.00008654331,0.000037803416,0.00030408188,0.000036859343,0.00034613922],"category_scores_gemma":[0.000026739088,0.00006305899,0.000071036055,0.0003211898,0.000023382425,0.00008671156,0.0001345075,0.00009039917,0.0000049042565],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074641524,0.0002741909,0.021128552,0.00004857937,0.00006381602,0.000005658144,0.0052463165,0.0034337663,0.25552237,0.36356372,0.00020693132,0.35043147],"study_design_scores_gemma":[0.0012990665,0.00031263081,0.010912445,0.000017189934,0.000028333166,0.000008087668,0.0005014028,0.5491254,0.43190014,0.004610243,0.00090533897,0.00037975988],"about_ca_topic_score_codex":0.000103085666,"about_ca_topic_score_gemma":0.000097839016,"teacher_disagreement_score":0.5456916,"about_ca_system_score_codex":0.0000032779114,"about_ca_system_score_gemma":0.000027613682,"threshold_uncertainty_score":0.37899816},"labels":[],"label_agreement":null},{"id":"W2076269205","doi":"10.1007/s10623-005-2031-2","title":"Self-Reciprocal Irreducible Pentanomials Over $$\\mathbb{F}_2$$","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Reciprocal; Mathematics; Combinatorics; Degree (music); Pure mathematics; Physics; Philosophy","score_opus":0.012341728093044665,"score_gpt":0.22610043634331584,"score_spread":0.21375870825027116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076269205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2340911,0.0024942993,0.74251306,0.00036818994,0.0005607454,0.0005392007,0.000018860506,0.0011909195,0.018223593],"genre_scores_gemma":[0.91345245,0.00017467003,0.085679464,0.00036712462,0.00019081513,0.000059999405,0.000008562954,0.000026242971,0.000040686413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976964,0.00017196666,0.00040031387,0.00078308827,0.0003479818,0.0006002497],"domain_scores_gemma":[0.9987088,0.00020037506,0.00013902999,0.00068884174,0.00007319599,0.00018978918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059710327,0.00036264586,0.00036136608,0.0005052841,0.00045790564,0.0005866337,0.0007553654,0.00014309914,0.000063284475],"category_scores_gemma":[0.000008041208,0.0003351472,0.00031320396,0.0012673003,0.00018023919,0.0005798373,0.00020772923,0.0001887469,0.000024089215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037800088,0.0003203296,0.005885953,0.0000450252,0.000086802014,0.000036964593,0.00030070497,0.000014115005,0.004509973,0.9746803,0.0052609616,0.008821041],"study_design_scores_gemma":[0.0025642868,0.0009094853,0.03936347,0.00011819214,0.00018416425,0.0001781825,0.0001636581,0.0064499998,0.010892235,0.78159153,0.15548374,0.0021010372],"about_ca_topic_score_codex":0.000062922074,"about_ca_topic_score_gemma":0.000016377691,"teacher_disagreement_score":0.67936134,"about_ca_system_score_codex":0.000016308302,"about_ca_system_score_gemma":0.00004245485,"threshold_uncertainty_score":0.99991006},"labels":[],"label_agreement":null},{"id":"W2076436757","doi":"10.1007/s10623-008-9195-5","title":"The trace of an optimal normal element and low complexity normal bases","year":2008,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Extension (predicate logic); Element (criminal law); Type (biology); Mathematics; TRACE (psycholinguistics); Combinatorics; Finite field; Field (mathematics); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.03360526761037703,"score_gpt":0.24161933735386298,"score_spread":0.20801406974348596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076436757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7484228,0.001032311,0.2496733,0.00012124838,0.00006761572,0.00017124787,0.000015415988,0.0000804105,0.0004156302],"genre_scores_gemma":[0.9543746,0.0005640545,0.04487316,0.00011729216,0.000035241465,0.000018752216,0.0000034962402,0.000008828825,0.000004553148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99842554,0.00021299467,0.00030905887,0.00037964422,0.00028318787,0.00038959557],"domain_scores_gemma":[0.9988677,0.0002579867,0.00012798689,0.00047173369,0.000086743894,0.00018788148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000615725,0.00022001406,0.00023561642,0.00017426757,0.00096039736,0.00015167077,0.00056862057,0.000055676937,0.000015133033],"category_scores_gemma":[0.0000101849055,0.00016616043,0.00013782251,0.00053395075,0.0009491672,0.0004938337,0.00017230128,0.00014292031,6.738797e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057039445,0.00067338906,0.0191246,0.00010299823,0.00018336702,0.000061419145,0.0038681778,0.00018474362,0.004564809,0.85260904,0.0005239888,0.117533095],"study_design_scores_gemma":[0.009607678,0.014226124,0.54079425,0.00034557382,0.000365195,0.0018975418,0.004502282,0.15185168,0.08872781,0.1507638,0.032097112,0.004820957],"about_ca_topic_score_codex":0.000030482457,"about_ca_topic_score_gemma":0.000024742172,"teacher_disagreement_score":0.7018452,"about_ca_system_score_codex":0.0000033373294,"about_ca_system_score_gemma":0.000030692736,"threshold_uncertainty_score":0.73866975},"labels":[],"label_agreement":null},{"id":"W2078353038","doi":"10.1090/s0025-5718-01-01352-7","title":"Smooth ideals in hyperelliptic function fields","year":2001,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Mathematical proof; Hyperelliptic curve cryptography; Hyperelliptic curve; Logarithm; Genus; Finite field; Discrete logarithm; Function (biology); Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis; Computer science; Geometry","score_opus":0.019933701301037207,"score_gpt":0.2488137992355454,"score_spread":0.2288800979345082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078353038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31755382,0.000029180721,0.67957556,0.00009536367,0.00008593671,0.000064543485,1.0485733e-7,0.00004309931,0.002552418],"genre_scores_gemma":[0.95111686,0.000007781362,0.048779294,0.000052846965,0.0000136047875,0.0000041711723,0.0000010488534,0.0000039025986,0.000020482748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993286,0.00003576048,0.00026317124,0.00011899193,0.00015108577,0.00010235043],"domain_scores_gemma":[0.99944454,0.00019259295,0.00011112546,0.0001821722,0.000047752652,0.000021827464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033376302,0.00006869952,0.00012763137,0.00018442413,0.000028108987,0.000033445613,0.00020834485,0.000040629686,0.000010400319],"category_scores_gemma":[0.000027904762,0.00006731242,0.00004623276,0.0004552739,0.00001769236,0.00017971295,0.000041282834,0.000059372796,0.000015304771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018097271,0.00033508334,0.0010140943,0.00012917696,0.000014759546,0.0000063989987,0.0028832338,0.016914096,0.0007168635,0.8648538,0.00013423148,0.112980165],"study_design_scores_gemma":[0.00020869446,0.00010086306,0.0025290947,0.000054971013,0.0000050495455,0.000005798175,0.00006502193,0.25442564,0.0001808771,0.74224305,0.00010129558,0.000079608326],"about_ca_topic_score_codex":0.0000048752286,"about_ca_topic_score_gemma":0.000005116881,"teacher_disagreement_score":0.63356304,"about_ca_system_score_codex":0.000009327526,"about_ca_system_score_gemma":0.00001146309,"threshold_uncertainty_score":0.2744921},"labels":[],"label_agreement":null},{"id":"W2078476935","doi":"10.1007/s00200-014-0219-2","title":"VSH and multiplicative modular relations between small primes with polynomial exponents","year":2014,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multiplicative function; Mathematics; Combinatorics; Polynomial; Prime (order theory); Order (exchange); Multiplicative number theory; Discrete mathematics; Hash function; Prime factor; Computer science","score_opus":0.007021612000770943,"score_gpt":0.19120881623314898,"score_spread":0.18418720423237803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078476935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49151003,0.00018533578,0.507663,0.0001588094,0.000006713745,0.0001250818,3.0035315e-7,0.0001231218,0.00022759491],"genre_scores_gemma":[0.883156,0.000017265438,0.11672108,0.000041911553,0.000018214221,0.00002468593,0.000004569069,0.000011160876,0.0000050870067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991419,0.00008180205,0.00021022606,0.00029260438,0.000076102675,0.00019738289],"domain_scores_gemma":[0.99866664,0.0005234953,0.000080644066,0.00062697957,0.000026314368,0.000075943884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047913237,0.00014232776,0.00017625665,0.00014008806,0.00020269938,0.00011068638,0.0005055498,0.000055645247,5.1618815e-7],"category_scores_gemma":[0.000026156607,0.00014499435,0.000018165407,0.0003618144,0.000057253936,0.00016362975,0.00043890745,0.00023315212,0.0000018880615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020671821,0.00014465596,0.17797942,0.00010318464,0.0001096269,0.0000010048263,0.0054117306,0.024790978,0.0036731085,0.607671,0.000021330827,0.18007326],"study_design_scores_gemma":[0.0009630834,0.00008213088,0.22735246,0.00018107131,0.00001434552,0.000009018471,0.000078100646,0.7634701,0.0011053081,0.0047215456,0.0016020703,0.00042073725],"about_ca_topic_score_codex":0.00003457194,"about_ca_topic_score_gemma":0.0000034710486,"teacher_disagreement_score":0.7386792,"about_ca_system_score_codex":0.000016452701,"about_ca_system_score_gemma":0.000009382322,"threshold_uncertainty_score":0.5912698},"labels":[],"label_agreement":null},{"id":"W2078609456","doi":"10.1007/s00373-007-0731-2","title":"Extremal Ternary Self-Dual Codes Constructed from Negacirculant Matrices","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"University of Lethbridge","keywords":"Ternary operation; Dual (grammatical number); Mathematics; Combinatorics; Construct (python library); Discrete mathematics; Computer science","score_opus":0.0070924533394057885,"score_gpt":0.20372241116566261,"score_spread":0.19662995782625683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078609456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9619131,0.001601783,0.033405088,0.000053385993,0.00077875966,0.00009275357,0.000009676378,0.00047827937,0.001667178],"genre_scores_gemma":[0.9946791,0.00015457139,0.005012449,0.0001000984,0.000028006903,0.0000029244088,0.0000048317397,0.000008387418,0.000009609741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870855,0.000053538835,0.00024228675,0.0003937351,0.00026459724,0.00033728202],"domain_scores_gemma":[0.999046,0.00023544616,0.00010321967,0.00037907177,0.00006526499,0.00017099203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035003875,0.00018906064,0.00020348675,0.00023050686,0.00025112048,0.00020705498,0.00044163925,0.000097618955,0.0000096999265],"category_scores_gemma":[0.000008447461,0.00017468863,0.00009374042,0.00081651995,0.000095783646,0.00028284456,0.00020577491,0.00016926503,0.0000050965336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015062723,0.00011358235,0.104794584,0.000011127209,0.000055194607,0.00012268819,0.00044962775,2.9260042e-7,0.00032772173,0.88544106,0.00015943349,0.008509639],"study_design_scores_gemma":[0.0008480498,0.00016151945,0.090839736,0.000027790898,0.00003920705,0.000112425114,0.00025368086,0.0011071361,0.0007714849,0.90352064,0.0019089578,0.00040936953],"about_ca_topic_score_codex":0.00007528259,"about_ca_topic_score_gemma":0.0000051759025,"teacher_disagreement_score":0.032766026,"about_ca_system_score_codex":0.000012892014,"about_ca_system_score_gemma":0.000025888441,"threshold_uncertainty_score":0.71235955},"labels":[],"label_agreement":null},{"id":"W2078667442","doi":"10.1109/isit.2014.6875148","title":"On the proof of Lin's conjecture","year":2014,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Chinese Academy of Sciences; Beijing Center for Mathematics and Information Interdisciplinary Sciences; National Natural Science Foundation of China","keywords":"Conjecture; Monomial; TRACE (psycholinguistics); Hadamard transform; Mathematics; Ternary operation; Combinatorics; Discrete mathematics; Product (mathematics); Simple (philosophy); Computer science","score_opus":0.008055384397416153,"score_gpt":0.1992979623490291,"score_spread":0.19124257795161295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078667442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052212644,0.000009163355,0.8635535,0.0032584262,0.00012068984,0.000074894415,1.77988e-7,0.00006347139,0.08070703],"genre_scores_gemma":[0.9973346,1.8145458e-7,0.0014843415,0.0010119479,0.00001626743,0.0000022700003,4.8378794e-8,0.0000012454102,0.00014912579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996597,0.0000586372,0.000051643623,0.00008762706,0.00007986424,0.000062528314],"domain_scores_gemma":[0.9993133,0.000280215,0.000023686443,0.00035304422,0.00001558026,0.000014170029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029119593,0.000037692298,0.00004536163,0.000023924005,0.000039350653,0.00001936666,0.00045467136,0.000016500799,0.00005649382],"category_scores_gemma":[0.000038802013,0.000018943587,0.00003989009,0.00014259589,0.00003348185,0.000030330037,0.000053174957,0.000050180974,0.000009626368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017765078,0.000012250885,0.000017174569,0.00000153647,0.0000026582982,7.298391e-8,0.00012849038,0.000018832407,0.00011352129,0.98400503,0.0009271979,0.01477148],"study_design_scores_gemma":[0.00009186619,0.00024007646,0.00019135469,0.000011038832,0.0000017067008,0.0000013203825,0.0000096873755,0.006732753,0.041923504,0.9409559,0.009779096,0.00006173168],"about_ca_topic_score_codex":0.0000012265989,"about_ca_topic_score_gemma":0.0000011805176,"teacher_disagreement_score":0.94512194,"about_ca_system_score_codex":9.599755e-7,"about_ca_system_score_gemma":0.0000051111833,"threshold_uncertainty_score":0.08449001},"labels":[],"label_agreement":null},{"id":"W2078894142","doi":"10.2168/lmcs-9(3:7)2013","title":"Universal codes of the natural numbers","year":2013,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Natural number; Set (abstract data type); Code (set theory); Sequence (biology); Construct (python library); Binary code; Code word; Linear code","score_opus":0.029789167219217805,"score_gpt":0.32768735026735263,"score_spread":0.2978981830481348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078894142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06934281,0.000030712225,0.9276736,0.00050633977,0.0011038921,0.0001331892,1.5856136e-7,0.00005454331,0.0011547715],"genre_scores_gemma":[0.4695355,9.770644e-7,0.5301699,0.00027041664,0.000014111082,0.0000024115136,1.4218481e-8,0.0000010443754,0.0000056295335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812144,0.0005407784,0.00021966916,0.00044368184,0.00034399307,0.0003304535],"domain_scores_gemma":[0.99834603,0.0007048439,0.00009246371,0.00067508785,0.000104200524,0.000077359335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019298706,0.00011179093,0.00017313649,0.00014563423,0.0001656703,0.00015179918,0.0035584627,0.000041312156,0.00001743572],"category_scores_gemma":[0.00014831981,0.00006728566,0.00010060943,0.0025741942,0.0011188142,0.0006295598,0.0014433941,0.00024094056,0.0000061307865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022083912,0.000052454958,0.0024378162,0.0000043417017,0.0000027524811,0.0000020770983,0.00046895223,0.00030840893,0.008032018,0.54888016,0.000035670662,0.43977314],"study_design_scores_gemma":[0.0002222197,0.000110217894,0.09606051,0.000042786873,0.0000022265076,0.000021003207,0.000025284615,0.38469568,0.011997949,0.50637096,0.00022010742,0.00023105809],"about_ca_topic_score_codex":0.0000404377,"about_ca_topic_score_gemma":0.0000022136562,"teacher_disagreement_score":0.43954208,"about_ca_system_score_codex":0.000030984567,"about_ca_system_score_gemma":0.00006453163,"threshold_uncertainty_score":0.66125685},"labels":[],"label_agreement":null},{"id":"W2080481349","doi":"10.1145/1015047.1015054","title":"Towards fault-tolerant cryptographic computations over finite fields","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Finite field; Cryptosystem; Cryptography; Multiplier (economics); Fault tolerance; Computation; Theoretical computer science; Realization (probability); Computer engineering; Algorithm; Distributed computing; Mathematics; Discrete mathematics","score_opus":0.018730309335290966,"score_gpt":0.26137289428814875,"score_spread":0.2426425849528578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080481349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05016426,0.00014282537,0.94440454,0.000634346,0.0023023263,0.00037824188,0.000011590766,0.0010457202,0.00091616344],"genre_scores_gemma":[0.9560206,0.000013789199,0.04321992,0.00051357975,0.00013563814,0.000033245236,0.00000474971,0.000029468965,0.000028998815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971924,0.0002363511,0.0006467069,0.00077249476,0.0005638287,0.00058822386],"domain_scores_gemma":[0.9973023,0.0005548772,0.00020257464,0.0015595651,0.00016597455,0.00021472198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005452455,0.00039280413,0.00041855176,0.00066557986,0.00090201164,0.00050592487,0.0016954411,0.00020791913,0.00001793732],"category_scores_gemma":[0.000038534814,0.00039116858,0.00041178789,0.0018163001,0.00010683483,0.00038828552,0.00004958534,0.0005841341,0.0000772715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000207738,0.00031607738,0.000020510155,0.000056869383,0.00014766745,0.00002663843,0.0039933654,0.8725294,0.000074433236,0.09635885,0.000042245778,0.026413174],"study_design_scores_gemma":[0.0052484022,0.0012440332,0.0014060101,0.0012862547,0.00014967835,0.00029529398,0.0013543305,0.8521242,0.0010346302,0.13101311,0.002766059,0.0020779797],"about_ca_topic_score_codex":0.0001836343,"about_ca_topic_score_gemma":0.000017188539,"teacher_disagreement_score":0.9058564,"about_ca_system_score_codex":0.000085995984,"about_ca_system_score_gemma":0.00012624133,"threshold_uncertainty_score":0.999854},"labels":[],"label_agreement":null},{"id":"W2080805739","doi":"10.1109/icccas.2006.285197","title":"Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Finite field; Computer science; Arithmetic; Bit (key); Computational complexity theory; Polynomial basis; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics","score_opus":0.027785353112241177,"score_gpt":0.24597585686653964,"score_spread":0.21819050375429846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080805739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019098902,0.000016037222,0.9662019,0.0004657181,0.00012233078,0.00014514715,0.000005423049,0.00010076808,0.013843793],"genre_scores_gemma":[0.8667894,8.5506355e-7,0.13238817,0.0002888785,0.000038099657,0.000014515353,0.0000029779235,0.000003305826,0.00047379776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932796,0.0000243505,0.00017782868,0.00019839144,0.000097152755,0.00017431023],"domain_scores_gemma":[0.99922127,0.00027776955,0.000056398356,0.00035289774,0.00006126182,0.000030387873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017177984,0.00008390052,0.00012817369,0.0000779938,0.00007213494,0.000034083765,0.00046161105,0.000051972766,0.000037793547],"category_scores_gemma":[0.00001621674,0.00007211423,0.00013660354,0.00021853324,0.000074912416,0.00011796452,0.00007415954,0.000051402214,0.00000769345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023792012,0.00011732718,0.00036977572,0.000023769715,0.0000066588705,5.857411e-7,0.00007106757,0.001015606,0.00035671945,0.9920121,0.0026792868,0.0033233287],"study_design_scores_gemma":[0.0011002133,0.0002221562,0.0039243605,0.000019797455,0.0000073854717,0.0000019289278,0.000015640413,0.233085,0.0101836,0.74111104,0.010071302,0.00025756436],"about_ca_topic_score_codex":0.000043439664,"about_ca_topic_score_gemma":0.000083077015,"teacher_disagreement_score":0.84769046,"about_ca_system_score_codex":0.000004123907,"about_ca_system_score_gemma":0.000014394965,"threshold_uncertainty_score":0.2940733},"labels":[],"label_agreement":null},{"id":"W2081149247","doi":"10.1016/s0893-9659(03)00073-9","title":"The post correspondence problem over a unary alphabet","year":2003,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Unary operation; Mathematics; Alphabet; Logarithm; Combinatorics; Representation (politics); Discrete mathematics; Mathematical analysis","score_opus":0.006986649179844907,"score_gpt":0.2045186240475634,"score_spread":0.1975319748677185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081149247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1259372,0.00011072523,0.8177594,0.004044107,0.00063897367,0.00085778855,0.0000023409245,0.0004856489,0.050163854],"genre_scores_gemma":[0.6827606,0.000018350198,0.3036965,0.012647877,0.00006530391,0.00024231419,0.0000020046332,0.000051492276,0.0005155407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987222,0.00004828005,0.00024993112,0.00029659466,0.0003141894,0.000368804],"domain_scores_gemma":[0.9982105,0.00066205475,0.00012710152,0.0009035745,0.000025766358,0.00007102729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008559985,0.00017726482,0.0001420137,0.000072171286,0.0003655632,0.00025697774,0.0010666357,0.000040375937,0.00002410995],"category_scores_gemma":[0.000041358,0.00012609147,0.000087054985,0.00043860092,0.00013544968,0.0001383632,0.00014674876,0.00017100084,0.00013727049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005949229,0.00004863259,0.0000144118685,0.000020804951,0.000020680505,0.0000063148127,0.0009660928,0.000015699468,0.020932622,0.9706784,0.0057291957,0.0015612134],"study_design_scores_gemma":[0.0007782055,0.00009458667,0.00022649798,0.000072553936,0.000037607337,0.000096129574,0.00035118923,0.0019873078,0.010641441,0.9149824,0.06993028,0.0008018024],"about_ca_topic_score_codex":8.361163e-7,"about_ca_topic_score_gemma":0.0000010545241,"teacher_disagreement_score":0.55682343,"about_ca_system_score_codex":0.000019242098,"about_ca_system_score_gemma":0.000029396666,"threshold_uncertainty_score":0.5141861},"labels":[],"label_agreement":null},{"id":"W2081314644","doi":"10.1007/s10623-011-9565-2","title":"Divisibility of polynomials over finite fields and combinatorial applications","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Trinomial; Divisibility rule; Finite field; Mathematics; Sequence (biology); Combinatorics; Polynomial; Discrete mathematics; Field (mathematics); Orthogonal polynomials; Primitive polynomial; Pure mathematics; Mathematical analysis","score_opus":0.032551740995447234,"score_gpt":0.24164271468292595,"score_spread":0.2090909736874787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081314644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21162647,0.00059081503,0.7847446,0.000026149968,0.00013336266,0.0002758064,0.000012717939,0.00008972819,0.0025003136],"genre_scores_gemma":[0.98530924,0.00013503004,0.0143939825,0.00008191397,0.00002866687,0.000041706502,0.0000014706274,0.0000057283664,0.0000022776783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989693,0.00010441697,0.00024937556,0.00036041992,0.00012462762,0.00019186072],"domain_scores_gemma":[0.99901587,0.00023493232,0.00010774644,0.00047164445,0.00005636856,0.00011344152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042751007,0.00014857933,0.00022681078,0.00020733928,0.0001645667,0.000063679676,0.00035190862,0.000093199174,0.000029939201],"category_scores_gemma":[0.000014995075,0.00013625075,0.000116009694,0.0005210867,0.00027380005,0.0002108999,0.00016319673,0.00009896851,8.1076513e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004194701,0.0001486502,0.03125172,0.000033906857,0.00004829923,0.0000010278706,0.000972709,4.3149947e-7,0.0005356931,0.9516498,0.00006531704,0.01525053],"study_design_scores_gemma":[0.0007617388,0.00048381483,0.057265785,0.000026113741,0.000047339916,0.0000044869334,0.00007459553,0.00051174336,0.003273681,0.9356963,0.0015140242,0.00034037972],"about_ca_topic_score_codex":0.00005020081,"about_ca_topic_score_gemma":0.0000052916175,"teacher_disagreement_score":0.7736828,"about_ca_system_score_codex":0.0000020116877,"about_ca_system_score_gemma":0.00001490527,"threshold_uncertainty_score":0.5556144},"labels":[],"label_agreement":null},{"id":"W2081993715","doi":"10.1016/j.disc.2006.01.005","title":"Generating indecomposable permutations","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Indecomposable module; Mathematics; Combinatorics; Permutation (music); Transposition (logic); Parity of a permutation; Discrete mathematics; Cyclic permutation; Symmetric group; Geometry","score_opus":0.011048546643465667,"score_gpt":0.23843785035046883,"score_spread":0.22738930370700317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081993715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08733473,0.000033932363,0.8905056,0.00023996334,0.0000854761,0.00007482096,0.000002405566,0.00020788122,0.021515159],"genre_scores_gemma":[0.6620978,0.0000011292797,0.33739465,0.00009744198,0.00006640833,0.000012487663,0.0000060638968,0.000008685117,0.00031530886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992519,0.000027227043,0.00020945996,0.00016616825,0.00015855023,0.00018667319],"domain_scores_gemma":[0.9993806,0.00009438443,0.00007519342,0.00037864453,0.00003603894,0.000035143068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002031902,0.00010047227,0.000107465195,0.00007569426,0.00021752206,0.0002287362,0.00041714756,0.000030341043,0.000028576012],"category_scores_gemma":[0.000018490031,0.00008903362,0.00007727199,0.00030679416,0.00003173878,0.00023803128,0.0001023258,0.000068643094,0.000057533412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.4583446e-7,0.000041652245,0.00012935362,0.000015569663,0.0000057086386,0.0000028723186,0.00057376927,0.0010476935,0.0012718936,0.99574924,0.00053579663,0.000626181],"study_design_scores_gemma":[0.00013060182,0.000023569386,0.00017272767,0.000023161725,0.000008649985,0.000018505021,0.00012133054,0.33367875,0.0015200762,0.6631804,0.0009272437,0.00019499105],"about_ca_topic_score_codex":0.00000832696,"about_ca_topic_score_gemma":0.000006731415,"teacher_disagreement_score":0.5747631,"about_ca_system_score_codex":0.000010172363,"about_ca_system_score_gemma":0.000016502583,"threshold_uncertainty_score":0.36306858},"labels":[],"label_agreement":null},{"id":"W2082176354","doi":"10.1016/j.ffa.2005.10.005","title":"On the distribution of irreducible trinomials over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mi mathvariant=\"double-struck\">F</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math>","year":2005,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; Mathematics; Scroll; Distribution (mathematics); Discrete mathematics; Mathematical analysis; Theology; Philosophy","score_opus":0.018506604844418028,"score_gpt":0.23416834247077928,"score_spread":0.21566173762636126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082176354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8785187,0.00029339318,0.076065466,0.0016490045,0.0003801032,0.00010453084,0.00035986127,0.00015624633,0.04247267],"genre_scores_gemma":[0.99677896,0.00020262302,0.0011108523,0.0007010074,0.00035475858,0.0005260333,0.00020619364,0.00004458962,0.00007499673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99801075,0.00008604409,0.0005024699,0.00057086954,0.0003575904,0.0004722419],"domain_scores_gemma":[0.9972107,0.0008937196,0.00041764448,0.0012501448,0.00005503176,0.00017279314],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00070731994,0.00024396057,0.00014630977,0.0001132893,0.00075484207,0.000355283,0.0009231429,0.00040694457,0.0018703116],"category_scores_gemma":[0.000091354115,0.00028617046,0.00037283415,0.00054945925,0.00027345074,0.00037467043,0.00045273322,0.0004161959,0.0002172091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014407764,0.00013777848,0.000005223025,0.00005895582,0.00013088525,0.0000055274845,0.0007099165,0.0003819503,0.00051508984,0.98351914,0.009734412,0.0046570706],"study_design_scores_gemma":[0.0023006022,0.0010894226,0.00042727322,0.00045113737,0.00036036444,0.00020900207,0.0006705653,0.29356483,0.57436734,0.05730731,0.06801433,0.0012377991],"about_ca_topic_score_codex":0.0001252743,"about_ca_topic_score_gemma":0.00006772496,"teacher_disagreement_score":0.9262118,"about_ca_system_score_codex":0.000005856046,"about_ca_system_score_gemma":0.00016444747,"threshold_uncertainty_score":0.99995905},"labels":[],"label_agreement":null},{"id":"W2083140175","doi":"10.1007/s00026-005-0248-4","title":"Collinear Points in Permutations","year":2005,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Transversal (combinatorics); Prime (order theory); Upper and lower bounds; Intersection (aeronautics); Discrete geometry; Discrete mathematics","score_opus":0.03988005282922381,"score_gpt":0.3060809598074195,"score_spread":0.2662009069781957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083140175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90115404,0.0006153995,0.07049071,0.012851582,0.00037901485,0.00017375364,0.0000041445787,0.00013897778,0.0141923595],"genre_scores_gemma":[0.9976654,0.00005727579,0.0017283104,0.0004518188,0.000013542412,0.000004068643,7.168175e-7,0.0000034887378,0.00007539421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931824,0.00005355109,0.00018967078,0.00013019158,0.0001558989,0.00015247385],"domain_scores_gemma":[0.9993878,0.0001072406,0.000060908744,0.00027574136,0.00012146771,0.000046811427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037378847,0.000063953376,0.000108872046,0.00018746771,0.000041093732,0.000025277506,0.00044637755,0.00003444271,0.000010308442],"category_scores_gemma":[0.000056321787,0.00006765362,0.000060583905,0.0008693828,0.000029636185,0.00028114027,0.000072556955,0.00008873252,0.000022019887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032182102,0.00017707693,0.0014541753,0.0000045431534,0.0000043087935,0.0000022338675,0.00051678316,0.000098398785,0.000031847,0.9929337,0.0007451606,0.004028573],"study_design_scores_gemma":[0.00038164813,0.00013510497,0.0068220976,0.000023339733,0.0000019436184,0.0000029324856,0.000029875802,0.00906107,0.0066390783,0.95685625,0.019897943,0.00014874116],"about_ca_topic_score_codex":0.0000051573684,"about_ca_topic_score_gemma":0.000004208348,"teacher_disagreement_score":0.09651133,"about_ca_system_score_codex":0.000006321331,"about_ca_system_score_gemma":0.00003507138,"threshold_uncertainty_score":0.27588347},"labels":[],"label_agreement":null},{"id":"W2083423194","doi":"10.1016/j.jnt.2005.12.005","title":"Diophantine m-tuples for linear polynomials II. Equal degrees","year":2006,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"TU Graz, Internationale Beziehungen und Mobilitätsprogramme","keywords":"Mathematics; Diophantine equation; Tuple; Diophantine set; Pure mathematics; Algebra over a field; Discrete mathematics; Combinatorics","score_opus":0.01407572093753825,"score_gpt":0.26076576612163654,"score_spread":0.2466900451840983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083423194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22052492,0.00060978456,0.7732076,0.00056107563,0.0009644681,0.00011587283,0.00002699846,0.000068001566,0.003921292],"genre_scores_gemma":[0.9333516,0.000013553093,0.064079225,0.00022718184,0.0014106561,0.0000044118356,0.0000023312107,0.000016563159,0.0008944752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987048,0.00016178428,0.0004939497,0.00015300472,0.0002267346,0.00025974776],"domain_scores_gemma":[0.99828196,0.0007794642,0.00041778747,0.00025972637,0.00018302568,0.000078038276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017719262,0.00014373667,0.00028129492,0.00014001717,0.00020965596,0.00007996066,0.0008058417,0.000064379026,0.00018750364],"category_scores_gemma":[0.00014909204,0.000112586305,0.0003628962,0.00023063905,0.00008009786,0.0004283551,0.00013382833,0.00014615702,0.00001615207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002809568,0.00022941922,0.0005187152,0.000017261968,0.00007747851,0.000027164417,0.0002487894,0.00013416905,0.0037276335,0.96388286,0.0140674375,0.016788099],"study_design_scores_gemma":[0.0014906338,0.00050954765,0.001161231,0.000123318,0.000062557476,0.0004345436,0.00006841587,0.0007829016,0.009492069,0.88244075,0.103090264,0.0003437673],"about_ca_topic_score_codex":0.0000024517713,"about_ca_topic_score_gemma":0.000001770375,"teacher_disagreement_score":0.71282667,"about_ca_system_score_codex":0.000016023258,"about_ca_system_score_gemma":0.000061723,"threshold_uncertainty_score":0.45911363},"labels":[],"label_agreement":null},{"id":"W2085192447","doi":"10.1515/form.2011.051","title":"Almost prime values of the order of elliptic curves over finite fields","year":2010,"lang":"en","type":"article","venue":"Forum Mathematicum","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Order (exchange); Mathematics; Combinatorics; Prime (order theory); Conjecture","score_opus":0.00694300099726095,"score_gpt":0.22648826274479472,"score_spread":0.21954526174753378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085192447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6773617,0.0003041923,0.3070324,0.002241649,0.0011627489,0.00048533286,0.000008619703,0.00012160431,0.011281704],"genre_scores_gemma":[0.9868045,0.000008443973,0.012577135,0.00023360357,0.000016984939,0.000006684905,3.4369128e-7,0.0000068228364,0.0003454725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916685,0.000040292973,0.00026081206,0.00013515669,0.00023137177,0.00016551529],"domain_scores_gemma":[0.99851,0.00035390377,0.00020222217,0.00082938944,0.000077083896,0.000027423415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038967608,0.00009805725,0.0001789289,0.000051139603,0.000066571614,0.000020352349,0.0009231552,0.00005544395,0.00012985947],"category_scores_gemma":[0.00023524361,0.000062807696,0.00013852988,0.00039363946,0.000120346034,0.00014599753,0.000287162,0.00014650908,0.000009730084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006026659,0.0002461522,0.0022651048,0.0005437785,0.000055598695,7.2215744e-7,0.002388541,0.000018464567,0.009372287,0.98068285,0.0027705114,0.0016499606],"study_design_scores_gemma":[0.0003079086,0.00015205253,0.0025349236,0.00080054457,0.000047872938,0.000013724628,0.00010848996,0.016501764,0.0917844,0.8860356,0.0014406058,0.00027208438],"about_ca_topic_score_codex":0.0000048225643,"about_ca_topic_score_gemma":0.000005713168,"teacher_disagreement_score":0.3094428,"about_ca_system_score_codex":0.0000016987659,"about_ca_system_score_gemma":0.00002949336,"threshold_uncertainty_score":0.25612235},"labels":[],"label_agreement":null},{"id":"W2085842155","doi":"10.46298/dmtcs.396","title":"Foreword to the special issue dedicated to the tenth ''Journées montoises d'informatique théorique''","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Czech; Library science; Mathematics; Humanities; Art; Computer science; Philosophy; Linguistics","score_opus":0.009133353797061221,"score_gpt":0.2545103635625403,"score_spread":0.24537700976547908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085842155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009617717,0.000016617278,0.95866585,0.020278689,0.0011096474,0.000878075,0.000007337253,0.00022799126,0.009198087],"genre_scores_gemma":[0.72932357,0.000005567468,0.26267007,0.0059550502,0.0019406226,0.0000427154,0.0000010833772,0.00002146541,0.000039824194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957904,0.00013645428,0.00075262523,0.00068258826,0.0014790732,0.0011588373],"domain_scores_gemma":[0.99584985,0.0010120824,0.00018358437,0.001985946,0.00031544425,0.0006530741],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.006426838,0.00039555447,0.00035033977,0.0003617391,0.0014567049,0.0011789448,0.007794615,0.000082668266,0.00010534073],"category_scores_gemma":[0.00047036548,0.00020598939,0.00021102073,0.003283047,0.001605601,0.0006648026,0.0024797574,0.000447112,0.00038208312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018996596,0.000055327608,0.000014419575,0.000012617808,0.000012625635,0.000007667549,0.012639509,0.00014562123,0.00005530269,0.9449237,0.0037634359,0.03835076],"study_design_scores_gemma":[0.00029942335,0.00078664586,0.00078286487,0.00025872616,0.00003675336,0.00014658777,0.0015623136,0.29265356,0.0043611648,0.6573764,0.04082883,0.00090670324],"about_ca_topic_score_codex":0.000004828391,"about_ca_topic_score_gemma":0.00003411107,"teacher_disagreement_score":0.7197059,"about_ca_system_score_codex":0.00006228003,"about_ca_system_score_gemma":0.00010954232,"threshold_uncertainty_score":0.9998579},"labels":[],"label_agreement":null},{"id":"W2086188341","doi":"10.1007/s10623-010-9457-x","title":"On zeros of Kloosterman sums","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Kloosterman sum; Mathematics; Zero (linguistics); Monomial; Ternary operation; Combinatorics; Pure mathematics; Discrete mathematics; Computer science","score_opus":0.04483294077571989,"score_gpt":0.22520953344966424,"score_spread":0.18037659267394435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086188341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43046921,0.0003052201,0.5559023,0.000034048113,0.00017529292,0.00019166092,0.0000078054345,0.00018610364,0.0127283605],"genre_scores_gemma":[0.97823125,0.00006363801,0.021419305,0.00024065468,0.000013052552,0.000013875992,0.0000012176673,0.000009637656,0.0000073959727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988785,0.000101119134,0.00022440858,0.00035204855,0.00018333129,0.00026058886],"domain_scores_gemma":[0.9990608,0.0001235958,0.000105302126,0.00053771207,0.000053149488,0.000119440425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030592788,0.00018402562,0.00022116324,0.0003861126,0.00013282378,0.000055162123,0.0005653702,0.00006903536,0.00003974448],"category_scores_gemma":[0.000008461103,0.0001584166,0.00018110104,0.0006456608,0.0002058714,0.00020782626,0.00010690538,0.000107640575,0.000006851677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000547431,0.00014303219,0.00321159,0.000019360907,0.000044867877,0.000007824098,0.0012342273,8.148783e-7,0.002820326,0.9738699,0.0001704282,0.018422872],"study_design_scores_gemma":[0.00082495465,0.0018852889,0.024309143,0.00011520192,0.000043727367,0.000024051144,0.00013543271,0.0003620822,0.042261854,0.9284095,0.0010533069,0.00057546614],"about_ca_topic_score_codex":0.0000151801,"about_ca_topic_score_gemma":0.000002007586,"teacher_disagreement_score":0.547762,"about_ca_system_score_codex":0.0000021979747,"about_ca_system_score_gemma":0.000010822722,"threshold_uncertainty_score":0.6460042},"labels":[],"label_agreement":null},{"id":"W2086525836","doi":"10.4153/cmb-2004-057-4","title":"A Generalization of the Erdös-Kac Theorem and its Applications","year":2004,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Generalization; Function field; Order (exchange); Context (archaeology); Finite field; Field (mathematics); Pure mathematics; Function (biology); Algebra over a field; Discrete mathematics; Mathematical analysis","score_opus":0.007531701196936816,"score_gpt":0.19411902001791623,"score_spread":0.1865873188209794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086525836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080441244,0.00039403158,0.86982644,0.025754616,0.00007953009,0.0007897499,0.000015132843,0.000091212336,0.022608068],"genre_scores_gemma":[0.9942383,0.0000054699585,0.004893381,0.00068581844,0.000018094022,0.000033534787,5.4916273e-7,0.0000052149157,0.000119636534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994532,0.000035819936,0.00013185774,0.0001393334,0.000093627365,0.00014617806],"domain_scores_gemma":[0.9993879,0.00006622605,0.000039666946,0.00031735536,0.00004021937,0.00014861714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019346437,0.00006695625,0.00008212039,0.000060208622,0.0001352033,0.000038541737,0.0004248764,0.000038398135,0.00021016056],"category_scores_gemma":[0.00007294971,0.000048818645,0.000043056676,0.00028049952,0.000079677666,0.000025918089,0.000059860453,0.000056543307,0.00017030553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.241487e-7,0.000011037045,0.0000066038074,0.000019792771,0.0000037065358,4.8791975e-7,0.00023058115,0.000021575539,0.000153287,0.9985859,0.00012911692,0.00083759846],"study_design_scores_gemma":[0.00012312029,0.00001351652,0.00013770255,0.00004415582,0.000007705544,0.000016763848,0.000020679081,0.00054609455,0.0016340512,0.98071563,0.016650993,0.00008956976],"about_ca_topic_score_codex":0.00005814443,"about_ca_topic_score_gemma":0.00012664229,"teacher_disagreement_score":0.9137971,"about_ca_system_score_codex":0.00002369074,"about_ca_system_score_gemma":0.00008404493,"threshold_uncertainty_score":0.23011108},"labels":[],"label_agreement":null},{"id":"W2087137868","doi":"10.1007/s10623-004-5663-8","title":"Higher Weights for Ternary and Quaternary Self-Dual Codes*","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Ternary operation; Dual (grammatical number); Mathematics; Quaternary; Combinatorics; Discrete mathematics; Computer science; Geology; Philosophy","score_opus":0.020556683007466724,"score_gpt":0.24308960790935924,"score_spread":0.22253292490189253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087137868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33521777,0.0039402405,0.65581053,0.0014727983,0.00039558872,0.0006309587,0.000035756766,0.00075968745,0.0017366429],"genre_scores_gemma":[0.7877989,0.00047659947,0.2103798,0.00088358665,0.00027500247,0.00009138977,0.0000070691103,0.000025511401,0.00006218729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982206,0.00011391997,0.0002970884,0.00067083165,0.00021677061,0.00048075116],"domain_scores_gemma":[0.99885434,0.00028675428,0.00010536291,0.0004456627,0.0000676235,0.00024023342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042620508,0.0003277804,0.0003132493,0.00036722145,0.0004325012,0.00035762056,0.00044380405,0.00012793585,0.00001889759],"category_scores_gemma":[0.000003988782,0.0002858265,0.00020303135,0.00042859282,0.00017396372,0.0005727855,0.00017657627,0.00014292017,0.0000056271037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012683112,0.00026545773,0.013105341,0.00007785982,0.00023473447,0.000021791859,0.0011677621,0.0000050205913,0.0017201558,0.92619854,0.0024120398,0.05466445],"study_design_scores_gemma":[0.004704382,0.0024222848,0.036474217,0.00019951681,0.00028187534,0.00030256002,0.00016221762,0.036263295,0.005224249,0.5500127,0.36154142,0.0024112961],"about_ca_topic_score_codex":0.000011458191,"about_ca_topic_score_gemma":0.0000059948284,"teacher_disagreement_score":0.45258108,"about_ca_system_score_codex":0.000008986097,"about_ca_system_score_gemma":0.000019139543,"threshold_uncertainty_score":0.9999594},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.1943988686853836,"score_gpt":0.24220270297843846,"score_spread":0.04780383429305485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087377210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23220347,0.0006432043,0.7637312,0.0022714394,0.00039117184,0.00007975804,3.0142138e-7,0.000022666682,0.0006568153],"genre_scores_gemma":[0.87220705,0.000019869318,0.12744078,0.0001436968,0.00016291547,0.0000022130987,1.0579156e-7,0.000009285796,0.000014092995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998178,0.00041327282,0.00057044113,0.00025254145,0.0002141446,0.00037159663],"domain_scores_gemma":[0.99875927,0.00036773394,0.00029006935,0.00024018557,0.00005540739,0.0002873459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010579111,0.0001597554,0.00039251268,0.001039327,0.00014561681,0.00018955105,0.00052918226,0.00011872693,0.00004602692],"category_scores_gemma":[0.0001177214,0.00015016596,0.00011609568,0.0010220413,0.000057146583,0.0007394789,0.00010789235,0.0003496525,0.0000085996635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078107434,0.00033034434,0.017533852,0.000047413872,0.00017737923,0.00013443427,0.008478371,0.003679262,0.0041097933,0.8534512,0.00062545046,0.11135437],"study_design_scores_gemma":[0.010991588,0.006619954,0.032502495,0.0011727576,0.00033545552,0.009932534,0.0039704978,0.20911196,0.0028193584,0.6914378,0.028058618,0.003046979],"about_ca_topic_score_codex":0.00000723654,"about_ca_topic_score_gemma":0.000021043337,"teacher_disagreement_score":0.64000356,"about_ca_system_score_codex":0.00004371021,"about_ca_system_score_gemma":0.000054209748,"threshold_uncertainty_score":0.612359},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013698900849824938,"score_gpt":0.24874483659826382,"score_spread":0.23504593574843888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087541534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029195691,0.000012732347,0.9922264,0.00039946198,0.00053665385,0.00033216574,0.00004639212,0.0004138499,0.0031127597],"genre_scores_gemma":[0.98072773,0.000013454477,0.017183004,0.0019064017,0.000019267967,0.000059027778,0.00000512701,0.000004584488,0.00008140289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898773,0.00008419213,0.00034968538,0.00015369295,0.00018154774,0.00024315667],"domain_scores_gemma":[0.9989093,0.00037147308,0.00011014124,0.00042153173,0.00010213403,0.0000854521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006048746,0.0001588883,0.00014305174,0.00030561216,0.00036496134,0.00019963765,0.00047409398,0.00007543617,0.000039487386],"category_scores_gemma":[0.000011049228,0.00014923314,0.00017484087,0.00026088458,0.00006702754,0.0017589682,0.000001414419,0.00014024429,0.00010768764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021783679,0.000106152394,0.0000012899932,0.000015352527,0.000029890862,5.039494e-7,0.001892182,0.0033143072,0.0003401811,0.70586044,0.00012589128,0.288096],"study_design_scores_gemma":[0.0027996055,0.0011378876,0.00013866217,0.00011535421,0.00005844258,0.000049589988,0.0006880308,0.09954635,0.04869838,0.8349978,0.010947563,0.00082233216],"about_ca_topic_score_codex":0.000001700123,"about_ca_topic_score_gemma":8.5508117e-7,"teacher_disagreement_score":0.9778082,"about_ca_system_score_codex":0.0000332985,"about_ca_system_score_gemma":0.00003690916,"threshold_uncertainty_score":0.608555},"labels":[],"label_agreement":null},{"id":"W2088257228","doi":"10.1587/transfun.e95.a.909","title":"On the Codeword Length Distribution of T-Codes","year":2012,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Code word; Mathematics; Code (set theory); Equivalence (formal languages); Limit (mathematics); Discrete mathematics; Combinatorics; Distribution (mathematics); Algorithm; Computer science; Decoding methods; Mathematical analysis","score_opus":0.02969416751035482,"score_gpt":0.27120473244634813,"score_spread":0.24151056493599332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088257228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16840723,0.0014667959,0.8269905,0.002214088,0.00010885923,0.00016440229,0.000018791157,0.00004187608,0.0005874953],"genre_scores_gemma":[0.9899467,0.0008544413,0.008972088,0.00018770403,0.000006978421,0.000020436719,0.0000025989293,0.0000030854483,0.0000059317113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883205,0.00022911943,0.000255912,0.00017938454,0.0002448282,0.00025869327],"domain_scores_gemma":[0.99777484,0.001021555,0.00015450703,0.00094022066,0.000055960627,0.000052937816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096158386,0.00011903581,0.00014713506,0.00011716593,0.00077558024,0.00008255242,0.0016209037,0.000034275537,0.000008577883],"category_scores_gemma":[0.0000049197347,0.00008747608,0.00009346976,0.0007412317,0.0006755723,0.00037899485,0.00006400302,0.00019974106,0.0000022312995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007830358,0.00041790438,0.00008502334,0.0000047247113,0.000030649804,1.3821823e-8,0.0004209685,0.00022943858,0.00023741066,0.94308716,0.00002963235,0.055449244],"study_design_scores_gemma":[0.0022673754,0.014901566,0.012594716,0.00084444316,0.0002939758,0.00009305184,0.002205603,0.5106616,0.10770515,0.31755006,0.028829776,0.0020527027],"about_ca_topic_score_codex":0.000016742739,"about_ca_topic_score_gemma":0.000014744457,"teacher_disagreement_score":0.8215395,"about_ca_system_score_codex":0.00002514661,"about_ca_system_score_gemma":0.000048957012,"threshold_uncertainty_score":0.59652144},"labels":[],"label_agreement":null},{"id":"W2088513464","doi":"10.1109/iscc.2013.6754985","title":"Cryptanalysis of the Toorani-Falahati Hill Ciphers","year":2013,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ciphertext; Computer science; Cryptanalysis; Plaintext; Transposition cipher; Cipher; Stream cipher; Block cipher; Theoretical computer science; Computer security; Cryptography; Encryption; Running key cipher","score_opus":0.003927824373186536,"score_gpt":0.1626031683274933,"score_spread":0.15867534395430677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088513464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24082305,0.00007559946,0.6275932,0.0047193696,0.00034823152,0.00023733506,6.877328e-7,0.00017927452,0.1260232],"genre_scores_gemma":[0.9932888,0.000002196749,0.0055829147,0.00053375686,0.000011204917,0.0000062902404,8.255922e-8,0.0000025018855,0.0005722666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931103,0.00009642949,0.0001505732,0.00015174616,0.00016718794,0.00012303036],"domain_scores_gemma":[0.99909,0.000077413715,0.000064144144,0.0006628924,0.00006726699,0.000038264785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023312905,0.00006610996,0.00009554649,0.000053690237,0.00007401083,0.00006623585,0.0009996156,0.000025338742,0.0005828651],"category_scores_gemma":[0.00002621673,0.00003854766,0.00017531223,0.0007760104,0.000064445245,0.000260257,0.00019786859,0.00005274354,0.00005817377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011615172,0.00004414802,0.005655967,0.0000057330676,0.00006165347,2.6651463e-7,0.00058677397,0.00009647809,0.0029775216,0.9450013,0.004263243,0.04130575],"study_design_scores_gemma":[0.0006641774,0.00016544746,0.07368455,0.000049127433,0.000095521806,0.0000075453268,0.00090179144,0.06706279,0.035080858,0.80899644,0.012595352,0.0006963808],"about_ca_topic_score_codex":0.00011323699,"about_ca_topic_score_gemma":0.000012755988,"teacher_disagreement_score":0.7524657,"about_ca_system_score_codex":0.000005511256,"about_ca_system_score_gemma":0.000013318939,"threshold_uncertainty_score":0.6381964},"labels":[],"label_agreement":null},{"id":"W2089248193","doi":"10.1007/s10623-012-9784-1","title":"Kötter interpolation in skew polynomial rings","year":2013,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Trigonometric interpolation; Mathematics; Skew; Polynomial interpolation; Interpolation (computer graphics); Birkhoff interpolation; Spline interpolation; Lagrange polynomial; Algebra over a field; Polynomial ring; Polynomial; Noncommutative geometry; Bilinear interpolation; Linear interpolation; Difference polynomials; Orthogonal polynomials; Pure mathematics; Mathematical analysis; Computer science; Artificial intelligence; Image (mathematics)","score_opus":0.012488518226646943,"score_gpt":0.2144672195103788,"score_spread":0.20197870128373185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089248193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46635705,0.00028796907,0.52928996,0.00052665203,0.00017013833,0.00027737083,0.0000014365118,0.0001668075,0.002922619],"genre_scores_gemma":[0.9675509,0.00003724003,0.031657428,0.0006286048,0.00004463201,0.000058325415,0.0000018733234,0.000009723566,0.000011294392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987551,0.000109665736,0.00025176047,0.00040202087,0.00014168741,0.0003397465],"domain_scores_gemma":[0.99932915,0.00011346687,0.00006796278,0.00033251997,0.00004131786,0.00011557115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028196973,0.00018828701,0.00018946125,0.0005720784,0.0001252976,0.00037571107,0.00043012245,0.0000836847,0.00008429907],"category_scores_gemma":[0.000009199654,0.0001730032,0.0001206931,0.00081541657,0.000109336244,0.0007262667,0.00013744163,0.0001630396,0.000029217263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006231941,0.00025714247,0.14843954,0.00005276213,0.00008428312,0.000018517192,0.0038030427,0.000011101515,0.021340152,0.64843345,0.005813005,0.17168471],"study_design_scores_gemma":[0.0022682443,0.00079554965,0.426983,0.00023627473,0.000032797445,0.000060255024,0.00042356408,0.033474095,0.0025442704,0.51989764,0.011700678,0.0015836421],"about_ca_topic_score_codex":0.00013678899,"about_ca_topic_score_gemma":0.000020071051,"teacher_disagreement_score":0.5011938,"about_ca_system_score_codex":0.000007306869,"about_ca_system_score_gemma":0.000011688042,"threshold_uncertainty_score":0.70548654},"labels":[],"label_agreement":null},{"id":"W2089281124","doi":"10.1016/j.aeue.2011.03.017","title":"Two-dimensional multiplicative arrays over Zq−1 and girth-6 q-ary QC-LDPC codes based on quadratic-residues modulo p&lt;q","year":2011,"lang":"en","type":"article","venue":"AEU - International Journal of Electronics and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Modulo; Quadratic residue; Low-density parity-check code; Multiplicative function; Mathematics; Combinatorics; Primitive root modulo n; Quadratic equation; Discrete mathematics; Prime (order theory); Algorithm; Decoding methods","score_opus":0.023259450018773224,"score_gpt":0.2767721636522026,"score_spread":0.25351271363342937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089281124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7802757,0.010812896,0.18232211,0.01444193,0.00055786595,0.0004620561,0.000071516704,0.0001277635,0.010928141],"genre_scores_gemma":[0.9661565,0.0005657035,0.032269746,0.00092649367,0.000037254613,0.000009826198,0.000009935491,0.000008849469,0.000015686433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987185,0.00019777981,0.00037123324,0.00019278712,0.00034051918,0.00017916341],"domain_scores_gemma":[0.99794173,0.00053195405,0.0003441701,0.0006581256,0.00039700692,0.00012702175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005457296,0.0001524937,0.0001810159,0.00026657426,0.00025731593,0.00012110467,0.0016313487,0.00004681223,0.000031752894],"category_scores_gemma":[0.00007812583,0.00013446657,0.0001065434,0.00016714787,0.00019162275,0.00039136122,0.0003308394,0.00038124272,0.0000021891858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001866311,0.0005561108,0.0017622393,0.0000031118796,0.0002755368,0.000006797109,0.00121268,0.00035889505,0.0034530587,0.9790412,0.0002535883,0.012890108],"study_design_scores_gemma":[0.0044900747,0.0021815056,0.032309473,0.00035825052,0.00014262309,0.00031446008,0.0002564759,0.38040322,0.008577651,0.56099343,0.009106581,0.0008662684],"about_ca_topic_score_codex":0.000029026467,"about_ca_topic_score_gemma":0.00010051189,"teacher_disagreement_score":0.41804782,"about_ca_system_score_codex":0.000046628975,"about_ca_system_score_gemma":0.00016231554,"threshold_uncertainty_score":0.5483387},"labels":[],"label_agreement":null},{"id":"W2089291152","doi":"10.1007/bf02887093","title":"Notes onq-ary interleaved sequences","year":2000,"lang":"en","type":"article","venue":"Chinese Science Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics; Polynomial; Component (thermodynamics); Distribution (mathematics); Discrete mathematics; Mathematical analysis; Physics; Biology","score_opus":0.006764618958314849,"score_gpt":0.23517626023926586,"score_spread":0.228411641280951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089291152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9336248,0.00017591927,0.011714663,0.009243473,0.0006012024,0.00014692332,0.0000018894457,0.000490194,0.04400094],"genre_scores_gemma":[0.9870414,0.000019366551,0.010790638,0.0014429395,0.000089405934,0.000010236591,5.3678417e-7,0.000005812334,0.0005996209],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808437,0.00006972058,0.00021673502,0.00067200646,0.0004820878,0.0004750653],"domain_scores_gemma":[0.998696,0.0001824557,0.00005236357,0.00075275195,0.0000748087,0.00024161856],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011465005,0.00019263412,0.00016426812,0.00023689198,0.000549754,0.00047001528,0.0028650912,0.000037543407,0.002217304],"category_scores_gemma":[0.0002703901,0.00014168386,0.000104905106,0.00195878,0.00089692994,0.0004964491,0.00027386946,0.00016884507,0.0011858442],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008453811,0.00037691407,0.0094219735,0.000032709246,0.000022963393,0.0001349337,0.0070856265,0.00035854286,0.04132353,0.14829986,0.006140255,0.7867182],"study_design_scores_gemma":[0.0022372652,0.001434714,0.10183318,0.00043697518,0.000026493024,0.00069668016,0.00031105574,0.032088052,0.040186826,0.44543988,0.3714386,0.003870312],"about_ca_topic_score_codex":0.000029546245,"about_ca_topic_score_gemma":0.000004237463,"teacher_disagreement_score":0.7828478,"about_ca_system_score_codex":0.0000251295,"about_ca_system_score_gemma":0.0001222195,"threshold_uncertainty_score":0.9995918},"labels":[],"label_agreement":null},{"id":"W2090210240","doi":"10.1109/tcsi.2002.800836","title":"Low complexity parallel multiplier in F(q/sup n/) over F/sub q/","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Multiplier (economics); Mathematics; Multiplication (music); Basis (linear algebra); Polynomial basis; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.03393996360662456,"score_gpt":0.241864641180011,"score_spread":0.20792467757338645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090210240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10340793,0.00044492658,0.8932246,0.000060687707,0.00013280795,0.0006473987,0.000046159115,0.000116620606,0.0019188533],"genre_scores_gemma":[0.99892783,0.00016845173,0.000105544204,0.0001646884,0.000033049666,0.0003915627,0.0000015291873,0.000010669846,0.00019669687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865776,0.0002183076,0.0002826441,0.00045756123,0.0001427737,0.00024094495],"domain_scores_gemma":[0.9991049,0.00029221183,0.00006366749,0.00038742312,0.000017324854,0.00013443401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043505692,0.00018784168,0.00020769105,0.00018356943,0.0005047999,0.00019567028,0.00024450387,0.00007863191,0.000048664886],"category_scores_gemma":[0.000001341011,0.00018026315,0.00006820838,0.00037690447,0.00022437195,0.00027288013,0.000004726087,0.00020601763,0.0000312298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017132184,0.0005833515,0.00010122364,0.00007211241,0.00003396997,0.00000264901,0.0012139847,0.0009598546,0.001987424,0.87342066,0.000022407386,0.121585265],"study_design_scores_gemma":[0.013062194,0.0015317625,0.010410037,0.0012109634,0.00023496439,0.0007563484,0.0058170026,0.26346785,0.009978534,0.6643342,0.024291204,0.004904965],"about_ca_topic_score_codex":0.000011866326,"about_ca_topic_score_gemma":0.000009809154,"teacher_disagreement_score":0.89551985,"about_ca_system_score_codex":0.00003139751,"about_ca_system_score_gemma":0.0000058338364,"threshold_uncertainty_score":0.7350918},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.004477564958067519,"score_gpt":0.1895377663441877,"score_spread":0.18506020138612017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090331763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046096895,0.000006804148,0.94003195,0.00009143116,0.000638702,0.00017721592,0.000027981923,0.00012822295,0.012800785],"genre_scores_gemma":[0.9973793,0.0000028272436,0.0023670562,0.00008738285,0.00001428079,0.00004983324,0.00000517956,0.0000038349176,0.00009027637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893725,0.00008038507,0.0005143976,0.00011086894,0.00018186384,0.0001752459],"domain_scores_gemma":[0.99923706,0.00017245191,0.00014410765,0.0003409947,0.00006628755,0.000039117887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038405487,0.000121182944,0.00013638356,0.0007424483,0.0002008739,0.00006355447,0.0002612794,0.00007036724,0.00010254019],"category_scores_gemma":[0.0000045738316,0.00011589744,0.00013721034,0.0007795656,0.000118826996,0.0017079497,0.0000022391532,0.00017750943,0.00007639401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112813905,0.0002445493,0.000058326794,0.00002869862,0.000027935932,4.57759e-7,0.0011853593,0.03881706,0.00033784803,0.86995316,0.00020656311,0.08902722],"study_design_scores_gemma":[0.008129726,0.0014945382,0.0070054377,0.00036527435,0.00016581042,0.00021526388,0.007511236,0.06283263,0.10147233,0.79472595,0.014090439,0.0019913705],"about_ca_topic_score_codex":0.000036078654,"about_ca_topic_score_gemma":0.000043690903,"teacher_disagreement_score":0.95128244,"about_ca_system_score_codex":0.000051118586,"about_ca_system_score_gemma":0.00006366192,"threshold_uncertainty_score":0.47261605},"labels":[],"label_agreement":null},{"id":"W2091416417","doi":"10.1142/s1793042109002602","title":"A GENERALIZATION OF ROTH'S THEOREM IN FUNCTION FIELDS","year":2009,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Cardinality (data modeling); Combinatorics; Generalization; Degree (music); Finite field; Polynomial; Ring (chemistry); Zero (linguistics); Polynomial ring; Field (mathematics); Discrete mathematics; Function field; Function (biology); Pure mathematics; Mathematical analysis","score_opus":0.008158623682477266,"score_gpt":0.25729639132960014,"score_spread":0.24913776764712287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091416417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13918482,0.0000797417,0.8503323,0.00078093004,0.0009570866,0.00003620507,0.000002250632,0.000015189116,0.008611449],"genre_scores_gemma":[0.99571776,0.000021373846,0.0034451985,0.0005973037,0.00015796306,5.999174e-7,0.0000015003242,0.000002638112,0.00005565918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902874,0.00015704431,0.00035086868,0.00008372448,0.00030191973,0.0000776875],"domain_scores_gemma":[0.999152,0.00015033915,0.00028293912,0.000122394,0.00026325238,0.000029089691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000803145,0.000065837216,0.00011148975,0.00023749133,0.000014920842,0.000039420094,0.0006646874,0.000044406825,0.00033299797],"category_scores_gemma":[0.000090640926,0.00005673875,0.000114957555,0.00021452799,0.000026501966,0.00043219796,0.000035666384,0.00012097903,0.000005056261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019818664,0.000111145586,0.0010157863,0.0000012271772,0.000036395435,0.000018722949,0.0004824968,0.0004040303,0.0005594263,0.910068,0.00041850313,0.08668611],"study_design_scores_gemma":[0.00045319975,0.00014117696,0.010658825,0.0000757329,0.0000059781387,0.00010395904,0.00003801936,0.0006802196,0.0012815369,0.9851679,0.0013248723,0.00006856687],"about_ca_topic_score_codex":0.00000186231,"about_ca_topic_score_gemma":0.0000015211696,"teacher_disagreement_score":0.85653293,"about_ca_system_score_codex":0.000025853318,"about_ca_system_score_gemma":0.00003517422,"threshold_uncertainty_score":0.36460942},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011824715899154022,"score_gpt":0.20682386458745025,"score_spread":0.19499914868829624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092375161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6081155,0.00705732,0.27651966,0.00817665,0.04711641,0.00063916476,0.000005585362,0.000414599,0.051955126],"genre_scores_gemma":[0.9914199,0.00009385213,0.007412302,0.00011075332,0.0006848607,9.914216e-7,1.5131211e-7,0.000010732506,0.00026643884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852526,0.00029658416,0.00045187026,0.00014472868,0.00031545345,0.00026608037],"domain_scores_gemma":[0.99896604,0.00023681643,0.00026695078,0.0002908272,0.00007576458,0.00016362111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010702464,0.00015362674,0.00030126557,0.00029991326,0.00008330233,0.00016158824,0.001035763,0.00007943259,0.00021526456],"category_scores_gemma":[0.00012126947,0.00013316322,0.00016008812,0.00052799215,0.00006636297,0.0010122141,0.00011103541,0.00031855263,0.00001405029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033354165,0.00009813013,0.00031716865,0.000005692247,0.000024854102,0.00016257496,0.001281003,0.000010775456,0.00016025967,0.9791731,0.0011874918,0.017245382],"study_design_scores_gemma":[0.001217336,0.0007449141,0.00038497505,0.000055093544,0.000008635869,0.0003590325,0.000116296476,0.000044027518,0.00086392194,0.9714207,0.024621846,0.00016324136],"about_ca_topic_score_codex":0.0000027554197,"about_ca_topic_score_gemma":0.0000014831301,"teacher_disagreement_score":0.38330445,"about_ca_system_score_codex":0.000032783104,"about_ca_system_score_gemma":0.000052906507,"threshold_uncertainty_score":0.5430239},"labels":[],"label_agreement":null},{"id":"W2093149070","doi":"10.1112/jlms/jds052","title":"Representation of powers by polynomials and the language of powers","year":2012,"lang":"en","type":"article","venue":"Journal of the London Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Sums of powers; Order (exchange); Representation (politics); Constant (computer programming); Field (mathematics); Power (physics); Expressive power; Pure mathematics; Discrete mathematics; Combinatorics; Computer science; Physics; Law","score_opus":0.009880160828598022,"score_gpt":0.25945103169598127,"score_spread":0.24957087086738325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093149070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92695886,0.0015574328,0.06729009,0.00310154,0.000224697,0.00014748464,0.0000027924934,0.000007725965,0.0007093688],"genre_scores_gemma":[0.99173385,0.000056353656,0.007903869,0.00019726162,0.000039610415,7.2023846e-7,5.851742e-8,0.000003923385,0.0000643295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888587,0.00020958489,0.0003973195,0.00005607185,0.00032404144,0.00012710545],"domain_scores_gemma":[0.9982939,0.00076574256,0.00054712984,0.00028346453,0.000054634405,0.000055163586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001940519,0.00007066967,0.0002672078,0.000017104116,0.000060799302,0.000024903271,0.00055834826,0.00004183072,0.000021651827],"category_scores_gemma":[0.00023704897,0.00003411668,0.00045344743,0.0002475091,0.00030918393,0.00021700907,0.00015427318,0.00014664597,7.368305e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033229293,0.00077721267,0.005014032,0.0003165314,0.0009942375,0.0000011466037,0.12167477,0.000028226274,0.104671106,0.7282999,0.029204855,0.0086856885],"study_design_scores_gemma":[0.00977969,0.00054565084,0.008411211,0.00079743395,0.0009041497,0.0004653471,0.025341302,0.0051843943,0.30524668,0.6413355,0.0013461767,0.0006424861],"about_ca_topic_score_codex":0.0000037052675,"about_ca_topic_score_gemma":6.426809e-8,"teacher_disagreement_score":0.20057556,"about_ca_system_score_codex":0.000010803046,"about_ca_system_score_gemma":0.0000137487405,"threshold_uncertainty_score":0.13912378},"labels":[],"label_agreement":null},{"id":"W2093848341","doi":"10.4153/cmb-2006-020-5","title":"Another Proof of Totaro's Theorem on <i>E</i><sub>8</sub>-Torsors","year":2006,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Universität Bielefeld; Canadian Mathematical Society","keywords":"Mathematics; Extension (predicate logic); Separable space; Field (mathematics); Pure mathematics; Discrete mathematics; Combinatorics; Mathematical analysis; Computer science; Programming language","score_opus":0.0061523046732652195,"score_gpt":0.17696891690655228,"score_spread":0.17081661223328706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093848341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6102983,0.00013259189,0.13608293,0.009236855,0.0002862506,0.0007711141,0.00002965219,0.000255798,0.24290651],"genre_scores_gemma":[0.9961614,7.9638704e-7,0.0024974167,0.00096439815,0.00006545146,0.000021217329,0.0000016354111,0.000020440406,0.00026723134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986049,0.00009603902,0.0003042798,0.00031748717,0.00024682705,0.00043046343],"domain_scores_gemma":[0.9987674,0.00025993926,0.00008167645,0.00062206975,0.000051592528,0.00021736666],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045567774,0.00018672935,0.0002443131,0.00021728947,0.00009892901,0.00006498917,0.000655308,0.00009392805,0.0008903536],"category_scores_gemma":[0.00008552957,0.00016266725,0.00014712273,0.00034069468,0.00016249767,0.000039462157,0.000045818866,0.00014547587,0.0011127371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065085387,0.000086693755,0.000018630248,0.000036049634,0.000010560152,0.000019189565,0.00011666513,0.000021340218,0.0014776672,0.98230726,0.0115239015,0.004375533],"study_design_scores_gemma":[0.00032624954,0.00020709174,0.00021701156,0.00018654486,0.000015174237,0.000023656416,0.000025542751,0.0006123097,0.10500105,0.8426866,0.050269336,0.0004294488],"about_ca_topic_score_codex":0.00019138839,"about_ca_topic_score_gemma":0.00028821194,"teacher_disagreement_score":0.38586313,"about_ca_system_score_codex":0.000053074597,"about_ca_system_score_gemma":0.000095314164,"threshold_uncertainty_score":0.999665},"labels":[],"label_agreement":null},{"id":"W2094280216","doi":"10.4153/cmb-2004-023-6","title":"Ramification des séries formelles","year":2004,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramification; Combinatorics; Integer (computer science); Prime (order theory); Prime number; Ring of integers; Ring (chemistry); Discrete mathematics; Algebraic number field","score_opus":0.011905888536334078,"score_gpt":0.20024039846573785,"score_spread":0.18833450992940376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094280216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08014774,0.00012298355,0.8593541,0.012280543,0.000080192636,0.00019167496,0.0000032681783,0.00021066488,0.04760884],"genre_scores_gemma":[0.949979,0.000005549452,0.049015958,0.00067335425,0.000025604488,0.000020116959,0.0000015028876,0.00000786764,0.00027106184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920905,0.000024360981,0.00015035516,0.0001912718,0.00010913484,0.00031584353],"domain_scores_gemma":[0.99915254,0.00008236958,0.000026624457,0.0003691593,0.00004184097,0.00032749362],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002583163,0.0000991283,0.00010323862,0.00012787335,0.00024291362,0.0001539147,0.0005071401,0.000051779272,0.00092633686],"category_scores_gemma":[0.00014691436,0.00009049311,0.000064733795,0.00024535015,0.00015468529,0.00008163029,0.000035934037,0.00007894814,0.0048830025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.7147197e-7,0.000016974845,0.000008918852,0.000018936495,0.000004634721,0.000008461207,0.0007064056,0.000009172441,0.000042500786,0.99304503,0.000739146,0.005398934],"study_design_scores_gemma":[0.00012345565,0.000031166688,0.00017310657,0.000045568555,0.0000035510598,0.000025434278,0.00009315295,0.00009654915,0.00055714184,0.9665929,0.032124706,0.00013327408],"about_ca_topic_score_codex":0.00024209045,"about_ca_topic_score_gemma":0.0005787106,"teacher_disagreement_score":0.86983126,"about_ca_system_score_codex":0.000080988844,"about_ca_system_score_gemma":0.00011874576,"threshold_uncertainty_score":0.99998695},"labels":[],"label_agreement":null},{"id":"W2094348308","doi":"10.1016/j.dam.2013.10.029","title":"The intersection spectrum of hooked Skolem sequences and applications","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Intersection (aeronautics); Mathematics; Sequence (biology); Combinatorics; Order (exchange); Integer (computer science); Spectrum (functional analysis); Integer sequence; Discrete mathematics; Computer science; Generating function; Physics","score_opus":0.006822453473603833,"score_gpt":0.2100070667718314,"score_spread":0.20318461329822757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094348308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031246034,0.000051121136,0.9497507,0.0004328376,0.000039276263,0.000476211,0.0000011172542,0.00009086861,0.017911797],"genre_scores_gemma":[0.9658515,0.00003326344,0.03380659,0.000036210324,0.000024206458,0.0002067256,7.442366e-7,0.0000057702814,0.00003498357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993842,0.000011142233,0.00019991248,0.00014997477,0.00012021735,0.00013453532],"domain_scores_gemma":[0.9992049,0.00018980622,0.00012715573,0.00041626714,0.000023095401,0.00003878399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002087113,0.00008814299,0.000105940875,0.000034534838,0.00018319338,0.00013454519,0.00044714828,0.000027492244,0.000008225021],"category_scores_gemma":[0.0000066757516,0.00005809333,0.00003973761,0.0002268681,0.0001631995,0.00011505731,0.00014069435,0.00006863374,0.000021194344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.217965e-7,0.000013621059,0.000010486473,0.000026546002,0.000013092236,4.132385e-8,0.00075145514,0.0000024553226,0.0027832387,0.98228484,0.000049137423,0.014064168],"study_design_scores_gemma":[0.00007179959,0.000025654577,0.00016640474,0.000012740204,0.000008667214,0.0000041778753,0.0009946335,0.00436262,0.005280182,0.9884568,0.00052770966,0.00008860457],"about_ca_topic_score_codex":0.000007063205,"about_ca_topic_score_gemma":0.000004623606,"teacher_disagreement_score":0.9346055,"about_ca_system_score_codex":0.0000072720372,"about_ca_system_score_gemma":0.000010059988,"threshold_uncertainty_score":0.23689772},"labels":[],"label_agreement":null},{"id":"W2094454765","doi":"10.1007/s12215-014-0165-7","title":"Even perfect numbers among generalized Fibonacci sequences","year":2014,"lang":"it","type":"article","venue":"Rendiconti del Circolo Matematico di Palermo Series 2","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia","keywords":"Fibonacci number; Combinatorics; Integer (computer science); Mathematics; Sequence (biology); Sigma; Pisano period; Perfect power; Lucas number; Fibonacci polynomials; Discrete mathematics; Physics; Computer science; Chemistry; Quantum mechanics","score_opus":0.01181070156895635,"score_gpt":0.22535459422680737,"score_spread":0.213543892657851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094454765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92247987,0.0016711871,0.0416278,0.0012416427,0.003916075,0.0017337713,0.000069142276,0.0011540601,0.026106425],"genre_scores_gemma":[0.9915902,0.00037590277,0.0036419574,0.00041961725,0.00043253115,0.00025924444,0.000040107112,0.000105084735,0.0031353736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9917347,0.002117603,0.001728797,0.0016215895,0.0011508316,0.0016464742],"domain_scores_gemma":[0.9948141,0.00075999286,0.0011964132,0.0023075694,0.00028671234,0.0006352041],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027476666,0.0011327629,0.0017683684,0.0005297995,0.0010829563,0.0015980774,0.0027891477,0.0005524611,0.0011688423],"category_scores_gemma":[0.00042746493,0.0010918138,0.00087058306,0.0014975831,0.0010319588,0.0021727572,0.00071897823,0.00063347974,0.00055773417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045115312,0.0008060406,0.084833324,0.0055310954,0.0018573353,0.0003424733,0.015452117,0.000965236,0.007511944,0.85480607,0.0077813123,0.019661918],"study_design_scores_gemma":[0.012321538,0.006393352,0.36551693,0.012065578,0.0030756262,0.0016219442,0.0041617784,0.16466369,0.015128769,0.3550513,0.046027098,0.013972374],"about_ca_topic_score_codex":0.00022965188,"about_ca_topic_score_gemma":0.00017665091,"teacher_disagreement_score":0.49975473,"about_ca_system_score_codex":0.00014711636,"about_ca_system_score_gemma":0.00020557495,"threshold_uncertainty_score":0.99974424},"labels":[],"label_agreement":null},{"id":"W2095026990","doi":"10.1109/tit.2015.2416068","title":"Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Interpolation (computer graphics); Polynomial; List decoding; Algorithm; Decoding methods; Mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Computer science; Artificial intelligence; Pure mathematics","score_opus":0.01921276658745393,"score_gpt":0.23838268054384007,"score_spread":0.21916991395638613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095026990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030021854,0.000005612477,0.9948606,0.00013649976,0.00034794866,0.0004516933,0.00004508236,0.0002292782,0.00092111673],"genre_scores_gemma":[0.93667465,0.0000015121227,0.062731214,0.00029609518,0.000025811622,0.00013957769,0.000008193922,0.0000079559995,0.00011500455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921155,0.000057951656,0.00025729084,0.0001456867,0.00015948171,0.00016803728],"domain_scores_gemma":[0.9988798,0.00048544814,0.00011306323,0.00024189556,0.00017769528,0.00010211151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004276601,0.00015102522,0.00011881609,0.00031322875,0.00026864544,0.00022710039,0.00019751434,0.00006637627,0.000006173557],"category_scores_gemma":[0.000022706809,0.00012715448,0.000054377055,0.00021587986,0.000087386776,0.002071503,0.0000034194697,0.00011749524,0.000018707658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001565157,0.00017236473,0.000004674803,0.000066405,0.00014160354,8.51393e-7,0.041780822,0.053925466,0.0001596621,0.14519359,0.00013652565,0.75685287],"study_design_scores_gemma":[0.0023800367,0.0006070165,0.0000126425,0.00004300862,0.000032537704,0.000030383717,0.0026936082,0.97303456,0.0026564081,0.016417028,0.0017752418,0.00031752425],"about_ca_topic_score_codex":0.000007858309,"about_ca_topic_score_gemma":0.0000041044364,"teacher_disagreement_score":0.9336724,"about_ca_system_score_codex":0.00003257829,"about_ca_system_score_gemma":0.000043796852,"threshold_uncertainty_score":0.5185209},"labels":[],"label_agreement":null},{"id":"W2096776883","doi":"10.1016/j.ffa.2013.02.005","title":"Cyclotomy and permutation polynomials of large indices","year":2013,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Mathematics; Discrete orthogonal polynomials; Finite field; Permutation graph; Difference polynomials; Partial permutation; Construct (python library); Cyclic permutation; Combinatorics; Classical orthogonal polynomials; Random permutation; Bit-reversal permutation; Discrete mathematics; Algebra over a field; Orthogonal polynomials; Pure mathematics; Symmetric group; Computer science","score_opus":0.006411509416715652,"score_gpt":0.2189252886992095,"score_spread":0.21251377928249385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096776883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30344808,0.00033227535,0.6913423,0.00081398187,0.000019831172,0.00029917082,0.00001654481,0.000049882427,0.0036779405],"genre_scores_gemma":[0.9978611,0.000051724008,0.0017076859,0.00018911863,0.00002005877,0.00013455494,0.0000040459754,0.0000021943993,0.000029510315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996376,0.000018685509,0.00010298085,0.00013080196,0.000030969175,0.000078970326],"domain_scores_gemma":[0.99950916,0.00018818515,0.00005480753,0.00018184565,0.000028946723,0.00003706996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009509184,0.000055003955,0.00007404885,0.0000643265,0.00011006408,0.000053798016,0.00014507605,0.000042441807,0.000027669894],"category_scores_gemma":[0.000005922989,0.000043893284,0.000021583048,0.00014999033,0.000036660505,0.00015375167,0.00007656468,0.000048166246,0.000006211509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017466687,0.00005826169,0.0022178502,0.000027044534,0.000019371473,7.220126e-8,0.003325196,0.0000022258605,0.0014555313,0.91102314,0.00014275433,0.08172681],"study_design_scores_gemma":[0.00064011157,0.00019353883,0.059127778,0.00003923703,0.000017712957,0.000010127204,0.0009315816,0.009811055,0.005199682,0.8865722,0.037080754,0.0003762295],"about_ca_topic_score_codex":0.000016614998,"about_ca_topic_score_gemma":0.000004351785,"teacher_disagreement_score":0.694413,"about_ca_system_score_codex":9.1918827e-7,"about_ca_system_score_gemma":0.0000062239883,"threshold_uncertainty_score":0.17899162},"labels":[],"label_agreement":null},{"id":"W2097068816","doi":"10.1142/s1793042109002638","title":"GAUSSIAN LAWS ON DRINFELD MODULES","year":2009,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Automorphism; Finite field; Combinatorics; Conjecture; Ideal (ethics); Polynomial ring; Rank (graph theory); Discrete mathematics; Commutative ring; Polynomial; Commutative property","score_opus":0.009838271542811661,"score_gpt":0.27216425060165284,"score_spread":0.2623259790588412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097068816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13950357,0.00012852154,0.61090136,0.014479829,0.004944126,0.00009369279,0.000020987116,0.00015651608,0.22977139],"genre_scores_gemma":[0.9903628,0.000015871135,0.0061741914,0.0027300394,0.00044253859,5.494644e-7,0.0000010213262,0.000004429118,0.00026852952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888235,0.00012254012,0.00027940792,0.00012303801,0.000465584,0.00012705689],"domain_scores_gemma":[0.99904376,0.00024659315,0.00022072185,0.00020666108,0.00019894238,0.00008329936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006181498,0.00010163443,0.0001199057,0.00018340611,0.00004630005,0.00014650203,0.0014225091,0.000053412547,0.0005579729],"category_scores_gemma":[0.00009055017,0.00008172264,0.00019530147,0.000120589255,0.000037910053,0.00043999703,0.000056712015,0.00029158656,0.000103020204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010280568,0.00012920311,0.0001238948,4.1075546e-7,0.000057108904,0.000110359164,0.00021517069,0.000052463456,0.0001645862,0.8774388,0.0029735388,0.11863167],"study_design_scores_gemma":[0.0003776197,0.00019353336,0.0050102524,0.00008900228,0.000005633897,0.00041928326,0.0000266021,0.00013315491,0.0010197343,0.9651942,0.027415028,0.00011591298],"about_ca_topic_score_codex":4.336784e-7,"about_ca_topic_score_gemma":2.948687e-7,"teacher_disagreement_score":0.8508593,"about_ca_system_score_codex":0.00003464926,"about_ca_system_score_gemma":0.000026832451,"threshold_uncertainty_score":0.6109412},"labels":[],"label_agreement":null},{"id":"W2097094277","doi":"10.1007/s12190-016-1045-4","title":"Simplex and MacDonald codes over $$R_{q}$$ R q","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Mathematics and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Simplex; Homogeneous; Combinatorics; Ring (chemistry); RADIUS; Computer science","score_opus":0.011784166309943214,"score_gpt":0.2316921247849474,"score_spread":0.2199079584750042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097094277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4329477,0.00010430311,0.5652598,0.00022508399,0.000051600648,0.000036464437,4.1535316e-7,0.000018165467,0.0013564613],"genre_scores_gemma":[0.8393647,0.000044132717,0.16038473,0.00012268517,0.000073061405,2.6538427e-7,2.1664754e-8,0.000005484508,0.000004923856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921536,0.000008668797,0.00032839138,0.00011942222,0.00017764657,0.00015050438],"domain_scores_gemma":[0.9989804,0.00042975135,0.00031368018,0.00013989357,0.00004659408,0.00008965827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006736216,0.00010422939,0.0002218688,0.00010045215,0.00010877661,0.00012366704,0.00026260584,0.00003204086,0.0000064783226],"category_scores_gemma":[0.00001790196,0.00006410228,0.000051265622,0.00010781254,0.000059786224,0.000114966635,0.00021215159,0.0000839574,0.0000011019742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012056089,0.00003691848,0.000044740285,0.000043231386,0.000034944478,0.000006250554,0.0008060481,0.000004793636,0.008045721,0.8073573,0.00014296244,0.18346505],"study_design_scores_gemma":[0.0010107775,0.00014541899,0.00067888806,0.0003123974,0.000031463856,0.00027533,0.00019684648,0.014341083,0.0032013985,0.9772391,0.0023159634,0.00025135445],"about_ca_topic_score_codex":1.9715874e-7,"about_ca_topic_score_gemma":1.6245839e-7,"teacher_disagreement_score":0.406417,"about_ca_system_score_codex":0.00000693991,"about_ca_system_score_gemma":0.000014837714,"threshold_uncertainty_score":0.2614015},"labels":[],"label_agreement":null},{"id":"W2097803721","doi":"10.1109/isspa.2012.6310593","title":"On efficient decoding for the Fuzzy Vault scheme","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Decoding methods; Computer science; Soft-decision decoder; Fuzzy logic; Code (set theory); Algorithm; Computer engineering; Scheme (mathematics); Vault (architecture); Theoretical computer science; Artificial intelligence; Mathematics; Engineering; Set (abstract data type)","score_opus":0.024857893444362813,"score_gpt":0.26438229250235673,"score_spread":0.23952439905799391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097803721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034482494,0.00012209514,0.9497201,0.0011089881,0.0006833278,0.00016046429,4.694061e-7,0.00014046166,0.013581594],"genre_scores_gemma":[0.96410054,0.0000017451467,0.034629755,0.0009055234,0.00010312025,0.000027300537,1.7645837e-7,0.00000391929,0.00022789222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938476,0.000021630678,0.00007836181,0.00013221196,0.000115654926,0.0002673934],"domain_scores_gemma":[0.9988549,0.000666479,0.000024683864,0.000373496,0.00002311015,0.00005735731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006311675,0.00007105181,0.00005242173,0.00004556622,0.00025825424,0.00007525032,0.00052394666,0.000021918995,0.000025113159],"category_scores_gemma":[0.000051606017,0.000041422212,0.00009068226,0.00020590698,0.000023109124,0.00009507404,0.000099222656,0.000056472494,0.000063870546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059603926,0.000043984066,0.00009694921,0.0000019404092,0.000007408359,6.0007366e-8,0.00022857304,0.000082968116,0.00018476314,0.9769233,0.0018002623,0.020623827],"study_design_scores_gemma":[0.0016176838,0.00050182897,0.00358795,0.00006469359,0.000041134623,0.000021230124,0.00038888855,0.547772,0.024838444,0.2685759,0.15160038,0.0009898816],"about_ca_topic_score_codex":0.0000011693063,"about_ca_topic_score_gemma":5.437813e-7,"teacher_disagreement_score":0.92961806,"about_ca_system_score_codex":0.000008967069,"about_ca_system_score_gemma":0.0000065334807,"threshold_uncertainty_score":0.19863088},"labels":[],"label_agreement":null},{"id":"W2098125062","doi":"10.1109/isit.2009.5205272","title":"Fast encoding and decoding of Gabidulin codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Encoding (memory); List decoding; Sequential decoding; Error detection and correction","score_opus":0.010587789019119503,"score_gpt":0.23299700316376384,"score_spread":0.22240921414464435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098125062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31961653,0.00014301405,0.6473474,0.00042391213,0.00006562091,0.000046269477,4.1235145e-7,0.00012706325,0.032229774],"genre_scores_gemma":[0.94937086,0.000021425654,0.05036569,0.00018581016,0.000012980861,4.442272e-7,1.15612735e-7,0.0000012476795,0.00004144411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950844,0.00002397233,0.000116848605,0.00015413988,0.000079739315,0.00011688425],"domain_scores_gemma":[0.99963915,0.0000781164,0.000036236408,0.00018130937,0.000021619377,0.00004356127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023968134,0.00006069325,0.00009604446,0.00009159643,0.000061756364,0.000050277034,0.00025858622,0.000021790553,0.000015973961],"category_scores_gemma":[0.000017230064,0.000052383595,0.000035389887,0.00022429392,0.0000309696,0.00020613048,0.000060770257,0.000040974166,0.000002377347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003244064,0.000018892562,0.0012823761,0.0000041877734,0.0000036975796,0.0000016413397,0.00044713696,0.000008030844,0.010058231,0.83568066,0.000054061926,0.15243785],"study_design_scores_gemma":[0.0011331567,0.000918615,0.044434156,0.00019803432,0.000024211098,0.00008223346,0.00054467906,0.05581037,0.16774091,0.72675186,0.0015430241,0.0008187719],"about_ca_topic_score_codex":0.0000026620974,"about_ca_topic_score_gemma":0.0000018562977,"teacher_disagreement_score":0.6297543,"about_ca_system_score_codex":0.0000028647194,"about_ca_system_score_gemma":0.000006759057,"threshold_uncertainty_score":0.21361409},"labels":[],"label_agreement":null},{"id":"W2098684813","doi":"10.1007/s10801-009-0170-7","title":"Bounds for codes and designs in complex subspaces","year":2009,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Calgary","keywords":"Linear subspace; Mathematics; Association scheme; Grassmannian; Combinatorics; Dimension (graph theory); Code (set theory); Set (abstract data type); Discrete mathematics; Finite set; Upper and lower bounds; Pure mathematics; Computer science","score_opus":0.031133890459105334,"score_gpt":0.2749133560179146,"score_spread":0.24377946555880928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098684813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76765454,0.0013227834,0.22648664,0.0034641696,0.00046271947,0.00015659901,0.0000010799941,0.000035243524,0.00041624383],"genre_scores_gemma":[0.9914283,0.000087671404,0.008168282,0.0002600434,0.000035821733,0.0000010483168,2.7435303e-7,0.0000039545616,0.000014571584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990644,0.00007377154,0.00032637056,0.00013158788,0.00019970014,0.00020418156],"domain_scores_gemma":[0.9990356,0.00033129417,0.00022593739,0.00016322943,0.00014272485,0.000101188605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009427885,0.00011032996,0.00025576865,0.0003077304,0.00010115813,0.00016388723,0.00050984713,0.000049235194,0.0000024268802],"category_scores_gemma":[0.000093547715,0.00009810529,0.00009705913,0.00053009664,0.000044249653,0.0003859706,0.000041749994,0.00015779227,3.567318e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041620842,0.0001673484,0.0018315973,0.0000111912195,0.000014430711,0.000019207746,0.0006522221,0.000007546593,0.000807485,0.9841676,0.0010724666,0.0112073235],"study_design_scores_gemma":[0.0011064503,0.0011809592,0.028552195,0.00003226593,0.000010597694,0.00008994596,0.00006166708,0.0011979741,0.00037224553,0.9645137,0.0027468428,0.00013515246],"about_ca_topic_score_codex":0.0000010512643,"about_ca_topic_score_gemma":0.0000025043644,"teacher_disagreement_score":0.2237738,"about_ca_system_score_codex":0.000034256187,"about_ca_system_score_gemma":0.000058259095,"threshold_uncertainty_score":0.40006176},"labels":[],"label_agreement":null},{"id":"W2101113454","doi":"10.1109/ares.2012.32","title":"On the Weak State in GGHN-like Ciphers","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Stream cipher; RC4; Permutation (music); Markov chain; Computer science; Table (database); Ciphertext; State (computer science); Plaintext; Algorithm; Theoretical computer science; Discrete mathematics; Cryptography; Mathematics; Encryption; Data mining; Machine learning","score_opus":0.016109916377884257,"score_gpt":0.22394062154513228,"score_spread":0.20783070516724803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101113454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5354256,0.00008228965,0.23142643,0.0024559894,0.0009518532,0.00017019312,4.9340235e-7,0.00022800318,0.22925915],"genre_scores_gemma":[0.9969782,0.0000030344588,0.0007716939,0.0015517543,0.000015759455,0.0000065683053,7.286845e-8,0.0000025944446,0.0006703148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941295,0.000083366256,0.00007077929,0.00010436232,0.000103652426,0.00022490318],"domain_scores_gemma":[0.99939054,0.00020433044,0.000016589973,0.0003371741,0.0000064916826,0.00004487498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000543149,0.00005874097,0.000045419474,0.00005419865,0.000052981628,0.00004767015,0.00046400356,0.000014014032,0.00011453777],"category_scores_gemma":[0.000011928285,0.000035009503,0.000035411693,0.00033413232,0.000027378865,0.00020735212,0.00009241621,0.00008681435,0.00016857088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039019774,0.00003607614,0.0011185331,6.1970303e-7,0.00000286113,4.600093e-7,0.0008209634,0.000018706867,0.00004750067,0.9884996,0.0026199238,0.006830851],"study_design_scores_gemma":[0.00051167264,0.00019165078,0.025773056,0.00003396095,0.0000036514487,0.0000071615755,0.00051713287,0.0044425796,0.002360972,0.8966913,0.06899299,0.00047385893],"about_ca_topic_score_codex":0.000018246123,"about_ca_topic_score_gemma":0.000016692533,"teacher_disagreement_score":0.46155262,"about_ca_system_score_codex":0.000008412903,"about_ca_system_score_gemma":0.0000067182264,"threshold_uncertainty_score":0.2166694},"labels":[],"label_agreement":null},{"id":"W2102086743","doi":"10.1109/18.959281","title":"Algorithms to enumerate codewords for DC/sup 2/-constrained channels","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Enumeration; Computer science; Algorithm; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.014081156210546595,"score_gpt":0.2420030752528459,"score_spread":0.2279219190422993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102086743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002422146,0.0000049895248,0.99217564,0.00064866483,0.001183532,0.00051163987,0.000051049596,0.0003882126,0.0026141205],"genre_scores_gemma":[0.9728931,0.000013848288,0.023220697,0.0029112261,0.00007758703,0.00035743965,0.000008102475,0.000011856326,0.0005061464],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884504,0.00008254543,0.00035754635,0.00018956752,0.00020483522,0.00032043696],"domain_scores_gemma":[0.99891174,0.00027152905,0.0000843031,0.0004243435,0.00015402179,0.00015404599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008143367,0.00018438286,0.00015356422,0.00051014515,0.00043361654,0.000250994,0.000513162,0.00008629625,0.00012038169],"category_scores_gemma":[0.000014037375,0.00018135284,0.00017416787,0.00075287913,0.00005330896,0.0017188659,0.0000030899653,0.00015114131,0.00027371309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027434845,0.00008788588,5.7404156e-7,0.00001830216,0.00005680627,0.0000010585711,0.005194401,0.041530803,0.000111125875,0.2936547,0.00029574957,0.65877426],"study_design_scores_gemma":[0.0047811205,0.0021503656,0.000034478326,0.00020107953,0.00009840376,0.00018607714,0.0022049735,0.3819757,0.056863002,0.3967306,0.15286821,0.0019059785],"about_ca_topic_score_codex":0.000002374261,"about_ca_topic_score_gemma":0.0000010183534,"teacher_disagreement_score":0.97047096,"about_ca_system_score_codex":0.000037433358,"about_ca_system_score_gemma":0.000049092836,"threshold_uncertainty_score":0.7395354},"labels":[],"label_agreement":null},{"id":"W2102564119","doi":"10.1109/92.974900","title":"Efficient exponentiation using weakly dual basis","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponentiation; Finite field; Polynomial basis; Basis (linear algebra); Mathematics; Modular exponentiation; Polynomial; Normal basis; Dual (grammatical number); Square (algebra); Topology (electrical circuits); Computer science; Discrete mathematics; Public-key cryptography; Combinatorics; Encryption; Galois theory; Mathematical analysis; Geometry","score_opus":0.019418815746947517,"score_gpt":0.240251609791976,"score_spread":0.22083279404502848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102564119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24763465,0.000061009807,0.74765503,0.000098299046,0.0033477969,0.00032151214,0.00002763129,0.00033734486,0.0005167059],"genre_scores_gemma":[0.99706566,0.000016239379,0.0021791041,0.000093128976,0.00015004461,0.000078413446,0.000006871585,0.000023890256,0.00038665248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736977,0.0003877048,0.0005813757,0.00061044825,0.0006056855,0.0004450445],"domain_scores_gemma":[0.99859285,0.00013786247,0.00019336706,0.0007010308,0.00022043525,0.00015445429],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008058936,0.00030271316,0.00028754576,0.000605332,0.0007182563,0.00042134346,0.0004041838,0.00017728796,0.00008456518],"category_scores_gemma":[0.000007858955,0.00028799236,0.00030493556,0.0012521619,0.000050338254,0.0005531369,0.0000047951617,0.00031747445,0.00014321943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004314949,0.003324255,0.00029311923,0.00012573962,0.00035623607,0.00007849681,0.009318128,0.8029519,0.09781876,0.038543485,0.0007294332,0.046029005],"study_design_scores_gemma":[0.0006075065,0.00016992682,0.00013625665,0.00021506664,0.000052636402,0.00013596346,0.001010639,0.9759878,0.019603169,0.00017868582,0.0014746266,0.00042772896],"about_ca_topic_score_codex":0.00009866993,"about_ca_topic_score_gemma":0.0000992443,"teacher_disagreement_score":0.749431,"about_ca_system_score_codex":0.00019709622,"about_ca_system_score_gemma":0.00006629122,"threshold_uncertainty_score":0.9999572},"labels":[],"label_agreement":null},{"id":"W2104443771","doi":"10.1007/978-3-642-15874-2_17","title":"Appended m-Sequences with Merit Factor Greater than 3.34","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Figure of merit; Sequence (biology); Pseudorandom binary sequence; Binary number; Conjecture; Rotation (mathematics); Legendre polynomials; Fraction (chemistry); Factor (programming language); Mathematics; Combinatorics; Algorithm; Computer science; Arithmetic; Geometry; Mathematical analysis","score_opus":0.016252238362898595,"score_gpt":0.22415227324000536,"score_spread":0.20790003487710676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104443771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001511076,0.00012658075,0.98961663,0.0006054269,0.0014369052,0.00035653554,0.000008764662,0.0003046176,0.0060334853],"genre_scores_gemma":[0.5640087,0.00001940512,0.43384796,0.001125223,0.0005556296,0.000016768166,0.0000045103,0.00005384476,0.00036796025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957156,0.000046988953,0.00040972192,0.0018830539,0.0011134276,0.00083119137],"domain_scores_gemma":[0.9970671,0.00029764732,0.00028946373,0.0018800681,0.00020857275,0.00025717693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060640246,0.0007205669,0.0005932134,0.0009527805,0.0004320361,0.0009216666,0.0048714536,0.00041549976,0.00010633968],"category_scores_gemma":[0.000028114944,0.00053378876,0.00018723811,0.00078693195,0.001695416,0.00081045757,0.0010146641,0.0013481368,0.00006315108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059206686,0.00006326908,0.001160334,0.000077825025,0.000071498005,0.000470563,0.0031483793,0.0006080776,0.0023029267,0.2071845,0.000009266798,0.78484416],"study_design_scores_gemma":[0.00067054137,0.0010510376,0.0009283781,0.00079765084,0.000029283692,0.00049719063,7.5496575e-7,0.020125132,0.023305384,0.9446612,0.0054422114,0.0024912495],"about_ca_topic_score_codex":0.000027134458,"about_ca_topic_score_gemma":0.00020858066,"teacher_disagreement_score":0.7823529,"about_ca_system_score_codex":0.00009898623,"about_ca_system_score_gemma":0.00042018126,"threshold_uncertainty_score":0.9997114},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006696594448420201,"score_gpt":0.2075444106367516,"score_spread":0.20084781618833142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105512769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066097885,0.0000016361752,0.9254663,0.0003569008,0.0010974795,0.00014576843,0.000013246568,0.00013157059,0.0066891885],"genre_scores_gemma":[0.9960459,0.0000073256288,0.0033431745,0.00052638736,0.000013710049,0.000029723324,0.0000010264914,0.0000035759617,0.000029168083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991369,0.00013337746,0.00028646865,0.00009509533,0.00022113789,0.00012699596],"domain_scores_gemma":[0.9984708,0.0007162764,0.00015365674,0.00053326564,0.00008384854,0.000042160234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007885739,0.00011132434,0.000099860896,0.00027194255,0.00031512536,0.000083831554,0.00046501894,0.00007470857,0.00021366333],"category_scores_gemma":[0.000025096555,0.00008056265,0.00012543045,0.00041874906,0.00021919656,0.00089319417,0.0000020144184,0.00034863982,0.00013990852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046337136,0.000051556995,0.0000012550115,0.0000072116645,0.000017170421,5.7402712e-8,0.0009416155,0.00021474823,0.0004905286,0.890423,0.000040833183,0.107765704],"study_design_scores_gemma":[0.00041419893,0.00031552726,0.000104865896,0.000041520274,0.000020268435,0.000027174976,0.000418726,0.0042334916,0.11418487,0.87759215,0.0024256946,0.00022154518],"about_ca_topic_score_codex":0.0000032768428,"about_ca_topic_score_gemma":0.0000034384977,"teacher_disagreement_score":0.92994803,"about_ca_system_score_codex":0.000009761117,"about_ca_system_score_gemma":0.000033670778,"threshold_uncertainty_score":0.32852495},"labels":[],"label_agreement":null},{"id":"W2106235749","doi":"10.1109/tit.2010.2079590","title":"Multiplicative Characters, the Weil Bound, and Polyphase Sequence Families With Low Correlation","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Lakehead University","funders":"","keywords":"Polyphase system; Multiplicative function; Sequence (biology); Mathematics; Correlation; Complementary sequences; Discrete mathematics; Combinatorics; Algorithm; Computer science; Physics; Mathematical analysis; Biology; Genetics","score_opus":0.005572041426733712,"score_gpt":0.2070042543238948,"score_spread":0.2014322128971611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106235749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14273149,0.0000038064586,0.85545033,0.00035281002,0.00034730448,0.0002278673,0.000015369043,0.00015506042,0.0007159364],"genre_scores_gemma":[0.99765325,0.000016808395,0.0014796647,0.00070772716,0.000014385041,0.000070469716,0.0000036084277,0.0000046085825,0.000049457845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926174,0.000084873354,0.00019149785,0.00013723622,0.0001774467,0.0001472272],"domain_scores_gemma":[0.99893796,0.0003433219,0.00012839788,0.0004372212,0.000091389906,0.00006170442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047100915,0.00013597302,0.00008262575,0.00018932323,0.00060375704,0.00023770891,0.00033402757,0.00006264886,0.000019874928],"category_scores_gemma":[0.000009299233,0.000091685695,0.00004541814,0.00036278804,0.00030374693,0.002344421,0.0000030052176,0.00037868603,0.00006124741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030941225,0.00009037262,0.000041144704,0.000020879981,0.000053904136,7.924696e-7,0.01705738,0.0012525187,0.00287693,0.51890457,0.00001782143,0.45937428],"study_design_scores_gemma":[0.010927625,0.0027081794,0.016954115,0.00049701927,0.0003275739,0.00095315505,0.01931088,0.44532487,0.21281487,0.2675135,0.01877568,0.0038925435],"about_ca_topic_score_codex":0.000008833752,"about_ca_topic_score_gemma":0.000012475947,"teacher_disagreement_score":0.85492176,"about_ca_system_score_codex":0.00001390873,"about_ca_system_score_gemma":0.000042808253,"threshold_uncertainty_score":0.4643672},"labels":[],"label_agreement":null},{"id":"W2106623697","doi":"10.1109/focs.2007.30","title":"Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Electronic circuit; Fan-out; Power (physics); Fan-in; Electrical engineering; Computer science; Geology; Engineering; Physics","score_opus":0.010412350139043418,"score_gpt":0.23382142748156962,"score_spread":0.22340907734252619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106623697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.692997,0.00025028968,0.27988112,0.00036867472,0.00007291569,0.00010984662,1.606998e-7,0.00002663971,0.026293358],"genre_scores_gemma":[0.9979153,0.000007158342,0.0019105566,0.00013082444,0.000005375255,0.0000022819922,5.7372777e-8,0.000002135806,0.000026292379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99933237,0.000045268873,0.00018391326,0.00016526609,0.000106483385,0.0001666713],"domain_scores_gemma":[0.9993593,0.00026580357,0.00003381162,0.00030226592,0.000011941333,0.000026849722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00122191,0.00006138743,0.000110508416,0.00013509864,0.000024015782,0.000024831375,0.00037001906,0.000029009401,0.000011823863],"category_scores_gemma":[0.0000299842,0.00003917288,0.00003916359,0.0005168771,0.00010728684,0.0001379213,0.000114660535,0.00009405736,0.0000018204596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015609821,0.000029599441,0.07787441,0.0000027034678,0.0000028750928,0.000006346682,0.001261173,5.6727555e-7,0.00010971383,0.8902316,0.0000072494395,0.030458143],"study_design_scores_gemma":[0.0011552139,0.000044132834,0.6862903,0.000029318593,0.0000017725407,0.000007427643,0.0001883895,0.00056043,0.0009526488,0.31052077,0.0001397941,0.000109791166],"about_ca_topic_score_codex":0.00009799802,"about_ca_topic_score_gemma":0.0016824213,"teacher_disagreement_score":0.6084159,"about_ca_system_score_codex":0.000004773838,"about_ca_system_score_gemma":0.000009725735,"threshold_uncertainty_score":0.15974236},"labels":[],"label_agreement":null},{"id":"W2106641903","doi":"10.1109/tc.2007.1047","title":"Comb Architectures for Finite Field Multiplication in F(2^m)","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Normal basis; Finite field; Basis (linear algebra); Critical path method; Multiplier (economics); Binary number; Field-programmable gate array; Computer science; Adder; Polynomial basis; Algorithm; Multiplication (music); Field (mathematics); Path (computing); Representation (politics); Mathematics; Arithmetic; Parallel computing; Discrete mathematics; Computer hardware; Latency (audio); Combinatorics; Galois theory","score_opus":0.01617108888284695,"score_gpt":0.2593328631153665,"score_spread":0.24316177423251956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106641903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026968634,0.000008771366,0.97114307,0.00055759674,0.0007532777,0.00025992392,0.0000028362228,0.0001641768,0.00014172349],"genre_scores_gemma":[0.93336475,0.0000018219431,0.06554913,0.0010029355,0.000030681473,0.00002978003,5.6491666e-7,0.0000065727295,0.000013767845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999133,0.000034033954,0.00019637073,0.0002905735,0.00010668933,0.00023935424],"domain_scores_gemma":[0.9980695,0.0014546786,0.000039505365,0.0003466842,0.000027128455,0.00006249953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033742,0.00011530395,0.000107556756,0.00038379157,0.0001303957,0.00004678686,0.00044054323,0.00006063619,0.0000034706243],"category_scores_gemma":[0.000005273519,0.00011835144,0.00012481624,0.00043891274,0.000025970947,0.00005785439,0.0000022419767,0.00017225352,0.000006571444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016026315,0.00025409175,0.000070212765,0.000015532361,0.000022354292,0.00000446114,0.0010880533,0.11872598,0.0005548747,0.0063197957,0.00011843673,0.87266594],"study_design_scores_gemma":[0.003100363,0.0013211975,0.0029469267,0.00016825047,0.000018933923,0.000020383564,0.00006148369,0.8451104,0.11601057,0.026592866,0.0038542799,0.0007943281],"about_ca_topic_score_codex":0.00001511818,"about_ca_topic_score_gemma":0.00008378431,"teacher_disagreement_score":0.9063961,"about_ca_system_score_codex":0.000023423136,"about_ca_system_score_gemma":0.000013070348,"threshold_uncertainty_score":0.48262316},"labels":[],"label_agreement":null},{"id":"W2106689698","doi":"10.1109/ccece.1999.807163","title":"Extended properties of high-order spectral-null words","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Null (SQL); Order (exchange); Mathematics; Word (group theory); Code (set theory); Redundancy (engineering); Combinatorics; Discrete mathematics; Algorithm; Computer science","score_opus":0.014494799207080827,"score_gpt":0.2051408220551718,"score_spread":0.19064602284809098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106689698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37796953,0.00036914175,0.55035126,0.00040370968,0.00042419013,0.00014439541,3.5772393e-7,0.00027781274,0.070059605],"genre_scores_gemma":[0.95662713,0.000009093759,0.04218185,0.00013099327,0.000012110622,0.000004665248,8.1794184e-8,0.000004098021,0.0010299954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992637,0.00007285345,0.00014166498,0.00020198086,0.00014073032,0.00017908594],"domain_scores_gemma":[0.9994223,0.000019625873,0.000036819118,0.00042452852,0.00005439947,0.000042289455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023009954,0.00008807482,0.00011633269,0.00008826672,0.000052457366,0.000043321845,0.00040608202,0.000028268476,0.00017709231],"category_scores_gemma":[0.000029685521,0.00006450852,0.000058303645,0.00052174187,0.00006521212,0.00020844114,0.000053938573,0.000059303216,0.000023247818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045973325,0.00006862905,0.00007338912,0.000007506931,0.000011396859,0.0000014448003,0.00028506486,0.0000075133644,0.0068963845,0.9889402,0.00013127818,0.0035726004],"study_design_scores_gemma":[0.00048245455,0.0002238562,0.001652637,0.00003815904,0.000009692387,0.000017686805,0.00014931647,0.0005136372,0.5913018,0.39947864,0.0057979063,0.00033420345],"about_ca_topic_score_codex":0.00001597003,"about_ca_topic_score_gemma":0.000005395943,"teacher_disagreement_score":0.58946157,"about_ca_system_score_codex":0.0000052689456,"about_ca_system_score_gemma":0.000034660337,"threshold_uncertainty_score":0.2630581},"labels":[],"label_agreement":null},{"id":"W2106824622","doi":"10.1007/978-3-540-85912-3_5","title":"A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Pseudorandom number generator; Randomness; Pseudorandom binary sequence; Binary number; Computer science; Algorithm; Order (exchange); Function (biology); Period (music); Mathematics; Discrete mathematics; Combinatorics; Statistics; Arithmetic; Physics","score_opus":0.03315556871134891,"score_gpt":0.23189349797111103,"score_spread":0.19873792925976214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106824622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008827095,0.0005572452,0.9858311,0.0012912448,0.0008650189,0.0011525956,0.0000050834265,0.0000986476,0.0013719805],"genre_scores_gemma":[0.9921213,0.000060544557,0.006210171,0.0012871277,0.00019632441,0.000042144587,6.764748e-7,0.000017410934,0.000064311476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687153,0.00025230358,0.0004455878,0.000972858,0.0010488287,0.0004089076],"domain_scores_gemma":[0.99678755,0.00092784985,0.00031902545,0.0014869036,0.00042108586,0.00005757645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013714863,0.00045088344,0.0004464467,0.00039989458,0.00069434865,0.00028869958,0.0043608216,0.00012723215,0.0000150841115],"category_scores_gemma":[0.00012897419,0.00021926085,0.00014923881,0.0012804357,0.0021146217,0.0002504933,0.0008164922,0.0007384335,0.000013814869],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002541969,0.0006140605,0.00015240362,0.000048979236,0.00032069828,0.00030957794,0.06089141,0.032031238,0.002277596,0.06938781,0.00028101762,0.833431],"study_design_scores_gemma":[0.003381264,0.006822483,0.00097542803,0.0026290417,0.00013713153,0.0006722316,0.000068982736,0.47278187,0.05709432,0.44766378,0.0037268528,0.004046594],"about_ca_topic_score_codex":0.000030441717,"about_ca_topic_score_gemma":0.00005058054,"teacher_disagreement_score":0.9832942,"about_ca_system_score_codex":0.000055960656,"about_ca_system_score_gemma":0.00039557624,"threshold_uncertainty_score":0.89411986},"labels":[],"label_agreement":null},{"id":"W2107014706","doi":"10.1109/arith.1997.614897","title":"Algorithms for multi-exponentiation based on complex arithmetic","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Modular exponentiation; Exponentiation; Modular arithmetic; Computer science; Cryptography; Arithmetic; Binary number; Modular design; Algorithm; Theoretical computer science; Parallel computing; Public-key cryptography; Mathematics; Encryption; Computer security","score_opus":0.13065980796550095,"score_gpt":0.2909043719107428,"score_spread":0.16024456394524186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107014706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004141745,0.000010209427,0.99577874,0.0007234435,0.00018036472,0.00018419694,0.0000026538635,0.00022888815,0.0024773113],"genre_scores_gemma":[0.48242483,0.0000010322958,0.515858,0.0012444787,0.00003309356,0.000033047032,0.000004173437,0.000005588388,0.00039576265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992847,0.000040134622,0.00011663626,0.00025258056,0.00013315269,0.00017280066],"domain_scores_gemma":[0.999399,0.00013783044,0.000036358986,0.0003322802,0.000043067535,0.00005144252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001927174,0.00008899188,0.00008219484,0.00013948824,0.00014127964,0.00009590593,0.000359512,0.000030426465,0.0001824094],"category_scores_gemma":[0.000022259364,0.00007913933,0.00009995977,0.00026273282,0.00002079719,0.0001298954,0.00002917362,0.000042626372,0.00006668896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017733493,0.0009893584,0.00020467199,0.000023451697,0.000023134058,0.0000033443914,0.00031011348,0.0011599874,0.0010856059,0.46570078,0.0053756246,0.5251062],"study_design_scores_gemma":[0.00064572814,0.00016928214,0.0010127464,0.000005312185,0.0000035152007,7.632481e-7,0.000005692689,0.9895345,0.0007051491,0.002851245,0.004949901,0.000116173986],"about_ca_topic_score_codex":0.00000270472,"about_ca_topic_score_gemma":0.0000019977629,"teacher_disagreement_score":0.98837453,"about_ca_system_score_codex":0.000010990288,"about_ca_system_score_gemma":0.0000034271752,"threshold_uncertainty_score":0.32272083},"labels":[],"label_agreement":null},{"id":"W2107744299","doi":"10.1109/18.825842","title":"On a conjectured ideal autocorrelation sequence and a related triple-error correcting cyclic code","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cyclic code; Golomb coding; BCH code; Autocorrelation; Sequence (biology); Mathematics; Code (set theory); Polynomial code; Ideal (ethics); Pseudorandom binary sequence; Binary number; Constant-weight code; Linear code; TRACE (psycholinguistics); Discrete mathematics; Error detection and correction; Algorithm; Decoding methods; Computer science; Block code; Arithmetic; Statistics","score_opus":0.012212847674001232,"score_gpt":0.24045029843727897,"score_spread":0.22823745076327773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107744299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07701477,0.00001014203,0.9113634,0.00016187527,0.0007582308,0.00041804192,0.000018984525,0.0005760142,0.009678531],"genre_scores_gemma":[0.99793166,0.00001160022,0.0008439949,0.00071561243,0.000008842057,0.000067087174,0.000005887739,0.000008284357,0.00040700543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986379,0.00023859023,0.00043468675,0.00022085969,0.00023828456,0.00022968715],"domain_scores_gemma":[0.9988399,0.00049891486,0.000149509,0.0003614195,0.00005282144,0.000097409626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007238436,0.00019399727,0.00015449485,0.00039434715,0.00053368823,0.00017909914,0.00027266762,0.00013609414,0.00045204768],"category_scores_gemma":[0.000026495081,0.00018547701,0.00010607836,0.0006482349,0.00009459745,0.0016939469,0.00000182552,0.00040590658,0.00029065317],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041316403,0.000075967924,0.000003259294,0.000016741218,0.00004649914,0.00000238504,0.008902442,0.0489899,0.00009973046,0.17396575,0.00007552303,0.76740867],"study_design_scores_gemma":[0.0046512103,0.0013387393,0.0007586158,0.00035450395,0.00009614349,0.00054301,0.0008681851,0.60358196,0.0076780524,0.3757589,0.00317882,0.001191839],"about_ca_topic_score_codex":0.000007406452,"about_ca_topic_score_gemma":0.0000029753644,"teacher_disagreement_score":0.9209169,"about_ca_system_score_codex":0.000058696405,"about_ca_system_score_gemma":0.000044294604,"threshold_uncertainty_score":0.7563533},"labels":[],"label_agreement":null},{"id":"W2107864588","doi":"10.1109/isit.2002.1023453","title":"A new family of Gold-like sequences","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Complementary sequences; Sequence (biology); Gold code; Cryptography; Primitive polynomial; Mathematics; Combinatorics; Prime (order theory); Computation; Discrete mathematics; Polynomial; Finite field; Computer science; Algorithm; Code division multiple access; Spread spectrum; Telecommunications","score_opus":0.017533162429569496,"score_gpt":0.22660663739877243,"score_spread":0.20907347496920292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107864588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024836503,0.00019845505,0.8091939,0.00010824683,0.00026533531,0.00003916295,1.8589473e-7,0.00010116559,0.16525702],"genre_scores_gemma":[0.85630167,0.000009191785,0.1416209,0.00037458452,0.000009250775,0.0000010646139,6.309503e-8,0.0000019256727,0.0016813332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994937,0.000043186654,0.000098548764,0.00014205655,0.00011131449,0.000111156674],"domain_scores_gemma":[0.99956405,0.00004783207,0.000029780535,0.00028046584,0.000023457955,0.00005438511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019057795,0.00005397532,0.00007334194,0.000060719,0.000021219854,0.000030093728,0.00042082334,0.000020410533,0.00006671801],"category_scores_gemma":[0.000012064235,0.000043279048,0.000056493376,0.0004235305,0.000025728945,0.00016437777,0.000036986497,0.000032767308,0.000022166048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.263889e-7,0.000009234879,0.0002446841,0.0000019890797,0.0000048749444,0.0000012713821,0.00014649772,0.0000047907592,0.0025602395,0.97729605,0.0023903693,0.017339084],"study_design_scores_gemma":[0.0003823469,0.00024186564,0.0021186701,0.00002432172,0.0000058857913,0.000018807546,0.00018042114,0.0004314177,0.028118633,0.8547247,0.113455765,0.0002971787],"about_ca_topic_score_codex":0.00003862122,"about_ca_topic_score_gemma":0.0000050584395,"teacher_disagreement_score":0.8314652,"about_ca_system_score_codex":0.000002825936,"about_ca_system_score_gemma":0.00005993007,"threshold_uncertainty_score":0.17648682},"labels":[],"label_agreement":null},{"id":"W2108998869","doi":"10.1109/tit.2010.2050793","title":"New Construction of $M$-Ary Sequence Families With Low Correlation From the Structure of Sidelnikov Sequences","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Lakehead University","funders":"","keywords":"Computer science","score_opus":0.005039821469258623,"score_gpt":0.19509263527872006,"score_spread":0.19005281380946143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108998869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20302546,0.0000055851956,0.7956378,0.000089797846,0.00063481723,0.00013548309,0.00006789934,0.00006566369,0.00033750045],"genre_scores_gemma":[0.97257924,0.00001142859,0.027231446,0.00013590454,0.000019912126,0.00000311228,0.0000075251683,0.000003633548,0.000007792595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990338,0.00009612703,0.0003599628,0.00011693921,0.00028751092,0.00010565451],"domain_scores_gemma":[0.99854547,0.00046317454,0.00032415,0.0004568128,0.0001583354,0.00005206403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023173478,0.00013029309,0.0001343371,0.00018115876,0.00018283844,0.00005587466,0.00046375493,0.00009480549,0.00015014106],"category_scores_gemma":[0.000016469867,0.00008887718,0.000075927666,0.0005327996,0.00032150093,0.0018321946,0.0000028091076,0.0003181519,0.0000068827785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028725338,0.000026552592,0.00018274154,0.0000313791,0.000090914626,2.8308963e-7,0.008896297,0.028184371,0.026780218,0.55386084,0.000030924333,0.38162822],"study_design_scores_gemma":[0.0010562635,0.00040015203,0.0014287854,0.00020611368,0.00009355443,0.00006422462,0.003922544,0.017445317,0.5703159,0.40435794,0.00029091907,0.00041826456],"about_ca_topic_score_codex":0.000116146075,"about_ca_topic_score_gemma":0.00006452377,"teacher_disagreement_score":0.7695538,"about_ca_system_score_codex":0.000011431486,"about_ca_system_score_gemma":0.00017957955,"threshold_uncertainty_score":0.36243066},"labels":[],"label_agreement":null},{"id":"W2109407938","doi":"10.1145/1040034.1040041","title":"ANTS VI","year":2004,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Presentation (obstetrics); Library science; Web site; Computer science; Operations research; World Wide Web; Engineering; The Internet","score_opus":0.01385975470012481,"score_gpt":0.22700332419816113,"score_spread":0.2131435694980363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109407938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36304146,0.00081381964,0.5220191,0.06965872,0.0018958036,0.00044024092,0.000007502035,0.0019659065,0.040157437],"genre_scores_gemma":[0.95470715,0.000012942906,0.043067507,0.0019386637,0.00008361417,0.000009241199,0.0000010960377,0.000007819027,0.00017198508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910593,0.000039340932,0.00012419299,0.00030377487,0.00016639684,0.00026034954],"domain_scores_gemma":[0.9987751,0.00012132742,0.00003948982,0.0009499021,0.000029592078,0.00008455058],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025453363,0.00010825737,0.00009963582,0.000076527875,0.00013168335,0.00009687943,0.0014781846,0.000046800225,0.00026242353],"category_scores_gemma":[0.00017822708,0.00010167476,0.00008092346,0.0002949613,0.000045575907,0.000076086326,0.00042296888,0.000111786154,0.0013260829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023245364,0.00023341303,0.0005124639,0.000014438888,0.000032490712,0.00011310168,0.0010046385,0.00013379597,0.003659843,0.89625037,0.021254862,0.07676731],"study_design_scores_gemma":[0.0010661258,0.00024307352,0.0038072048,0.000059275077,0.000007801427,0.00005447452,0.00003576765,0.000027901104,0.011935057,0.40893397,0.5733641,0.00046527878],"about_ca_topic_score_codex":0.000018138275,"about_ca_topic_score_gemma":0.0000015796585,"teacher_disagreement_score":0.5916657,"about_ca_system_score_codex":0.000015335781,"about_ca_system_score_gemma":0.000024404875,"threshold_uncertainty_score":0.9994515},"labels":[],"label_agreement":null},{"id":"W2109539366","doi":"10.1109/tc.2007.70845","title":"Low Complexity Normal Elements over Finite Fields of Characteristic Two","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Computation; Computational complexity theory; Constructive; Finite field; Binary number; Degree (music); Algorithm; Extension (predicate logic); Distribution (mathematics); Discrete mathematics; Computer science; Arithmetic","score_opus":0.02901359929829447,"score_gpt":0.24706651915260894,"score_spread":0.21805291985431446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109539366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20387316,0.0000029305372,0.7945857,0.00006764082,0.0010720636,0.000091473,0.000016141405,0.000114773844,0.00017612703],"genre_scores_gemma":[0.98367184,0.000012275432,0.015736388,0.0004885489,0.000038755337,0.000008370734,0.0000020789996,0.00000780971,0.000033946057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987886,0.0000859904,0.00031569527,0.00029961288,0.00025656965,0.00025351514],"domain_scores_gemma":[0.9990405,0.00020829328,0.00010736344,0.000496086,0.00005155578,0.00009623394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012942783,0.0001679355,0.00020695428,0.00022245929,0.00025563952,0.000032208416,0.000612017,0.000047829115,0.00009332555],"category_scores_gemma":[0.000001584591,0.0001755525,0.0001948132,0.00041988096,0.00014722142,0.0002852025,0.000007636938,0.00021457183,0.000028308747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011344441,0.008092133,0.0040385653,0.00044556195,0.0011057969,0.0004601079,0.014222434,0.211875,0.0067770695,0.05190763,0.0034636313,0.6964776],"study_design_scores_gemma":[0.0067362036,0.0025173335,0.031046972,0.00041915735,0.00009877441,0.00020444678,0.0000342422,0.87519836,0.0733877,0.0069445525,0.0015695937,0.0018426743],"about_ca_topic_score_codex":0.000024620926,"about_ca_topic_score_gemma":0.00001126327,"teacher_disagreement_score":0.7797987,"about_ca_system_score_codex":0.000020254116,"about_ca_system_score_gemma":0.000033846405,"threshold_uncertainty_score":0.71588236},"labels":[],"label_agreement":null},{"id":"W2110262961","doi":"10.1109/istel.2010.5734050","title":"Iterative soft decoding of Reed-Solomon codes using information correction","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; List decoding; Sequential decoding; Berlekamp–Welch algorithm; Computer science; Belief propagation; Parity-check matrix; Algorithm; Concatenated error correction code; Low-density parity-check code; Binary symmetric channel; Serial concatenated convolutional codes; Theoretical computer science; Arithmetic; Mathematics; Block code","score_opus":0.010901301754637825,"score_gpt":0.24339835382119604,"score_spread":0.2324970520665582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110262961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3115736,0.0000019410518,0.68355256,0.000018077746,0.0007630841,0.000042107695,4.4068736e-7,0.000074608506,0.00397358],"genre_scores_gemma":[0.950482,8.135364e-7,0.049401585,0.000072383664,0.000021752214,0.0000014837308,0.0000012367791,0.0000015231052,0.000017190043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995143,0.000027695703,0.0001721247,0.00008717516,0.00010210522,0.00009661333],"domain_scores_gemma":[0.9994753,0.0000928382,0.00010827105,0.0001883321,0.00010678429,0.00002846689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002977244,0.00005953287,0.00007780369,0.0001588985,0.0001133545,0.00010160793,0.00021366031,0.00004427404,0.000023611103],"category_scores_gemma":[0.000060945065,0.000055604687,0.00004405026,0.0003233997,0.000038210863,0.0015158369,0.00006979259,0.00010880547,0.000006635754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033710377,0.000053045504,0.0060640364,0.000020974001,0.000023954939,6.7708083e-7,0.00709635,0.0005455988,0.11755088,0.5638149,0.00025132985,0.30454454],"study_design_scores_gemma":[0.00025907546,0.0001295966,0.002080293,0.00003954476,0.000008812005,0.000033872562,0.00030794615,0.8230401,0.15543328,0.017657934,0.0007889881,0.00022053378],"about_ca_topic_score_codex":0.00003417612,"about_ca_topic_score_gemma":0.00003282661,"teacher_disagreement_score":0.8224945,"about_ca_system_score_codex":0.000006944957,"about_ca_system_score_gemma":0.000019893594,"threshold_uncertainty_score":0.22674933},"labels":[],"label_agreement":null},{"id":"W2110711133","doi":"10.1109/tc.2005.35","title":"A class of unidirectional bit serial systolic architectures for multiplicative inversion and division over GF(2/sup m/)","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Mathematics; Multiplicative inverse; GF(2); Division (mathematics); Cryptography; Multiplicative function; Discrete mathematics; Galois theory; Dimension (graph theory); Polynomial; Finite field arithmetic; Arithmetic; Polynomial basis; Inversion (geology); Primitive polynomial; Inverse; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.011705015567760393,"score_gpt":0.236284639021819,"score_spread":0.22457962345405863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110711133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26465186,0.000015144247,0.73429453,0.00031702747,0.00036898474,0.00021297317,0.000019863885,0.00009749034,0.000022137141],"genre_scores_gemma":[0.9601701,0.000005863717,0.039509617,0.00019965056,0.00006338092,0.000027084114,0.0000010902247,0.000008700052,0.000014530961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990197,0.000083970896,0.00019309996,0.00035660778,0.00017364621,0.0001729749],"domain_scores_gemma":[0.99906313,0.0004478739,0.00007922345,0.00026824238,0.0000552291,0.00008631598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014966742,0.00015232884,0.00017212832,0.00031562557,0.0002382556,0.000042280964,0.0002977556,0.00006742063,0.000005372757],"category_scores_gemma":[0.0000029704775,0.00014421393,0.00015531818,0.0003258615,0.000105171974,0.0001167541,0.0000078411485,0.00013269056,0.0000023683515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047847923,0.00047897868,0.000062789455,0.00007429966,0.0001780425,0.000001045883,0.0025746906,0.24424843,0.0045483583,0.00923687,0.0006505109,0.7374675],"study_design_scores_gemma":[0.0016013416,0.00052284246,0.00040668517,0.00011339786,0.000025815541,0.000012189614,0.000023810799,0.9639474,0.028226,0.0015889494,0.0032670521,0.0002644778],"about_ca_topic_score_codex":0.000011633866,"about_ca_topic_score_gemma":0.000016190967,"teacher_disagreement_score":0.737203,"about_ca_system_score_codex":0.000036313475,"about_ca_system_score_gemma":0.000024837103,"threshold_uncertainty_score":0.5880873},"labels":[],"label_agreement":null},{"id":"W2110869001","doi":"","title":"CIRI-CIRI POLINOMIAL PERMUTASI ATAS FINITE FIELD","year":2013,"lang":"id","type":"article","venue":"UG Jurnal","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics","score_opus":0.014003708633881696,"score_gpt":0.22950422603424603,"score_spread":0.21550051740036433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110869001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7887338,0.00219829,0.11425482,0.015936155,0.009830515,0.0008176485,0.00005589222,0.00045945134,0.06771344],"genre_scores_gemma":[0.9908817,0.000105380066,0.0013468151,0.0037054133,0.0015926727,0.00001676,0.000006198241,0.000024190522,0.002320876],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99732244,0.00024193076,0.0005134306,0.0006307226,0.00045025014,0.0008412369],"domain_scores_gemma":[0.9977425,0.0005656782,0.00021315464,0.00089363114,0.0001621636,0.00042289335],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00044887728,0.00037020954,0.0003483231,0.00028957493,0.0005140286,0.00092888495,0.0016026142,0.00023850646,0.0031983813],"category_scores_gemma":[0.00014856723,0.00036064791,0.00042293084,0.0005818682,0.00017741956,0.00080346887,0.00054133724,0.00076713663,0.00332994],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031584635,0.0011090554,0.027871134,0.00021368948,0.00056442444,0.00041395923,0.010621634,0.00013430156,0.00570909,0.27462196,0.24172425,0.43670064],"study_design_scores_gemma":[0.0069952626,0.0051980736,0.09562744,0.0011588255,0.00048128326,0.0013634621,0.0009049792,0.04290246,0.0164456,0.16263065,0.6607953,0.0054967175],"about_ca_topic_score_codex":0.00015854897,"about_ca_topic_score_gemma":0.000013991396,"teacher_disagreement_score":0.43120393,"about_ca_system_score_codex":0.00004066497,"about_ca_system_score_gemma":0.00018623087,"threshold_uncertainty_score":0.99988455},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015574177502245027,"score_gpt":0.24457235455965437,"score_spread":0.22899817705740935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111124108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02481494,0.00003495343,0.9732548,0.0009639335,0.00025239,0.00035265833,8.994263e-7,0.000059497404,0.00026595246],"genre_scores_gemma":[0.86081743,0.000011316142,0.13857919,0.00008935654,0.00013549859,0.00016263896,5.7424177e-7,0.00000487145,0.00019914635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994394,0.00003616381,0.00012464677,0.0001632103,0.000114993934,0.0001215765],"domain_scores_gemma":[0.9993195,0.00012573444,0.00005401652,0.00038146882,0.000091130416,0.00002818218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035226328,0.000058467733,0.000051303516,0.000029997653,0.0006737895,0.000053604974,0.0004163782,0.000025165775,0.000001038263],"category_scores_gemma":[0.00001404231,0.000034358,0.00006950266,0.00040401064,0.000076320786,0.00012624958,0.00005390142,0.000047172623,0.00001775942],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001329538,0.000029532725,0.00000779457,0.0000016239378,0.000009407564,4.5583462e-8,0.00050289795,0.0004300533,0.0016642391,0.038662605,0.00015882909,0.9585197],"study_design_scores_gemma":[0.00027535885,0.00051231944,0.0005037943,0.0000049377145,0.000018580606,0.000064276974,0.00040152564,0.8362313,0.057042062,0.010210944,0.09455814,0.00017678426],"about_ca_topic_score_codex":0.00003377584,"about_ca_topic_score_gemma":0.000014918164,"teacher_disagreement_score":0.9583429,"about_ca_system_score_codex":0.000009294054,"about_ca_system_score_gemma":0.000016921238,"threshold_uncertainty_score":0.5182312},"labels":[],"label_agreement":null},{"id":"W2111124811","doi":"10.1109/ecctd.2009.5274961","title":"High speed VLSI implementation of a finite field multiplier using redundant representation","year":2009,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Very-large-scale integration; Computer science; Electronic engineering; Finite field; Clock rate; CMOS; Domino logic; Logic synthesis; Integrated circuit design; Arithmetic; Logic gate; Embedded system; Mathematics; Algorithm; Logic family; Engineering","score_opus":0.029720815596601054,"score_gpt":0.32270169311479024,"score_spread":0.2929808775181892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111124811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47879145,0.000006361662,0.519862,0.00044518866,0.00010559323,0.00008872842,6.690391e-7,0.000054715212,0.00064531196],"genre_scores_gemma":[0.92813224,0.0000029519567,0.0714537,0.00034395274,0.000027201611,6.1281867e-7,0.000002087303,0.0000018942644,0.000035340057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992887,0.000045464112,0.000212855,0.0001899225,0.00014211338,0.00012099326],"domain_scores_gemma":[0.9994192,0.00010734244,0.000097368174,0.00029414537,0.000051907136,0.000030040535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016971635,0.00006671778,0.00009237356,0.00012346038,0.00006377464,0.00004825399,0.00022494458,0.000026006386,0.00009585246],"category_scores_gemma":[0.000020967176,0.00006192949,0.00006284604,0.00039077684,0.000012238084,0.0003196887,0.000045635596,0.000042261454,0.0000030078509],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060297694,0.00012608377,0.0032022404,0.000012203091,0.000034532328,0.000007773441,0.0029854763,0.0017466691,0.17174341,0.49232024,0.0004722171,0.32728887],"study_design_scores_gemma":[0.0013358511,0.0005954914,0.02686828,0.000033985696,0.00003150033,0.0000096594895,0.0006213509,0.06534715,0.7615427,0.14312944,0.00016690721,0.00031770518],"about_ca_topic_score_codex":0.00019184026,"about_ca_topic_score_gemma":0.000010093691,"teacher_disagreement_score":0.5897993,"about_ca_system_score_codex":0.000009788781,"about_ca_system_score_gemma":0.000017121709,"threshold_uncertainty_score":0.25254112},"labels":[],"label_agreement":null},{"id":"W2111916081","doi":"10.1109/isit.1994.394851","title":"Fast parallel algorithms for decoding Reed-Solomon codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Berlekamp–Welch algorithm; Remainder; Parallel algorithm; Reed–Solomon error correction; List decoding; Parallel computing; Arithmetic; Sequential decoding; Mathematics; Concatenated error correction code; Block code","score_opus":0.047405293368868215,"score_gpt":0.26151064668241397,"score_spread":0.21410535331354574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111916081","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018604744,0.00018589121,0.9828581,0.0006172557,0.00024130392,0.00014347913,0.0000020671146,0.0003333929,0.013758029],"genre_scores_gemma":[0.4914466,0.00003889953,0.50578105,0.00047863903,0.000102460086,0.000045245335,0.0000014062966,0.000009704064,0.002095967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990923,0.000029588056,0.00015372424,0.00031400015,0.00011696513,0.00029346437],"domain_scores_gemma":[0.99929035,0.00017515778,0.00004268832,0.00037045515,0.00004178041,0.000079553676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025882374,0.00010895089,0.00012576648,0.00009471436,0.00020828775,0.0001521528,0.00064268266,0.000047441285,0.0000926072],"category_scores_gemma":[0.000023015875,0.000100056954,0.00012306892,0.00026918785,0.00003832398,0.00030960515,0.00011294132,0.00006228603,0.000059924016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005681052,0.000061807885,0.00019830743,0.00000791087,0.000018285738,0.0000034252184,0.0005251645,0.000056738318,0.00025304983,0.7039492,0.0040410464,0.29087937],"study_design_scores_gemma":[0.001024323,0.00039976832,0.00030665955,0.000030683914,0.000014894329,0.000033353346,0.00014592774,0.8311461,0.0020112924,0.14023618,0.024068028,0.00058275205],"about_ca_topic_score_codex":0.000005501734,"about_ca_topic_score_gemma":0.000008951674,"teacher_disagreement_score":0.8310894,"about_ca_system_score_codex":0.000009810258,"about_ca_system_score_gemma":0.000003917637,"threshold_uncertainty_score":0.40802044},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013025688746851864,"score_gpt":0.20439368484091025,"score_spread":0.19136799609405838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112446992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20514393,0.00017593654,0.79323155,0.00022659457,0.00010678724,0.00012673158,0.00001161307,0.0000733314,0.0009035194],"genre_scores_gemma":[0.9932684,0.0001480518,0.0062115793,0.00020651845,0.00006265595,0.000012706044,0.000017181434,0.000007374335,0.000065548236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907315,0.000059839564,0.00022047009,0.00031203212,0.00015316806,0.00018135873],"domain_scores_gemma":[0.9993596,0.00013565071,0.00010021499,0.00027318488,0.000042434887,0.00008891318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015137206,0.00015581379,0.00017066696,0.00032169206,0.00016666706,0.00012399854,0.00016773834,0.000070877475,0.000019680188],"category_scores_gemma":[0.000005431686,0.00014199983,0.0001016135,0.00058290723,0.00006512239,0.00017999376,0.000060119804,0.00008983368,0.0000015378045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008161564,0.00019958217,0.00934518,0.000047104135,0.000065291526,0.0000047703456,0.0005418229,0.000117121475,0.029643118,0.8958929,0.0011069727,0.062954485],"study_design_scores_gemma":[0.0038999938,0.0046364698,0.34945887,0.0005964128,0.0002718268,0.00005644789,0.00027548516,0.017192574,0.03798193,0.52904946,0.054435015,0.0021454834],"about_ca_topic_score_codex":0.000044762543,"about_ca_topic_score_gemma":0.000012240183,"teacher_disagreement_score":0.78812444,"about_ca_system_score_codex":0.0000030010729,"about_ca_system_score_gemma":0.000015659592,"threshold_uncertainty_score":0.57905847},"labels":[],"label_agreement":null},{"id":"W2112574687","doi":"10.1007/3-540-46416-6_31","title":"Enumerating Nondegenerate Permutations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block cipher; Combinatorics; Mathematics; Cryptosystem; Block (permutation group theory); Discrete mathematics; Physics; Cryptography; Algorithm","score_opus":0.0248043449733415,"score_gpt":0.2623609242255619,"score_spread":0.2375565792522204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112574687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011158354,0.00043345802,0.98313606,0.0003025985,0.0016564192,0.00020677668,0.0000032403266,0.00022340221,0.013926482],"genre_scores_gemma":[0.2099303,0.000032336287,0.78590435,0.0027602979,0.0008721511,0.000009441154,0.000007667267,0.000045690464,0.0004377817],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677944,0.000036556172,0.00047667438,0.0012860427,0.00076805404,0.00065323396],"domain_scores_gemma":[0.9977199,0.00049414695,0.00022353581,0.0011546494,0.00023192604,0.00017583132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013696877,0.0004479674,0.0003637946,0.0011939364,0.0005301418,0.0006918598,0.002626519,0.0002525759,0.00004270219],"category_scores_gemma":[0.000064561114,0.0004336139,0.00017072474,0.0009769097,0.0005535093,0.0005541267,0.0008313466,0.0007860453,0.00006338088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022226634,0.000013984712,0.000017553544,0.000011450107,0.000007902431,0.000070414775,0.00076942856,0.009848164,0.00022970092,0.31865853,0.000007929447,0.6703627],"study_design_scores_gemma":[0.00020521978,0.0001556428,0.000056492518,0.00025208807,0.000009647375,0.00010248677,2.4681842e-7,0.29743487,0.0027901174,0.6958156,0.0023133613,0.0008642202],"about_ca_topic_score_codex":0.00000715678,"about_ca_topic_score_gemma":0.00006136268,"teacher_disagreement_score":0.6694985,"about_ca_system_score_codex":0.00013845517,"about_ca_system_score_gemma":0.00036460315,"threshold_uncertainty_score":0.9998116},"labels":[],"label_agreement":null},{"id":"W2112729878","doi":"10.1109/isit.2010.5513718","title":"A new class of ternary and quaternary sequences with two-level autocorrelation","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Hadamard transform; Autocorrelation; Golomb coding; Decimation; Complementary sequences; Pseudorandom number generator; Mathematics; Combinatorics; Algorithm; Computer science; Statistics; Artificial intelligence; Telecommunications","score_opus":0.014802321738436082,"score_gpt":0.23544762081390372,"score_spread":0.22064529907546765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112729878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43272755,0.000009895979,0.5622816,0.00039701996,0.00012091793,0.00006606603,4.211593e-7,0.00006602381,0.004330521],"genre_scores_gemma":[0.83493996,0.0000012261506,0.16460358,0.000063690655,0.000025801133,0.0000023719806,2.7196563e-7,0.0000024291178,0.0003607009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949133,0.00002094953,0.00010019301,0.00017583244,0.00011954181,0.000092172355],"domain_scores_gemma":[0.9995626,0.00005929609,0.00005765634,0.00023486909,0.000023864373,0.000061691426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014411678,0.0000708241,0.00007614129,0.00007530268,0.000042058564,0.000048305526,0.00029436714,0.000028659124,0.000033401902],"category_scores_gemma":[0.0000043512773,0.00004962757,0.000021226091,0.00017254829,0.00006315206,0.00037506013,0.00007929464,0.00009944119,0.000003859693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032116193,0.000024787185,0.09730983,0.000008956628,0.000018426512,0.000009458329,0.000734901,0.00002885889,0.013544992,0.79742247,0.00012788844,0.09073731],"study_design_scores_gemma":[0.0023066348,0.0012772009,0.30032682,0.00013683262,0.000033867847,0.00043981808,0.00013971468,0.2078387,0.0234925,0.46100456,0.0022325602,0.0007708012],"about_ca_topic_score_codex":0.00026454646,"about_ca_topic_score_gemma":0.0001397342,"teacher_disagreement_score":0.40221238,"about_ca_system_score_codex":0.0000017371899,"about_ca_system_score_gemma":0.00004373132,"threshold_uncertainty_score":0.20237537},"labels":[],"label_agreement":null},{"id":"W2113594177","doi":"10.1109/tit.2009.2032818","title":"${\\BBZ}_4$-Valued Quadratic Forms and Quaternary Sequence Families","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Sequence (biology); Algorithm; Computer science; Combinatorics; Mathematics; Biology; Genetics","score_opus":0.01237484903717348,"score_gpt":0.2342085310195714,"score_spread":0.22183368198239792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113594177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04449709,0.000019967209,0.95033926,0.00028796538,0.0002818909,0.00017194281,0.0000080718755,0.00033731165,0.0040564868],"genre_scores_gemma":[0.9944395,0.000055452354,0.003790351,0.0016047397,0.000010540389,0.000021096459,0.0000021906972,0.000003744734,0.000072401956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989805,0.000099131685,0.00032449057,0.00015470988,0.0002263775,0.00021479573],"domain_scores_gemma":[0.9992258,0.00012601481,0.0000999915,0.00040304154,0.000055233446,0.00008990586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053679105,0.00016862224,0.00013451507,0.00037219093,0.0003649264,0.0002260348,0.00038417024,0.0000709352,0.000028570768],"category_scores_gemma":[0.000007300075,0.00014571792,0.00008981684,0.000399142,0.00009320762,0.003433647,0.0000024401072,0.00018912382,0.00011079439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084422965,0.000050038114,0.0000030574138,0.00001955571,0.000019428684,0.0000014681398,0.0049858796,0.0013183343,0.00033252404,0.6101245,0.00002831405,0.38303244],"study_design_scores_gemma":[0.0014179095,0.0012078033,0.00056281436,0.0001515442,0.000045778565,0.00014275582,0.0019764705,0.09499393,0.025256658,0.8717863,0.0016055038,0.0008525146],"about_ca_topic_score_codex":0.000004241059,"about_ca_topic_score_gemma":0.0000012895081,"teacher_disagreement_score":0.9499424,"about_ca_system_score_codex":0.0000291731,"about_ca_system_score_gemma":0.00003274587,"threshold_uncertainty_score":0.59422046},"labels":[],"label_agreement":null},{"id":"W2113785162","doi":"10.1109/iscas.1990.112396","title":"Improved cellular structures for bit-steered ROM finite ring systolic arrays","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Pipeline (software); Computation; Computer science; Spice; Ring (chemistry); Logic gate; Latency (audio); Parallel computing; Bit (key); CMOS; Word (group theory); Computer hardware; Algorithm; Computational science; Electronic engineering; Mathematics; Engineering","score_opus":0.021173163959831754,"score_gpt":0.21029382068510596,"score_spread":0.1891206567252742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113785162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019676447,0.00023414461,0.9732945,0.00017960473,0.00034932923,0.00024527687,0.000004360633,0.00037565624,0.0056406707],"genre_scores_gemma":[0.9534576,0.0000038479907,0.044869795,0.00020581862,0.00010668016,0.000027963604,0.0000016210495,0.000011527416,0.00131513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989562,0.000038689937,0.00018864684,0.00036964766,0.00011823672,0.0003285806],"domain_scores_gemma":[0.9990408,0.0001850307,0.00006306537,0.00057479885,0.00004484926,0.00009149731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016982586,0.00015651286,0.0001614081,0.00014363472,0.00021007347,0.0001989538,0.0007530421,0.00006371481,0.000237242],"category_scores_gemma":[0.00003684672,0.00013411525,0.00013314682,0.00032297877,0.000031902517,0.00024342543,0.00011751871,0.000088654655,0.00003483257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012303856,0.00004782011,0.000024922228,0.00006302523,0.000052427833,0.000005329619,0.000802377,0.00030747274,0.070456274,0.89247304,0.0007267198,0.03502827],"study_design_scores_gemma":[0.0011110757,0.00031540185,0.00011830793,0.000031161097,0.0000264864,0.000011659085,0.000058611393,0.8357064,0.05285785,0.09293677,0.016201055,0.00062520447],"about_ca_topic_score_codex":0.000009747847,"about_ca_topic_score_gemma":0.000005176634,"teacher_disagreement_score":0.93378115,"about_ca_system_score_codex":0.000011634215,"about_ca_system_score_gemma":0.0000066722605,"threshold_uncertainty_score":0.5469062},"labels":[],"label_agreement":null},{"id":"W2114064510","doi":"10.1109/pacrim.2011.6033011","title":"Multicarrier error correction using T-codes","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Code word; Computer science; Code (set theory); Algorithm; Error detection and correction; Transmission (telecommunications); Forward error correction; Variable (mathematics); Domain (mathematical analysis); Decoding methods; Discrete mathematics; Theoretical computer science; Mathematics; Telecommunications; Programming language","score_opus":0.07120405676965574,"score_gpt":0.2644219022569285,"score_spread":0.19321784548727278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114064510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115392365,0.000008644154,0.8560034,0.000012191616,0.00088545243,0.00003590188,1.1091842e-7,0.0002170351,0.0274449],"genre_scores_gemma":[0.89586836,4.4152236e-7,0.10377788,0.000115458075,0.000019448207,0.0000014990642,7.792947e-8,0.0000027518693,0.00021409302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954927,0.000033574175,0.00007287121,0.00015720325,0.000065700326,0.0001214039],"domain_scores_gemma":[0.99963504,0.000024126448,0.000021486743,0.00024627344,0.000027919043,0.000045132576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013835162,0.000056531513,0.000052285068,0.00006938455,0.000095906835,0.000033238044,0.00025890046,0.000025584764,0.00014885952],"category_scores_gemma":[0.000013212268,0.000047881254,0.000046831054,0.00022338978,0.000031233838,0.00026310427,0.000072389965,0.00004625316,0.0000301899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003233098,0.00016554305,0.00851722,0.000005946938,0.000040971572,0.000012532082,0.0063298047,0.00004851141,0.008111866,0.8670825,0.0007582637,0.108894534],"study_design_scores_gemma":[0.00054333085,0.0002616072,0.020752149,0.000040746392,0.000034171422,0.00009752787,0.0005830568,0.764642,0.09506756,0.113396674,0.0038377754,0.0007434232],"about_ca_topic_score_codex":0.00004877696,"about_ca_topic_score_gemma":0.000008171049,"teacher_disagreement_score":0.780476,"about_ca_system_score_codex":0.000006566562,"about_ca_system_score_gemma":0.0000103766815,"threshold_uncertainty_score":0.1952541},"labels":[],"label_agreement":null},{"id":"W2114412781","doi":"10.1016/j.jsc.2011.08.006","title":"Detecting lacunary perfect powers and computing their roots","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lacunary function; Mathematics; Polynomial; Integer (computer science); Combinatorics; Computation; Randomized algorithm; Representation (politics); Conjecture; Discrete mathematics; Algorithm; Mathematical analysis; Computer science","score_opus":0.021891256590385367,"score_gpt":0.23571256640937882,"score_spread":0.21382130981899344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114412781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5936849,0.00016975618,0.40512374,0.00005133282,0.0002585224,0.000032592296,1.06976934e-7,0.000032625274,0.00064640504],"genre_scores_gemma":[0.9742421,0.000008077442,0.025555624,0.00008657703,0.00009900936,2.1158218e-7,1.2164813e-7,0.0000067526707,0.0000015507499],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990273,0.0001622621,0.0003396803,0.00014528078,0.00016302237,0.00016242113],"domain_scores_gemma":[0.99905807,0.00023830251,0.00036347785,0.00010675539,0.00014172701,0.00009165336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097059354,0.0001148158,0.00019133561,0.00029093807,0.00016135914,0.000091708505,0.00030211304,0.000043009986,0.0000042260676],"category_scores_gemma":[0.000045684264,0.00009614533,0.00010522342,0.000338035,0.000042581705,0.0004447796,0.000118113385,0.00022393033,0.0000018634724],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007622763,0.00012967343,0.009159725,0.00004181041,0.00010752008,0.00006767961,0.033941995,0.0009251296,0.003130707,0.013959174,0.00008314276,0.9383772],"study_design_scores_gemma":[0.0024052416,0.0024632164,0.46226946,0.00048915314,0.00009109563,0.0039805328,0.003940624,0.3011213,0.006373814,0.21572676,0.0002721363,0.0008666803],"about_ca_topic_score_codex":0.000004853191,"about_ca_topic_score_gemma":8.336697e-7,"teacher_disagreement_score":0.93751055,"about_ca_system_score_codex":0.000017767296,"about_ca_system_score_gemma":0.000031333737,"threshold_uncertainty_score":0.39206928},"labels":[],"label_agreement":null},{"id":"W2115470417","doi":"10.1109/acssc.2004.1399512","title":"A family of rate 1/2 modified binary block repetition codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Block code; Linear code; Concatenated error correction code; Hamming code; Mathematics; Algorithm; Decoding methods; Encoder; Block (permutation group theory); Binary number; Discrete mathematics; Computer science; Arithmetic; Combinatorics; Statistics","score_opus":0.0173814297407639,"score_gpt":0.23082777630645654,"score_spread":0.21344634656569264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115470417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7134872,0.00009054062,0.24518386,0.0007056204,0.0000978072,0.00007563501,0.0000014883915,0.00023005444,0.04012779],"genre_scores_gemma":[0.981641,0.000017798531,0.017590495,0.00037823917,0.00002875428,0.0000041201088,6.7039264e-7,0.000002675491,0.00033626542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993999,0.00006482971,0.0001476566,0.00017759143,0.00009510874,0.00011493167],"domain_scores_gemma":[0.9994547,0.000065567605,0.000049164333,0.00035039548,0.000044987697,0.000035201767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032173996,0.00006565079,0.00009041174,0.00010245189,0.00005052784,0.000027661008,0.00033929577,0.000028802771,0.000019437606],"category_scores_gemma":[0.00000986344,0.000056966688,0.00006506305,0.000313589,0.000039393155,0.00022607716,0.0000887493,0.000045134726,0.000022969665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022208334,0.00010576774,0.00007106849,0.000008501766,0.000012503337,0.0000029074401,0.00021010924,0.001064666,0.06341372,0.9207992,0.0009985236,0.013290844],"study_design_scores_gemma":[0.002287381,0.0011549487,0.025996132,0.00017597097,0.0000413347,0.000043655295,0.00020127054,0.41513577,0.2578619,0.27416196,0.021841021,0.0010986268],"about_ca_topic_score_codex":0.00000935028,"about_ca_topic_score_gemma":0.0000029353366,"teacher_disagreement_score":0.6466372,"about_ca_system_score_codex":0.0000058025907,"about_ca_system_score_gemma":0.000015522022,"threshold_uncertainty_score":0.23230341},"labels":[],"label_agreement":null},{"id":"W2115938507","doi":"10.1109/tit.2007.915972","title":"Guided Scrambling Polynomials for Periodic Quotient Relationship Patterns","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scrambling; Quotient; Encoder; Code word; Mathematics; Discrete mathematics; Coding (social sciences); Unit interval; Algorithm; Computer science; Arithmetic; Combinatorics; Decoding methods; Statistics","score_opus":0.03989844807251743,"score_gpt":0.25606012661305605,"score_spread":0.2161616785405386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115938507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051107027,0.000009976952,0.945906,0.00022591936,0.00090170855,0.00037492777,0.000039168008,0.00033641644,0.0010989003],"genre_scores_gemma":[0.9918678,0.00001256685,0.006918946,0.000826253,0.000035484933,0.00015104953,0.00000879255,0.00000844506,0.00017065536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987503,0.00012525996,0.0004779964,0.00016856022,0.00023093948,0.00024692304],"domain_scores_gemma":[0.998643,0.0005008387,0.00016000401,0.00046878474,0.0001325297,0.00009488376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007644778,0.00016152795,0.0001425257,0.0005290169,0.0010137269,0.00014113357,0.00043003468,0.000091734706,0.00006586331],"category_scores_gemma":[0.000033724547,0.00016013082,0.0002217967,0.0004035853,0.000074379896,0.0020337498,0.000002850024,0.00017603149,0.00014138441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035235233,0.00026016173,0.00032149168,0.00010811334,0.00011129118,0.000002055412,0.021471838,0.034894414,0.00020903164,0.81224763,0.0013381272,0.12868349],"study_design_scores_gemma":[0.018506275,0.0039067706,0.0150544355,0.00086614164,0.00039423606,0.0009732404,0.007121493,0.2073383,0.16107254,0.5134722,0.06513739,0.0061569614],"about_ca_topic_score_codex":0.000004088043,"about_ca_topic_score_gemma":0.0000013062298,"teacher_disagreement_score":0.9407608,"about_ca_system_score_codex":0.000058829526,"about_ca_system_score_gemma":0.00007982219,"threshold_uncertainty_score":0.77968705},"labels":[],"label_agreement":null},{"id":"W2116143063","doi":"","title":"The LLL algorithm using fast givens","year":2011,"lang":"en","type":"article","venue":"IEEE Asia-Pacific Conference on Synthetic Aperture Radar","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lattice reduction; Basis (linear algebra); Lattice (music); Lattice problem; Reduction (mathematics); Algorithm; Time complexity; Mathematics; Cryptography; Polynomial; Computer science; Discrete mathematics; Statistics","score_opus":0.040448986740992635,"score_gpt":0.23656863290330082,"score_spread":0.1961196461623082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116143063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015013508,0.00022511592,0.8899661,0.0019803157,0.0023387638,0.0004111096,0.000024071986,0.00042906989,0.10312412],"genre_scores_gemma":[0.9523351,0.00010633025,0.046141926,0.00029591305,0.0001485823,0.000029314328,0.0000015754122,0.000038493297,0.000902727],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99722797,0.00032590382,0.00038421224,0.0008064834,0.0005434819,0.0007119733],"domain_scores_gemma":[0.9972216,0.00055739336,0.00019386702,0.0016365547,0.00015921188,0.00023138268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000636967,0.000432442,0.00034425146,0.00016651113,0.00083322835,0.00033531914,0.0020046786,0.00017923141,0.0001701799],"category_scores_gemma":[0.00006990806,0.0002994284,0.00026131017,0.0005446923,0.0004687973,0.00027739146,0.00015117959,0.00048512244,0.00022720892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051299856,0.00018544935,0.000013352919,0.000008020641,0.00008042384,0.00006742277,0.0033902584,0.0000012831841,0.0037166262,0.4111313,0.0006254775,0.58072907],"study_design_scores_gemma":[0.001943582,0.0019328002,0.0005848958,0.0009721298,0.00022727407,0.0012110337,0.010955497,0.15523474,0.033812057,0.28700668,0.5019059,0.0042133764],"about_ca_topic_score_codex":0.000021931843,"about_ca_topic_score_gemma":0.0000068535655,"teacher_disagreement_score":0.9508338,"about_ca_system_score_codex":0.000050549424,"about_ca_system_score_gemma":0.00016125632,"threshold_uncertainty_score":0.99994576},"labels":[],"label_agreement":null},{"id":"W2116408881","doi":"10.1145/2517300.2517305","title":"Efficient hardware implementation of the stream cipher WG-16 with composite field arithmetic","year":2013,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Stream cipher; Field-programmable gate array; Arithmetic; Cryptography; Cipher; Field (mathematics); Parallel computing; Algorithm; Computer hardware; Mathematics; Encryption","score_opus":0.006045410193124273,"score_gpt":0.22410263957398222,"score_spread":0.21805722938085795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116408881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72001344,0.000011772455,0.2731517,0.001126244,0.00009005884,0.00023411956,9.705757e-7,0.00005264392,0.0053190426],"genre_scores_gemma":[0.99345183,3.76764e-7,0.005929791,0.00044054154,0.00000813811,0.000014737357,4.2862177e-7,0.0000027641593,0.0001513634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99940026,0.000046692923,0.00011528756,0.00014546531,0.0001688669,0.00012342149],"domain_scores_gemma":[0.9994055,0.00006880961,0.000059027,0.00037115221,0.00006538263,0.000030140392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084045045,0.00007068537,0.00006996219,0.00003816928,0.00008324809,0.000065023494,0.0004251089,0.000016543465,0.0003836597],"category_scores_gemma":[0.0000023590208,0.0000392983,0.00005259116,0.00029698526,0.000033037042,0.00006714706,0.00012903547,0.000051361872,0.000012756975],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021977565,0.0004121486,0.12346498,0.0000657355,0.00016073213,0.0000021518276,0.003814351,0.0019121291,0.0078678895,0.51867265,0.005588547,0.33801672],"study_design_scores_gemma":[0.002923545,0.0018040129,0.53501636,0.00021280599,0.00009913086,0.000035753743,0.0034012033,0.044035144,0.37500793,0.034043055,0.0024555996,0.0009654899],"about_ca_topic_score_codex":0.00027327365,"about_ca_topic_score_gemma":0.000055016964,"teacher_disagreement_score":0.4846296,"about_ca_system_score_codex":0.000008497378,"about_ca_system_score_gemma":0.000016208047,"threshold_uncertainty_score":0.42008048},"labels":[],"label_agreement":null},{"id":"W2117718425","doi":"10.1109/isit.2003.1228268","title":"Highly nonlinear s-boxes with reduced bound on maximum correlation (extended abstract)","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correlation attack; Upper and lower bounds; Stream cipher; Mathematics; Hadamard transform; Nonlinear system; Combinatorics; Algebraic number; Function (biology); Order (exchange); Discrete mathematics; Cryptography; Algorithm; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.01173066988507863,"score_gpt":0.22883528884066212,"score_spread":0.2171046189555835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117718425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57128423,0.000035003475,0.24615996,0.0006836169,0.00067301316,0.00024471447,0.0000016343516,0.00055345555,0.1803644],"genre_scores_gemma":[0.9659818,0.0000031400511,0.032864828,0.00033781966,0.000031918677,0.000006482187,0.0000025069053,0.000009130078,0.0007624084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989827,0.000048929738,0.0001546874,0.00034772552,0.00023773247,0.00022821514],"domain_scores_gemma":[0.99919623,0.00010434621,0.00006991485,0.0004893434,0.00005665334,0.000083540246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027036347,0.0001438715,0.0001106863,0.00012697167,0.00017647367,0.00017459795,0.0003176595,0.000056108976,0.000102517595],"category_scores_gemma":[0.000024720703,0.000108651366,0.000055493936,0.00042150475,0.000053666794,0.00033002562,0.000023206065,0.00014572329,0.00013319092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057777095,0.00018583446,0.00018050578,0.0000048416564,0.000022619446,0.000016682445,0.00021503265,0.00022749857,0.0013398967,0.98405963,0.0004478439,0.013241845],"study_design_scores_gemma":[0.004512409,0.0037868079,0.043257393,0.00022705777,0.00007048702,0.00023318213,0.00033105852,0.019464808,0.121376686,0.7246452,0.0797563,0.0023386206],"about_ca_topic_score_codex":0.000007126635,"about_ca_topic_score_gemma":0.000007778578,"teacher_disagreement_score":0.39469755,"about_ca_system_score_codex":0.000017982764,"about_ca_system_score_gemma":0.00005393625,"threshold_uncertainty_score":0.44306743},"labels":[],"label_agreement":null},{"id":"W2118738916","doi":"10.1155/s111086570220414x","title":"Low-Complexity Versatile Finite Field Multiplier in Normal Basis","year":2002,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Lethbridge","funders":"","keywords":"Multiplier (economics); Very-large-scale integration; Computer science; Pipeline (software); Finite field; Basis (linear algebra); Arithmetic; Computational science; Computer hardware; Computer architecture; Mathematics; Embedded system; Discrete mathematics","score_opus":0.027146521306878724,"score_gpt":0.268918607304453,"score_spread":0.24177208599757427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118738916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16918804,0.005910124,0.7902855,0.00195627,0.00091171847,0.00024658078,0.0000026513978,0.00017971787,0.031319354],"genre_scores_gemma":[0.9864124,0.00019427272,0.012169032,0.0010478487,0.00012914439,0.0000047369026,2.3846343e-7,0.0000104438395,0.00003189677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981886,0.00017386158,0.00046378688,0.00033817065,0.00038672466,0.00044885927],"domain_scores_gemma":[0.99892247,0.0004910269,0.00022445581,0.00018612568,0.000057509074,0.00011842903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062118814,0.00020287199,0.00023112174,0.0004722629,0.00026532795,0.00027433698,0.00078666495,0.00006329118,0.00035903577],"category_scores_gemma":[0.00012328557,0.00018546906,0.00009683461,0.0009917873,0.00008104999,0.002252763,0.00009364541,0.00081245025,0.00003153794],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012120385,0.0003046243,0.007458247,0.00005024702,0.0000035720755,0.00025031366,0.0017996973,0.010310101,0.00017652876,0.0026636438,0.000057963185,0.97680384],"study_design_scores_gemma":[0.0062969225,0.0018549442,0.010476868,0.0032628134,0.000016023929,0.0004096797,0.00076445437,0.7811063,0.014397175,0.164471,0.01497822,0.0019656145],"about_ca_topic_score_codex":0.000001265497,"about_ca_topic_score_gemma":0.000012806281,"teacher_disagreement_score":0.97483826,"about_ca_system_score_codex":0.000065861605,"about_ca_system_score_gemma":0.000026694122,"threshold_uncertainty_score":0.7563209},"labels":[],"label_agreement":null},{"id":"W2118962918","doi":"10.1016/s0012-365x(03)00280-2","title":"Splitting systems and separating systems","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016749313579064496,"score_gpt":0.24829603083223578,"score_spread":0.23154671725317127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118962918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15149991,0.00058949133,0.83976346,0.00010060188,0.00032766286,0.00024016491,0.0000021802646,0.00027691096,0.007199583],"genre_scores_gemma":[0.960957,0.00000964416,0.03884662,0.000025280486,0.0000636175,0.000019493173,8.654647e-7,0.000011572887,0.000065936656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989939,0.0000327815,0.0002978676,0.00023811252,0.00020337883,0.00023399718],"domain_scores_gemma":[0.9991876,0.00011253387,0.00014390412,0.0004374696,0.000036041416,0.00008245364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000575162,0.0001422776,0.00020804124,0.00007319393,0.00019884465,0.00054024387,0.0003727207,0.00004704708,5.8508937e-7],"category_scores_gemma":[0.000040594354,0.00011908749,0.000050645554,0.0002425388,0.000044077966,0.00026783158,0.00016991397,0.000094056944,0.000018003237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.427184e-7,0.000015010433,0.00006675967,0.00023138442,0.0000151624745,0.000006968947,0.0027908722,0.0010188915,0.00020395606,0.99543893,0.000012546143,0.00019896952],"study_design_scores_gemma":[0.0011553011,0.00024839473,0.00015072706,0.0020530047,0.00006546082,0.00057675916,0.0072720842,0.5919865,0.00073838443,0.39317635,0.0014770372,0.0011000629],"about_ca_topic_score_codex":0.000016751206,"about_ca_topic_score_gemma":6.267296e-7,"teacher_disagreement_score":0.80945706,"about_ca_system_score_codex":0.000018568848,"about_ca_system_score_gemma":0.00001783063,"threshold_uncertainty_score":0.5209584},"labels":[],"label_agreement":null},{"id":"W2119112132","doi":"10.1109/isit.2003.1228394","title":"Trace representation of binary e-th residue sequences of period p","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Period (music); Residue (chemistry); Binary number; TRACE (psycholinguistics); Representation (politics); Mathematics; Computer science; Chemistry; Arithmetic; Art; Philosophy; Political science; Organic chemistry","score_opus":0.02266298923944488,"score_gpt":0.26754272573814025,"score_spread":0.24487973649869538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119112132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90330726,0.00022667547,0.07526879,0.00020278481,0.00010357193,0.000068082845,7.4745753e-7,0.000050426162,0.020771628],"genre_scores_gemma":[0.96943164,0.000011810426,0.030342476,0.000018247485,0.0000042932475,0.0000022018514,2.2132954e-7,0.0000017889123,0.00018734187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931467,0.00012799253,0.00016805937,0.00016204304,0.00014348829,0.00008373426],"domain_scores_gemma":[0.9994309,0.000078587735,0.00008260607,0.00032981156,0.000053800868,0.000024303137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028127257,0.00005125575,0.00010320614,0.00008983073,0.0000377225,0.000014993577,0.0002952528,0.000024794266,0.00008461729],"category_scores_gemma":[0.00003950771,0.00004354469,0.00006418363,0.00052021554,0.00007964299,0.0002350326,0.000031377265,0.000034967725,0.0000027663423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011947912,0.00007145514,0.0051504103,0.000020298496,0.00001056135,0.000004639134,0.0015731185,0.00014039164,0.09152785,0.89806366,0.00020582543,0.00321982],"study_design_scores_gemma":[0.00029391225,0.0003668135,0.012922978,0.00003632985,0.000009605407,0.000023042756,0.00095399946,0.0010236021,0.89236367,0.091364145,0.00047900487,0.00016287845],"about_ca_topic_score_codex":0.000023732959,"about_ca_topic_score_gemma":0.0000043443024,"teacher_disagreement_score":0.8066995,"about_ca_system_score_codex":0.0000031729576,"about_ca_system_score_gemma":0.000034854424,"threshold_uncertainty_score":0.17757009},"labels":[],"label_agreement":null},{"id":"W2119258844","doi":"10.1109/tit.2005.853326","title":"Toward a General Correlation Theorem","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptography; Modulo; Mathematics; Discrete mathematics; S-box; Algebra over a field; Computer science; Algorithm; Pure mathematics; Block cipher","score_opus":0.011220516436408423,"score_gpt":0.2151863566428308,"score_spread":0.2039658402064224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119258844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034137096,0.000010854457,0.9785082,0.00045353538,0.00069430505,0.00014995215,0.000007710128,0.00043928702,0.016322475],"genre_scores_gemma":[0.9859527,0.00001248662,0.012052527,0.0015772476,0.000057105022,0.000038242466,0.0000036014067,0.0000057535954,0.0003003336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899715,0.00013044894,0.00030834883,0.00013207777,0.00023527123,0.00019667212],"domain_scores_gemma":[0.9992107,0.00014553266,0.000101820166,0.00038947476,0.00007494509,0.00007753139],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006107639,0.00014120356,0.00009823469,0.0003588106,0.00027394455,0.00016747222,0.00041997762,0.00008182714,0.00024147569],"category_scores_gemma":[0.000006256485,0.00013122476,0.00013910136,0.00043213624,0.000058287667,0.003056055,0.0000024975757,0.00021024703,0.00089169876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004444561,0.0000343382,7.005151e-7,0.000003948874,0.000014021065,1.7835039e-7,0.002368691,0.028649239,0.000029755689,0.6133925,0.00011284414,0.3553494],"study_design_scores_gemma":[0.0019858114,0.00042677502,0.00018004193,0.000061889834,0.00005325255,0.000096968506,0.0005823928,0.50483793,0.031919815,0.40766326,0.051259767,0.00093208754],"about_ca_topic_score_codex":0.0000014548738,"about_ca_topic_score_gemma":8.645246e-7,"teacher_disagreement_score":0.982539,"about_ca_system_score_codex":0.00005377447,"about_ca_system_score_gemma":0.000035243098,"threshold_uncertainty_score":0.9998862},"labels":[],"label_agreement":null},{"id":"W2119343098","doi":"10.1109/pacrim.2007.4313290","title":"When Can Interleaving Be Avoided for Reed-Solomon Coded Binary Markov Channels?","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Interleaving; Decoding methods; Markov chain; Algorithm; Code word; Channel (broadcasting); Binary number; Markov process; Computer science; Additive white Gaussian noise; Binary symmetric channel; Mathematics; Noise (video); Discrete mathematics; Low-density parity-check code; Arithmetic; Telecommunications; Statistics; Artificial intelligence","score_opus":0.02265834991264076,"score_gpt":0.2566265819012277,"score_spread":0.23396823198858696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119343098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09100845,0.00004730028,0.8966208,0.0026039938,0.0009031052,0.00030737123,0.0000029639366,0.00044769293,0.008058304],"genre_scores_gemma":[0.93566704,0.0000029495661,0.060668785,0.0017713225,0.00012832523,0.000020677266,0.0000051817087,0.000014328325,0.0017214025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861133,0.0000529,0.00026247426,0.00042748425,0.0001658951,0.0004798939],"domain_scores_gemma":[0.99882305,0.00034904262,0.0000787032,0.00052890484,0.00008093055,0.00013935851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013086331,0.00016856578,0.00018561396,0.0002519208,0.00022029715,0.00015299782,0.00092513015,0.00008063941,0.00004955189],"category_scores_gemma":[0.00004876405,0.00015442235,0.00015667734,0.00034347665,0.000059365284,0.00029806118,0.00029520338,0.00013110256,0.0000067152996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005082174,0.00031231312,0.0013253408,0.000105302024,0.00012867177,0.00008389254,0.013383179,0.000027162827,0.024415309,0.7532245,0.033033542,0.17345256],"study_design_scores_gemma":[0.005815109,0.0043741204,0.0037467433,0.00047291323,0.00010658579,0.00020351131,0.0045587528,0.096888445,0.18269584,0.6222203,0.07542147,0.0034962143],"about_ca_topic_score_codex":0.00006032898,"about_ca_topic_score_gemma":0.00019817382,"teacher_disagreement_score":0.84465855,"about_ca_system_score_codex":0.000034810393,"about_ca_system_score_gemma":0.000023941106,"threshold_uncertainty_score":0.6297161},"labels":[],"label_agreement":null},{"id":"W2119561941","doi":"10.1109/tcomm.2014.022314.120896","title":"Asymptotical Analysis of Several Multiple Description Scenarios with L≥ 3 Descriptions","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Erasure; Algorithm; Computer science; Lattice (music); Code (set theory); Mathematics; Theoretical computer science","score_opus":0.02844989013748888,"score_gpt":0.2391577841428268,"score_spread":0.2107078940053379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119561941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015131471,0.000016786544,0.9826099,0.00074045727,0.00010456657,0.00014380112,0.000023483446,0.00019151751,0.0010379718],"genre_scores_gemma":[0.9241978,0.0000319887,0.07548806,0.00012943125,0.000005737162,0.000059168964,0.000009659569,0.000009286091,0.00006887762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863863,0.0003553967,0.00030407347,0.00027072633,0.0002331147,0.00019804205],"domain_scores_gemma":[0.99650013,0.00059025263,0.000103629805,0.0025150036,0.00018671271,0.000104282095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034937906,0.00014888881,0.00024031686,0.0007308979,0.0005683834,0.000088353685,0.0013605881,0.00007151607,0.000036619018],"category_scores_gemma":[0.00001439642,0.00013835622,0.0002521525,0.0024264657,0.00026909358,0.00041765365,0.00001176417,0.00029809395,0.000017237524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018274324,0.00404615,0.0025514467,0.000029469415,0.0030521492,0.0000010220738,0.0043252716,0.4658767,0.0062257983,0.4576362,0.00011975975,0.0559533],"study_design_scores_gemma":[0.0004786616,0.00023818022,0.007022573,0.0000362021,0.0006666592,0.000005543324,0.00008500085,0.9871357,0.00084652257,0.0021820953,0.0010610987,0.00024177585],"about_ca_topic_score_codex":0.00008493978,"about_ca_topic_score_gemma":0.0009815374,"teacher_disagreement_score":0.9090663,"about_ca_system_score_codex":0.00004106804,"about_ca_system_score_gemma":0.000041961386,"threshold_uncertainty_score":0.5642003},"labels":[],"label_agreement":null},{"id":"W2119936466","doi":"10.1016/j.ffa.2010.10.002","title":"On constructing permutations of finite fields","year":2010,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":199,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of British Columbia; University of Lethbridge","funders":"","keywords":"Permutation (music); Mathematics; Combinatorics; Finite field; Set (abstract data type); Cyclic permutation; Permutation graph; Partial permutation; Discrete mathematics; Algebra over a field; Pure mathematics; Symmetric group; Computer science","score_opus":0.009601733691645173,"score_gpt":0.22736804589570872,"score_spread":0.21776631220406356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119936466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061159395,0.00002215776,0.9239047,0.00071844534,0.00010552697,0.00014181701,0.000022862163,0.00007003347,0.013855029],"genre_scores_gemma":[0.9921511,0.000009421061,0.0073861945,0.00029154654,0.00004346643,0.000066517896,0.000005679522,0.0000038695916,0.000042241685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946505,0.000018686344,0.00015509083,0.00019638572,0.000054681208,0.00011008041],"domain_scores_gemma":[0.99833983,0.0010453542,0.0000732276,0.00043554898,0.00005430419,0.00005176253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012546596,0.00008714108,0.0000993393,0.00009886639,0.00019223108,0.000048317866,0.0003073532,0.00009109172,0.000054728083],"category_scores_gemma":[0.000054094067,0.00007392836,0.000059623995,0.00028512522,0.0000904302,0.000082177066,0.00007580768,0.00025258027,0.000008626822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001923079,0.00003187843,0.00017654171,0.000006939439,0.0000089259975,1.514912e-7,0.0007394163,0.000035517158,0.00044393662,0.9582627,0.000037544174,0.040254556],"study_design_scores_gemma":[0.00024783,0.00013142926,0.0006528342,0.000021935792,0.000009411666,0.00001064473,0.00025666892,0.00949751,0.0034528824,0.9741365,0.011369315,0.00021305645],"about_ca_topic_score_codex":0.0000058849378,"about_ca_topic_score_gemma":0.000015502295,"teacher_disagreement_score":0.93099165,"about_ca_system_score_codex":0.0000010808294,"about_ca_system_score_gemma":0.000019033674,"threshold_uncertainty_score":0.30147108},"labels":[],"label_agreement":null},{"id":"W2120095615","doi":"10.1109/isit.2004.1365219","title":"Bounds on the minimum distances of a class of q-ary images of q/sup m/-ary irreducible cyclic codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Code word; Finite field; Upper and lower bounds; Characterization (materials science); Mathematics; Discrete mathematics; Code (set theory); Physics; Decoding methods; Algorithm; Mathematical analysis; Computer science","score_opus":0.014176793379500164,"score_gpt":0.2358233241332501,"score_spread":0.22164653075374993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120095615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.931359,0.00045361635,0.025939029,0.001835924,0.0001523334,0.00014518645,0.000017916953,0.0000514032,0.040045593],"genre_scores_gemma":[0.99598527,0.000042177402,0.0036316058,0.00016723022,0.000015347558,0.000006089794,7.685574e-7,0.0000047220974,0.00014680522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895996,0.00007987586,0.0003050319,0.00023310786,0.00025672882,0.00016526852],"domain_scores_gemma":[0.99867564,0.0003586186,0.00017219885,0.00067932165,0.000064011074,0.000050231265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040421737,0.00011634087,0.00022683389,0.00012288509,0.000070176284,0.000027754922,0.00092331035,0.000036514124,0.00006372349],"category_scores_gemma":[0.00005281752,0.00007469653,0.00016100037,0.00058179843,0.00044907493,0.00019584848,0.000137009,0.00007905284,0.000004007447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006735069,0.00035794722,0.0006169349,0.00006913075,0.000054733107,0.0000016570858,0.0013372935,0.00018732628,0.027791558,0.96595484,0.0007615097,0.0027996926],"study_design_scores_gemma":[0.00065717986,0.000870827,0.004941796,0.0003093042,0.000027376169,0.000006315587,0.0010997826,0.0005089486,0.6047966,0.38530144,0.0012128926,0.00026757972],"about_ca_topic_score_codex":0.000046075515,"about_ca_topic_score_gemma":0.000009048269,"teacher_disagreement_score":0.5806534,"about_ca_system_score_codex":0.000008441866,"about_ca_system_score_gemma":0.000082448445,"threshold_uncertainty_score":0.3046036},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016552816498077758,"score_gpt":0.25349352498912764,"score_spread":0.23694070849104987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120749565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015337406,0.00021479843,0.9831149,0.00039746417,0.0007045641,0.000036593978,0.000006839436,0.000012710657,0.00017473924],"genre_scores_gemma":[0.9477864,0.00040610554,0.050993856,0.0002142044,0.00047361554,0.0000013151234,0.0000027505735,0.000008842441,0.00011293988],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867743,0.00011761881,0.0005016018,0.00011780313,0.00040646808,0.00017907491],"domain_scores_gemma":[0.9983333,0.0005100447,0.0005285605,0.00031270372,0.0002370908,0.0000783486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006918323,0.0001036288,0.00028066686,0.0004238931,0.00016027829,0.0001219694,0.00079441816,0.000057575187,0.00003262776],"category_scores_gemma":[0.000062870895,0.00006976686,0.00041385763,0.0016926447,0.000063569954,0.00033300207,0.00008751934,0.0001941563,0.0000013323842],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012289654,0.00023952621,0.006183843,0.0000059526064,0.002750834,0.00008201048,0.002592527,0.0050294297,0.0005692161,0.008521521,0.0013892499,0.972513],"study_design_scores_gemma":[0.0013168947,0.000936724,0.05671414,0.000042878342,0.0007449673,0.000096577074,0.00019594714,0.8808863,0.000575382,0.011915665,0.04620917,0.0003653511],"about_ca_topic_score_codex":0.000016392069,"about_ca_topic_score_gemma":0.0000072587163,"teacher_disagreement_score":0.97214764,"about_ca_system_score_codex":0.00002086401,"about_ca_system_score_gemma":0.0000473248,"threshold_uncertainty_score":0.284501},"labels":[],"label_agreement":null},{"id":"W2121122045","doi":"10.1109/ccece.2003.1226223","title":"Soft Reed-Solomon decoding for concatenated codes","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université du Québec; Institut National de la Recherche Scientifique","funders":"","keywords":"Decoding methods; Convolutional code; Sequential decoding; Concatenated error correction code; Algorithm; Serial concatenated convolutional codes; Computer science; List decoding; Additive white Gaussian noise; Reed–Solomon error correction; Turbo code; Block Error Rate; Block code; Channel (broadcasting); Telecommunications","score_opus":0.02030091934969145,"score_gpt":0.25498024080667375,"score_spread":0.2346793214569823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121122045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028215813,0.0000475011,0.9654806,0.00075137295,0.00021941631,0.0001444004,0.0000014723277,0.00045086435,0.004688542],"genre_scores_gemma":[0.8983573,0.000004050945,0.10085295,0.0005991501,0.000029134593,0.000018403955,0.000001907665,0.0000057141356,0.0001314226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992584,0.000016886863,0.0001357994,0.0002591331,0.00008598306,0.0002438043],"domain_scores_gemma":[0.99942875,0.00013431048,0.000040020648,0.00027442878,0.000056236007,0.000066237124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029302837,0.00009447926,0.00010844224,0.00008504239,0.00017453684,0.00011721656,0.0005294283,0.000045986242,0.000014055539],"category_scores_gemma":[0.00004366308,0.000080641905,0.000091235,0.00028930278,0.00004316135,0.0002666664,0.00008977157,0.000052700892,0.000025542136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012638946,0.000031603005,0.0001549319,0.000006716139,0.000014275834,0.0000028966897,0.00026715928,0.00012170032,0.0037651334,0.97762704,0.00025317085,0.017742753],"study_design_scores_gemma":[0.0017720618,0.00038018223,0.00030641272,0.000044600623,0.0000145010345,0.000026760308,0.00010932747,0.017513223,0.08263,0.89187115,0.0048856433,0.00044615328],"about_ca_topic_score_codex":0.00001659938,"about_ca_topic_score_gemma":0.000019987468,"teacher_disagreement_score":0.87014145,"about_ca_system_score_codex":0.0000197516,"about_ca_system_score_gemma":0.000028136668,"threshold_uncertainty_score":0.32884815},"labels":[],"label_agreement":null},{"id":"W2121484689","doi":"10.1109/tcomm.2013.13.120317","title":"Grobner Bases for Lattices and an Algebraic Decoding Algorithm","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Gröbner basis; Decoding methods; Algebraic number; Algorithm; Computer science; Berlekamp–Welch algorithm; List decoding; Sequential decoding; Algebra over a field; Mathematics; Theoretical computer science; Block code; Computation; Concatenated error correction code; Pure mathematics","score_opus":0.04023690450236831,"score_gpt":0.2959592228082651,"score_spread":0.25572231830589676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121484689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039222087,0.00011888023,0.99243504,0.0023894012,0.00014294063,0.00030723197,0.000019840867,0.00021832947,0.0004461023],"genre_scores_gemma":[0.6775977,0.00014619096,0.32138982,0.00041271205,0.000014731551,0.00033856858,0.0000042800975,0.00000991497,0.00008606208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992205,0.00012670396,0.00016750727,0.00023169706,0.00007970347,0.00017391883],"domain_scores_gemma":[0.99761057,0.00071156817,0.00004859242,0.0014319464,0.00009096641,0.00010634044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020605403,0.00011453754,0.000104362014,0.00017739456,0.0008730195,0.00024932894,0.0010712745,0.000047127844,0.000047667723],"category_scores_gemma":[0.0000048889133,0.00011294302,0.00007685994,0.00030011666,0.00013006965,0.0009597369,0.000010617591,0.00014901385,0.000023571627],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035906444,0.00039066994,0.000014549542,0.000010124575,0.000050040922,1.4567199e-7,0.00090618106,0.00012807107,0.00078921235,0.097263776,0.00024065774,0.900203],"study_design_scores_gemma":[0.0008721221,0.00053029606,0.00051759096,0.000073469164,0.00008981357,0.00002371369,0.00046202372,0.8250533,0.0046609403,0.15172887,0.015337548,0.000650367],"about_ca_topic_score_codex":0.00006007388,"about_ca_topic_score_gemma":0.00008520524,"teacher_disagreement_score":0.89955264,"about_ca_system_score_codex":0.000012097925,"about_ca_system_score_gemma":0.000019783125,"threshold_uncertainty_score":0.67146486},"labels":[],"label_agreement":null},{"id":"W2122036794","doi":"10.1109/isit.2012.6284659","title":"New constructions of codes for asymmetric channels via concatenation","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Linear code; Concatenation (mathematics); Block code; Concatenated error correction code; Reed–Muller code; Mathematics; Expander code; Discrete mathematics; Computer science; Algorithm; Combinatorics; Decoding methods","score_opus":0.020538111533601817,"score_gpt":0.25498831020990187,"score_spread":0.23445019867630004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122036794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036057245,0.000086679145,0.9918715,0.0001641512,0.00065111025,0.00010855235,0.0000013960208,0.00007352943,0.0034373868],"genre_scores_gemma":[0.8845053,0.0000023389978,0.115192905,0.00005396483,0.000076825054,0.0000066572,0.0000010821376,0.0000020640155,0.0001589152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995776,0.000018468454,0.000110839566,0.00008575803,0.000071894814,0.00013543644],"domain_scores_gemma":[0.9995185,0.0001514581,0.0000451732,0.00014811175,0.00006928499,0.00006743707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023155869,0.000048357997,0.000077257355,0.00019910424,0.00005861398,0.000020718855,0.00019905387,0.00002701926,0.000026424312],"category_scores_gemma":[0.000030586496,0.00004190636,0.00006164883,0.00058905204,0.000026765643,0.00033805665,0.000035452704,0.000022320875,0.000005424284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023583466,0.000019050856,0.0005071563,0.0000042979,0.000011207657,1.2403571e-8,0.00015000088,0.000010333231,0.0006455146,0.8982115,0.0006034273,0.09983518],"study_design_scores_gemma":[0.001791501,0.00046450397,0.005622524,0.000025700054,0.00006463959,0.000054672593,0.00022791295,0.040292103,0.26842475,0.6620963,0.020375289,0.000560079],"about_ca_topic_score_codex":0.000014294105,"about_ca_topic_score_gemma":0.0000010813325,"teacher_disagreement_score":0.88089955,"about_ca_system_score_codex":0.0000057757115,"about_ca_system_score_gemma":0.000018546958,"threshold_uncertainty_score":0.17088918},"labels":[],"label_agreement":null},{"id":"W2122046957","doi":"10.1109/isit.1993.748605","title":"On the Construction and Dimensionality of Linear Block Code Trellises","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Trellis (graph); Space–time trellis code; Mathematics; Upper and lower bounds; Trellis quantization; Isomorphism (crystallography); Dimension (graph theory); Combinatorics; Convolutional code; Discrete mathematics; Algorithm; Linear code; Decoding methods; Block code; Computer science; Mathematical analysis","score_opus":0.015294478001681966,"score_gpt":0.22936406798184034,"score_spread":0.21406958998015838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122046957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9303331,0.000049650578,0.059882313,0.0037904882,0.00007476788,0.000056884088,0.0000018770374,0.000046364574,0.005764587],"genre_scores_gemma":[0.98622787,0.000009478209,0.013272766,0.00041341977,0.000019010788,8.7277317e-7,1.0733821e-7,9.887306e-7,0.000055481305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964666,0.00004210672,0.00007522606,0.00010124172,0.000083838044,0.00005090494],"domain_scores_gemma":[0.99949986,0.00024584198,0.000027813523,0.00018562147,0.000022093429,0.000018744831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001876895,0.00003930834,0.000047320344,0.00002401747,0.000076609125,0.000012179384,0.00012602712,0.000015247528,0.000033720225],"category_scores_gemma":[0.000016237831,0.000023132663,0.00002578803,0.00010520835,0.00009970039,0.000059030248,0.000046540492,0.000039387465,0.000004916561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065753497,0.000022059876,0.00019444161,0.0000011777753,0.000004686483,1.0135787e-7,0.00008010764,0.00008030274,0.0005729033,0.99088776,0.00027983627,0.007870065],"study_design_scores_gemma":[0.0008630249,0.0004694454,0.0069072833,0.00006757361,0.000026947926,0.00007134193,0.00017524998,0.07246418,0.21624747,0.6607417,0.04155631,0.00040946802],"about_ca_topic_score_codex":0.0000031653926,"about_ca_topic_score_gemma":0.0000038692006,"teacher_disagreement_score":0.33014604,"about_ca_system_score_codex":0.0000018809153,"about_ca_system_score_gemma":0.0000059963863,"threshold_uncertainty_score":0.094332255},"labels":[],"label_agreement":null},{"id":"W2122414545","doi":"10.1109/isit.1991.695140","title":"A Neural Network Implementation Of A Permutation Decoder For Binary Cyclic Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Code word; Decoding methods; Permutation (music); Computer science; Parity-check matrix; Algorithm; Artificial neural network; Hopfield network; Binary number; Word (group theory); Theoretical computer science; Mathematics; Arithmetic; Artificial intelligence","score_opus":0.01692470651120803,"score_gpt":0.3032888610210897,"score_spread":0.2863641545098817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122414545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44768065,0.00004195433,0.5511585,0.0005951846,0.00006619697,0.00014604644,0.0000015373412,0.00006180905,0.00024811068],"genre_scores_gemma":[0.9153587,0.0000028003242,0.08417704,0.00033345912,0.00007048972,0.000027932376,0.000005162622,0.0000031574912,0.000021255477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945736,0.00003328281,0.00015668846,0.00013745471,0.000074246826,0.000140948],"domain_scores_gemma":[0.9996263,0.000104739534,0.00006219214,0.00013966486,0.00004217938,0.000024925695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020983287,0.000056950685,0.00007182422,0.000058191366,0.00007966066,0.00003170712,0.00018953782,0.00001718987,0.000039940598],"category_scores_gemma":[0.0000038694757,0.000051346928,0.0000694279,0.00022214593,0.00001632387,0.00031547996,0.000039196286,0.000020846404,0.0000024392216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003907752,0.000062520994,0.004436489,0.000019135554,0.00002959163,3.7929684e-7,0.0016235177,0.009453615,0.003940792,0.6101237,0.0028401753,0.367431],"study_design_scores_gemma":[0.0018408733,0.0008153706,0.043892074,0.000020231762,0.000039483704,0.000010755581,0.00060144794,0.80745614,0.016336596,0.12305107,0.0055338223,0.00040213214],"about_ca_topic_score_codex":0.000008237036,"about_ca_topic_score_gemma":0.00006245751,"teacher_disagreement_score":0.79800254,"about_ca_system_score_codex":0.000007414026,"about_ca_system_score_gemma":0.000013647539,"threshold_uncertainty_score":0.20938669},"labels":[],"label_agreement":null},{"id":"W2122501450","doi":"10.1109/lcomm.2005.1576588","title":"A family of low-complexity binary linear codes for bluetooth and BLAST signaling applications","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bluetooth; Computer network; Theoretical computer science; Telecommunications; Wireless","score_opus":0.04715343231336983,"score_gpt":0.2871259003855308,"score_spread":0.239972468072161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122501450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18791609,0.00038593682,0.8026133,0.0083682835,0.00002928725,0.0003779955,0.000028390177,0.000121053126,0.00015967015],"genre_scores_gemma":[0.71061975,0.00005287899,0.28762087,0.0014940597,0.00003852486,0.00015289501,0.000009136411,0.0000072932053,0.0000045572197],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991694,0.00010101114,0.000264772,0.00021201593,0.00009364875,0.00015914827],"domain_scores_gemma":[0.9976428,0.0005033863,0.00012843477,0.0015863596,0.00008524703,0.0000537847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003483467,0.00010805843,0.00014830702,0.00015760878,0.0003740499,0.00004945955,0.0015930379,0.00003410717,0.0000014281568],"category_scores_gemma":[0.000012071748,0.00011576038,0.00008644721,0.00038809242,0.00042463263,0.00030506798,0.00024594166,0.000121659985,0.000004882939],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002988054,0.00051204,0.0004612411,0.00012420752,0.000084125786,2.6396765e-7,0.0018286855,0.001963284,0.52916163,0.4286094,0.0014376673,0.035787538],"study_design_scores_gemma":[0.0044643055,0.0005873305,0.009622508,0.00064235955,0.00026471863,0.00003820131,0.00086655066,0.60050297,0.0845987,0.07504801,0.22084214,0.0025222222],"about_ca_topic_score_codex":0.000009956341,"about_ca_topic_score_gemma":0.00000893212,"teacher_disagreement_score":0.59853965,"about_ca_system_score_codex":0.000016467946,"about_ca_system_score_gemma":0.000022857519,"threshold_uncertainty_score":0.4720571},"labels":[],"label_agreement":null},{"id":"W2122840332","doi":"10.1007/3-540-36400-5_37","title":"Error Detection in Polynomial Basis Multipliers over Binary Extension Fields","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Computer science; Polynomial basis; Finite field arithmetic; Multiplier (economics); Binary number; Normal basis; Arithmetic; Multiplication (music); Error detection and correction; Basis (linear algebra); Polynomial; Algorithm; Cryptography; Theoretical computer science; Galois theory; Mathematics; Discrete mathematics","score_opus":0.01494533657790721,"score_gpt":0.2364174286268894,"score_spread":0.2214720920489822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122840332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050987145,0.00023718267,0.98957807,0.0003550919,0.0029989004,0.00031651798,0.000002134687,0.00013453877,0.0012788345],"genre_scores_gemma":[0.9072447,0.000044783825,0.08944199,0.0028176622,0.00028831162,0.000012739187,0.0000022457116,0.000035730092,0.00011183803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996665,0.00008828158,0.00046507284,0.0015258733,0.00062117813,0.0006345816],"domain_scores_gemma":[0.99793965,0.00042190094,0.00019961043,0.0012071604,0.00008402434,0.00014764607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010330875,0.0004853343,0.00044200988,0.0015695355,0.00026563372,0.00027334233,0.0017733307,0.0005317506,0.00003261726],"category_scores_gemma":[0.00008662614,0.00047085254,0.00018261085,0.001037133,0.00045130952,0.00056434196,0.0006962369,0.0010953892,0.000017084163],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050101728,0.00006561348,0.00014853563,0.000028663886,0.000010201058,0.00016570257,0.00085887325,0.01680582,0.0014401913,0.0036915839,0.00006308667,0.97667164],"study_design_scores_gemma":[0.001400482,0.00081843004,0.0027413769,0.0007342003,0.000019856896,0.00015296851,0.0000011580681,0.79464597,0.008243824,0.18414523,0.0050343587,0.0020621794],"about_ca_topic_score_codex":0.00004175148,"about_ca_topic_score_gemma":0.00023449755,"teacher_disagreement_score":0.97460943,"about_ca_system_score_codex":0.00024249736,"about_ca_system_score_gemma":0.00016847401,"threshold_uncertainty_score":0.99977434},"labels":[],"label_agreement":null},{"id":"W2122914962","doi":"10.1109/asap.2005.6","title":"A Fault-Tolerant Modulus Replication Complex FIR Filter","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Residue number system; Fault tolerance; Replication (statistics); Computer science; Computation; Overhead (engineering); Finite impulse response; Throughput; Parallel computing; Wireless; Algorithm; Distributed computing; Mathematics; Telecommunications","score_opus":0.021306216229149404,"score_gpt":0.238544440937397,"score_spread":0.21723822470824758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122914962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038557496,0.000025891311,0.90932035,0.0018137707,0.00011566985,0.00010208678,0.0000014519134,0.00042176186,0.04964153],"genre_scores_gemma":[0.9622472,8.714474e-7,0.03544552,0.0009139198,0.0000611225,0.000015098731,0.000006345108,0.000004165771,0.0013057858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917376,0.000037040903,0.0001488136,0.00034533598,0.00012836314,0.0001666828],"domain_scores_gemma":[0.9989449,0.00003217156,0.000039962033,0.00090848946,0.000040419418,0.00003410517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018471347,0.00008256613,0.00008037251,0.00006759365,0.000111642155,0.00010717689,0.0005170803,0.000028315768,0.00011841583],"category_scores_gemma":[0.000005793176,0.00007010207,0.00006954352,0.00030886917,0.000028830518,0.0002024554,0.00010577968,0.00004887113,0.000101934536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005304593,0.00007578748,0.00031931457,0.0000038169273,0.0000047477915,0.0000029686366,0.00007725112,0.00014934948,0.0059862533,0.9352515,0.027741307,0.030382443],"study_design_scores_gemma":[0.00048355415,0.00009424489,0.04391481,0.00001243288,0.00000588512,0.000021905598,0.000013241654,0.3696433,0.006861271,0.46320263,0.115352124,0.00039459157],"about_ca_topic_score_codex":0.00006873301,"about_ca_topic_score_gemma":0.000014593527,"teacher_disagreement_score":0.92368966,"about_ca_system_score_codex":0.000009751586,"about_ca_system_score_gemma":0.000007820168,"threshold_uncertainty_score":0.28586793},"labels":[],"label_agreement":null},{"id":"W2123050863","doi":"10.1109/isit.1994.394887","title":"(T, U) mapping matrices: properties and applications in permutation decoding","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Permutation (music); Connection (principal bundle); Computer science; Combinatorics; Mathematics; Algorithm; Discrete mathematics; Physics","score_opus":0.042343635931223214,"score_gpt":0.21696875205476643,"score_spread":0.1746251161235432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123050863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23437598,0.00087437965,0.7523309,0.00033035138,0.000022874505,0.00017062994,1.3689755e-7,0.0001621384,0.011732599],"genre_scores_gemma":[0.989105,0.000059722934,0.0106077185,0.000079916266,0.0000115493995,0.0000323673,1.6008231e-7,0.0000019083727,0.00010167325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960023,0.000019797133,0.000089801986,0.00014786958,0.000051671894,0.00009062676],"domain_scores_gemma":[0.9997879,0.00003684764,0.0000192338,0.000121526915,0.000011992157,0.00002248808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010874758,0.00004604856,0.00004606166,0.00016399207,0.0000911735,0.00009734556,0.00015739631,0.000015945829,0.000016734615],"category_scores_gemma":[0.000006032939,0.00003795177,0.00001357557,0.00045750014,0.000018514691,0.0003052301,0.000053000025,0.000036638336,0.000011104571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011111457,0.00006698107,0.012913928,0.00004807741,0.000006022483,0.0000018371815,0.009960236,0.00006224021,0.001880163,0.73441625,0.00007142605,0.24057174],"study_design_scores_gemma":[0.00089213613,0.000097099655,0.025582157,0.0001759739,0.000008114835,0.00005007574,0.005245477,0.80434954,0.00283926,0.1431089,0.01677411,0.00087713834],"about_ca_topic_score_codex":0.000006664049,"about_ca_topic_score_gemma":0.00000537509,"teacher_disagreement_score":0.8042873,"about_ca_system_score_codex":0.000007138967,"about_ca_system_score_gemma":0.0000019993558,"threshold_uncertainty_score":0.15476282},"labels":[],"label_agreement":null},{"id":"W2124932533","doi":"10.1109/cwit.2011.5872122","title":"Multivariate interpolation decoding of heterogeneous Interleaved Reed-Solomon codes","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"List decoding; Decoding methods; Reed–Solomon error correction; Code word; Algorithm; Interpolation (computer graphics); Error detection and correction; Berlekamp–Welch algorithm; Computer science; Sequential decoding; Dimension (graph theory); Mathematics; Concatenated error correction code; Block code; Combinatorics; Telecommunications","score_opus":0.04057246284310645,"score_gpt":0.24834742504535232,"score_spread":0.20777496220224587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124932533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20689175,0.000019164498,0.7824803,0.000012332703,0.00020928457,0.00006629899,7.104024e-7,0.0001507663,0.010169406],"genre_scores_gemma":[0.91310835,0.0000028870122,0.08677973,0.000059275284,0.000010620167,0.0000035230614,5.8179063e-7,0.000005103305,0.000029910792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992028,0.00008083095,0.00024345673,0.0002279094,0.000089531546,0.0001554581],"domain_scores_gemma":[0.9993416,0.00007132571,0.00011145162,0.00037099872,0.00005639343,0.000048218506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027243877,0.00009593886,0.00013549147,0.00015555689,0.00004985807,0.000029910014,0.0005653046,0.00004467857,0.00009185466],"category_scores_gemma":[0.000026750453,0.000087586974,0.00009915882,0.00021382171,0.000048181704,0.00027859074,0.00021603378,0.00006334065,0.000015894682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020316732,0.0002900399,0.009159263,0.000034817207,0.0001348562,0.000017672084,0.017693559,0.000019767464,0.08481048,0.7486631,0.000055043536,0.13891819],"study_design_scores_gemma":[0.0010179796,0.0010656307,0.009336152,0.00019585254,0.00003419575,0.00006708891,0.00039790134,0.26536238,0.5615893,0.16009702,0.00014376815,0.0006927366],"about_ca_topic_score_codex":0.00009435363,"about_ca_topic_score_gemma":0.000035770776,"teacher_disagreement_score":0.70621663,"about_ca_system_score_codex":0.000008093679,"about_ca_system_score_gemma":0.000007955209,"threshold_uncertainty_score":0.35716933},"labels":[],"label_agreement":null},{"id":"W2127451403","doi":"10.1109/icwc.1992.200720","title":"A performance comparison of some combining schemes for finite-buffer ARQ systems in a Rayleigh-fading channel","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Automatic repeat request; Rayleigh fading; Computer science; Fading; Selective Repeat ARQ; Channel (broadcasting); Throughput; Decoding methods; Algorithm; Hybrid automatic repeat request; Selection (genetic algorithm); Computer network; Wireless; Telecommunications link; Telecommunications; Artificial intelligence","score_opus":0.03902344120105891,"score_gpt":0.26845910294561337,"score_spread":0.22943566174455446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127451403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6523481,0.000470984,0.3442109,0.00003809119,0.00045536217,0.00031764992,0.0000010803667,0.00009731424,0.0020605067],"genre_scores_gemma":[0.99396324,0.000008672711,0.0058271764,0.00004868048,0.00001793245,0.00006423086,9.2598634e-7,0.000008062786,0.00006110148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987983,0.00008079629,0.00037711932,0.00027437633,0.00015508522,0.00031430673],"domain_scores_gemma":[0.9990331,0.00041392783,0.00012030338,0.0003241163,0.000056879904,0.00005166981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000772655,0.00013840791,0.00032625426,0.00029808423,0.00010735472,0.0000670369,0.0004526773,0.00006081637,0.000004598161],"category_scores_gemma":[0.00007205583,0.00012678656,0.00008583185,0.00053923624,0.000040425046,0.00043070552,0.00006648952,0.00011070483,0.000004333669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029034441,0.00015687158,0.015115143,0.00017719797,0.000020215772,6.8319076e-7,0.0017649017,0.0026706127,0.0007754553,0.9774455,0.0000763031,0.0017680828],"study_design_scores_gemma":[0.0015271467,0.000392412,0.00044329156,0.00031871547,0.000008418106,0.0000040169043,0.0006405931,0.9609675,0.021451289,0.011888748,0.0020159488,0.00034195755],"about_ca_topic_score_codex":0.0000067588276,"about_ca_topic_score_gemma":0.0000017327159,"teacher_disagreement_score":0.96555674,"about_ca_system_score_codex":0.000016942566,"about_ca_system_score_gemma":0.000030402827,"threshold_uncertainty_score":0.5170206},"labels":[],"label_agreement":null},{"id":"W2127532366","doi":"10.1109/dasc.2006.9","title":"A Parallel GNFS Integrated with the Block Wiedemann's Algorithm for Integer Factorization","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Integer factorization; Algorithm; Computer science; Factorization; Cryptosystem; Block (permutation group theory); Integer (computer science); Field (mathematics); Parallel computing; Mathematics; Public-key cryptography; Cryptography; Encryption; Combinatorics","score_opus":0.007591969086953684,"score_gpt":0.20356709492611497,"score_spread":0.19597512583916127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127532366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013986615,0.00002897409,0.99440646,0.0011626724,0.00010975941,0.00027276375,0.0000027981532,0.00024283917,0.0023750614],"genre_scores_gemma":[0.77836204,0.0000018854909,0.2186822,0.00071122695,0.00012432454,0.00010420667,0.000015595135,0.000013761471,0.0019847695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992509,0.00004337816,0.00011898419,0.00025076748,0.00013674362,0.00019922608],"domain_scores_gemma":[0.99934,0.0001308465,0.00005595219,0.00031996059,0.00012443753,0.000028807548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019884016,0.00012922793,0.000097690485,0.0000674949,0.00018673774,0.00018619635,0.0005176491,0.000041203613,0.0000128438105],"category_scores_gemma":[0.0000056075437,0.00006731885,0.00006711486,0.00050671364,0.000057405832,0.00023395046,0.000050907005,0.0000793271,0.000007546356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029841818,0.00009018076,0.00014627808,0.0000043133955,0.000035942845,0.0000019569818,0.00030076737,0.00040074915,0.00018726809,0.9175569,0.011148454,0.070097364],"study_design_scores_gemma":[0.0022678701,0.0012088176,0.0025366643,0.000059269565,0.00006177742,0.000047078036,0.0005271654,0.5293773,0.0036716308,0.19388333,0.2653659,0.0009932084],"about_ca_topic_score_codex":0.00005305608,"about_ca_topic_score_gemma":0.000058523958,"teacher_disagreement_score":0.77696335,"about_ca_system_score_codex":0.0000125728975,"about_ca_system_score_gemma":0.00002900384,"threshold_uncertainty_score":0.2745183},"labels":[],"label_agreement":null},{"id":"W2127589484","doi":"10.1109/pacrim.1991.160713","title":"An expanded set of design criteria for substitution boxes and their use in strengthening DES-like cryptosystems","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Cryptosystem; Substitution (logic); Set (abstract data type); Computer science; S-box; Cryptography; Theoretical computer science; Computer security; Arithmetic; Mathematics; Programming language","score_opus":0.10134192146709614,"score_gpt":0.2805634637302241,"score_spread":0.17922154226312798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127589484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4662288,0.00007690369,0.5334349,0.0000055383207,0.00005765911,0.00011886883,0.0000026267394,0.000043577293,0.000031057447],"genre_scores_gemma":[0.941322,0.00001254414,0.05859253,0.000020380454,0.000019756022,0.000018874813,0.0000012805567,0.000004457217,0.000008117606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991622,0.00017846216,0.00019701864,0.00020973966,0.000059152404,0.00019342692],"domain_scores_gemma":[0.9992999,0.000282215,0.00005398788,0.00026605406,0.000038788723,0.00005908937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006085663,0.00010537846,0.00014578618,0.0001596792,0.00008895796,0.00012806851,0.00023049263,0.00004295049,0.000009876787],"category_scores_gemma":[0.00003141056,0.000083510145,0.000039433304,0.00024193623,0.00007942083,0.0010134648,0.000033402204,0.000035913283,3.9488432e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002544712,0.00053628715,0.03018752,0.00024359333,0.0000749518,0.0000048221495,0.0539213,0.0006348902,0.14070302,0.6846377,0.0004290654,0.088372335],"study_design_scores_gemma":[0.0021215568,0.0011338807,0.006114567,0.00029116916,0.000014540546,0.000043393124,0.0019816437,0.85615337,0.071590595,0.059235767,0.0006419163,0.00067760475],"about_ca_topic_score_codex":0.00003052143,"about_ca_topic_score_gemma":0.000026636106,"teacher_disagreement_score":0.85551846,"about_ca_system_score_codex":0.000009217932,"about_ca_system_score_gemma":0.0000055981313,"threshold_uncertainty_score":0.34054446},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Prime (order theory); Combinatorics; Algorithm; Discrete mathematics; Computer science; Mathematics","score_opus":0.009472739349772318,"score_gpt":0.2108607350587515,"score_spread":0.20138799570897917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129568979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062288884,0.0000032470775,0.9322631,0.00025114443,0.00075785554,0.00013891025,0.0000047291987,0.00034889564,0.0039432347],"genre_scores_gemma":[0.9072733,0.0000040723007,0.09199411,0.00060817273,0.000019200064,0.000025786929,0.0000013598193,0.000005516574,0.00006848892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907494,0.000052959705,0.00024566727,0.00015598738,0.00024494005,0.00022551017],"domain_scores_gemma":[0.99902874,0.00019252907,0.000109905515,0.00046866445,0.000066271845,0.00013391652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045836807,0.00015858206,0.00010836974,0.00033678132,0.0003227075,0.00027746838,0.0005675811,0.00008085315,0.00013518438],"category_scores_gemma":[0.0000075950834,0.00013059679,0.00009244367,0.0005248056,0.00013006783,0.003124405,0.00000193194,0.00040271663,0.00017027148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014229618,0.000058224912,0.000015191123,0.000018322524,0.00008512048,0.0000024115877,0.0057099736,0.036428913,0.0017112375,0.679022,0.00009155505,0.27671477],"study_design_scores_gemma":[0.0048058014,0.0028487619,0.0005871483,0.00036025603,0.00019569704,0.00069290015,0.003589177,0.051571954,0.2971699,0.6257549,0.009124702,0.0032987979],"about_ca_topic_score_codex":0.00002137009,"about_ca_topic_score_gemma":0.000014404448,"teacher_disagreement_score":0.8449844,"about_ca_system_score_codex":0.0000175137,"about_ca_system_score_gemma":0.00012534864,"threshold_uncertainty_score":0.53255826},"labels":[],"label_agreement":null},{"id":"W2130780608","doi":"10.1145/1390768.1390785","title":"On lacunary polynomial perfect powers","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lacunary function; Mathematics; Polynomial; Norm (philosophy); Stable polynomial; Conjecture; Combinatorics; Discrete mathematics; Representation (politics); Square-free polynomial; Matrix polynomial; Mathematical analysis","score_opus":0.012723261084678198,"score_gpt":0.20945864178894605,"score_spread":0.19673538070426785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130780608","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66697663,0.000030594252,0.07738094,0.00085627206,0.0005378173,0.000067215995,4.995595e-7,0.00044841116,0.25370163],"genre_scores_gemma":[0.994726,0.0000045657575,0.003001193,0.0013906584,0.00004239765,0.0000020741677,2.6792128e-7,0.0000034567765,0.0008293809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994043,0.000048616846,0.00006672568,0.00020356382,0.00011950684,0.00015727134],"domain_scores_gemma":[0.9994679,0.00011118801,0.0000148070785,0.00033485447,0.000010359973,0.000060886177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012276779,0.00007597328,0.000067151464,0.00009480533,0.00015277257,0.000025392685,0.00043417633,0.000030931813,0.00016277112],"category_scores_gemma":[0.000013557106,0.00006202051,0.00008585023,0.00023195907,0.000051873856,0.00014778206,0.00008232953,0.00008673254,0.0002525845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063366424,0.00014467348,0.00089870585,0.0000021165524,0.000019414563,0.00010404582,0.0009795825,0.00003385611,0.0008433498,0.8990005,0.08145478,0.0164556],"study_design_scores_gemma":[0.009674914,0.012901521,0.12422182,0.00015522014,0.00005042446,0.0025352137,0.00041582432,0.03572649,0.07139837,0.33816746,0.39870673,0.0060460065],"about_ca_topic_score_codex":0.000005837203,"about_ca_topic_score_gemma":6.8837625e-7,"teacher_disagreement_score":0.56083304,"about_ca_system_score_codex":0.000008079903,"about_ca_system_score_gemma":0.000020100357,"threshold_uncertainty_score":0.32465467},"labels":[],"label_agreement":null},{"id":"W2131858589","doi":"10.1007/s10623-007-9052-y","title":"Division of trinomials by pentanomials and orthogonal arrays","year":2007,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Trinomial; Mathematics; Combinatorics; Sequence (biology); Degree (music); Discrete mathematics; Finite field; Polynomial; Distribution (mathematics); Mathematical analysis","score_opus":0.014445100091879298,"score_gpt":0.2413546451420634,"score_spread":0.2269095450501841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131858589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43736282,0.0011815832,0.56048435,0.00004088454,0.00006772641,0.00012341143,0.000011397693,0.00005190811,0.00067590934],"genre_scores_gemma":[0.97397614,0.00032809697,0.02550466,0.00013980755,0.00002547542,0.0000059803865,0.000004367992,0.000009646192,0.0000058510564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984726,0.00011056362,0.0003988305,0.00044036916,0.00023622846,0.0003414665],"domain_scores_gemma":[0.99882025,0.0004307155,0.00017042467,0.0003264899,0.00005984002,0.00019227961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014031337,0.00021296515,0.00033120989,0.00037328625,0.00021039625,0.00012689715,0.00036280038,0.00009572152,0.000011256368],"category_scores_gemma":[0.000018088544,0.00019029091,0.00015194977,0.0006393425,0.00027005936,0.00027888888,0.00015144967,0.00010686292,7.718206e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015292276,0.00019788959,0.040157262,0.000057462566,0.00010435305,0.000011430595,0.0007246467,0.0000024902188,0.1232518,0.7129807,0.0008889503,0.12147007],"study_design_scores_gemma":[0.0056331432,0.0033527277,0.18019664,0.00033294063,0.00020270105,0.00013733914,0.0008638291,0.000954866,0.2470366,0.5388705,0.01994383,0.0024748722],"about_ca_topic_score_codex":0.0000117478285,"about_ca_topic_score_gemma":0.0000063609923,"teacher_disagreement_score":0.5366133,"about_ca_system_score_codex":0.0000040259893,"about_ca_system_score_gemma":0.000014564468,"threshold_uncertainty_score":0.7759838},"labels":[],"label_agreement":null},{"id":"W2131972975","doi":"10.1016/j.dam.2006.04.025","title":"Two-tuple balance of non-binary sequences with ideal two-level autocorrelation","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Sequence (biology); Conjecture; Combinatorics; Autocorrelation; Prime (order theory); Ideal (ethics); Finite field; Tuple; Binary number; Discrete mathematics; Period (music); Pseudorandom binary sequence; Function (biology); Arithmetic; Statistics","score_opus":0.01195315731277429,"score_gpt":0.23859496720282278,"score_spread":0.22664180989004848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131972975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1270785,0.000018341112,0.83965516,0.000059019792,0.000050638202,0.00034529652,0.000008367504,0.0001366523,0.032648012],"genre_scores_gemma":[0.6736414,0.0000013413947,0.32619348,0.000025429554,0.000030659634,0.00004406284,0.0000085407655,0.000010988019,0.000044135293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871516,0.000016033739,0.0003594988,0.0003004877,0.00034958817,0.0002592191],"domain_scores_gemma":[0.9988747,0.00015806987,0.0002951246,0.00057174294,0.000053195337,0.00004716965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033111367,0.00019898971,0.0002732612,0.00010612184,0.00012228182,0.00006959435,0.00061353977,0.00004525862,0.000012170528],"category_scores_gemma":[0.000005203862,0.00015748372,0.00007151866,0.00052279036,0.00014131164,0.00022059378,0.00012289335,0.00011884498,0.000018475703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016089572,0.0000830997,0.00038891373,0.000087639564,0.000018371922,0.0000044014314,0.0007464904,0.0030054976,0.011597379,0.983078,0.000076561606,0.000897546],"study_design_scores_gemma":[0.0013380527,0.00018303463,0.0027396434,0.0001959552,0.0000505957,0.000025180028,0.00038665597,0.26876253,0.012484958,0.7132182,0.00006834163,0.0005468328],"about_ca_topic_score_codex":0.000040515308,"about_ca_topic_score_gemma":0.000015073152,"teacher_disagreement_score":0.54656285,"about_ca_system_score_codex":0.000016852395,"about_ca_system_score_gemma":0.00004898242,"threshold_uncertainty_score":0.64219993},"labels":[],"label_agreement":null},{"id":"W2132052310","doi":"10.37236/839","title":"Compression of Root Systems and the $E$-Sequence","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Root (linguistics); Mathematics; Sequence (biology); Root system; Pure mathematics; Discrete mathematics; Combinatorics; Algebra over a field; Botany; Biology","score_opus":0.013622498070892204,"score_gpt":0.2218310289784053,"score_spread":0.2082085309075131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132052310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80306625,0.02335802,0.17089668,0.0011869624,0.00069208315,0.0001533827,2.608749e-7,0.00001948445,0.00062684534],"genre_scores_gemma":[0.9986333,0.0012504819,0.000016538137,0.000026193633,0.00003255506,0.000001272581,3.355806e-8,0.0000039165693,0.000035663277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986318,0.00037502171,0.00032156642,0.00007667633,0.00035677198,0.00023818146],"domain_scores_gemma":[0.99849445,0.0005161818,0.00043766043,0.0003392978,0.00017384086,0.000038569968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019056485,0.000087699074,0.00022953865,0.0000688395,0.00024589294,0.00003405329,0.0011865457,0.00002998298,6.861157e-7],"category_scores_gemma":[0.00005292272,0.000042906275,0.00009889227,0.000413103,0.00029949693,0.00018154977,0.00012264223,0.00042050047,5.31669e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006146374,0.000030865725,0.00024164833,0.0000065242057,0.000033528628,0.0000042711113,0.0006075205,0.00008430256,0.0002483001,0.9982634,0.00009821437,0.0003199497],"study_design_scores_gemma":[0.0015676212,0.00048355982,0.0006060829,0.00006590682,0.000030026771,0.0014715659,0.000072021845,0.0033974494,0.0011435872,0.9893066,0.0017658597,0.000089711975],"about_ca_topic_score_codex":0.0000074682885,"about_ca_topic_score_gemma":4.6181538e-7,"teacher_disagreement_score":0.19556706,"about_ca_system_score_codex":0.000035230933,"about_ca_system_score_gemma":0.00016758553,"threshold_uncertainty_score":0.22049168},"labels":[],"label_agreement":null},{"id":"W2132246788","doi":"10.1081/agb-120023130","title":"The 2-Power Degree Subfields of the Splitting Fields of Polynomials with Frobenius Galois Groups","year":2003,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Okanagan University College; Okanagan College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Trinomial; Galois group; Degree (music); Quintic function; Complement (music); Combinatorics; Finite field; Order (exchange); Group (periodic table); Polynomial; Field (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.0268525358548795,"score_gpt":0.25085330576690107,"score_spread":0.22400076991202156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132246788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84757143,0.0036200425,0.08500655,0.005105881,0.000318173,0.0005034616,0.00000307732,0.00006502689,0.05780635],"genre_scores_gemma":[0.9883609,0.00010121972,0.011374348,0.000106124986,0.0000031313202,0.00001784408,2.5972756e-7,0.000004493737,0.000031695225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988885,0.00041840915,0.0003048347,0.00011903499,0.00012832694,0.00014088633],"domain_scores_gemma":[0.99539924,0.0011031391,0.00018957011,0.003214987,0.00007344926,0.00001963034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094080885,0.00007976667,0.00012555724,0.000061305196,0.00028138424,0.000037364327,0.0031695906,0.000055883098,0.00000961357],"category_scores_gemma":[0.00020831946,0.0000480622,0.00008074696,0.00074136804,0.0003405276,0.00010569987,0.00051603373,0.00024895958,0.000001121402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055670503,0.00006364145,0.010612303,0.000003899768,0.000015419302,1.0719343e-7,0.0013287291,0.0000122065685,0.0001529403,0.98282987,0.00006609293,0.00490925],"study_design_scores_gemma":[0.0017907907,0.00041288522,0.15258452,0.00055074453,0.00006393278,0.00003851315,0.0029211766,0.0018427831,0.03820025,0.786008,0.01487327,0.0007131513],"about_ca_topic_score_codex":0.000036780002,"about_ca_topic_score_gemma":0.00029433766,"teacher_disagreement_score":0.19682187,"about_ca_system_score_codex":0.000010640232,"about_ca_system_score_gemma":0.00006003406,"threshold_uncertainty_score":0.5889941},"labels":[],"label_agreement":null},{"id":"W2132252040","doi":"10.1109/icc.2008.842","title":"Soft Decision Decoding of Reed-Solomon Codes Using Sphere Decoding","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Code word; List decoding; Code (set theory); Set (abstract data type); Symbol (formal); Mathematics; Computer science; Algorithm; RADIUS; Discrete mathematics; Combinatorics; Arithmetic; Concatenated error correction code; Block code","score_opus":0.03967255677975378,"score_gpt":0.2681964337958218,"score_spread":0.22852387701606802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132252040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45533356,0.000112807626,0.5419004,0.000011976689,0.00015391891,0.00004499714,4.4521815e-7,0.00010881113,0.0023330653],"genre_scores_gemma":[0.7104536,0.00003139243,0.28938538,0.00006354302,0.000027548023,0.0000010251508,2.8699637e-7,0.0000074336926,0.000029781237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986012,0.00006560307,0.00036211405,0.00037230583,0.00029409843,0.00030466245],"domain_scores_gemma":[0.9986921,0.00043112686,0.00014038534,0.0005434461,0.00009593072,0.000096990305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004683669,0.00015235912,0.00024905978,0.000184211,0.00033877688,0.000055966306,0.00078904256,0.00007839131,0.00008219696],"category_scores_gemma":[0.00010194841,0.00014410008,0.00016202046,0.00071060134,0.00010458534,0.000546271,0.00032451184,0.00011171537,0.000014012511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014212434,0.00028388563,0.06903775,0.000063102045,0.000096828764,0.00014002305,0.0030722353,0.0029245776,0.06821658,0.35811633,0.00080169743,0.49710488],"study_design_scores_gemma":[0.0019664944,0.00055965094,0.008992763,0.000717458,0.00005759635,0.00086201745,0.0005993648,0.6599268,0.16341485,0.15996926,0.001350128,0.0015836754],"about_ca_topic_score_codex":0.000042627118,"about_ca_topic_score_gemma":0.000028829645,"teacher_disagreement_score":0.65700215,"about_ca_system_score_codex":0.000026727952,"about_ca_system_score_gemma":0.00005540615,"threshold_uncertainty_score":0.58762306},"labels":[],"label_agreement":null},{"id":"W2132519869","doi":"10.1109/ccece.1993.332413","title":"On the spectral characteristics of continuous guided scrambling line codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Scrambling; Code (set theory); Symbol (formal); Computer science; Algorithm; Limit (mathematics); Sequence (biology); Mathematics; Discrete mathematics","score_opus":0.03891504634099112,"score_gpt":0.24139616256430554,"score_spread":0.20248111622331444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132519869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73175174,0.000038552193,0.23396644,0.002336475,0.00026497428,0.00011818733,0.000003165908,0.00016855107,0.03135189],"genre_scores_gemma":[0.9947247,0.0000128487245,0.004075896,0.0007205586,0.00005018063,0.0000019757297,3.417924e-7,0.0000035612288,0.00040992213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999327,0.000052841733,0.00018612694,0.00014479001,0.00014016466,0.00014908916],"domain_scores_gemma":[0.99915224,0.00028126335,0.000075151314,0.00041172197,0.000048546164,0.00003108155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031324656,0.00007996366,0.00012584383,0.00006020134,0.00008220773,0.00007004558,0.00056825683,0.00002423516,0.00028462693],"category_scores_gemma":[0.00008898651,0.000050270242,0.00007637016,0.00026585194,0.000062174084,0.00006895198,0.00007084392,0.000087720204,0.000039806226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004154822,0.00006840871,0.00025346765,0.000002826432,0.000011186879,0.000003407986,0.00021595122,0.000005808863,0.0013275767,0.9876423,0.0015299476,0.008935003],"study_design_scores_gemma":[0.0016414507,0.0021187912,0.015853612,0.00028746904,0.00005894818,0.00007625437,0.00022320826,0.3306426,0.11420103,0.5239947,0.009684755,0.0012171909],"about_ca_topic_score_codex":0.000004061473,"about_ca_topic_score_gemma":9.444159e-7,"teacher_disagreement_score":0.4636476,"about_ca_system_score_codex":0.000004108679,"about_ca_system_score_gemma":0.0000037191842,"threshold_uncertainty_score":0.31164655},"labels":[],"label_agreement":null},{"id":"W2132805517","doi":"10.1109/newcas.2004.1359100","title":"Design of reconfigurable general finite field multiplier in GF[2/sup m/]","year":2004,"lang":"en","type":"article","venue":"The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Multiplier (economics); Finite field; Very-large-scale integration; Computer science; Mathematics; Arithmetic; Embedded system; Discrete mathematics","score_opus":0.03683872581728505,"score_gpt":0.2530160978105393,"score_spread":0.21617737199325426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132805517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3924382,0.0060986103,0.589098,0.001740814,0.0024834233,0.002163881,0.00008147315,0.00033144894,0.0055641886],"genre_scores_gemma":[0.99806917,0.000108860506,0.00024880565,0.0004631545,0.00026517166,0.00005444703,0.000003171299,0.000029704268,0.00075754646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697906,0.00044276443,0.00077543507,0.0006857883,0.00042537478,0.000691599],"domain_scores_gemma":[0.99756604,0.0008468948,0.00027578138,0.0009618427,0.00015183566,0.00019757333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014817786,0.00041388912,0.00058722444,0.00032649533,0.00030728962,0.00021284887,0.0009833449,0.00023324545,0.000023098175],"category_scores_gemma":[0.00007886348,0.00030970693,0.0001454082,0.00093790854,0.00015435471,0.00041681927,0.000055194698,0.00048979884,0.00003581297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018978269,0.00044591542,0.0009895933,0.000109912115,0.000113710536,0.00009971961,0.008764726,0.9019553,0.00050954975,0.028539684,0.0012997945,0.056982335],"study_design_scores_gemma":[0.048008624,0.011995387,0.013941137,0.019287713,0.00064830336,0.0030808882,0.031560324,0.6474853,0.01476709,0.15681274,0.036551505,0.01586096],"about_ca_topic_score_codex":0.00040594043,"about_ca_topic_score_gemma":0.00007863933,"teacher_disagreement_score":0.60563093,"about_ca_system_score_codex":0.000057549983,"about_ca_system_score_gemma":0.00012614822,"threshold_uncertainty_score":0.9999355},"labels":[],"label_agreement":null},{"id":"W2132902317","doi":"10.1109/tc.2007.1024","title":"Comments on \"Five, Six, and Seven-Term Karatsuba-Like Formulae","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Modulo; Term (time); Multiplication (music); Arithmetic; Remainder; Chinese remainder theorem; Mathematics; Discrete mathematics; Computer science; Algebra over a field; Combinatorics; Pure mathematics; Physics","score_opus":0.013942774073868616,"score_gpt":0.2435503478042002,"score_spread":0.22960757373033158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132902317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111354396,0.000012317666,0.88559616,0.0003156275,0.0017298557,0.00016804785,0.0000052214414,0.00025438995,0.00056399516],"genre_scores_gemma":[0.98584,0.00001546102,0.011541988,0.0024476638,0.00004316823,0.000007746807,0.0000010256762,0.00001403099,0.00008886871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985981,0.00006454291,0.00023804841,0.00045658427,0.00025965687,0.00038306997],"domain_scores_gemma":[0.9988373,0.00035416146,0.000062251165,0.00052021997,0.000034098688,0.00019195765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034080597,0.00023161729,0.00018234058,0.0003628872,0.0003954845,0.00014574775,0.00054596603,0.00008084105,0.000009220879],"category_scores_gemma":[7.820655e-7,0.00022820964,0.00014097024,0.00044332058,0.00007888241,0.0003202352,0.000007983513,0.00028175503,0.00004040516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032335144,0.000996636,0.00015553086,0.000037174214,0.00020934595,0.000110802765,0.0032832848,0.0065885247,0.00082945457,0.020001044,0.001975232,0.9654896],"study_design_scores_gemma":[0.035163105,0.022297762,0.045967504,0.0029976415,0.00060446374,0.0015367083,0.0012296368,0.5226148,0.20856673,0.049631234,0.096862614,0.012527828],"about_ca_topic_score_codex":0.000008085588,"about_ca_topic_score_gemma":0.000018459292,"teacher_disagreement_score":0.9529618,"about_ca_system_score_codex":0.000047788508,"about_ca_system_score_gemma":0.000014968977,"threshold_uncertainty_score":0.9306119},"labels":[],"label_agreement":null},{"id":"W2133073742","doi":"10.1109/ccece.2002.1015280","title":"High-speed forward error correction IP blocks for system-on-chip design","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Encoder; Convolutional code; Field-programmable gate array; Error detection and correction; Computer hardware; Transceiver; System on a chip; Forward error correction; Chip; Decoding methods; CMOS; Code (set theory); VHDL; Embedded system; Hardware description language; Wireless; Electronic engineering; Algorithm; Telecommunications; Engineering","score_opus":0.027646817563178494,"score_gpt":0.2399748808083369,"score_spread":0.2123280632451584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133073742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005015408,0.000016104656,0.982347,0.00012182814,0.002883775,0.00044043938,0.0000010057705,0.0004943344,0.008680069],"genre_scores_gemma":[0.9292957,7.4938976e-7,0.06867192,0.00025943862,0.00006656978,0.0000499159,8.195156e-7,0.000010965323,0.0016439139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882036,0.00015977697,0.00019152816,0.00037657988,0.00016423546,0.0002875027],"domain_scores_gemma":[0.9988876,0.00041361767,0.000070654576,0.00046180768,0.00007578707,0.00009051569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007960677,0.00015351796,0.00016846099,0.00015831778,0.00025566865,0.00012450968,0.00040037368,0.00007219983,0.00002832401],"category_scores_gemma":[0.00007804387,0.00012877284,0.00014149012,0.00039876232,0.000023305392,0.0001653257,0.000026637792,0.000081979284,0.000047681628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061804014,0.00006353826,0.000033179796,0.000015713944,0.00002663527,0.0000020921082,0.00014313118,0.0014155174,0.00032462197,0.9810832,0.010288323,0.0065422347],"study_design_scores_gemma":[0.005500752,0.004947948,0.00048942055,0.0003478606,0.00014731323,0.00023594812,0.0010286559,0.45356685,0.25103658,0.24283127,0.03774152,0.0021258648],"about_ca_topic_score_codex":0.000007789836,"about_ca_topic_score_gemma":0.000002395424,"teacher_disagreement_score":0.9242803,"about_ca_system_score_codex":0.00003850263,"about_ca_system_score_gemma":0.000034953704,"threshold_uncertainty_score":0.5251204},"labels":[],"label_agreement":null},{"id":"W2133099611","doi":"10.1109/isit.2003.1228395","title":"Trace representation of binary jacobi sequences","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"TRACE (psycholinguistics); Hadamard transform; Binary number; Representation (politics); Mathematics; Prime (order theory); Combinatorics; Function (biology); Pure mathematics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.025383987361052823,"score_gpt":0.27011243461976603,"score_spread":0.2447284472587132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133099611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4603486,0.00021091587,0.42938417,0.0003211626,0.00026336612,0.00008785904,3.558618e-7,0.00014513478,0.10923842],"genre_scores_gemma":[0.9709816,0.000010313275,0.028666323,0.000046174995,0.0000044568214,0.0000023996652,1.288811e-7,0.0000012239899,0.00028735996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995133,0.000084138796,0.000096701035,0.00013605996,0.00009532824,0.000074461896],"domain_scores_gemma":[0.999595,0.00007453306,0.000037163405,0.00024183506,0.00002887137,0.00002263986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019718577,0.000039038223,0.00005791908,0.000063612344,0.000036806145,0.000020242249,0.00023776207,0.000016901233,0.00007338112],"category_scores_gemma":[0.000026879101,0.000032794534,0.000045369783,0.0004934294,0.00003691863,0.0002539255,0.00002127636,0.000027244365,0.000008948253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018938837,0.000027759732,0.0011598425,0.0000033469378,0.00000467927,0.0000020573405,0.00030445287,0.000058416423,0.014848402,0.9772679,0.00026184876,0.0060593844],"study_design_scores_gemma":[0.0004236383,0.00036073782,0.009067831,0.000032044278,0.000010446932,0.0000337215,0.00063363655,0.004178835,0.45092204,0.52732986,0.006695425,0.00031175886],"about_ca_topic_score_codex":0.000009078858,"about_ca_topic_score_gemma":0.000001332429,"teacher_disagreement_score":0.51063305,"about_ca_system_score_codex":0.0000025764327,"about_ca_system_score_gemma":0.000016327116,"threshold_uncertainty_score":0.13373223},"labels":[],"label_agreement":null},{"id":"W2133220743","doi":"10.1112/blms/bdu033","title":"Abelian surfaces over finite fields with prescribed groups","year":2014,"lang":"en","type":"preprint","venue":"Bulletin of the London Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Abelian group; Combinatorics; Congruence relation; Mathematics; Prime power; Prime (order theory); Order (exchange); Field (mathematics); Group (periodic table); Discrete mathematics; Physics; Pure mathematics; Quantum mechanics","score_opus":0.010976767766208942,"score_gpt":0.2151733370883539,"score_spread":0.20419656932214497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133220743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1310548,0.0004382131,0.8430999,0.0155220935,0.00063173636,0.00111545,0.000025032581,0.00039659656,0.0077161794],"genre_scores_gemma":[0.86575025,0.00005840218,0.13058695,0.0018399066,0.00013197651,0.00007387489,0.0000035797812,0.000043434622,0.0015116251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770355,0.00025365042,0.000466438,0.00056672574,0.0006430705,0.00036655177],"domain_scores_gemma":[0.9965134,0.0010161037,0.00042126895,0.0018498545,0.000099164805,0.00010015876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010470473,0.00036876756,0.00057640276,0.000024748128,0.00017655554,0.000182891,0.0027503418,0.00037471618,0.0003686365],"category_scores_gemma":[0.00014558973,0.00022292476,0.00083767995,0.00019537484,0.00036060117,0.000027016311,0.0025162888,0.0008108118,0.00004479272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012103208,0.0010062995,0.00080634106,0.0050484976,0.0010432998,0.000005623205,0.009396599,0.00848665,0.00016451003,0.8297065,0.14150795,0.0027067317],"study_design_scores_gemma":[0.0010272198,0.00024752764,0.0010556272,0.001955427,0.00021272653,0.000010270218,0.00006882429,0.055611122,0.0013080686,0.8958707,0.041676983,0.0009555001],"about_ca_topic_score_codex":0.000024124596,"about_ca_topic_score_gemma":0.0000018189266,"teacher_disagreement_score":0.73469543,"about_ca_system_score_codex":0.000021607439,"about_ca_system_score_gemma":0.00004782039,"threshold_uncertainty_score":0.9090608},"labels":[],"label_agreement":null},{"id":"W2133384197","doi":"10.1186/s13662-015-0402-1","title":"Factorizations for difference operators","year":2015,"lang":"en","type":"article","venue":"Advances in Difference Equations","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"University Research Council, DePaul University","keywords":"Mathematics; Partial differential equation; Ordinary differential equation; Applied mathematics; Algebra over a field; Pure mathematics; Mathematical analysis; Differential equation","score_opus":0.04857355432760668,"score_gpt":0.30982209543809897,"score_spread":0.2612485411104923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133384197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020582002,0.00045568697,0.9765294,0.00031028935,0.00062156067,0.00027221572,0.000014400522,0.00014095078,0.0010734696],"genre_scores_gemma":[0.9736754,0.00005549894,0.025698313,0.0001115777,0.00004389093,0.00024286531,0.000014088357,0.000006887686,0.00015147938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988763,0.00007225152,0.00024187934,0.00034502917,0.00019426503,0.00027029737],"domain_scores_gemma":[0.99862206,0.0005884318,0.000069737864,0.00044213852,0.00015225352,0.00012537901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020816039,0.00014066305,0.0001533536,0.0001999356,0.00016065112,0.00012210231,0.0008170645,0.000046658275,0.0000056117133],"category_scores_gemma":[0.00062559714,0.00012846095,0.000051529525,0.00082210975,0.000071171446,0.00074679416,0.00011045927,0.00009996747,0.000010962333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004179231,0.000076995224,0.005684097,0.000005216294,0.000002945901,4.270942e-7,0.0012144375,0.0007484426,0.00014469364,0.95374,0.000013263571,0.03836528],"study_design_scores_gemma":[0.00069056975,0.00019714498,0.007863813,0.0000477763,0.00000679153,0.0000011369345,0.00029331478,0.06316874,0.0005516576,0.92343175,0.003381927,0.000365397],"about_ca_topic_score_codex":0.0000060572065,"about_ca_topic_score_gemma":0.000092211165,"teacher_disagreement_score":0.9530934,"about_ca_system_score_codex":0.000047376423,"about_ca_system_score_gemma":0.000110840425,"threshold_uncertainty_score":0.52384853},"labels":[],"label_agreement":null},{"id":"W2133591184","doi":"10.1109/cwit.2007.375724","title":"A Minimum Distance Bound for 1-Generator Quasi-Cyclic Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Conjecture; Generator (circuit theory); Algorithm; Computer science; Combinatorics; Mathematics; Physics","score_opus":0.01701784666429795,"score_gpt":0.26366443389470573,"score_spread":0.24664658723040778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133591184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060276248,0.00026386176,0.9347739,0.00026660875,0.00034645188,0.00013816559,0.0000033697859,0.00020015436,0.0037312259],"genre_scores_gemma":[0.9318601,0.0000059180984,0.06626429,0.0010800919,0.00012914186,0.000018193427,0.0000016908305,0.0000072660096,0.0006332997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990839,0.000019049945,0.00017192154,0.0002990302,0.0001052217,0.0003209002],"domain_scores_gemma":[0.9991387,0.0002623157,0.0000438976,0.00040607696,0.000049812497,0.00009919517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006144014,0.00010707109,0.00011379902,0.00007741547,0.000192247,0.00015425774,0.0005573391,0.00004101584,0.000013650391],"category_scores_gemma":[0.000030315538,0.000092799244,0.00010639594,0.00034011368,0.000059367492,0.00020611467,0.00006602599,0.00004538544,0.0000145904005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003109875,0.000084385494,0.00030136268,0.000011676741,0.000011952408,0.0000023625985,0.0002215275,7.934728e-7,0.004808468,0.9709103,0.003652172,0.019963888],"study_design_scores_gemma":[0.0012369144,0.00059957424,0.0010903528,0.000039248756,0.000017145709,0.000016231168,0.00018649251,0.0083511,0.07619306,0.37124828,0.5402404,0.0007812194],"about_ca_topic_score_codex":0.000004294081,"about_ca_topic_score_gemma":0.00008922433,"teacher_disagreement_score":0.8715839,"about_ca_system_score_codex":0.000014420134,"about_ca_system_score_gemma":0.000022663242,"threshold_uncertainty_score":0.37842432},"labels":[],"label_agreement":null},{"id":"W2133612207","doi":"10.1109/isit.2008.4595290","title":"Hyperbent functions, Kloosterman sums and Dickson polynomials","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Kloosterman sum; Monomial; Bent molecular geometry; TRACE (psycholinguistics); Mathematics; Class (philosophy); Zero (linguistics); Discrete mathematics; Point (geometry); Pure mathematics; Bent function; Combinatorics; Boolean function; Computer science; Artificial intelligence","score_opus":0.015110043568258688,"score_gpt":0.19495548663895348,"score_spread":0.1798454430706948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133612207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83359516,0.00039427017,0.14238967,0.00097590865,0.00039186154,0.00009393561,0.0000010900293,0.00030883623,0.021849249],"genre_scores_gemma":[0.99518585,0.000050677416,0.0026946324,0.00052674673,0.000049713555,0.0000047345425,6.849934e-7,0.0000032684466,0.0014836963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994275,0.000036248417,0.00009685413,0.0002076533,0.000091974,0.00013977008],"domain_scores_gemma":[0.9995544,0.000049188206,0.0000220598,0.00028330032,0.000014647014,0.00007643149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012381772,0.00007490782,0.00008202321,0.00008022093,0.00022576342,0.000052491483,0.00021379544,0.000026546943,0.000050136427],"category_scores_gemma":[0.0000061355277,0.00006195134,0.000041330677,0.00016415321,0.000060974366,0.00024685654,0.0001357294,0.000048917856,0.000057276397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005288914,0.0003022853,0.0686402,0.000024051207,0.000082171515,0.00008239474,0.0029445272,0.000010702547,0.008446951,0.5992973,0.042893786,0.27722278],"study_design_scores_gemma":[0.0034995761,0.0014196864,0.41180575,0.00007964627,0.000060500795,0.0020760975,0.00044682852,0.0068204044,0.023675092,0.04188527,0.5060625,0.002168646],"about_ca_topic_score_codex":0.000015189449,"about_ca_topic_score_gemma":0.00000469833,"teacher_disagreement_score":0.557412,"about_ca_system_score_codex":0.0000053263257,"about_ca_system_score_gemma":0.0000125621245,"threshold_uncertainty_score":0.25263023},"labels":[],"label_agreement":null},{"id":"W2134831983","doi":"10.1109/glocom.1993.318191","title":"Performance evaluation of partial erasure decoding for non-binary block codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada); University of Victoria","funders":"","keywords":"Decoding methods; Erasure; Erasure code; List decoding; Computer science; Algorithm; Binary number; Code (set theory); Upper and lower bounds; Sequential decoding; Binary code; Mathematics; Arithmetic; Block code; Concatenated error correction code","score_opus":0.05298843826562864,"score_gpt":0.2768273245894315,"score_spread":0.22383888632380283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134831983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8682013,0.000058465503,0.12529081,0.0001440587,0.00021027325,0.00023998957,0.0000011002656,0.00006373962,0.005790221],"genre_scores_gemma":[0.98645633,0.000009644599,0.013336276,0.000047199785,0.000044286367,0.000034674187,6.326444e-7,0.000003512755,0.00006742587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991951,0.000046500787,0.0001609155,0.00018243314,0.00026232417,0.00015274175],"domain_scores_gemma":[0.99936813,0.00010173732,0.00006243524,0.00026557365,0.00016968383,0.000032424523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006777,0.0000738736,0.00009909365,0.00007872114,0.00012254674,0.00003008904,0.00032023538,0.000033758788,0.000085265434],"category_scores_gemma":[0.00003241823,0.000065641034,0.000073809024,0.0002380998,0.000027715221,0.00027721748,0.000050877745,0.00003781843,0.000008988839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086509994,0.0005334684,0.01739985,0.00015129172,0.00011916714,0.0000011257524,0.0035298073,0.010204579,0.020737287,0.14723273,0.0065340986,0.7934701],"study_design_scores_gemma":[0.00040918446,0.00017668627,0.0015066263,0.000021326408,0.000019296203,0.000002105996,0.000015552554,0.98141193,0.014276282,0.0018427727,0.00022552382,0.000092738555],"about_ca_topic_score_codex":0.0000010519203,"about_ca_topic_score_gemma":0.0000011045524,"teacher_disagreement_score":0.9712073,"about_ca_system_score_codex":0.000010970834,"about_ca_system_score_gemma":0.000015423944,"threshold_uncertainty_score":0.26767638},"labels":[],"label_agreement":null},{"id":"W2135125006","doi":"10.1109/asap.2007.4429981","title":"Run-Time Error Detection in Polynomial Basis Multiplication Using Linear Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Error detection and correction; Algorithm; Multiplication (music); Multiplier (economics); Overhead (engineering); Coding (social sciences); Cryptography; Very-large-scale integration; Polynomial; Arithmetic; Theoretical computer science; Mathematics; Embedded system","score_opus":0.02201343657687921,"score_gpt":0.2733461848330555,"score_spread":0.2513327482561763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135125006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48221713,0.0000060035013,0.5169666,0.000048669837,0.00007366675,0.000057078985,2.1939861e-7,0.000098641685,0.0005319905],"genre_scores_gemma":[0.93493056,6.9671114e-7,0.0648425,0.0001127003,0.00006628559,0.0000020281766,4.999304e-7,0.0000044088056,0.000040322597],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926615,0.000042320196,0.00017371147,0.00022995334,0.00009891212,0.00018893211],"domain_scores_gemma":[0.9995257,0.00009745739,0.00004660885,0.00025363461,0.000030056637,0.00004650783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006825639,0.00007740744,0.00008037892,0.00025583222,0.00009704634,0.000040061866,0.00025142328,0.000058262885,0.000019411813],"category_scores_gemma":[0.00002578133,0.00007602403,0.000050780225,0.00062617543,0.000025944908,0.00028659936,0.00006874062,0.0000787428,0.00003481401],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012814671,0.00018611124,0.0049488316,0.000009135475,0.000014835414,0.0000057351363,0.0010408377,0.0007284242,0.6457374,0.007100028,0.000038961636,0.34006152],"study_design_scores_gemma":[0.00046470363,0.00006989261,0.018599786,0.000014957287,0.0000051723296,0.00001101913,0.000055886427,0.6578583,0.3206796,0.001268595,0.0007326964,0.00023935748],"about_ca_topic_score_codex":0.00012320782,"about_ca_topic_score_gemma":0.0001577599,"teacher_disagreement_score":0.6571299,"about_ca_system_score_codex":0.00004219831,"about_ca_system_score_gemma":0.000013422159,"threshold_uncertainty_score":0.310017},"labels":[],"label_agreement":null},{"id":"W2135574494","doi":"10.1109/cec.2006.1688376","title":"Cryptanalysis of Simple Substitution Ciphers Using Particle Swarm Optimization","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Particle swarm optimization; Simple (philosophy); Cryptanalysis; Substitution (logic); Computer science; Differential cryptanalysis; S-box; Multi-swarm optimization; Algorithm; Linear cryptanalysis; Cryptography; Block cipher","score_opus":0.015780392814333803,"score_gpt":0.23491693762307495,"score_spread":0.21913654480874115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135574494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3285853,0.0000202027,0.6700296,0.00002616032,0.00002759778,0.0000260171,2.866442e-7,0.00006021041,0.0012246445],"genre_scores_gemma":[0.9031931,0.0000014067184,0.09674542,0.000024928702,0.000015618478,0.0000010616113,0.0000017354993,0.0000022835363,0.000014440729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993669,0.00004235245,0.0001785452,0.00015342195,0.00013283231,0.00012598284],"domain_scores_gemma":[0.99956053,0.000029026824,0.000070906506,0.0002493267,0.00006436448,0.00002581257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019075834,0.000059083523,0.00008784662,0.00007467132,0.00008886629,0.00004576208,0.000201232,0.00002442293,0.000063560845],"category_scores_gemma":[0.000009431527,0.000055110468,0.000078807374,0.0008630937,0.00004331042,0.0003346218,0.00004323979,0.0000231466,0.000002600602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031451882,0.000037378777,0.002280466,0.0000023608468,0.000008742893,6.092664e-7,0.000029560772,0.59186983,0.003986095,0.40126023,0.000016406146,0.00050518493],"study_design_scores_gemma":[0.00012886741,0.000017364202,0.000606959,0.0000031209424,0.000020491925,0.0000011866034,0.000021984093,0.9445545,0.0380049,0.016497374,0.00006248845,0.00008076494],"about_ca_topic_score_codex":0.00015376111,"about_ca_topic_score_gemma":0.000016141867,"teacher_disagreement_score":0.5746078,"about_ca_system_score_codex":0.000016108012,"about_ca_system_score_gemma":0.000016665197,"threshold_uncertainty_score":0.22473396},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Lakehead University","funders":"","keywords":"Autocorrelation; Binary number; Combinatorics; Mathematics; Discrete mathematics; Algorithm; Statistics; Arithmetic","score_opus":0.010572955385884828,"score_gpt":0.20558574709073885,"score_spread":0.19501279170485403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136017419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013829869,0.000009085492,0.98032993,0.00015656417,0.00035182154,0.0002095674,0.0000040336176,0.00044676685,0.0046623726],"genre_scores_gemma":[0.95180535,0.0000172691,0.047257133,0.00039278873,0.000022131733,0.0000417655,0.0000034173047,0.0000060207526,0.00045413504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905753,0.00008842738,0.00024534113,0.00014144942,0.00028451503,0.00018275235],"domain_scores_gemma":[0.99924463,0.0001307746,0.00010638472,0.0003400259,0.00007595957,0.0001022373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002737442,0.00014962739,0.00010210044,0.00037436507,0.00048595332,0.000096079864,0.00038129854,0.00006730023,0.00017704822],"category_scores_gemma":[0.000003115186,0.00012583107,0.00008129076,0.00062723126,0.0000920128,0.0035823274,0.0000021482426,0.00021155005,0.0003133822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005617702,0.00013074456,0.00003415482,0.000024444782,0.00009348946,0.00001401594,0.013180545,0.30987975,0.00014655398,0.3621122,0.0006975987,0.31312475],"study_design_scores_gemma":[0.01630786,0.013092982,0.011749912,0.00087861874,0.00041190253,0.004108866,0.0055506956,0.54026824,0.10437012,0.24737565,0.049059212,0.0068259244],"about_ca_topic_score_codex":0.0000085830325,"about_ca_topic_score_gemma":0.0000012352027,"teacher_disagreement_score":0.93797547,"about_ca_system_score_codex":0.000034307777,"about_ca_system_score_gemma":0.00014769855,"threshold_uncertainty_score":0.51312417},"labels":[],"label_agreement":null},{"id":"W2136633702","doi":"10.1109/isit.2011.6033971","title":"Density and bounds for Grassmannian codes with chordal distance","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Grassmannian; Cardinality (data modeling); Hamming distance; Combinatorics; Minimum distance; Mathematics; Generalization; Upper and lower bounds; Hamming code; Code (set theory); RADIUS; Discrete mathematics; Hamming bound; Chordal graph; Decoding methods; Computer science; Algorithm; Block code; Mathematical analysis","score_opus":0.019060088395175593,"score_gpt":0.20713922864880618,"score_spread":0.1880791402536306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136633702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16209844,0.000024241474,0.83124775,0.00007902616,0.00004452679,0.00007576132,8.035058e-7,0.0000993488,0.0063301325],"genre_scores_gemma":[0.9083504,0.0000024474984,0.09130976,0.00014144827,0.000011288135,0.000009626252,3.199816e-7,0.0000029408277,0.00017173268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995252,0.000013190181,0.00005481255,0.0002089688,0.000057534762,0.00014032699],"domain_scores_gemma":[0.9996199,0.00003525652,0.000022055323,0.00023021862,0.000035372734,0.000057181976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014454006,0.00007033207,0.00007506858,0.000031467167,0.00014894285,0.00007545236,0.000232242,0.000017967706,0.0000053137173],"category_scores_gemma":[0.000004441888,0.000050977305,0.000023925824,0.000120610166,0.00009275809,0.00021068701,0.00005397418,0.00003174549,0.0000012426375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004558867,0.000024223504,0.016130246,0.0000070054125,0.000010389022,0.0000022917059,0.00052748446,8.013605e-8,0.000049778097,0.9777869,0.00013732635,0.0052787084],"study_design_scores_gemma":[0.0010429537,0.0010248009,0.14191829,0.000033799664,0.00002585749,0.00005123643,0.00013240056,0.0034299102,0.0089629395,0.83217716,0.010628498,0.00057218305],"about_ca_topic_score_codex":0.000013621757,"about_ca_topic_score_gemma":0.00015306065,"teacher_disagreement_score":0.746252,"about_ca_system_score_codex":0.0000033143256,"about_ca_system_score_gemma":0.000009986391,"threshold_uncertainty_score":0.20787942},"labels":[],"label_agreement":null},{"id":"W2137543927","doi":"10.1109/tit.2013.2257918","title":"Upper Bounds on Matching Families in &lt;formula formulatype=\"inline\"&gt; &lt;tex Notation=\"TeX\"&gt;$\\BBZ_{pq}^{n}$&lt;/tex&gt;&lt;/formula&gt;","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Matching (statistics); Combinatorics; Upper and lower bounds; Modulo; Discrete mathematics; Mathematics; Statistics; Mathematical analysis","score_opus":0.007942866790031734,"score_gpt":0.21923461337938616,"score_spread":0.21129174658935443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137543927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20051278,0.000066374334,0.77473414,0.000529135,0.0017197882,0.001105674,0.00007517786,0.0007816816,0.02047526],"genre_scores_gemma":[0.99047595,0.00015551088,0.005907709,0.0019838084,0.00011818828,0.00038047024,0.00007117502,0.0000609187,0.0008462703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950798,0.00034152254,0.0016857915,0.0006573658,0.0011539373,0.0010815443],"domain_scores_gemma":[0.9963425,0.0008644821,0.00055463053,0.0014707108,0.000432742,0.00033494606],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018650688,0.0008151079,0.0006406841,0.0022282477,0.0012870759,0.0010431674,0.0014792201,0.00046044102,0.00052314176],"category_scores_gemma":[0.000057615158,0.00077103585,0.00058452133,0.0018777052,0.0002609833,0.009099512,0.00003719064,0.00091250415,0.0022678406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036904225,0.00044086936,0.000017036842,0.00014781296,0.00014801582,0.000004428863,0.015497947,0.03729755,0.0023902112,0.76462644,0.00058528763,0.17847534],"study_design_scores_gemma":[0.009448272,0.0022365267,0.0050465856,0.0012640607,0.0002571734,0.00021232144,0.00425926,0.3119991,0.025585206,0.5343647,0.1002819,0.0050448794],"about_ca_topic_score_codex":0.000039029426,"about_ca_topic_score_gemma":0.00011022389,"teacher_disagreement_score":0.7899632,"about_ca_system_score_codex":0.0003517858,"about_ca_system_score_gemma":0.00021250953,"threshold_uncertainty_score":0.99999386},"labels":[],"label_agreement":null},{"id":"W2139020064","doi":"10.1109/ccece.2003.1226390","title":"Reed-Solomon encoder &amp; decoder design, simulation and synthesis","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Encoder; Computer science; Reed–Solomon error correction; Decoding methods; Error detection and correction; Soft-decision decoder; Computer hardware; Forward error correction; Bit error rate; Complex programmable logic device; Block (permutation group theory); Wireless; Transmission (telecommunications); Embedded system; Block code; Algorithm; Concatenated error correction code; Telecommunications","score_opus":0.04210580553516231,"score_gpt":0.27345639281737877,"score_spread":0.23135058728221647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139020064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02017484,0.000058282745,0.97697556,0.00031381342,0.00006589259,0.00008474838,2.773075e-7,0.00020734088,0.0021192273],"genre_scores_gemma":[0.7848192,0.000006948998,0.21485022,0.00023158299,0.000015472438,0.0000071728887,2.3773713e-7,0.0000043017076,0.00006489338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926925,0.00006427673,0.00011786687,0.00026867096,0.000117932046,0.00016203249],"domain_scores_gemma":[0.9991754,0.00037151872,0.000032116677,0.00031889344,0.000036167563,0.00006585529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033453607,0.00009641618,0.00008971375,0.00009989429,0.00013411883,0.00011827703,0.000250207,0.00005146113,0.000042502998],"category_scores_gemma":[0.000069433794,0.00008265431,0.000035031222,0.00023453328,0.000040864037,0.00036976705,0.00008892824,0.00005227108,0.000053443273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063641426,0.00026289315,0.0010718661,0.000021529984,0.00006149701,0.000012085367,0.0027754088,0.23299122,0.0029896558,0.62048024,0.00024608723,0.1390239],"study_design_scores_gemma":[0.0008807544,0.00017263791,0.0026204886,0.000063133586,0.00003414799,0.000034887405,0.000055485936,0.20573214,0.013574952,0.77246034,0.0036454974,0.00072554353],"about_ca_topic_score_codex":0.000017841927,"about_ca_topic_score_gemma":0.000021888769,"teacher_disagreement_score":0.7646443,"about_ca_system_score_codex":0.000013015538,"about_ca_system_score_gemma":0.00001802271,"threshold_uncertainty_score":0.3370545},"labels":[],"label_agreement":null},{"id":"W2139208616","doi":"10.5555/510378.510477","title":"A new class of linear feedback shift register generators","year":2000,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Shift register; Generator (circuit theory); Finite field; Linear congruential generator; Randomness; Polynomial; Nonlinear system; Linear feedback shift register; Class (philosophy); Computer science; Mathematics; Discrete mathematics; Telecommunications; Mathematical analysis; Power (physics); Electrical engineering; Artificial intelligence; Engineering","score_opus":0.02978063360897829,"score_gpt":0.2667799408689723,"score_spread":0.236999307259994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139208616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12780054,0.000024270634,0.8618153,0.00055427745,0.00018981715,0.0000930523,0.000001998172,0.000112160094,0.009408584],"genre_scores_gemma":[0.98479396,0.0000029062883,0.013631067,0.00032915093,0.000094862335,0.0000018086849,0.0000021231344,0.0000064230894,0.0011377196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989889,0.00007583449,0.0002792737,0.00030388738,0.0001871732,0.00016488241],"domain_scores_gemma":[0.9990841,0.000091546965,0.0000878471,0.00055488414,0.00008740002,0.00009418716],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013693076,0.00012905088,0.00015653393,0.00009564914,0.000058626734,0.000093120165,0.0006089278,0.00006275247,0.0013022071],"category_scores_gemma":[0.000014283228,0.00012157431,0.000101272846,0.0003120319,0.00004681015,0.00039080466,0.00007123988,0.000095180905,0.00013108202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018492852,0.000117597054,0.0037057893,0.000033919725,0.00007028123,0.000007758139,0.0072428235,0.04745505,0.00082901074,0.34561008,0.0015000275,0.5932427],"study_design_scores_gemma":[0.0013715024,0.00033570605,0.01175127,0.00017859782,0.000022986005,0.000004925027,0.000030021278,0.83762443,0.0047886246,0.063746355,0.07953122,0.0006143822],"about_ca_topic_score_codex":0.000014000773,"about_ca_topic_score_gemma":0.0000110677865,"teacher_disagreement_score":0.8569934,"about_ca_system_score_codex":0.000009211892,"about_ca_system_score_gemma":0.00006562014,"threshold_uncertainty_score":0.9996107},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quadratic equation; GF(2); Combinatorics; Discrete mathematics; Finite field","score_opus":0.015836492332065445,"score_gpt":0.2384164064629816,"score_spread":0.22257991413091616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139563752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16785467,0.000027868751,0.80398667,0.00052781036,0.00014858537,0.0002482352,0.0000043429154,0.00006656298,0.027135251],"genre_scores_gemma":[0.98631525,0.0000025553054,0.013217537,0.00026583063,0.000008938625,0.00001281725,0.0000013189443,0.000007531664,0.00016824799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999151,0.00012864188,0.00022392151,0.00013616723,0.0002270738,0.00013322652],"domain_scores_gemma":[0.99870294,0.0005034463,0.00012074004,0.0006142064,0.000029920515,0.000028756054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005504407,0.00010624896,0.0001254285,0.000060462928,0.000100765945,0.00009360129,0.00040414478,0.000031082294,0.00007190258],"category_scores_gemma":[0.00019452178,0.000066173976,0.00009356769,0.00029536287,0.000048920996,0.00011849741,0.000038580998,0.000078457924,0.000025189183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014813771,0.000047082733,0.000018551173,0.00002955392,0.000011250577,7.6175735e-7,0.0021689208,0.000030790936,0.00040326908,0.9966943,0.00037217827,0.00022183132],"study_design_scores_gemma":[0.00011340832,0.00007944042,0.000032004722,0.000069050206,0.000009175715,0.000003513339,0.00020361229,0.017004427,0.0041654864,0.9777158,0.00049323053,0.000110873705],"about_ca_topic_score_codex":8.30238e-7,"about_ca_topic_score_gemma":0.0000013178152,"teacher_disagreement_score":0.8184605,"about_ca_system_score_codex":0.000007854801,"about_ca_system_score_gemma":0.000014958846,"threshold_uncertainty_score":0.26984966},"labels":[],"label_agreement":null},{"id":"W2139812902","doi":"10.48550/arxiv.1510.06999","title":"On a problem of Sidon for polynomials over finite fields","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Omega; Combinatorics; Conjecture; Physics; Integer (computer science); Polynomial; Mathematics; Mathematical analysis; Quantum mechanics","score_opus":0.08083855480742418,"score_gpt":0.20205503985040998,"score_spread":0.12121648504298581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139812902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24040903,0.000033855846,0.75250715,0.00008398817,0.00040923926,0.00046118078,0.000042228632,0.00013018966,0.0059231534],"genre_scores_gemma":[0.9967464,0.00001815802,0.002392784,0.00012843267,0.00005225122,0.0000023220787,0.0000073296287,0.00001065093,0.00064162654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873495,0.00010158138,0.00018355611,0.0006692415,0.00007432756,0.00023633239],"domain_scores_gemma":[0.998114,0.00043087534,0.00026767573,0.00092604733,0.00015270482,0.00010867766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043044458,0.0002196882,0.00031923302,0.00030064254,0.000068037385,0.0000488327,0.0013366597,0.00026850446,0.000019793906],"category_scores_gemma":[0.000048811078,0.0002396803,0.00031869736,0.0003589593,0.0000718162,0.00014962637,0.0008670076,0.00027361314,0.000009879493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002103507,0.00012549022,0.00021872099,0.0001227676,0.00008857631,0.000017303784,0.0003242045,0.08516232,0.00002773314,0.9104379,0.0021761297,0.0010885176],"study_design_scores_gemma":[0.000758626,0.00038234616,0.00008352754,0.000162493,0.00005541515,5.383005e-7,0.000017986373,0.08299922,0.00038780223,0.91340566,0.0014032965,0.00034309793],"about_ca_topic_score_codex":0.000041189516,"about_ca_topic_score_gemma":0.000015388698,"teacher_disagreement_score":0.7563374,"about_ca_system_score_codex":0.000053139494,"about_ca_system_score_gemma":0.00015763713,"threshold_uncertainty_score":0.9773879},"labels":[],"label_agreement":null},{"id":"W2141324117","doi":"10.1016/j.disc.2015.05.025","title":"Generalized de Bruijn words for primitive words and powers","year":2015,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; De Bruijn sequence; Combinatorics; Word (group theory); Alphabet; Mathematics; Order (exchange); Upper and lower bounds; Combinatorics on words; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.03411923224235038,"score_gpt":0.2946641922986173,"score_spread":0.2605449600562669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141324117","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059452612,0.00041859262,0.93431485,0.00054341386,0.00043607134,0.0007270944,0.00006610019,0.00024549174,0.003795781],"genre_scores_gemma":[0.1667714,0.00014079208,0.83158773,0.00038290911,0.00020047998,0.0002956857,0.000043474425,0.00006564236,0.0005119083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982651,0.00010183282,0.00037314865,0.0005568968,0.0002797912,0.00042321978],"domain_scores_gemma":[0.9981406,0.0002810272,0.00029140478,0.00094571215,0.00012573518,0.00021552535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012222982,0.00036839725,0.0005115534,0.00017144483,0.000120378856,0.00042915152,0.0010855165,0.0002478523,0.000007496482],"category_scores_gemma":[0.00019928292,0.00033281944,0.00025297454,0.00018241188,0.00013590489,0.00012986935,0.0013121724,0.00031350672,0.000003998485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000330077,0.00007871714,0.000043484233,0.0006167115,0.00018826452,0.000007366518,0.026723277,0.00011813407,0.00008162523,0.966098,0.0017180747,0.004293344],"study_design_scores_gemma":[0.00052474416,0.00008594078,0.000022741373,0.00031808135,0.00009582441,0.000016122178,0.00060467434,0.06377362,0.00027238243,0.93208385,0.001691459,0.0005105861],"about_ca_topic_score_codex":0.000006895057,"about_ca_topic_score_gemma":0.000004108353,"teacher_disagreement_score":0.10731878,"about_ca_system_score_codex":0.00006856601,"about_ca_system_score_gemma":0.00019646638,"threshold_uncertainty_score":0.9999124},"labels":[],"label_agreement":null},{"id":"W2141337917","doi":"10.1109/glocom.1993.318116","title":"Unicity distance of linear and non-linear pseudonoise sequence generators for direct-sequence spread spectrum systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Pseudorandom noise; Plaintext; Cryptosystem; Sequence (biology); Mathematics; Cryptography; Code (set theory); Spread spectrum; Discrete mathematics; Ciphertext; Function (biology); Shift register; Algorithm; Combinatorics; Computer science; Encryption; Code division multiple access; Telecommunications; Computer network; Biology","score_opus":0.037596086758551535,"score_gpt":0.2530975084620982,"score_spread":0.2155014217035467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141337917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2251159,0.00076680334,0.76916736,0.00031464116,0.00041399413,0.00046510552,0.00004940883,0.00021343619,0.0034933474],"genre_scores_gemma":[0.9663356,0.00018567179,0.033030096,0.00008095742,0.000083600695,0.000024875328,0.0000013249713,0.000011817866,0.00024603587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856186,0.000057266556,0.00033813147,0.0005221893,0.00019734302,0.00032319935],"domain_scores_gemma":[0.9987411,0.00019351617,0.0001508108,0.00068503065,0.000092149145,0.00013739047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040211465,0.00020436964,0.00030466134,0.00010580176,0.00018721678,0.000075694225,0.0006881126,0.000072287665,0.0000147703595],"category_scores_gemma":[0.000042823023,0.00017987017,0.00010128863,0.00045914977,0.00019348277,0.0003757766,0.00013368722,0.00009707203,0.00000764387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041338713,0.00014892084,0.0031685762,0.00024903836,0.000061727944,0.00001993348,0.00071942096,0.0014216482,0.015876995,0.9721121,0.00039280334,0.005787491],"study_design_scores_gemma":[0.0005371413,0.00035941342,0.0001338704,0.00013486623,0.000022864213,0.000028503026,0.00004046663,0.93147737,0.055513166,0.008183471,0.0030549387,0.00051390374],"about_ca_topic_score_codex":0.00009247015,"about_ca_topic_score_gemma":0.000026079892,"teacher_disagreement_score":0.96392864,"about_ca_system_score_codex":0.000023086177,"about_ca_system_score_gemma":0.000018664638,"threshold_uncertainty_score":0.7334893},"labels":[],"label_agreement":null},{"id":"W2141363069","doi":"10.1145/1277548.1277590","title":"Faster algorithms for the characteristic polynomial","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Field (mathematics); Polynomial; Algorithm; Time complexity; Matrix (chemical analysis); Computational complexity theory; Computer science; Discrete mathematics; Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.024563613840982063,"score_gpt":0.26749654145927426,"score_spread":0.2429329276182922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141363069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047195163,0.000024835252,0.9905193,0.00087824743,0.0007138854,0.00013072281,0.0000011877677,0.00009559494,0.0029167023],"genre_scores_gemma":[0.9655864,0.0000019171594,0.031220552,0.0016664669,0.00040065264,0.000014406399,7.3396114e-7,0.0000054443776,0.0011034007],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994545,0.000010179508,0.000104152314,0.00014885252,0.000076564225,0.00020574301],"domain_scores_gemma":[0.99921316,0.00039369133,0.000026771837,0.0003013351,0.000025382731,0.00003968514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006043552,0.0000631637,0.00005486787,0.000043736185,0.00015651782,0.00010489609,0.0005599003,0.000023364904,0.0000313088],"category_scores_gemma":[0.000014591117,0.00003816525,0.00007799906,0.00014651066,0.00003368841,0.00012302931,0.00008330867,0.00004709294,0.000026088273],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037804297,0.00003351274,0.00017318704,0.0000037717407,0.000022867429,0.0000027070769,0.00046773202,8.518563e-7,0.0011116121,0.29062614,0.0027605526,0.7047593],"study_design_scores_gemma":[0.0018109656,0.00063480897,0.0660449,0.000021158374,0.000049053542,0.00007537332,0.00032551266,0.063280076,0.015506126,0.0395579,0.81180155,0.0008925961],"about_ca_topic_score_codex":0.0000035027754,"about_ca_topic_score_gemma":0.000003929148,"teacher_disagreement_score":0.9608669,"about_ca_system_score_codex":0.0000052295695,"about_ca_system_score_gemma":0.000008795928,"threshold_uncertainty_score":0.15563336},"labels":[],"label_agreement":null},{"id":"W2141750148","doi":"10.1109/ccece.1998.682777","title":"Differential-like cryptanalysis of a class of substitution-permutation networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Differential cryptanalysis; Linear cryptanalysis; Higher-order differential cryptanalysis; Block cipher; Permutation (music); Computer science; Substitution (logic); Differential (mechanical device); Cryptanalysis; Boomerang attack; Class (philosophy); Impossible differential cryptanalysis; Theoretical computer science; Algorithm; Mathematics; Cryptography; Artificial intelligence; Engineering; Physics","score_opus":0.013799964398430127,"score_gpt":0.20778171277029392,"score_spread":0.1939817483718638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141750148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15639709,0.000094070354,0.8410177,0.00004902545,0.00011926207,0.000037184556,5.421344e-7,0.00004395301,0.0022411486],"genre_scores_gemma":[0.9960487,0.000029570636,0.0037794935,0.00003400961,0.0000150218775,0.0000027263286,0.0000013024829,0.000002231564,0.0000869497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992595,0.000056931294,0.0002415541,0.00016199808,0.00016845469,0.00011157906],"domain_scores_gemma":[0.9993395,0.000076457225,0.00011686177,0.00034681175,0.000085256026,0.00003509343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009405579,0.00007282,0.00015596548,0.00016122898,0.00004727319,0.000021266842,0.00035591362,0.000040157793,0.00039635354],"category_scores_gemma":[0.000010218773,0.00006229391,0.00015503283,0.00078070763,0.0000745957,0.00017444126,0.000055041484,0.000047792993,0.000004811247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006027215,0.00013065345,0.0016013082,0.000011443289,0.00007476974,0.0000010439039,0.0002497333,0.0031644262,0.0017858903,0.97907096,0.00013205412,0.013771699],"study_design_scores_gemma":[0.00027142247,0.0000734024,0.003942509,0.000018462046,0.00005435251,0.000002195853,0.000020137439,0.97979134,0.0039009526,0.011484401,0.0003079505,0.00013288655],"about_ca_topic_score_codex":0.00000894464,"about_ca_topic_score_gemma":0.0000064305855,"teacher_disagreement_score":0.9766269,"about_ca_system_score_codex":0.0000061991345,"about_ca_system_score_gemma":0.0000046165464,"threshold_uncertainty_score":0.43397933},"labels":[],"label_agreement":null},{"id":"W2142061932","doi":"10.1112/s1461157013000223","title":"Wieferich pairs and Barker sequences, II","year":2014,"lang":"en","type":"article","venue":"LMS Journal of Computation and Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Simon Fraser University; Western Canada Research Grid; Compute Canada; Simons Foundation","keywords":"Circulant matrix; Sequence (biology); Prime (order theory); Hadamard transform; Computation; Matrix (chemical analysis); Hadamard matrix; Multiple","score_opus":0.011219062029175237,"score_gpt":0.23235483853112363,"score_spread":0.22113577650194838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142061932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1648186,0.000111512054,0.83368635,0.00046804568,0.00010351103,0.000027082488,1.1983944e-7,0.000017199389,0.0007675959],"genre_scores_gemma":[0.7524374,0.000047757978,0.24727646,0.00018935109,0.000028842867,2.9467182e-7,9.979146e-8,0.0000028586626,0.000016933045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993932,0.000055722816,0.0002481447,0.00007211613,0.00015304182,0.00007774948],"domain_scores_gemma":[0.99933875,0.00019881241,0.0002152053,0.00007403021,0.00009678224,0.000076416894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007029302,0.00006977112,0.00014623714,0.00009880743,0.000116306,0.000101712045,0.00014484642,0.000024776371,0.0000034425052],"category_scores_gemma":[0.00005158534,0.00005398293,0.000034744415,0.00013243993,0.000049770017,0.00025209304,0.00006682905,0.00007910599,8.7263413e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008386671,0.000101919795,0.00024338829,0.00010850329,0.000043445823,0.0000063946823,0.006328474,0.00049675634,0.00046439277,0.8586594,0.00073470036,0.13280427],"study_design_scores_gemma":[0.00047673733,0.00041411608,0.0008306442,0.000118783995,0.000021506421,0.00046468747,0.0001916926,0.18360373,0.00013473362,0.8108046,0.0028043662,0.00013441367],"about_ca_topic_score_codex":3.0634922e-7,"about_ca_topic_score_gemma":2.689359e-7,"teacher_disagreement_score":0.5876188,"about_ca_system_score_codex":0.000003611332,"about_ca_system_score_gemma":0.000013993206,"threshold_uncertainty_score":0.220136},"labels":[],"label_agreement":null},{"id":"W2142080379","doi":"10.1109/asap.1995.522931","title":"An array processor for inner product computations using a Fermat number ALU","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Fermat's Last Theorem; Computation; Product (mathematics); Ring (chemistry); Computer science; Polynomial; Moduli; Parallel computing; Polynomial ring; Computational complexity theory; Mathematics; Computational science; Algorithm; Discrete mathematics; Physics; Geometry; Mathematical analysis","score_opus":0.04894018998387789,"score_gpt":0.2960886673696947,"score_spread":0.2471484773858168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142080379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07862132,0.000021589987,0.91722596,0.0006922911,0.00016419098,0.00025985597,0.000001818479,0.00028762245,0.0027253528],"genre_scores_gemma":[0.76505876,5.721609e-7,0.23425442,0.0003921656,0.000082246755,0.000024584942,0.0000015678726,0.000007337247,0.00017835642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914914,0.000041613566,0.00014459196,0.00032948982,0.0001170763,0.00021806124],"domain_scores_gemma":[0.9993463,0.000049525417,0.000046963127,0.00036100854,0.00012522157,0.00007094602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017788813,0.00010454173,0.00009968596,0.0000740605,0.00026178895,0.00020511079,0.00044667072,0.000024135448,0.00009169151],"category_scores_gemma":[0.000017529681,0.00008948885,0.00005920931,0.0005252204,0.000037025606,0.00070561405,0.000031282052,0.00005296467,0.000037553258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026694412,0.001384528,0.0046371776,0.00018176317,0.00009501003,0.000005979671,0.009597692,0.004801991,0.021114143,0.8617572,0.008081632,0.08831615],"study_design_scores_gemma":[0.00070868066,0.00014737002,0.00058436836,0.00003889289,0.000026672891,0.000090690126,0.000098555756,0.8721417,0.013606077,0.10114677,0.010787264,0.00062295655],"about_ca_topic_score_codex":0.0000040119476,"about_ca_topic_score_gemma":0.0000034615537,"teacher_disagreement_score":0.86733973,"about_ca_system_score_codex":0.000010286805,"about_ca_system_score_gemma":0.000014564988,"threshold_uncertainty_score":0.36492494},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016014499892090993,"score_gpt":0.23097149485726928,"score_spread":0.21495699496517828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143019587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00297751,0.00001894966,0.9953304,0.00013490475,0.00021482835,0.00043502834,0.00004274738,0.00020584662,0.0006398049],"genre_scores_gemma":[0.97452796,0.000010838519,0.024226341,0.0004908282,0.000026993795,0.00006732277,0.000004142249,0.000009709253,0.0006358662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990833,0.00007555229,0.00026623224,0.00017286508,0.0001663548,0.00023571055],"domain_scores_gemma":[0.99910885,0.00024183163,0.00011051841,0.00028290405,0.00013257086,0.00012330382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046864478,0.00016273034,0.00012126046,0.00019235202,0.00058842567,0.00023063313,0.00020411398,0.000079130325,0.00016187488],"category_scores_gemma":[0.0000069144,0.00012004363,0.00006601343,0.00034121066,0.00006571579,0.0021986233,0.000002622736,0.00016511983,0.00006784292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001056469,0.00038379416,0.00013426844,0.00022755968,0.00017026684,0.000039644525,0.021254497,0.0934521,0.000056317567,0.16506895,0.0016840502,0.7164721],"study_design_scores_gemma":[0.003116395,0.00071218325,0.000052111296,0.00009827826,0.0000425914,0.0009337861,0.00025062656,0.9724854,0.0030577148,0.011631199,0.007108006,0.00051167194],"about_ca_topic_score_codex":0.0000047805615,"about_ca_topic_score_gemma":0.0000060512093,"teacher_disagreement_score":0.97155046,"about_ca_system_score_codex":0.00002207866,"about_ca_system_score_gemma":0.000036025114,"threshold_uncertainty_score":0.4895237},"labels":[],"label_agreement":null},{"id":"W2143563649","doi":"10.1145/1837210.1837233","title":"Parallel sparse polynomial interpolation over finite fields","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Finite field; Interpolation (computer graphics); Polynomial; Polynomial interpolation; Probabilistic logic; Mathematics; Zero (linguistics); Field (mathematics); Algorithm; Computer science; Applied mathematics; Discrete mathematics; Pure mathematics; Linear interpolation; Mathematical analysis; Artificial intelligence; Statistics","score_opus":0.011980715784398358,"score_gpt":0.23437907440278627,"score_spread":0.22239835861838791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143563649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1325944,0.0000045400834,0.8367318,0.00062553305,0.0010925658,0.000049765433,4.5104338e-7,0.00017894256,0.028721977],"genre_scores_gemma":[0.96291983,0.0000010415332,0.03567817,0.00076718593,0.00013111283,0.0000033709987,7.5480324e-7,0.00000279756,0.0004957433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948514,0.000020656265,0.000101453734,0.00017541871,0.000082520746,0.00013478796],"domain_scores_gemma":[0.99943215,0.000102084945,0.000029396488,0.0003662688,0.000016118815,0.000054001357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015351594,0.00007050797,0.00005980675,0.00007814119,0.000066885084,0.000109502354,0.00042744016,0.000066358116,0.00052713737],"category_scores_gemma":[0.000025319056,0.000060704933,0.00006681136,0.00015319375,0.00002770321,0.00030946915,0.00013042692,0.00017604204,0.00008305389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028288407,0.00005633628,0.004069833,0.0000024962078,0.000012336175,0.000004411532,0.0005764785,0.000031770924,0.0037077758,0.94906956,0.009450963,0.03298977],"study_design_scores_gemma":[0.0018366113,0.0004105346,0.050320864,0.000022963568,0.000017858642,0.000032656746,0.0000488462,0.52285063,0.0041535716,0.258722,0.16052799,0.0010554581],"about_ca_topic_score_codex":0.000024015682,"about_ca_topic_score_gemma":0.0000898918,"teacher_disagreement_score":0.8303254,"about_ca_system_score_codex":0.0000018771269,"about_ca_system_score_gemma":0.0000136212575,"threshold_uncertainty_score":0.5771784},"labels":[],"label_agreement":null},{"id":"W2144302285","doi":"10.1109/newcas.2012.6328942","title":"Stochastic chase decoder for reed-solomon codes","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Field-programmable gate array; Soft-decision decoder; Coding gain; Coding (social sciences); Code (set theory); Reed–Solomon error correction; Parallel computing; Algorithm; Computer hardware; Concatenated error correction code; Mathematics; Programming language; Block code","score_opus":0.0375525481023082,"score_gpt":0.28780112929294377,"score_spread":0.2502485811906356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144302285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027698271,0.00043876027,0.9912462,0.00036090988,0.0016628891,0.0005594739,0.00002370765,0.00048473733,0.0024534992],"genre_scores_gemma":[0.8854396,0.000008401229,0.113122314,0.00040050535,0.0003320095,0.000265346,0.000022909506,0.000022761715,0.0003861753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983675,0.00006471456,0.00027079147,0.0006342505,0.0001910264,0.00047170714],"domain_scores_gemma":[0.99806446,0.00032446595,0.00015120527,0.0011776875,0.000109434695,0.00017272696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070809585,0.0002848078,0.00032622676,0.00019109738,0.00015540425,0.00022672243,0.0015052147,0.00024775142,0.000055549684],"category_scores_gemma":[0.00006141899,0.000267228,0.0003127542,0.0001476912,0.00006709317,0.00019052865,0.001366705,0.0003076449,0.000047364414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048656202,0.00018700556,0.000039139588,0.0001424027,0.000108599736,0.0000019375582,0.0010126772,0.0009030578,0.00014458837,0.94705606,0.0020269465,0.048328936],"study_design_scores_gemma":[0.0007111103,0.00018128956,0.00022008835,0.00018972467,0.000113194816,0.000019792993,0.0000494253,0.10805566,0.001086685,0.884869,0.0032803898,0.0012236581],"about_ca_topic_score_codex":0.000017951117,"about_ca_topic_score_gemma":0.000018846085,"teacher_disagreement_score":0.88266975,"about_ca_system_score_codex":0.000026308917,"about_ca_system_score_gemma":0.000071198214,"threshold_uncertainty_score":0.999978},"labels":[],"label_agreement":null},{"id":"W2144323841","doi":"10.1109/tit.2011.2159478","title":"Two New Measures for Permutations: Ambiguity and Deficiency","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Abelian group; Ambiguity; Combinatorics; Multiplicative function; Function (biology); Inverse; Mathematics; Discrete mathematics; Finite field; Computer science","score_opus":0.030470348110095424,"score_gpt":0.24476481365843122,"score_spread":0.2142944655483358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144323841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002573564,0.000029820496,0.99042386,0.000064498796,0.00036861992,0.00024132211,0.0000116715755,0.00021471556,0.0060719415],"genre_scores_gemma":[0.9793769,0.000015855027,0.019987678,0.0004565782,0.000011840209,0.00006173203,0.000001265489,0.0000042938477,0.00008385914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992808,0.00006318949,0.00023353177,0.00012586499,0.00013909336,0.00015753313],"domain_scores_gemma":[0.9993149,0.00015524849,0.00007706263,0.0002703793,0.00009366162,0.00008875697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005735554,0.000110388486,0.000085063235,0.0002757347,0.00038089935,0.0001104783,0.00028152813,0.00004204206,0.0000456087],"category_scores_gemma":[0.000016664899,0.00010379456,0.00008700881,0.00028318932,0.00006725692,0.0018176029,0.0000020411433,0.00009517492,0.000041120227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006474736,0.00003583872,0.0000024253568,0.0000107093865,0.000011635539,7.930855e-8,0.006816545,0.00027964325,0.00003167659,0.71704674,0.00004990052,0.27565008],"study_design_scores_gemma":[0.0012012772,0.00034339272,0.00031883933,0.000026828688,0.00004215527,0.000023155266,0.00094890414,0.0053080143,0.012291463,0.9774337,0.0017356301,0.000326667],"about_ca_topic_score_codex":0.00001632062,"about_ca_topic_score_gemma":0.0000063171856,"teacher_disagreement_score":0.97680336,"about_ca_system_score_codex":0.000016279442,"about_ca_system_score_gemma":0.000058692396,"threshold_uncertainty_score":0.42326194},"labels":[],"label_agreement":null},{"id":"W2144706139","doi":"10.1109/isit.2004.1365583","title":"On the zeta functions of two towers of function fields","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Jacobian matrix and determinant; Hyperelliptic curve cryptography; Discrete logarithm; Mathematics; Finite field; Abelian group; Riemann zeta function; Elliptic curve; Hyperelliptic curve; Pure mathematics; Function (biology); Elliptic function; Logarithm; Discrete mathematics; Applied mathematics; Mathematical analysis; Elliptic curve cryptography; Computer science; Public-key cryptography","score_opus":0.015073378452901581,"score_gpt":0.2230687911632948,"score_spread":0.20799541271039323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144706139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11978268,0.000013958267,0.8445837,0.0011012271,0.0002819689,0.00004656086,4.773404e-7,0.00003884075,0.03415062],"genre_scores_gemma":[0.99856603,0.0000017041369,0.0008657786,0.00035808142,0.000011355755,0.000002372015,1.9807979e-7,0.0000012243136,0.00019325168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962825,0.00002262079,0.00009345654,0.000091079455,0.000102395075,0.00006222982],"domain_scores_gemma":[0.99946284,0.00011863948,0.000039204806,0.0003316551,0.000032881228,0.00001475307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017383802,0.00004105768,0.000051783965,0.000056325254,0.000053558753,0.000010096924,0.0002474677,0.000018220464,0.00013768347],"category_scores_gemma":[0.00001536519,0.00002563363,0.00007452998,0.00031179228,0.00004161271,0.00007542719,0.000040133484,0.00005526302,0.0000107752285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010181803,0.00004067112,0.000036221707,0.0000017713672,0.000011346173,1.0472022e-7,0.0001316813,0.0009950977,0.00058802933,0.99190867,0.00043868017,0.005837532],"study_design_scores_gemma":[0.00043386308,0.0006709632,0.0009743364,0.000026879276,0.000015298107,0.0000020307352,0.00014052079,0.00058651995,0.016730221,0.97907853,0.0012503035,0.00009055708],"about_ca_topic_score_codex":0.00003272872,"about_ca_topic_score_gemma":0.000011678462,"teacher_disagreement_score":0.87878335,"about_ca_system_score_codex":0.000003837908,"about_ca_system_score_gemma":0.000015654008,"threshold_uncertainty_score":0.15075375},"labels":[],"label_agreement":null},{"id":"W2145728281","doi":"10.1109/ftcs.1991.146689","title":"Burst and unidirectional error detecting codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Minimum distance; Upper and lower bounds; Computer science; Combinatorics; Probability of error; Discrete mathematics; Algorithm; Mathematics","score_opus":0.027856236012454683,"score_gpt":0.22538321749012133,"score_spread":0.19752698147766665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145728281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3652382,0.0005036477,0.5385972,0.0014833023,0.0004184128,0.00007710241,7.5618163e-7,0.00075041864,0.09293093],"genre_scores_gemma":[0.98476017,0.0000075813696,0.014539377,0.00016777901,0.000028045124,0.0000020803577,5.146714e-8,0.0000019432691,0.00049300044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996065,0.000025308835,0.000054486787,0.00014758181,0.0000672022,0.000098911274],"domain_scores_gemma":[0.9997192,0.00008827705,0.000014571388,0.00012301134,0.000015569723,0.000039392537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012717054,0.000047693615,0.000044080538,0.000058756614,0.00016256764,0.00007653279,0.00014483738,0.000017579561,0.00011023051],"category_scores_gemma":[0.000016084863,0.00004180424,0.000022565053,0.00021466272,0.000031876847,0.0001655712,0.0000677041,0.000048422662,0.000018350698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027514768,0.00004249884,0.002932071,0.000005907714,0.000017503995,0.000005409899,0.0005948863,0.000014780569,0.0011535643,0.78814584,0.0007298293,0.20635498],"study_design_scores_gemma":[0.0013909924,0.000655538,0.019604791,0.00007812147,0.000028271455,0.0006112397,0.0005822052,0.5417297,0.025554838,0.30010623,0.10824099,0.0014171063],"about_ca_topic_score_codex":0.000006157393,"about_ca_topic_score_gemma":0.000008605701,"teacher_disagreement_score":0.6195219,"about_ca_system_score_codex":0.0000036828653,"about_ca_system_score_gemma":0.0000017062513,"threshold_uncertainty_score":0.17047274},"labels":[],"label_agreement":null},{"id":"W2146559163","doi":"10.1109/ccece.2000.849662","title":"A low-power reduced-area ROM architecture for cryptographic algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Scalability; Read-only memory; Control logic; Block cipher; Overhead (engineering); Computer hardware; Embedded system; Parallel computing; Cryptography; Algorithm; Operating system","score_opus":0.01816150721499426,"score_gpt":0.22279859053301904,"score_spread":0.20463708331802477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146559163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015966624,0.00020849831,0.96464854,0.001797332,0.00048783072,0.0003161577,0.000005866259,0.0005815405,0.015987622],"genre_scores_gemma":[0.8411717,0.000017345295,0.15693586,0.0011365435,0.00009436713,0.000089415196,0.0000019320214,0.00001948583,0.00053336984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853945,0.000050053637,0.00020719429,0.00053881813,0.00021676361,0.00044774078],"domain_scores_gemma":[0.99877256,0.00018006796,0.000057678775,0.00076243735,0.00007314832,0.00015409249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023621586,0.00021368336,0.00018679257,0.0003006578,0.0002287544,0.00019479754,0.0010087304,0.00009248927,0.00037456624],"category_scores_gemma":[0.000031949607,0.00017619999,0.00031362262,0.0008772146,0.000084658095,0.000228011,0.00014241914,0.00016425888,0.000040613453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027238624,0.00044629106,0.000063949374,0.000031239164,0.00010762299,0.00001658939,0.0023526738,0.00006653805,0.006297584,0.6189292,0.018585723,0.35307536],"study_design_scores_gemma":[0.0024755453,0.0015617118,0.00181016,0.00014338235,0.00004835648,0.00015230633,0.00014629329,0.041174762,0.011633644,0.7723385,0.16667065,0.0018446688],"about_ca_topic_score_codex":0.0000027793724,"about_ca_topic_score_gemma":0.0000057818675,"teacher_disagreement_score":0.8252051,"about_ca_system_score_codex":0.000008314341,"about_ca_system_score_gemma":0.0000097910715,"threshold_uncertainty_score":0.71852267},"labels":[],"label_agreement":null},{"id":"W2146782192","doi":"10.1016/j.laa.2012.04.049","title":"Is every matrix similar to a polynomial in a companion matrix?","year":2012,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Monic polynomial; Matrix (chemical analysis); Degree (music); Rank (graph theory); Finite field; Field (mathematics); Integer (computer science); Polynomial ring; Discrete mathematics; Polynomial; Pure mathematics; Physics; Mathematical analysis","score_opus":0.021878967935034084,"score_gpt":0.2993224730417016,"score_spread":0.27744350510666754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146782192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31795657,0.0057446645,0.6610183,0.009216879,0.0006563996,0.0032038137,0.00024853455,0.00058641995,0.0013683955],"genre_scores_gemma":[0.9709023,0.00020590184,0.026521873,0.00091641606,0.00053942547,0.00059078465,0.000036813555,0.00002650933,0.00025992456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983909,0.000069103946,0.00035799554,0.00065579696,0.00018347282,0.00034268963],"domain_scores_gemma":[0.99864805,0.000104334,0.000119736695,0.0008406299,0.00006285112,0.00022439736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032269416,0.0002645773,0.0003086191,0.00034974935,0.00015424463,0.00016012073,0.0009234624,0.00022491692,0.00003650244],"category_scores_gemma":[0.000011818725,0.0002756748,0.00012678666,0.000621787,0.000029570238,0.00017090053,0.0013008094,0.00043052042,0.00020329106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007004727,0.0008215388,0.0027517038,0.00049630133,0.00013907405,0.000004869858,0.0072549717,0.00053960993,0.0030043107,0.9454892,0.009061483,0.030366834],"study_design_scores_gemma":[0.0021146578,0.00023073578,0.03281973,0.00062137994,0.00025954595,0.00007014464,0.0002304052,0.110294275,0.0053396826,0.20519646,0.6388767,0.003946293],"about_ca_topic_score_codex":0.000023552704,"about_ca_topic_score_gemma":0.0000058855667,"teacher_disagreement_score":0.7402928,"about_ca_system_score_codex":0.00003156967,"about_ca_system_score_gemma":0.00007073403,"threshold_uncertainty_score":0.99996954},"labels":[],"label_agreement":null},{"id":"W2146949677","doi":"10.1006/eujc.2000.0409","title":"Transitive Factorizations in the Symmetric Group, and Combinatorial Aspects of Singularity Theory","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monodromy; Symmetric group; Combinatorics; Conjecture; Alternating group; Group (periodic table); Permutation group; Permutation (music); Combinatorial proof; Generating function; Series (stratigraphy); Holomorphic function; Partition (number theory); Pure mathematics","score_opus":0.010295371457462905,"score_gpt":0.20785636947065797,"score_spread":0.19756099801319507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146949677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7585555,0.0011530614,0.18620889,0.0002827835,0.0012893985,0.00017212126,0.0000036770045,0.00003051133,0.05230408],"genre_scores_gemma":[0.9994565,0.00012446148,0.00029072765,0.0000623089,0.000053796535,2.3718044e-7,4.0905678e-7,0.000007759751,0.000003765709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997195,0.0017610363,0.0004159793,0.00012653174,0.00035094385,0.00015047609],"domain_scores_gemma":[0.998797,0.0005584068,0.0002188831,0.00024061919,0.00011875401,0.000066358385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027337777,0.000116586576,0.00020914203,0.00030665094,0.00011317645,0.00009029175,0.0008563519,0.000021577262,0.0000070608094],"category_scores_gemma":[0.00012352518,0.00008723527,0.000103391496,0.0016032623,0.00010417829,0.00032612577,0.00004122835,0.00035078355,0.0000013939082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036890404,0.0002804746,0.00077010645,0.0000075613757,0.000019379531,0.00010077487,0.0023322443,0.0000073345905,0.000026943071,0.9839909,0.000017982744,0.012409421],"study_design_scores_gemma":[0.0015155277,0.0009663846,0.08197567,0.000050045954,0.00003023666,0.00010398989,0.00012246678,0.00006890892,0.00007293889,0.913194,0.0017601433,0.00013966163],"about_ca_topic_score_codex":7.88935e-7,"about_ca_topic_score_gemma":3.5714348e-7,"teacher_disagreement_score":0.24090107,"about_ca_system_score_codex":0.000017521696,"about_ca_system_score_gemma":0.0000321638,"threshold_uncertainty_score":0.3557351},"labels":[],"label_agreement":null},{"id":"W2146987189","doi":"10.1109/itw.2007.4313068","title":"On Codes of Bounded Trellis Complexity","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Trellis (graph); Matroid; Discrete mathematics; Permutation (music); Combinatorics; Bounded function; Time complexity; Mathematics; Computer science; Decoding methods; Algorithm","score_opus":0.03367316908111371,"score_gpt":0.27080077291437127,"score_spread":0.23712760383325757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146987189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19658065,0.000009926642,0.7089832,0.00010965296,0.00009234341,0.000032392734,6.675459e-7,0.00009498016,0.0940962],"genre_scores_gemma":[0.9719033,0.0000010814349,0.027658105,0.00027689527,0.000010121092,3.5269582e-7,3.755707e-7,0.0000016989558,0.00014804855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994667,0.000024003568,0.000118126794,0.00013233096,0.00012903842,0.00012975422],"domain_scores_gemma":[0.99937993,0.00020387812,0.00003550685,0.0003112776,0.000027476764,0.00004194475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045847794,0.000054517186,0.00008392046,0.00009051124,0.000055784996,0.000024422148,0.00039210243,0.000021691345,0.00007541428],"category_scores_gemma":[0.0000129765685,0.000044546825,0.00006150769,0.0002931494,0.000096452786,0.00007367404,0.00005540981,0.00004533456,0.000019229068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016412743,0.00006144331,0.00020319577,0.0000024959838,0.0000051310626,0.0000014790794,0.0001477759,0.000002056054,0.00042013012,0.98979133,0.00029457596,0.009053994],"study_design_scores_gemma":[0.00019059547,0.00018996165,0.0059395107,0.000008786599,0.0000019263057,0.0000022305314,0.000022867382,0.00092517765,0.030813089,0.95968664,0.002125597,0.00009363904],"about_ca_topic_score_codex":0.000021022759,"about_ca_topic_score_gemma":0.000038590348,"teacher_disagreement_score":0.7753227,"about_ca_system_score_codex":0.000005685618,"about_ca_system_score_gemma":0.000007486431,"threshold_uncertainty_score":0.18165667},"labels":[],"label_agreement":null},{"id":"W2147118979","doi":"10.1007/s10623-011-9537-6","title":"On explicit factors of cyclotomic polynomials over finite fields","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; National Natural Science Foundation of China","keywords":"Cyclotomic polynomial; Mathematics; Finite field; Factorization; Cyclotomic field; Field (mathematics); Factorization of polynomials; Combinatorics; Pure mathematics; Polynomial; Discrete mathematics; Mathematical analysis; Algorithm","score_opus":0.04522408745819378,"score_gpt":0.23620401879972105,"score_spread":0.19097993134152727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147118979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6653218,0.00015086128,0.33058256,0.0000139827935,0.00014372617,0.00013821296,0.000010635212,0.0001067339,0.0035314718],"genre_scores_gemma":[0.9926342,0.00008642154,0.006934172,0.00028928524,0.000018843348,0.000015821186,0.0000018669505,0.000012296979,0.0000071331174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869996,0.00011323218,0.00029229416,0.00040499528,0.00018750175,0.00030200934],"domain_scores_gemma":[0.9986948,0.00042582265,0.00014355981,0.0005631966,0.00003878943,0.00013383063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026686292,0.00024093603,0.00030268557,0.0004886814,0.00014336765,0.000064055326,0.0005843942,0.000121052515,0.00010732253],"category_scores_gemma":[0.000023450864,0.0002029474,0.00026276446,0.00061896094,0.00012526399,0.00022690752,0.0001120807,0.00014012141,0.0000038354347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010502532,0.00019273968,0.01712359,0.000023407672,0.00009673216,0.0000065587374,0.002696366,0.0000078235535,0.0027720938,0.97151023,0.00034493726,0.005120474],"study_design_scores_gemma":[0.0015514172,0.0029248523,0.12655032,0.00019357291,0.00009726097,0.000009717101,0.00038996714,0.0013909638,0.07821022,0.7861072,0.0012774246,0.0012971148],"about_ca_topic_score_codex":0.000069890455,"about_ca_topic_score_gemma":0.0000065293475,"teacher_disagreement_score":0.32731235,"about_ca_system_score_codex":0.0000036839085,"about_ca_system_score_gemma":0.000015550433,"threshold_uncertainty_score":0.8275955},"labels":[],"label_agreement":null},{"id":"W2147369663","doi":"10.1109/newcas.2005.1496735","title":"Feasibility of a Digital Design Flow of an-Asynchronous BCJR/MAP Convolutional Channel Decoder","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Turbo code; Convolutional code; BCJR algorithm; Computer science; Serial concatenated convolutional codes; Asynchronous communication; Turbo equalizer; Difference-map algorithm; Soft-decision decoder; Concatenated error correction code; Electronic engineering; Decoding methods; Algorithm; Block code; Telecommunications; Engineering","score_opus":0.03525774947029374,"score_gpt":0.25929542986882625,"score_spread":0.2240376803985325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147369663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09009492,0.00007397976,0.908379,0.0001388488,0.00008209121,0.00013341547,0.000011537362,0.00008103497,0.0010051482],"genre_scores_gemma":[0.87258816,0.0000010699908,0.12727718,0.000050252136,0.00003470247,0.0000041665494,0.000002480253,0.000003716629,0.000038248716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989697,0.00007063749,0.00026788103,0.0002866197,0.00021659627,0.00018859557],"domain_scores_gemma":[0.99905664,0.00015186648,0.00008606679,0.00049083505,0.00012945922,0.00008514022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004280263,0.00010890797,0.00017315618,0.00009546615,0.00005069268,0.000039069913,0.00056834694,0.000049836526,0.00009537262],"category_scores_gemma":[0.000030547093,0.0000967284,0.00011747274,0.00023738213,0.0001453909,0.0007731425,0.00011876842,0.000056593846,0.000016812515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006660779,0.0058433963,0.007431721,0.00016362104,0.00024592484,0.000009860242,0.006011827,0.0435596,0.0045707934,0.719672,0.0019188911,0.20990624],"study_design_scores_gemma":[0.0012113559,0.0007360045,0.0050346907,0.000028337576,0.000014102483,0.000024860448,0.000073304225,0.8128375,0.016187655,0.16323553,0.00024740145,0.00036930604],"about_ca_topic_score_codex":0.0000042943643,"about_ca_topic_score_gemma":0.0000052130868,"teacher_disagreement_score":0.78249323,"about_ca_system_score_codex":0.000023140981,"about_ca_system_score_gemma":0.00009355678,"threshold_uncertainty_score":0.39444697},"labels":[],"label_agreement":null},{"id":"W2147622371","doi":"10.1109/isit.1993.748412","title":"Inverterless Cauchy Cells for a Systolic Reed-Solomon Encoder","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Encoder; Finite field; Arithmetic; Parallel computing; Computer science; Discrete mathematics; Mathematics; Algorithm","score_opus":0.011227250045338503,"score_gpt":0.22403007111996656,"score_spread":0.21280282107462806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147622371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01898616,0.0000772511,0.96873075,0.00093022705,0.00031031296,0.00022385879,0.0000021654478,0.00032303506,0.010416259],"genre_scores_gemma":[0.93858266,0.000005649877,0.05834848,0.0017084328,0.00012767232,0.000043760723,8.542672e-7,0.00000806714,0.0011744278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908173,0.000038416973,0.00016303541,0.00031405926,0.00012042751,0.0002823338],"domain_scores_gemma":[0.999235,0.00010224374,0.000043066484,0.00048253586,0.000047155383,0.00009001873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002634931,0.00011769596,0.00013233494,0.000116340314,0.00012193503,0.00011352876,0.00072325324,0.000056773246,0.000035431924],"category_scores_gemma":[0.0000065899267,0.00010117448,0.0001219575,0.00026631687,0.000033958215,0.0003412317,0.00010764912,0.0000634904,0.00009192069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002098754,0.0001245242,0.000095050396,0.000036701753,0.00002924437,0.0000034355667,0.0018712842,0.000092141374,0.008691834,0.8563146,0.0131682,0.11955198],"study_design_scores_gemma":[0.002267626,0.00065775024,0.0002532016,0.00009914018,0.000048617927,0.0000760397,0.00026798208,0.41483852,0.17232092,0.13499196,0.2727347,0.0014435686],"about_ca_topic_score_codex":0.000017079217,"about_ca_topic_score_gemma":0.0000641981,"teacher_disagreement_score":0.9195965,"about_ca_system_score_codex":0.000019798945,"about_ca_system_score_gemma":0.000024502515,"threshold_uncertainty_score":0.41257757},"labels":[],"label_agreement":null},{"id":"W2148201159","doi":"10.1007/s12095-010-0019-x","title":"Asymptotic enumeration of correlation-immune boolean functions","year":2010,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Boolean function; Mathematics; Combinatorics; Parity function; Function (biology); Discrete mathematics; Maximum satisfiability problem; Boolean data type; Order (exchange); Boolean expression","score_opus":0.008518214191220884,"score_gpt":0.22122794436111445,"score_spread":0.21270973016989356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148201159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12719603,0.0012252867,0.8547583,0.0012474419,0.0005519015,0.0002764169,0.000018666899,0.00023693976,0.014489016],"genre_scores_gemma":[0.95664823,0.0001370573,0.04304063,0.000061734856,0.000017810074,0.000036360652,0.000030647265,0.000006320855,0.000021179692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991422,0.0001022632,0.0003019246,0.00019542575,0.00011912003,0.00013901135],"domain_scores_gemma":[0.9974454,0.00027245298,0.00014972509,0.0019157648,0.00014142152,0.0000752029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033932575,0.00011586209,0.00013754575,0.0003161518,0.00061661593,0.00009692059,0.0010503271,0.00008138859,0.000036018115],"category_scores_gemma":[0.000044080574,0.00011935893,0.0001387343,0.00096649287,0.00040319414,0.00042871854,0.00029750765,0.00034219289,0.000009911046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003646125,0.000102335056,0.0051464443,0.000006155241,0.000033232627,8.0097884e-8,0.00072280114,0.000015900725,0.00511437,0.96169186,0.000058848065,0.027104352],"study_design_scores_gemma":[0.0015692214,0.0004839453,0.18233363,0.00012208814,0.00021117028,0.00006539175,0.001004496,0.04864847,0.003441344,0.6963764,0.06465271,0.0010911704],"about_ca_topic_score_codex":0.000017631963,"about_ca_topic_score_gemma":0.000043291653,"teacher_disagreement_score":0.8294522,"about_ca_system_score_codex":0.000003175781,"about_ca_system_score_gemma":0.00003807676,"threshold_uncertainty_score":0.4867316},"labels":[],"label_agreement":null},{"id":"W2148367244","doi":"10.1145/2442829.2442844","title":"A polynomial time algorithm for computing the HNF of a module over the integers of a number field","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Calgary Laboratory Services","funders":"","keywords":"Modulo; Field (mathematics); Hermite polynomials; Ring of integers; Algorithm; Polynomial ring; Mathematics; Polynomial; Discrete mathematics; Ring (chemistry); Time complexity; Modular design; Algebraic number field; Computer science; Pure mathematics","score_opus":0.00950673958228829,"score_gpt":0.24907717271117355,"score_spread":0.23957043312888526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148367244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06030155,0.00003641796,0.93213475,0.0005480281,0.0002522119,0.0001847618,0.0000026566756,0.000031920914,0.0065077017],"genre_scores_gemma":[0.9667159,5.582712e-7,0.032650054,0.0003858467,0.000105162646,0.0000049559403,2.277698e-7,0.0000035772857,0.00013375458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993995,0.00005905993,0.0001585058,0.000094850766,0.00010714387,0.00018094237],"domain_scores_gemma":[0.9987372,0.0007749504,0.000088744826,0.00034131625,0.000031637497,0.000026120846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006525513,0.0000688443,0.000109591136,0.000024333563,0.00008609825,0.000021344842,0.0006067658,0.00003051205,0.00007730664],"category_scores_gemma":[0.000027949201,0.00003598466,0.00015209055,0.00020470454,0.00007178578,0.00012315165,0.00019458226,0.00006947145,0.0000059970143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006168902,0.00029847794,0.002713844,0.000029637504,0.00020552878,2.6395415e-7,0.010648002,0.00004065247,0.0016174995,0.34236172,0.038732283,0.6032904],"study_design_scores_gemma":[0.0012650702,0.00038996956,0.004431202,0.000078807054,0.000068815316,0.000028357543,0.00069981033,0.91801125,0.044073593,0.015854217,0.014676961,0.0004219581],"about_ca_topic_score_codex":0.000047317582,"about_ca_topic_score_gemma":0.0000011063564,"teacher_disagreement_score":0.9179706,"about_ca_system_score_codex":0.0000040261543,"about_ca_system_score_gemma":0.000013998641,"threshold_uncertainty_score":0.14674118},"labels":[],"label_agreement":null},{"id":"W2148399495","doi":"10.1080/00927870701866648","title":"Simple Formulae for the Number of Quadrics and Symmetric Forms of Modules Over Local Rings","year":2008,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Simple (philosophy); Algebraic number; Interpretation (philosophy); Type (biology); Representation (politics); Algebra over a field; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.03419347623983653,"score_gpt":0.2976487704496305,"score_spread":0.26345529420979397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148399495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4633877,0.0010417636,0.53421503,0.00020867094,0.000020802687,0.00018712372,0.000005579759,0.000021253027,0.0009120982],"genre_scores_gemma":[0.9761988,0.0005933593,0.023106104,0.000051954743,0.000002855541,0.0000340434,0.000002325401,0.0000044046255,0.000006175179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994199,0.00004170011,0.00023857092,0.000099612385,0.00009119914,0.00010898871],"domain_scores_gemma":[0.99726826,0.001154938,0.0001080887,0.0013799359,0.00006857169,0.00002023489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036692867,0.000063695894,0.00012366122,0.00013603747,0.00018355306,0.000011572056,0.0014468558,0.000035262754,0.0000028302306],"category_scores_gemma":[0.000083046696,0.000048258622,0.00006533624,0.0008543899,0.00036042597,0.00019519977,0.0005891354,0.000090746005,6.652398e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049384607,0.00008055789,0.019249702,0.000013659363,0.000011684978,5.685753e-8,0.00063073414,0.00002428957,0.000018864894,0.95404816,0.000045530716,0.02587185],"study_design_scores_gemma":[0.0005722972,0.00005756012,0.15487774,0.000029796383,0.000013440834,0.00001332715,0.00017695654,0.1122853,0.0008163006,0.72816795,0.00285002,0.00013930841],"about_ca_topic_score_codex":0.000038005484,"about_ca_topic_score_gemma":0.00002887449,"teacher_disagreement_score":0.51281106,"about_ca_system_score_codex":0.000010651937,"about_ca_system_score_gemma":0.000018187664,"threshold_uncertainty_score":0.2688642},"labels":[],"label_agreement":null},{"id":"W2148496593","doi":"10.1145/1576702.1576753","title":"Efficient computation of order bases","year":2009,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Dimension (graph theory); Computation; Field (mathematics); Order (exchange); Matrix (chemical analysis); Mathematics; Combinatorics; Basis (linear algebra); Power series; Polynomial; Matrix multiplication; Discrete mathematics; Series (stratigraphy); Algorithm; Pure mathematics; Mathematical analysis; Physics; Geometry","score_opus":0.010243818345754472,"score_gpt":0.23992381607057991,"score_spread":0.22967999772482545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148496593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11132815,0.00001959426,0.8779874,0.00032360142,0.000051389103,0.000027952636,1.045301e-7,0.00007717035,0.010184671],"genre_scores_gemma":[0.95123637,3.5009842e-7,0.048436746,0.00030051425,0.0000058516375,2.8616307e-7,1.8009654e-7,6.168249e-7,0.000019087693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999658,0.000020495743,0.00007823775,0.00009227415,0.000087104614,0.00006389838],"domain_scores_gemma":[0.99975014,0.00003254873,0.00002502862,0.00012264044,0.000050416467,0.000019231731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010921179,0.000034660043,0.000047899386,0.000063082414,0.000027597196,0.000015938906,0.00016455847,0.000010209856,0.000013829454],"category_scores_gemma":[0.000009384039,0.000028353941,0.000028153248,0.00038817007,0.000013315628,0.00003151299,0.00002049404,0.000018017958,0.0000072878033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035178653,0.00009945258,0.00006229115,0.0000021642857,0.000002289337,7.784345e-7,0.00017133816,0.009953449,0.000974394,0.88344556,0.00020276463,0.10508202],"study_design_scores_gemma":[0.00038989386,0.00042703515,0.01334372,0.000027204644,0.0000050622966,0.0000061623005,0.000038028604,0.8451299,0.011469105,0.12840883,0.0005653318,0.00018971783],"about_ca_topic_score_codex":0.0000017863911,"about_ca_topic_score_gemma":2.471798e-7,"teacher_disagreement_score":0.83990824,"about_ca_system_score_codex":0.000002104543,"about_ca_system_score_gemma":0.000008874954,"threshold_uncertainty_score":0.11562402},"labels":[],"label_agreement":null},{"id":"W2148632144","doi":"10.1109/wescan.1988.27670","title":"Applications of forward error coding in mobile communication systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Victoria; Concordia University","funders":"","keywords":"Decoding methods; Computer science; Coding (social sciences); Error detection and correction; Power consumption; Mobile telephony; Communications system; Microprocessor; Theoretical computer science; Real-time computing; Computer engineering; Algorithm; Computer network; Embedded system; Power (physics); Mobile radio; Mathematics; Statistics","score_opus":0.015556260295329975,"score_gpt":0.26144755990866314,"score_spread":0.24589129961333317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148632144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012479191,0.0005144069,0.9554895,0.000030710045,0.00003840485,0.000321884,6.3689885e-7,0.00006650563,0.031058729],"genre_scores_gemma":[0.9839161,0.000027964013,0.015758386,0.000018463545,0.000002096147,0.00018923935,7.3757934e-7,0.000002211342,0.00008480187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994486,0.00010691701,0.00017389697,0.00011106744,0.00007303641,0.00008650218],"domain_scores_gemma":[0.9991842,0.00011759274,0.00005888048,0.0005794281,0.000037473703,0.000022459002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000483901,0.0000442602,0.00008494551,0.00012386183,0.000050864845,0.00002776375,0.0004683177,0.000024807276,0.000009803231],"category_scores_gemma":[0.000009848911,0.000041996693,0.00003189192,0.00058962696,0.000028802366,0.00014370096,0.000053100626,0.00004979016,0.000007735677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.810061e-7,0.000040502142,0.0008844249,0.000009281181,0.0000024458675,5.89352e-8,0.0002495894,0.00022282074,0.00019772738,0.995214,0.00003792084,0.003140642],"study_design_scores_gemma":[0.0023084374,0.0004161356,0.003384951,0.0003827233,0.000031840642,0.000044997738,0.0065652397,0.1328732,0.02078881,0.49060622,0.34136263,0.0012348106],"about_ca_topic_score_codex":0.000018483584,"about_ca_topic_score_gemma":0.00001119814,"teacher_disagreement_score":0.9714369,"about_ca_system_score_codex":0.000011257213,"about_ca_system_score_gemma":0.000014725356,"threshold_uncertainty_score":0.17125754},"labels":[],"label_agreement":null},{"id":"W2149059289","doi":"10.1109/acssc.1990.523456","title":"The Modulus Replication RNS (MRRNS): A Comparative Study","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Chinese remainder theorem; Redundancy (engineering); Computer science; Computation; Algorithm; Finite field; Residue number system; Binary number; Computational complexity theory; Theoretical computer science; Polynomial; Parallel computing; Arithmetic; Mathematics; Discrete mathematics","score_opus":0.03441153603012465,"score_gpt":0.30529478174305025,"score_spread":0.2708832457129256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149059289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38091055,0.00012041254,0.5591943,0.005034635,0.0002129093,0.0005817631,3.9538367e-7,0.0004706511,0.053474385],"genre_scores_gemma":[0.994626,0.0000028716279,0.0041610324,0.0002025097,0.000045917062,0.00004001002,1.8936447e-7,0.0000018058439,0.00091966614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992236,0.00010728909,0.0001256225,0.00027311879,0.00013801524,0.00013238819],"domain_scores_gemma":[0.99872243,0.000115536604,0.00004145414,0.0010377106,0.000046940826,0.000035944362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054949074,0.00006646726,0.00006515238,0.00003282334,0.000336849,0.00016209623,0.0007608036,0.000012077405,0.000012796917],"category_scores_gemma":[0.000012106618,0.00004111792,0.00003984891,0.000334177,0.000035683563,0.00022665146,0.00014002509,0.00006545008,0.00009808804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010785559,0.00023512049,0.00053621404,3.2898538e-7,0.00002236249,4.6418688e-7,0.0048617087,0.00007408332,0.00012148145,0.8829663,0.0032721923,0.107898995],"study_design_scores_gemma":[0.001987653,0.0016349325,0.07441351,0.000013249222,0.000036445253,0.000026730699,0.007089535,0.37446952,0.009612811,0.20349102,0.32628918,0.000935402],"about_ca_topic_score_codex":0.000007619613,"about_ca_topic_score_gemma":0.000085337284,"teacher_disagreement_score":0.67947525,"about_ca_system_score_codex":0.000012739849,"about_ca_system_score_gemma":0.000011310585,"threshold_uncertainty_score":0.25908044},"labels":[],"label_agreement":null},{"id":"W2149489229","doi":"10.37236/1720","title":"Binary Gray Codes with Long Bit Runs","year":2003,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Mathematics; Gray code; Combinatorics; Subsequence; Hamming distance; Binary number; Hamming code; Gray (unit); Discrete mathematics; Arithmetic; Algorithm; Block code; Decoding methods","score_opus":0.005235754770155271,"score_gpt":0.2027874407928435,"score_spread":0.19755168602268822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149489229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35636464,0.007481368,0.63135266,0.0009927199,0.00077790924,0.00012481998,2.1299577e-7,0.00006314934,0.0028424927],"genre_scores_gemma":[0.99921024,0.0003725084,0.00017685232,0.00008918033,0.000034300694,0.0000015383921,9.208674e-8,0.000011361705,0.00010392248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836123,0.00030296575,0.0002617173,0.00013107648,0.0004176118,0.00052538933],"domain_scores_gemma":[0.9987514,0.00023236114,0.000300462,0.00043584604,0.00019328872,0.00008661823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017971871,0.00015433192,0.00021538162,0.00016489977,0.00025073343,0.00010632716,0.0012394044,0.00004134137,0.0000075455255],"category_scores_gemma":[0.000042535452,0.00009103895,0.00013100087,0.001082631,0.000091227215,0.0003352697,0.00005131245,0.0006467851,0.000004972134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000319944,0.00011687382,0.00093779963,0.000004778644,0.00008273413,0.000021546975,0.00021772804,0.0000837365,0.000107908316,0.99778455,0.00018011927,0.00043022828],"study_design_scores_gemma":[0.0008091916,0.0018750505,0.00061203755,0.00004051337,0.000051340958,0.0010060383,0.00006894457,0.00011411462,0.0020952118,0.983494,0.009647385,0.00018621687],"about_ca_topic_score_codex":0.0000011899392,"about_ca_topic_score_gemma":0.0000023508103,"teacher_disagreement_score":0.64284563,"about_ca_system_score_codex":0.00007583398,"about_ca_system_score_gemma":0.00043523757,"threshold_uncertainty_score":0.37124607},"labels":[],"label_agreement":null},{"id":"W2149698442","doi":"10.37236/1013","title":"Nonexistence of Permutation Binomials of Certain Shapes","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Permutation (music); Prime (order theory); Discrete mathematics","score_opus":0.008703562126573168,"score_gpt":0.24210384104737448,"score_spread":0.2334002789208013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149698442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59281135,0.0015244514,0.40440434,0.00022509949,0.00020791365,0.000058151512,2.436991e-7,0.000008404579,0.0007600333],"genre_scores_gemma":[0.9995555,0.00016113365,0.00020173594,0.000025221763,0.000029705692,3.068908e-7,7.854104e-8,0.0000047998487,0.000021461525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985683,0.00013113742,0.0005443587,0.00007989725,0.0003783943,0.00029791842],"domain_scores_gemma":[0.9981516,0.00050086295,0.0007722385,0.00021851312,0.00031500586,0.000041780313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036125656,0.00008861375,0.00023398173,0.00020443017,0.000065181295,0.00001636257,0.001087089,0.000040744577,0.0000037775903],"category_scores_gemma":[0.000102559774,0.00006264055,0.00016320798,0.0007510932,0.000089643705,0.00018571442,0.00006264477,0.00027556036,7.4646425e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006392328,0.00009513843,0.00024558438,0.000012318707,0.00004304717,0.000002430927,0.0008734456,0.0000771449,0.007260448,0.98724395,0.000013634745,0.0040689292],"study_design_scores_gemma":[0.0004945321,0.0010349511,0.0019424079,0.000039898463,0.00003290107,0.000087763154,0.00019693657,0.00043013188,0.038547732,0.95679027,0.0003173124,0.00008515417],"about_ca_topic_score_codex":0.000004316524,"about_ca_topic_score_gemma":0.0000021262097,"teacher_disagreement_score":0.40674418,"about_ca_system_score_codex":0.000069006885,"about_ca_system_score_gemma":0.00023822376,"threshold_uncertainty_score":0.25544077},"labels":[],"label_agreement":null},{"id":"W2149963403","doi":"10.1017/s0004972713000208","title":"ON PERMUTATION BINOMIALS OVER FINITE FIELDS","year":2013,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Finite field; Binomial (polynomial); Gaussian binomial coefficient; Permutation (music); Partial permutation; Binomial coefficient; Cyclic permutation; Generalized permutation matrix; Divisor (algebraic geometry)","score_opus":0.017067199966747364,"score_gpt":0.23927560724547778,"score_spread":0.22220840727873042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149963403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.730898,0.000011207771,0.18631509,0.06627392,0.00044465615,0.0009961162,0.000007653607,0.00024136485,0.014811958],"genre_scores_gemma":[0.9788135,0.0000012760692,0.016223311,0.0014731253,0.000031341482,0.000023078566,3.7192348e-7,0.0000065437484,0.003427439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990605,0.000082074475,0.0002400321,0.00018046443,0.000245678,0.00019123298],"domain_scores_gemma":[0.9986982,0.0005650494,0.00011191537,0.00052901264,0.000039158156,0.000056686225],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032738684,0.00011388448,0.00015167969,0.0000137138495,0.00010949032,0.00008372807,0.00075493555,0.00009605086,0.0028304125],"category_scores_gemma":[0.00014859361,0.00007356977,0.00037061836,0.00015518413,0.000119597455,0.000043538264,0.00015872992,0.00015784791,0.00047933357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033257606,0.00016657928,0.00008648125,0.00008980232,0.000045250817,2.5903333e-7,0.0012704699,0.00015932402,0.0005401847,0.75885147,0.23755953,0.0012273474],"study_design_scores_gemma":[0.00033940148,0.00011307842,0.004058458,0.00014060485,0.000019990608,0.0000032485593,0.00010690501,0.0031644222,0.0042026127,0.98024666,0.007385202,0.00021942482],"about_ca_topic_score_codex":0.0000119936685,"about_ca_topic_score_gemma":6.95813e-8,"teacher_disagreement_score":0.24791548,"about_ca_system_score_codex":0.000012787413,"about_ca_system_score_gemma":0.000009527165,"threshold_uncertainty_score":0.99808115},"labels":[],"label_agreement":null},{"id":"W2150671712","doi":"10.1109/tip.2009.2032943","title":"Unequal Erasure Protection Technique for Scalable Multistreams","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CMC Microsystems (Canada); McMaster University","funders":"","keywords":"Scalability; Computer science; Network packet; Erasure; Algorithm; Redundancy (engineering); Theoretical computer science; Computer network; Programming language; Database","score_opus":0.01848128859747372,"score_gpt":0.26328938766746834,"score_spread":0.24480809906999462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150671712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062286155,0.000033075863,0.9971745,0.00053643045,0.00015982249,0.0006252906,0.0000054538186,0.0005188247,0.00032374728],"genre_scores_gemma":[0.79358584,0.0000024240578,0.20587125,0.00013906923,0.000031127376,0.0002609263,5.374834e-7,0.000010345841,0.00009846331],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989233,0.000044228917,0.00019570628,0.00039743792,0.0001632692,0.0002760293],"domain_scores_gemma":[0.9993983,0.000035985347,0.000076300756,0.00027971005,0.00014271293,0.00006700918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003143261,0.00016828933,0.00013470759,0.00021200311,0.00062578084,0.00028903026,0.00032399353,0.00009290449,0.0000067668043],"category_scores_gemma":[0.000007201932,0.00016520881,0.00012345743,0.0006445365,0.000046333393,0.0008886714,9.646977e-7,0.00023702098,0.0000075903804],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006356857,0.000251225,4.2037877e-7,0.00005295822,0.00000668613,0.0000023205894,0.00022776076,0.0006094358,0.20528144,0.00047082754,0.000025496967,0.79300785],"study_design_scores_gemma":[0.0005740135,0.00057067495,0.000019194244,0.00016514407,0.000021633767,0.00003274086,0.000031307438,0.07613309,0.9031871,0.01851539,0.0004030572,0.0003466653],"about_ca_topic_score_codex":0.000005095958,"about_ca_topic_score_gemma":0.0000022603406,"teacher_disagreement_score":0.79296297,"about_ca_system_score_codex":0.00004173798,"about_ca_system_score_gemma":0.000059876715,"threshold_uncertainty_score":0.67370194},"labels":[],"label_agreement":null},{"id":"W2150776556","doi":"10.1090/fic/060/06","title":"Biased statistics for traces of cyclic 𝑝-fold covers over finite fields","year":2011,"lang":"en","type":"other","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta; National Science Foundation","keywords":"Fold (higher-order function); Mathematics; Affine transformation; Endomorphism; Statistics; TRACE (psycholinguistics); Pure mathematics; Computer science; Philosophy","score_opus":0.025707629409017742,"score_gpt":0.25124153442752983,"score_spread":0.2255339050185121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150776556","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011472676,0.00009195482,0.740016,0.0000131816,0.0003615103,0.00015880879,0.0001765074,0.000116227195,0.25905433],"genre_scores_gemma":[0.010675469,0.0002126904,0.33630148,0.00089118583,0.00020884763,0.00005198205,0.00004767569,0.00021165132,0.651399],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992287,0.00003098028,0.0001758006,0.000264428,0.00012833308,0.00017174728],"domain_scores_gemma":[0.9988239,0.00043095174,0.00018752142,0.00048488885,0.000024137578,0.00004861685],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012881521,0.00016649334,0.00024363789,0.00023352214,0.000025131078,0.000030169016,0.00063366303,0.00018557721,0.0023026413],"category_scores_gemma":[0.000038040558,0.000145268,0.00013158032,0.00016077666,0.000059281938,0.000050394974,0.00006418824,0.000079347024,0.000018684299],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013524269,0.000046115525,0.000036936384,0.000074673146,0.00006608278,0.0000015874544,0.0001278607,0.0000030884999,0.000010961109,0.4885965,0.5036662,0.0073564546],"study_design_scores_gemma":[0.000708409,0.00035547497,0.00007038767,0.00014227765,0.000058120124,7.327503e-7,0.00001258045,0.0016548708,0.00064377,0.08293037,0.912964,0.0004590367],"about_ca_topic_score_codex":0.00011326915,"about_ca_topic_score_gemma":0.00013270044,"teacher_disagreement_score":0.40929776,"about_ca_system_score_codex":0.0000035101798,"about_ca_system_score_gemma":0.000034556346,"threshold_uncertainty_score":0.99860936},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational complexity theory; Polynomial basis; Multiplier (economics); Mathematics; Discrete mathematics; Matrix multiplication; Toeplitz matrix; Polynomial; Time complexity; Computer science; Algorithm; Combinatorics; Pure mathematics","score_opus":0.04373998678267655,"score_gpt":0.27502531965156407,"score_spread":0.23128533286888753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150782829","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021462943,0.000009058229,0.9936925,0.0009750921,0.0013722613,0.0006646953,0.0000052230616,0.00038358875,0.0007512775],"genre_scores_gemma":[0.47153068,0.0000013439252,0.5274986,0.00072591705,0.000051197654,0.000026934902,0.0000012436242,0.000011340667,0.00015272305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983097,0.00006125647,0.00027885588,0.0006175807,0.00023911176,0.00049353245],"domain_scores_gemma":[0.99838907,0.0004439926,0.00005933218,0.0006852931,0.000052304324,0.00037004062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004612218,0.00025084382,0.0002463534,0.00039489492,0.00037818064,0.00013380265,0.00087478687,0.00010430113,0.000010647627],"category_scores_gemma":[0.000003807218,0.00025871964,0.00028157287,0.0007663849,0.000062124396,0.00023208569,0.000008217944,0.00023638035,0.00003350631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011026172,0.0015590824,0.000009620414,0.00009952225,0.00028082737,0.000021914862,0.007334784,0.33922836,0.0009034115,0.17947987,0.0136118205,0.45636818],"study_design_scores_gemma":[0.0045797722,0.0019981617,0.000897723,0.00013549378,0.0000858431,0.00007113809,0.0003861075,0.9436241,0.006543038,0.034095228,0.00597942,0.0016039773],"about_ca_topic_score_codex":0.00003738487,"about_ca_topic_score_gemma":0.000034951783,"teacher_disagreement_score":0.60439575,"about_ca_system_score_codex":0.000058114627,"about_ca_system_score_gemma":0.000059529684,"threshold_uncertainty_score":0.9999865},"labels":[],"label_agreement":null},{"id":"W2152528368","doi":"10.1109/isit.1997.613276","title":"Generalized concatenated codes with quasi-cyclic codes as outer code","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Carleton University","funders":"","keywords":"Concatenated error correction code; Linear code; Serial concatenated convolutional codes; Block code; Computer science; Turbo code; Tornado code; BCJR algorithm; Decoding methods; Algorithm; Theoretical computer science","score_opus":0.024080563638900186,"score_gpt":0.23802361947279935,"score_spread":0.21394305583389917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152528368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48481053,0.00035500896,0.45486578,0.0034236957,0.00030142156,0.00033516958,0.000008759142,0.0015218426,0.054377805],"genre_scores_gemma":[0.97477317,0.00005066078,0.018614413,0.002448302,0.000039825725,0.000024669163,0.0000036714282,0.000015987735,0.0040293173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984634,0.00015085444,0.00022633717,0.00048311683,0.00027799196,0.00039830452],"domain_scores_gemma":[0.99889314,0.00012879317,0.00007996705,0.0006639616,0.00007600793,0.00015812578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023078902,0.00022903024,0.00026352014,0.00014700633,0.00020314964,0.00027085608,0.0008657992,0.00007373307,0.0007421082],"category_scores_gemma":[0.000016013097,0.00016158079,0.000098049786,0.00059182855,0.00015850156,0.00038735417,0.00013215821,0.00013212491,0.00040323453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059204714,0.0003158899,0.0022675444,0.00001219384,0.00013569318,0.000108553206,0.0012920728,0.000051799205,0.0027122311,0.9680345,0.0081523685,0.016857965],"study_design_scores_gemma":[0.01623626,0.0055808797,0.004533409,0.00030186735,0.0002603603,0.0013651106,0.0007155425,0.31130657,0.17897946,0.20119448,0.2739637,0.0055623665],"about_ca_topic_score_codex":0.000067028996,"about_ca_topic_score_gemma":0.00007016768,"teacher_disagreement_score":0.76684,"about_ca_system_score_codex":0.000015791387,"about_ca_system_score_gemma":0.000013920328,"threshold_uncertainty_score":0.81255645},"labels":[],"label_agreement":null},{"id":"W2152724910","doi":"10.1016/j.jsc.2010.06.021","title":"On the De Boer–Pellikaan method for computing minimum distance","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Connection (principal bundle); Ideal (ethics); Code (set theory); Projective test; Minimum distance; Discrete mathematics; Algebra over a field; Arithmetic; Pure mathematics; Combinatorics; Geometry; Law; Computer science; Programming language","score_opus":0.013182069695073288,"score_gpt":0.2990532433500757,"score_spread":0.2858711736550024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152724910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15440683,0.00002491814,0.84251124,0.0019567457,0.0006866947,0.00010130038,5.8251635e-7,0.000023730978,0.0002879483],"genre_scores_gemma":[0.7757107,0.0000014203832,0.22356547,0.00046452894,0.00024284302,0.0000013743527,2.907596e-7,0.000006093473,0.0000072787648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895185,0.00015547143,0.00033843293,0.00013662608,0.0002245879,0.0001930526],"domain_scores_gemma":[0.9971783,0.0019431368,0.0004094824,0.00018368816,0.00020994394,0.000075428135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021083474,0.0001033996,0.00016620597,0.00013889442,0.00022757627,0.00016814149,0.0006343459,0.000045174478,0.0000043858313],"category_scores_gemma":[0.00020073027,0.000072814946,0.0001793355,0.00030596685,0.00003697823,0.00016519618,0.000044422766,0.0003258294,0.000002561744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005167789,0.0000880208,0.00012456976,0.0000136887,0.00003705621,0.000004410465,0.0024891736,0.0072554187,0.0040291017,0.81488705,0.0010893124,0.16993053],"study_design_scores_gemma":[0.00035252367,0.00021555545,0.0017079676,0.000040669252,0.000014206989,0.00009537649,0.000082622704,0.59354275,0.0010525404,0.40146708,0.0013277764,0.00010091109],"about_ca_topic_score_codex":0.0000013886225,"about_ca_topic_score_gemma":0.0000026591742,"teacher_disagreement_score":0.62130386,"about_ca_system_score_codex":0.000020613546,"about_ca_system_score_gemma":0.00006188465,"threshold_uncertainty_score":0.29693076},"labels":[],"label_agreement":null},{"id":"W2152982916","doi":"10.1109/sips.2005.1579965","title":"SIMD implementation of interpolation in algebraic soft-decision Reed-Solomon decoding","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"SIMD; Computer science; Parallel computing; Reed–Solomon error correction; Speedup; Decoding methods; Interpolation (computer graphics); Algorithm; Block code; Concatenated error correction code; Frame (networking)","score_opus":0.007531925662421875,"score_gpt":0.2684136274788836,"score_spread":0.2608817018164617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152982916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43546394,0.000017651197,0.56248546,0.000044534176,0.00007845881,0.000066648885,3.870969e-7,0.000045102566,0.001797796],"genre_scores_gemma":[0.9683463,0.0000021781484,0.03156384,0.00004688346,0.000017787734,0.0000041142794,0.000003208517,0.0000034786722,0.000012235088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913347,0.000048193666,0.00032560527,0.00020163601,0.00014948072,0.00014160987],"domain_scores_gemma":[0.99947643,0.00015504034,0.00009894675,0.00021759619,0.00003365564,0.000018336923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044145968,0.00007412742,0.00009725103,0.0003074064,0.000039434264,0.0000462954,0.00028668257,0.000033619333,0.000060656264],"category_scores_gemma":[0.0000127362,0.00007040086,0.000053985044,0.00055958406,0.000016996317,0.00046122263,0.000104125655,0.00005030597,0.0000067039186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023302695,0.00006327838,0.068612754,0.000008679041,0.000004532622,0.0000016095682,0.0006080483,0.000095082105,0.017257331,0.46848458,0.00041649822,0.44442433],"study_design_scores_gemma":[0.0013430972,0.00035540806,0.1685249,0.00009225558,0.0000074901072,0.000007112512,0.00056537834,0.08361229,0.03903839,0.705891,0.00021505886,0.00034758143],"about_ca_topic_score_codex":0.00035114048,"about_ca_topic_score_gemma":0.0010579842,"teacher_disagreement_score":0.53288233,"about_ca_system_score_codex":0.000020521797,"about_ca_system_score_gemma":0.000014465173,"threshold_uncertainty_score":0.28708637},"labels":[],"label_agreement":null},{"id":"W2153149491","doi":"10.1109/cwit.2007.375726","title":"On Decoding Binary Quasi-Perfect Codes Over Markov Noise Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Hamming code; Binary symmetric channel; Linear code; Block code; Algorithm; Hamming distance; Hamming bound; Markov chain; Computer science; Sequential decoding; Hamming weight; Mathematics; Binary code; Binary number; Low-density parity-check code; Statistics; Arithmetic","score_opus":0.012718783682532988,"score_gpt":0.25663382338157664,"score_spread":0.24391503969904366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153149491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48071247,0.00004669214,0.49076658,0.00014716673,0.0006264669,0.00009134252,6.5723697e-7,0.00032733518,0.027281279],"genre_scores_gemma":[0.9898318,0.00000857864,0.0085381195,0.0011134596,0.00009880851,0.0000042118527,0.0000010149467,0.000009788967,0.0003941999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998717,0.0000677864,0.00018349278,0.0003914355,0.00023389656,0.00040635935],"domain_scores_gemma":[0.9987411,0.00053457025,0.00004794474,0.00051644264,0.00002846245,0.00013148187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011603733,0.00016687918,0.0001471367,0.00029816016,0.00020537068,0.00013957456,0.0006421569,0.00006521248,0.0002016215],"category_scores_gemma":[0.00004135374,0.00014092182,0.00013465718,0.00059560244,0.000045896053,0.00031334982,0.00017941935,0.00013903643,0.00009698466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097812976,0.00024318436,0.0011676579,0.00001254256,0.000024891633,0.00007094162,0.0005124674,0.00004758266,0.0037917434,0.9356752,0.0029440252,0.055411946],"study_design_scores_gemma":[0.005283236,0.007463616,0.05023549,0.0006870239,0.00007854645,0.00021101984,0.0005836995,0.19695915,0.19741085,0.51581395,0.02051767,0.00475577],"about_ca_topic_score_codex":0.000013013541,"about_ca_topic_score_gemma":0.000009379671,"teacher_disagreement_score":0.50911933,"about_ca_system_score_codex":0.000026310421,"about_ca_system_score_gemma":0.000014999309,"threshold_uncertainty_score":0.5746625},"labels":[],"label_agreement":null},{"id":"W2153763450","doi":"10.1093/qmath/has026","title":"VALUE SETS OF POLYNOMIAL MAPS OVER FINITE FIELDS","year":2012,"lang":"en","type":"article","venue":"The Quarterly Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Cardinality (data modeling); Mathematics; Univariate; Finite field; Polynomial; Value (mathematics); Set (abstract data type); Field (mathematics); Finite set; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science; Statistics; Multivariate statistics","score_opus":0.01633911009885555,"score_gpt":0.2519146443295315,"score_spread":0.23557553423067593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153763450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54821783,0.00039637307,0.4489535,0.0005589642,0.0007917351,0.00007424459,0.000002675197,0.000017818964,0.0009868803],"genre_scores_gemma":[0.97085214,0.000011704619,0.028795505,0.0001296356,0.00017967533,6.085867e-7,9.270004e-8,0.0000063448756,0.0000242703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884206,0.0001245252,0.00047370727,0.000050189665,0.00030906487,0.00020045905],"domain_scores_gemma":[0.99828964,0.00063209434,0.0005217946,0.00040800252,0.00006896907,0.00007946748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015541923,0.00010242316,0.00022549093,0.00010630326,0.00006448535,0.000047164955,0.000906548,0.000050189516,0.000029462411],"category_scores_gemma":[0.000039763425,0.000063395026,0.00020972421,0.00018413084,0.000060620157,0.00038022295,0.000043151456,0.00020340834,0.000011880338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085423555,0.0013463722,0.0007645388,0.00024342521,0.0004139205,0.00001773778,0.16963553,0.00017669181,0.0015418944,0.73624605,0.012629422,0.07689896],"study_design_scores_gemma":[0.0018273868,0.0031031186,0.0021328847,0.0005322353,0.00026428053,0.0009831057,0.004664375,0.0103304535,0.00453838,0.9669427,0.0041078823,0.0005731873],"about_ca_topic_score_codex":0.0000017412173,"about_ca_topic_score_gemma":4.0812068e-7,"teacher_disagreement_score":0.42263436,"about_ca_system_score_codex":0.000008402305,"about_ca_system_score_gemma":0.000027727925,"threshold_uncertainty_score":0.2585174},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Binary number; Integer (computer science); Physics; Correlation; Sequence (biology); Mathematics; Arithmetic; Geometry; Chemistry","score_opus":0.005060276466135727,"score_gpt":0.19318052446566364,"score_spread":0.18812024799952792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154006376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021745544,0.000017229357,0.97416407,0.000099254525,0.00022717216,0.00015543579,0.000012042587,0.00026458516,0.0033146534],"genre_scores_gemma":[0.98853725,0.000009923818,0.010619249,0.0005268401,0.000016450676,0.000017350678,0.0000034637567,0.0000051358174,0.0002643345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992139,0.00007098507,0.00021384496,0.00013343427,0.00019376165,0.00017412248],"domain_scores_gemma":[0.9992929,0.0002237431,0.000093122115,0.00026941736,0.000055501605,0.00006529375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003285462,0.0001311705,0.00009072268,0.00020567443,0.00029491194,0.0001563644,0.00019641612,0.00006224746,0.000041307456],"category_scores_gemma":[0.0000033050524,0.00011438195,0.000046213947,0.0004810025,0.000050453535,0.0024275552,0.0000022345478,0.00015963364,0.000071527655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003401946,0.00010348836,0.000036179128,0.000036057223,0.000030506544,0.000003439725,0.0022706632,0.023041125,0.0005776836,0.7848322,0.00040760828,0.18832088],"study_design_scores_gemma":[0.010836024,0.0026161603,0.012239666,0.00064600527,0.00017993725,0.00034252094,0.0021819046,0.29889053,0.017624846,0.62882257,0.023007013,0.0026128117],"about_ca_topic_score_codex":0.000017268432,"about_ca_topic_score_gemma":0.0000049926975,"teacher_disagreement_score":0.9667917,"about_ca_system_score_codex":0.000025769203,"about_ca_system_score_gemma":0.00006326614,"threshold_uncertainty_score":0.46643606},"labels":[],"label_agreement":null},{"id":"W2154252189","doi":"10.1017/s0305004105008947","title":"Incomplete exponential sums and Diffie–Hellman triples","year":2006,"lang":"en","type":"article","venue":"Mathematical Proceedings of the Cambridge Philosophical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multiplicative function; Mathematics; Exponential function; Combinatorics; Integer (computer science); Order (exchange); Modulo; Prime (order theory); Distribution (mathematics); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.010405627194020287,"score_gpt":0.1960286202560741,"score_spread":0.18562299306205382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154252189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9455303,0.00015637981,0.020206818,0.017775094,0.00014449524,0.00045498848,0.000009898295,0.0002664644,0.015455567],"genre_scores_gemma":[0.9902187,0.0000076230185,0.009138016,0.00027645525,0.00024688433,0.000018091174,6.521753e-7,0.00001593925,0.00007763505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998217,0.000019533623,0.0004755098,0.00042707488,0.00050969695,0.00035117596],"domain_scores_gemma":[0.99908876,0.00020534651,0.00020634144,0.00027405503,0.00011090143,0.000114569295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005952976,0.00024233277,0.00037461924,0.000036349127,0.00031032966,0.0001644285,0.0011184175,0.00013968334,0.000007434099],"category_scores_gemma":[0.000079818325,0.00016510264,0.0004817018,0.00046407484,0.0006194969,0.0002832848,0.00091079116,0.00031929594,0.0000065519475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010626436,0.0001735258,0.00021021099,0.00018174475,0.000027262417,3.2155015e-7,0.00014184682,7.198779e-7,0.012554973,0.98500276,0.0014559944,0.00024003844],"study_design_scores_gemma":[0.00045967,0.00006984828,0.002296165,0.00009326071,0.000038992708,0.000028181586,0.00003219144,0.00686307,0.005735853,0.98382497,0.00031812332,0.00023966482],"about_ca_topic_score_codex":0.0000037669802,"about_ca_topic_score_gemma":7.7677726e-8,"teacher_disagreement_score":0.04468841,"about_ca_system_score_codex":0.000023286324,"about_ca_system_score_gemma":0.000012119587,"threshold_uncertainty_score":0.67326903},"labels":[],"label_agreement":null},{"id":"W2154346619","doi":"10.1109/ccece.2006.277417","title":"Reducing Packet Loss in CBC Secured VoIP using Interleaved Encryption","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Voice over IP; Computer network; Block cipher; Encryption; Quality of service; Network packet; Ciphertext; Block size; Block (permutation group theory); Block cipher mode of operation; Key schedule; Key (lock); Computer security; Mathematics; The Internet; Operating system","score_opus":0.013921607741118084,"score_gpt":0.23743037516642054,"score_spread":0.22350876742530246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154346619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6309393,0.000025926964,0.365799,0.00012298246,0.0001935131,0.000059465376,3.1844252e-7,0.00012607765,0.0027333847],"genre_scores_gemma":[0.9735662,0.0000017421917,0.026189288,0.000087020744,0.00007871301,0.0000030356125,0.0000016090179,0.0000059570207,0.0000664512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895763,0.00010699511,0.00022834678,0.00031695786,0.0001335062,0.00025655128],"domain_scores_gemma":[0.99948895,0.000050489867,0.000057863683,0.00033727393,0.00003020923,0.000035231064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003494091,0.000113376766,0.00011804166,0.00024768387,0.00007421664,0.00012590594,0.00039247036,0.000055129196,0.000038464266],"category_scores_gemma":[0.000012440165,0.000108137276,0.00006966822,0.00066789344,0.000039974708,0.00044225997,0.00012505456,0.0001183152,0.000017520964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004130869,0.00021745006,0.017894631,0.000026068246,0.0000131552915,0.00006775655,0.0018418907,0.001923659,0.052629177,0.90134674,0.0005400227,0.02345812],"study_design_scores_gemma":[0.0015322479,0.00018634679,0.024014253,0.0003125074,0.000014457808,0.00011757516,0.00047998558,0.3320239,0.04683769,0.59213346,0.0013394566,0.0010081404],"about_ca_topic_score_codex":0.00037885594,"about_ca_topic_score_gemma":0.00014548033,"teacher_disagreement_score":0.34262687,"about_ca_system_score_codex":0.000046809004,"about_ca_system_score_gemma":0.000021905878,"threshold_uncertainty_score":0.440971},"labels":[],"label_agreement":null},{"id":"W2154757782","doi":"10.1109/iscas.2008.4542158","title":"A high speed word level finite field multiplier using reordered normal basis","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Computer science; Finite field; Very-large-scale integration; Basis (linear algebra); Permutation (music); Critical path method; Word (group theory); Adder; Word length; Architecture; Arithmetic; Algorithm; Mathematics; Discrete mathematics; Embedded system; Engineering","score_opus":0.0625180271145517,"score_gpt":0.24756020241453203,"score_spread":0.18504217529998032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154757782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37759334,0.000015899304,0.6177908,0.0003948046,0.00030543547,0.00007108735,0.0000017461355,0.00018971298,0.0036371548],"genre_scores_gemma":[0.8176635,0.000007180841,0.18036585,0.0010460324,0.00007066438,0.0000016345169,8.349784e-7,0.000006861757,0.0008374267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988941,0.000057771897,0.00020301569,0.00033252203,0.00019764128,0.00031493008],"domain_scores_gemma":[0.9989467,0.0003046115,0.00005548493,0.0005410157,0.000057574864,0.000094615156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018294908,0.00014874707,0.0001576534,0.00016935554,0.00030750068,0.00006951001,0.00061837514,0.00007443692,0.0003191786],"category_scores_gemma":[0.000068378075,0.00013570418,0.00012584978,0.0006222618,0.000052188916,0.0003970659,0.00025746395,0.00014451654,0.00005566249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006196389,0.0010932828,0.036231432,0.000074299795,0.0003946893,0.0007478944,0.010814077,0.008081146,0.021351723,0.5133918,0.013531536,0.39366847],"study_design_scores_gemma":[0.008028167,0.0010434799,0.06486947,0.00022711168,0.00009589441,0.0006619476,0.00036056008,0.6445245,0.17453758,0.0743526,0.027119055,0.004179607],"about_ca_topic_score_codex":0.00017625013,"about_ca_topic_score_gemma":0.00002362001,"teacher_disagreement_score":0.6364434,"about_ca_system_score_codex":0.000011817659,"about_ca_system_score_gemma":0.00004405944,"threshold_uncertainty_score":0.5533856},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01787885720311226,"score_gpt":0.2609267653700013,"score_spread":0.24304790816688904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154926368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.262204,0.000038992937,0.73170084,0.00033876303,0.0001577262,0.000078725505,0.000004140067,0.00026431584,0.0052125216],"genre_scores_gemma":[0.9041493,0.0000033472727,0.095485695,0.00024381939,0.000060134014,0.0000037965656,0.000010262342,0.000006588976,0.000037047168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991038,0.00004754114,0.00021980933,0.00023149999,0.00020459323,0.0001927568],"domain_scores_gemma":[0.9991408,0.00022080452,0.00011429876,0.00043438436,0.00003151676,0.00005820095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002690904,0.00013269846,0.0001602665,0.00007210136,0.0001589749,0.00019845192,0.0005100868,0.000050300172,0.000026186106],"category_scores_gemma":[0.00007698234,0.00011673403,0.000087052154,0.00027230504,0.000025380366,0.0003223862,0.000060655293,0.000117760734,0.0000521023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052774944,0.00009995649,0.00016292748,0.00001783443,0.000023496515,0.000010497668,0.017515117,0.000083867606,0.0017374539,0.9375001,0.00022569818,0.04261777],"study_design_scores_gemma":[0.00016569727,0.0000855701,0.0010984078,0.000075460084,0.000019178344,0.000013646066,0.0011164624,0.094427645,0.002178541,0.90043586,0.00013375754,0.00024974396],"about_ca_topic_score_codex":0.0000055278797,"about_ca_topic_score_gemma":0.000003152682,"teacher_disagreement_score":0.6419453,"about_ca_system_score_codex":0.0000134545235,"about_ca_system_score_gemma":0.0000102600325,"threshold_uncertainty_score":0.47602755},"labels":[],"label_agreement":null},{"id":"W2156237015","doi":"10.1109/tit.2011.2111110","title":"Sequence Families With Low Correlation Derived From Multiplicative and Additive Characters","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multiplicative function; Mathematics","score_opus":0.012477722220665894,"score_gpt":0.19537316860760717,"score_spread":0.18289544638694127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156237015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11823022,0.0000035006076,0.8797219,0.000023343802,0.00014696739,0.00018741343,0.00006338656,0.00018131016,0.0014419779],"genre_scores_gemma":[0.9920844,0.00003230646,0.007403626,0.00036680145,0.000006104654,0.000076089724,0.000012665191,0.0000047360218,0.0000132747955],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999284,0.00010047408,0.00018892363,0.00016191187,0.00013524585,0.00012940397],"domain_scores_gemma":[0.99916255,0.00025940908,0.00013967967,0.0002758463,0.00009630061,0.00006618627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001696329,0.00014053461,0.00010175427,0.0002147921,0.00025161818,0.000070316404,0.00022023078,0.00005868868,0.000054659577],"category_scores_gemma":[0.0000056559825,0.0001201064,0.000041189865,0.000267721,0.00018047058,0.0027558447,0.0000026455652,0.0001670595,0.00008222314],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009811755,0.00014880125,0.00007929988,0.000019154208,0.00018073252,0.0000024962985,0.10972757,0.0008943993,0.0013360538,0.16424184,0.0000095717205,0.7223789],"study_design_scores_gemma":[0.0070115966,0.0024670216,0.076271646,0.0008142021,0.00027099365,0.000094235016,0.029864443,0.1299392,0.5375878,0.2120268,0.00073190074,0.0029201538],"about_ca_topic_score_codex":0.000024303163,"about_ca_topic_score_gemma":0.0000054391667,"teacher_disagreement_score":0.87385416,"about_ca_system_score_codex":0.000025105797,"about_ca_system_score_gemma":0.000027373055,"threshold_uncertainty_score":0.48977968},"labels":[],"label_agreement":null},{"id":"W2156362874","doi":"10.1109/bsc.2006.1644571","title":"A Lower Bound on the Minimum Distance of a 1-Generator Quasi-Cyclic Code","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Conjecture; Generator (circuit theory); Algorithm; Combinatorics; Physics; Computer science; Mathematics","score_opus":0.012776166007441428,"score_gpt":0.2217417485311823,"score_spread":0.20896558252374087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156362874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63209337,0.00011670769,0.33566946,0.0019421839,0.00030779254,0.00012315567,0.0000059693157,0.00011388482,0.029627481],"genre_scores_gemma":[0.9968454,0.0000020861025,0.0015627464,0.0006377766,0.000055156066,0.000010248148,4.4592622e-7,0.00000454251,0.00088157936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992072,0.000064366606,0.00015922979,0.00021790703,0.0001838996,0.0001674107],"domain_scores_gemma":[0.99907845,0.00019926451,0.000060285936,0.00060256466,0.000031856303,0.000027568205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024542926,0.00009499698,0.00010063093,0.000043669017,0.00011386368,0.0000836254,0.0006498456,0.000026934262,0.00005300628],"category_scores_gemma":[0.000014064019,0.00005898302,0.00009684808,0.00038122074,0.00010261941,0.00008790423,0.00006834856,0.00006282606,0.000024356154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016351234,0.00016752766,0.00019115131,0.0000028797695,0.000006134301,0.0000024189517,0.000072197465,0.000008337216,0.0035752503,0.9895149,0.005670773,0.00077208254],"study_design_scores_gemma":[0.0010384257,0.0010754395,0.0044682818,0.00010639153,0.000022468757,0.000011420727,0.0001123963,0.014400829,0.11633481,0.6858401,0.17577522,0.0008142561],"about_ca_topic_score_codex":0.000018615005,"about_ca_topic_score_gemma":0.00007549937,"teacher_disagreement_score":0.36475205,"about_ca_system_score_codex":0.000008175145,"about_ca_system_score_gemma":0.000020007808,"threshold_uncertainty_score":0.24052578},"labels":[],"label_agreement":null},{"id":"W2157055070","doi":"10.1002/ett.1523","title":"Collaborative algebraic decoding of interleaved Reed–Solomon codes","year":2011,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"List decoding; Concatenated error correction code; Reed–Solomon error correction; Serial concatenated convolutional codes; Sequential decoding; Berlekamp–Welch algorithm; Decoding methods; Linear code; Algorithm; Mathematics; Block code; Computer science","score_opus":0.02428618657381141,"score_gpt":0.2586574155446826,"score_spread":0.23437122897087118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157055070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021597324,0.00033220855,0.96957254,0.0012866561,0.00010451397,0.00022606955,0.000009260117,0.002252238,0.004619182],"genre_scores_gemma":[0.75004053,0.0005308984,0.24928576,0.000023277058,0.0000011509286,0.000088679095,0.0000014308004,0.000009771854,0.0000185105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987706,0.00015332103,0.00039475953,0.000301196,0.0001325294,0.00024757773],"domain_scores_gemma":[0.9972217,0.00030333456,0.00020132227,0.0020738982,0.00017241959,0.000027344684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035888303,0.00018097676,0.00024078188,0.0008190595,0.0005259573,0.000036009103,0.0026049316,0.00013148306,0.000040975647],"category_scores_gemma":[0.00007365008,0.00018758049,0.00013085318,0.0021698936,0.00043568833,0.00040501016,0.00008841157,0.00041224193,0.000016867789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004547779,0.0006512389,0.00016822208,0.000020643882,0.0002025222,0.0000016044118,0.008866527,0.00016428191,0.004063419,0.5023971,0.00008128586,0.48333767],"study_design_scores_gemma":[0.00087265915,0.0012490477,0.0012747013,0.00037773096,0.00012150813,0.000024762463,0.023135595,0.011451144,0.6419079,0.31633803,0.0021537186,0.0010932062],"about_ca_topic_score_codex":0.000033720597,"about_ca_topic_score_gemma":0.00008633728,"teacher_disagreement_score":0.7284432,"about_ca_system_score_codex":0.000037356112,"about_ca_system_score_gemma":0.000040932544,"threshold_uncertainty_score":0.7649311},"labels":[],"label_agreement":null},{"id":"W2159333237","doi":"10.1109/icc.2009.5198625","title":"A Low Complexity Iterative Technique for Soft Decision Decoding of Reed-Solomon Codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Belief propagation; Berlekamp–Welch algorithm; List decoding; Sequential decoding; Parity-check matrix; Algorithm; Computer science; Factor graph; Low-density parity-check code; Tanner graph; Linear code; Binary number; Block code; Concatenated error correction code; Theoretical computer science; Mathematics; Arithmetic","score_opus":0.03075280943614378,"score_gpt":0.29663398448263273,"score_spread":0.26588117504648895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159333237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016290115,0.000022073502,0.98117375,0.00016406189,0.000057235087,0.00034369616,0.000004568682,0.00014195134,0.0018025745],"genre_scores_gemma":[0.6133149,0.0000020867851,0.38646722,0.00017650895,0.000010981962,0.000013118172,0.0000010904024,0.0000021575931,0.000011892408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991074,0.000048018035,0.00024147748,0.000280418,0.00013476914,0.00018787674],"domain_scores_gemma":[0.9989398,0.00041851646,0.000093713155,0.00036815432,0.00012818196,0.00005164468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056083925,0.00011019057,0.00019540511,0.0001540724,0.00013890368,0.00006796701,0.0005797833,0.00005686524,0.000012206766],"category_scores_gemma":[0.00008452068,0.00009649665,0.00013231594,0.00037146744,0.00006849807,0.00029380454,0.00008642827,0.000067738016,0.0000017846533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007970866,0.00011863871,0.0000874248,0.000012507555,0.0000061100777,0.0000013214604,0.0003851779,0.000016176726,0.041892134,0.826369,0.00027644352,0.13075535],"study_design_scores_gemma":[0.00026153645,0.00057059136,0.0005622998,0.00009487307,0.0000038056507,0.0000073707342,0.00002102171,0.010760744,0.26923367,0.718223,0.000114170936,0.00014693351],"about_ca_topic_score_codex":0.00000334087,"about_ca_topic_score_gemma":0.000011184359,"teacher_disagreement_score":0.59702486,"about_ca_system_score_codex":0.000013502196,"about_ca_system_score_gemma":0.00001921285,"threshold_uncertainty_score":0.3935019},"labels":[],"label_agreement":null},{"id":"W2159478385","doi":"10.1109/tcomm.2004.833044","title":"High-Order Spectral-Null Multimode Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scrambling; Multi-mode optical fiber; Coding (social sciences); Null (SQL); Algorithm; Mathematics; Computer science; Concatenated error correction code; Block code; Decoding methods; Telecommunications; Optical fiber; Statistics","score_opus":0.024820448395127773,"score_gpt":0.26444082072791125,"score_spread":0.2396203723327835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159478385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003697533,0.000092137896,0.98762906,0.005532971,0.00031660328,0.00017282486,0.000025197178,0.0004871987,0.0020464736],"genre_scores_gemma":[0.7692954,0.00022747915,0.2299753,0.000301103,0.000011955245,0.00006841519,0.0000038737217,0.000011220536,0.00010527262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989438,0.00013471923,0.0002329029,0.00027767057,0.00016885107,0.00024206737],"domain_scores_gemma":[0.99664295,0.00023989387,0.000058489335,0.0028602444,0.00009782406,0.00010062613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019007004,0.00016322744,0.00014711858,0.0002335461,0.0008252035,0.00012527904,0.0021870523,0.00007018887,0.000056997094],"category_scores_gemma":[0.0000048298502,0.00016914545,0.00014329137,0.0009284978,0.00019407264,0.0004001178,0.000012772411,0.00040320237,0.00021237409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014648278,0.0013352422,0.0000045521174,0.0000061868896,0.00009332601,0.0000023134992,0.0014731166,0.048492666,0.003279113,0.9163308,0.00007898224,0.02888901],"study_design_scores_gemma":[0.0048351977,0.0008726832,0.0010132184,0.00026061857,0.00019140748,0.00009334378,0.00036244083,0.047837887,0.13324152,0.78864825,0.0206695,0.0019739363],"about_ca_topic_score_codex":0.00024972568,"about_ca_topic_score_gemma":0.0005389839,"teacher_disagreement_score":0.7655978,"about_ca_system_score_codex":0.00006732661,"about_ca_system_score_gemma":0.00008028067,"threshold_uncertainty_score":0.6897551},"labels":[],"label_agreement":null},{"id":"W2159864227","doi":"10.1109/isit.2008.4595423","title":"New results on periodic sequences with large k-error linear complexity","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Average-case complexity; Structural complexity theory; Computational complexity theory; PH; Time complexity; Complexity class; Sequence (biology); Combinatorics; Algorithm; Discrete mathematics; Quantum complexity theory","score_opus":0.06331512143643958,"score_gpt":0.2705075409069949,"score_spread":0.20719241947055533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159864227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29177147,0.000046679863,0.6313591,0.003942736,0.0002538549,0.00020116595,0.000012504668,0.00082411093,0.07158837],"genre_scores_gemma":[0.90148073,0.0000054176076,0.09610071,0.0009002324,0.000072321855,0.000002330382,0.0000027884482,0.0000047470585,0.0014306867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889475,0.00006181634,0.00014303249,0.00036867894,0.00026485467,0.00026688952],"domain_scores_gemma":[0.9991756,0.00006824494,0.00005098655,0.00052814296,0.000038514234,0.00013848789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022163767,0.00012972542,0.00012969288,0.00008770913,0.00036210514,0.000054426982,0.00064516923,0.000034037213,0.000093813425],"category_scores_gemma":[0.000017257174,0.00008896424,0.000059790917,0.00048228004,0.0001260972,0.00023331001,0.00009355815,0.00012690737,0.00013796912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002730543,0.00014691957,0.0015995925,0.0000053539293,0.000024429679,0.00012432678,0.0035441876,0.00007981815,0.000077619436,0.9833026,0.0073539414,0.0034681703],"study_design_scores_gemma":[0.016973108,0.01297746,0.12645227,0.0004289005,0.000051897892,0.0014270948,0.0010142326,0.07395784,0.017427398,0.18285774,0.5621165,0.00431558],"about_ca_topic_score_codex":0.00007893917,"about_ca_topic_score_gemma":0.00009203021,"teacher_disagreement_score":0.80044484,"about_ca_system_score_codex":0.00001021741,"about_ca_system_score_gemma":0.00010383544,"threshold_uncertainty_score":0.36278564},"labels":[],"label_agreement":null},{"id":"W2160095768","doi":"10.1109/glocom.2003.1258202","title":"Application of reed-solomon codes with erasure decoding to type-II hybrid ARQ transmission","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hybrid automatic repeat request; Computer science; Reed–Solomon error correction; Erasure; Decoding methods; Automatic repeat request; Selective Repeat ARQ; Error detection and correction; Algorithm; Code rate; Erasure code; Concatenated error correction code; Block code; Transmission (telecommunications); Telecommunications","score_opus":0.007956282967644801,"score_gpt":0.2252405716604495,"score_spread":0.2172842886928047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160095768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14923826,0.000025443604,0.8478534,0.0005300702,0.000026790498,0.00013238114,5.0472823e-7,0.000117377174,0.00207576],"genre_scores_gemma":[0.89572006,0.000004888186,0.1040701,0.0001524987,0.000012088755,0.0000072641287,0.0000012384962,0.000004987331,0.000026864824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929196,0.000018838176,0.00013405796,0.00025398924,0.00016259124,0.00013856521],"domain_scores_gemma":[0.9994361,0.000025643914,0.00004383574,0.00033851364,0.00007578933,0.000080133206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020746788,0.00008671866,0.00011271206,0.00010259882,0.000118798096,0.000025351994,0.00038840962,0.000024732426,0.000008898237],"category_scores_gemma":[0.0000053292833,0.00006825383,0.000036817553,0.00054687506,0.000025542453,0.0001600715,0.000051726838,0.00005718711,0.0000086591435],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001679584,0.00019412022,0.0009883684,0.0000344241,0.000026453374,0.000004738481,0.0015031365,0.0034931204,0.09065836,0.623029,0.00009960019,0.2798007],"study_design_scores_gemma":[0.0015376068,0.0025876046,0.0039769695,0.00030290382,0.00003664096,0.0000714427,0.00012237224,0.010699146,0.83330727,0.13970834,0.0069200895,0.00072960084],"about_ca_topic_score_codex":0.000033583266,"about_ca_topic_score_gemma":0.000015856576,"teacher_disagreement_score":0.74648184,"about_ca_system_score_codex":0.000013739283,"about_ca_system_score_gemma":0.000030379784,"threshold_uncertainty_score":0.27833104},"labels":[],"label_agreement":null},{"id":"W2160227782","doi":"10.1145/2465506.2465956","title":"Fast algorithms for <i>l</i> -adic towers over finite fields","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Finite field; Closure (psychology); Algorithm; Computer science; Field (mathematics); Work (physics); Mathematics; Algebra over a field; Theoretical computer science; Discrete mathematics; Pure mathematics; Engineering; Mechanical engineering","score_opus":0.025011288093148565,"score_gpt":0.2605562789935025,"score_spread":0.2355449909003539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160227782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011746576,0.0001755119,0.97883624,0.0009522573,0.002388467,0.00053153944,0.000019869802,0.00039641312,0.01552506],"genre_scores_gemma":[0.328045,0.00030161356,0.6389611,0.013112864,0.0014433698,0.0012929625,0.00009242771,0.00009310112,0.016657572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998318,0.000046856374,0.00028202785,0.00073938206,0.00022033717,0.00039338443],"domain_scores_gemma":[0.9980894,0.00034973415,0.00013007614,0.0011948231,0.00010095933,0.00013504771],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003177432,0.00030422705,0.00029776344,0.00018637361,0.0001244138,0.00046482898,0.0018113578,0.00034267703,0.00033410062],"category_scores_gemma":[0.00003426328,0.00026978846,0.00042230065,0.00019279233,0.00005730321,0.00022112163,0.0014143866,0.00042579626,0.000064836444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017428702,0.00012419824,0.00008441089,0.00017201027,0.0001698507,0.0000070092733,0.0011224558,0.0014933307,0.000035649122,0.4961556,0.08117575,0.41944233],"study_design_scores_gemma":[0.0005934909,0.00022292961,0.00013867674,0.00012767219,0.000038264883,0.0000043870014,0.000032916374,0.23665121,0.00059226295,0.630712,0.12989222,0.0009940364],"about_ca_topic_score_codex":0.00006694017,"about_ca_topic_score_gemma":0.000006394158,"teacher_disagreement_score":0.41844827,"about_ca_system_score_codex":0.000019605217,"about_ca_system_score_gemma":0.00007680674,"threshold_uncertainty_score":0.99997544},"labels":[],"label_agreement":null},{"id":"W2160860009","doi":"10.1109/tit.2007.911265","title":"New Nonbinary Self-Dual Codes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Dual (grammatical number); Circulant matrix; Code (set theory); Construct (python library); Computer science; Minimum distance; Mathematics; Discrete mathematics; Combinatorics; Programming language","score_opus":0.010026629562084466,"score_gpt":0.20623723997782367,"score_spread":0.1962106104157392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160860009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005147147,0.000012544653,0.98265016,0.00014576704,0.00069317897,0.00012653065,0.000007141807,0.00073104,0.0104864985],"genre_scores_gemma":[0.974264,0.000045563476,0.024320435,0.00090512424,0.00003775655,0.000021504862,0.000002450366,0.000006383122,0.00039676504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990451,0.00010444735,0.00027121502,0.00012859666,0.00025055878,0.00020010855],"domain_scores_gemma":[0.9991221,0.00018576357,0.00008198005,0.0004274187,0.00006034354,0.00012241084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034124238,0.00014437051,0.00011329463,0.00034974286,0.0004994913,0.00008307803,0.00039713352,0.00007273298,0.00018500653],"category_scores_gemma":[0.0000035057801,0.00013874898,0.00013413177,0.0005250441,0.000054287342,0.0025070154,0.0000030462463,0.00020412852,0.0006805898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000197954,0.00021277703,0.00000884888,0.000026269765,0.00011568401,0.000010579306,0.017122393,0.0060202735,0.00010502116,0.6934079,0.0040335697,0.2787387],"study_design_scores_gemma":[0.008961077,0.0036700107,0.0025364687,0.00026282686,0.0002246744,0.0027420684,0.0024405501,0.06787021,0.14111453,0.61025435,0.15582769,0.0040955427],"about_ca_topic_score_codex":0.0000048614584,"about_ca_topic_score_gemma":7.227215e-7,"teacher_disagreement_score":0.96911687,"about_ca_system_score_codex":0.000033008324,"about_ca_system_score_gemma":0.000110446024,"threshold_uncertainty_score":0.8747832},"labels":[],"label_agreement":null},{"id":"W2160893622","doi":"10.1016/j.disc.2003.10.027","title":"Binary optimal linear rate 1/2 codes","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Circulant matrix; Automorphism group; Linear code; Minimum distance; Discrete mathematics; Binary number; Code (set theory); Binary code; Automorphism; Block code; Decoding methods; Algorithm; Arithmetic","score_opus":0.017284274332645698,"score_gpt":0.255960872085661,"score_spread":0.23867659775301528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160893622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15106055,0.00004715706,0.84424555,0.00062647177,0.00013009206,0.00010884942,0.0000042349993,0.00029236628,0.0034847036],"genre_scores_gemma":[0.56960154,0.000018580256,0.42993388,0.00023415977,0.00005513967,0.000012271351,0.0000036265044,0.000015662028,0.0001251579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991006,0.000035785673,0.00021337393,0.0002310366,0.00016780457,0.00025136615],"domain_scores_gemma":[0.9991082,0.00009633511,0.00008076329,0.00059072155,0.0000377944,0.00008616502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039465496,0.0001523603,0.00017440274,0.000089400695,0.0001479194,0.00011777687,0.00073647726,0.00004809826,0.000020116026],"category_scores_gemma":[0.000045412762,0.00012657075,0.00012005289,0.00036879344,0.00008106639,0.00027090363,0.00023210054,0.00011393633,0.00015251568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043480427,0.00009308435,0.000011016542,0.00004480012,0.00002198038,0.000026607633,0.0022839755,0.0019810877,0.0012183276,0.9937695,0.00008240856,0.00046286115],"study_design_scores_gemma":[0.00091126416,0.00036695684,0.00015843556,0.00022740105,0.000036822184,0.00006256414,0.00050742575,0.09420571,0.014977428,0.88575256,0.002125305,0.00066812895],"about_ca_topic_score_codex":0.000002220342,"about_ca_topic_score_gemma":7.3365277e-7,"teacher_disagreement_score":0.41854098,"about_ca_system_score_codex":0.000015197754,"about_ca_system_score_gemma":0.000033819917,"threshold_uncertainty_score":0.5161406},"labels":[],"label_agreement":null},{"id":"W2161136434","doi":"10.1109/isit.1995.550338","title":"Spectral properties and information leakage of multi-output Boolean functions","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Boolean function; Leakage (economics); Cryptography; Boolean network; Function (biology); Mathematics; Information leakage; Discrete mathematics; Boolean expression; Computer science; Algorithm","score_opus":0.037809060189052446,"score_gpt":0.19117109994573644,"score_spread":0.153362039756684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161136434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2247768,0.00020003827,0.7472832,0.0006901901,0.00016828573,0.0001373083,0.0000019144275,0.00020863368,0.026533619],"genre_scores_gemma":[0.9927371,0.000014401742,0.0063323504,0.00015163435,0.000008716014,0.0000025432184,3.3626256e-7,0.0000011840139,0.0007517044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996545,0.000014354543,0.00010976893,0.00006807394,0.000069784604,0.000083551415],"domain_scores_gemma":[0.99974644,0.000013324605,0.00003023356,0.00015508525,0.00002627518,0.000028624121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007882904,0.000048779497,0.000053325333,0.00009641003,0.00007173876,0.000060159928,0.00013322388,0.000017499933,0.000041785508],"category_scores_gemma":[0.000013953962,0.00003738286,0.000028824268,0.00016156143,0.00004713848,0.0011881259,0.000055748907,0.000040763523,0.000035651803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016846117,0.00021049025,0.0025158627,0.00007752746,0.000043525568,0.0000012072826,0.010888513,0.00015895789,0.0024550573,0.64177847,0.0037889697,0.3380646],"study_design_scores_gemma":[0.002741852,0.0011207497,0.04774727,0.000118456825,0.000042985885,0.00008367324,0.0021934453,0.7999139,0.031041522,0.008159025,0.10581498,0.0010221652],"about_ca_topic_score_codex":0.00000855657,"about_ca_topic_score_gemma":0.000003973086,"teacher_disagreement_score":0.7997549,"about_ca_system_score_codex":0.0000031248292,"about_ca_system_score_gemma":0.0000028545244,"threshold_uncertainty_score":0.15244287},"labels":[],"label_agreement":null},{"id":"W2161786270","doi":"10.1016/j.disc.2004.10.001","title":"Erratum to “Construction of new extremal self-dual codes” [Discrete Mathematics 263 (2003) 81–91]","year":2004,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Discrete mathematics; Combinatorics","score_opus":0.016396793248745076,"score_gpt":0.24953170746511466,"score_spread":0.2331349142163696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161786270","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046993632,0.00065053714,0.9174052,0.0007634257,0.016327413,0.0015476969,0.00022038416,0.0011191524,0.061496254],"genre_scores_gemma":[0.0006973919,0.00028369454,0.96129555,0.00024854628,0.0013090257,0.00008131578,0.00020755063,0.0002441809,0.035632756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993984,0.00015056776,0.0019105761,0.0012281782,0.0015958503,0.0011308558],"domain_scores_gemma":[0.99395657,0.00019384432,0.0015024398,0.0031223171,0.000581057,0.0006437495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001022181,0.0012397841,0.0018567625,0.00089376833,0.00032907652,0.0005521478,0.002914026,0.00093407766,0.0001344955],"category_scores_gemma":[0.0004412731,0.0011562078,0.000697438,0.0027640667,0.00028213472,0.00057051517,0.0011350539,0.0013371272,0.0001876721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002068711,0.00036800516,0.000004723355,0.0024537684,0.0004890414,0.000050848415,0.016360736,0.00008588714,0.00010252439,0.59255075,0.38601816,0.0014948662],"study_design_scores_gemma":[0.0014974521,0.0009959722,0.000023698842,0.006201056,0.0009918018,0.0006367434,0.0026078993,0.01955825,0.001220784,0.8458292,0.11700095,0.0034362264],"about_ca_topic_score_codex":0.000036419842,"about_ca_topic_score_gemma":0.000031790594,"teacher_disagreement_score":0.2690172,"about_ca_system_score_codex":0.00022293911,"about_ca_system_score_gemma":0.0014140256,"threshold_uncertainty_score":0.9990888},"labels":[],"label_agreement":null},{"id":"W2162057952","doi":"10.1109/itw.2005.1531856","title":"The multivariate merit factor of a Boolean function","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Univariate; Asymptote; Boolean function; Multivariate statistics; Mathematics; Figure of merit; Quadratic equation; Function (biology); Multivariate analysis; Metric (unit); Value (mathematics); Statistics; Discrete mathematics; Computer science; Mathematical analysis; Engineering","score_opus":0.012129266420942161,"score_gpt":0.2263809565451967,"score_spread":0.21425169012425452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162057952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035350233,0.00007745126,0.9525592,0.0011734383,0.00024568004,0.000064051295,6.0847077e-7,0.00013388744,0.010395492],"genre_scores_gemma":[0.9928474,0.000004122222,0.0065242066,0.00014138319,0.00003991319,0.000002388336,9.283992e-8,0.0000018480489,0.00043868736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995761,0.000037284215,0.00009662438,0.000101617356,0.00009061294,0.00009776402],"domain_scores_gemma":[0.9995333,0.000098601464,0.000037261816,0.0002804968,0.000026282392,0.00002405716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001589093,0.00004551721,0.00004496405,0.000028503884,0.000108258515,0.000042702868,0.0003411575,0.000015752488,0.000046837216],"category_scores_gemma":[0.00001220134,0.000027310476,0.0000549694,0.00015901041,0.00003034754,0.00017209182,0.00006786486,0.000041180796,0.000027826074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012956152,0.000021633809,0.00009325665,0.0000010241915,0.0000128874635,8.620722e-8,0.00026036892,0.000009501891,0.004034939,0.71335316,0.00023376195,0.28196642],"study_design_scores_gemma":[0.0013933491,0.0006943182,0.057616726,0.000032170512,0.0000270768,0.000008690775,0.00028605884,0.08609571,0.07428077,0.17597996,0.6029663,0.00061888],"about_ca_topic_score_codex":0.000009896844,"about_ca_topic_score_gemma":0.0000146455395,"teacher_disagreement_score":0.9574971,"about_ca_system_score_codex":0.0000039521774,"about_ca_system_score_gemma":0.000007768678,"threshold_uncertainty_score":0.11136889},"labels":[],"label_agreement":null},{"id":"W2163023576","doi":"10.1109/pacrim.1989.48388","title":"The least complex parallel Massey-Omura multiplier and its LCA and VLSI designs","year":2003,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multiplier (economics); Very-large-scale integration; Representation (politics); Polynomial; Computer science; Arithmetic; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics; Embedded system; Mathematical analysis","score_opus":0.04863150669127425,"score_gpt":0.24670657792527573,"score_spread":0.19807507123400148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163023576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12997377,0.0014970002,0.82473654,0.002288353,0.00023659361,0.0004156875,0.0000017480675,0.0002823879,0.0405679],"genre_scores_gemma":[0.97521067,0.00008995433,0.023741016,0.00036890685,0.000012221752,0.000009360906,2.279868e-7,0.000005095165,0.0005625513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914587,0.0001254716,0.00011569821,0.00026514754,0.00011031175,0.00023752927],"domain_scores_gemma":[0.9992974,0.00026633733,0.000031461677,0.000276023,0.000033032626,0.00009576402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040644847,0.00011573163,0.0000944246,0.000039330203,0.00046606915,0.00027693377,0.00030602264,0.00003306357,0.000022464168],"category_scores_gemma":[0.000031579624,0.000075413685,0.000032092645,0.00018751298,0.000095929354,0.0001951206,0.00012245942,0.00008160258,0.000015115298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006603114,0.000015442285,0.0012234855,0.0000034874815,0.000012184602,0.0000023074522,0.00019917807,0.0000059601457,0.0010444829,0.98806673,0.0004107269,0.009009439],"study_design_scores_gemma":[0.003980412,0.0006283623,0.08761944,0.00005381388,0.00005047707,0.0003901902,0.0014364794,0.13912527,0.0042394507,0.48395714,0.2767424,0.0017765543],"about_ca_topic_score_codex":0.0000025716377,"about_ca_topic_score_gemma":0.000010622031,"teacher_disagreement_score":0.8452369,"about_ca_system_score_codex":0.000003751113,"about_ca_system_score_gemma":0.000012105262,"threshold_uncertainty_score":0.35846743},"labels":[],"label_agreement":null},{"id":"W2163288567","doi":"10.1016/j.disc.2009.12.006","title":"The number of irreducible polynomials of degree <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si115.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math> over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si116.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:msub></mml:math> with given trace and constant terms","year":2010,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Degree (music); Combinatorics; TRACE (psycholinguistics); Constant (computer programming); Discrete mathematics; Physics; Computer science","score_opus":0.01869653219332097,"score_gpt":0.24817503262386428,"score_spread":0.22947850043054333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163288567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84193575,0.00095033523,0.0033751312,0.00073618215,0.0029947131,0.000148229,0.0008848157,0.00032790576,0.14864692],"genre_scores_gemma":[0.98035616,0.0013119179,0.012797372,0.00087027,0.0016280771,0.0010349768,0.0006593331,0.001016652,0.00032525655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98563683,0.0005814577,0.0036274656,0.002827807,0.0038881903,0.0034382674],"domain_scores_gemma":[0.9847233,0.003436014,0.004726941,0.0052103875,0.0003657435,0.0015375743],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0042499388,0.0017572837,0.00093820755,0.0006810237,0.0025857962,0.0028521062,0.0045313737,0.0028788804,0.037188392],"category_scores_gemma":[0.0017412931,0.0025379055,0.0026840905,0.0020088714,0.0043388135,0.0025814646,0.0037049807,0.0027332895,0.0011634943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030366916,0.0007997321,0.000057255413,0.002867161,0.0027796943,0.0012017541,0.0059574177,0.00094709964,0.006054475,0.94806516,0.02645088,0.001782685],"study_design_scores_gemma":[0.0042528026,0.0022363274,0.00018956375,0.0033497491,0.0028178187,0.003249493,0.0035257204,0.43045014,0.5432203,0.0018184443,0.0022263555,0.0026632715],"about_ca_topic_score_codex":0.0013878603,"about_ca_topic_score_gemma":0.0014235837,"teacher_disagreement_score":0.9462467,"about_ca_system_score_codex":0.000026139582,"about_ca_system_score_gemma":0.0022937343,"threshold_uncertainty_score":0.99961424},"labels":[],"label_agreement":null},{"id":"W2163581636","doi":"10.1109/arith.2003.1207676","title":"A unidirectional bit serial systolic architecture for double-basis division over GF(2/sup m/)","year":2004,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Division (mathematics); Verilog; Finite field; Galois theory; GF(2); Computer science; Cryptography; Parallel computing; Basis (linear algebra); Arithmetic; Dimension (graph theory); Computer hardware; Field-programmable gate array; Mathematics; Discrete mathematics; Algorithm; Combinatorics","score_opus":0.01374058181408562,"score_gpt":0.24190304157134102,"score_spread":0.2281624597572554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163581636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14655367,0.00003477332,0.8490379,0.0013726209,0.0005998629,0.00027489322,0.0000060849384,0.00036712142,0.0017530653],"genre_scores_gemma":[0.96360105,0.000002362016,0.035444357,0.00042493633,0.00025282076,0.000057662724,0.00000543071,0.000011608918,0.00019976303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989228,0.00003196522,0.00016029032,0.0003859918,0.00022311958,0.00027582972],"domain_scores_gemma":[0.9993243,0.00010366934,0.000045966164,0.0003752829,0.000053907315,0.000096880685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002489002,0.00015257443,0.0001429488,0.00020212421,0.0002640056,0.00016556225,0.00051782944,0.00007589056,0.000058134377],"category_scores_gemma":[0.000012470303,0.0001242791,0.000199491,0.0005387773,0.00004318176,0.00022392113,0.00014436422,0.00010311044,0.000019386905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018750547,0.00009793068,0.00007639131,0.000021851227,0.000034979555,0.000002450223,0.00033644433,0.004176409,0.0008338708,0.9745271,0.00051748374,0.019187592],"study_design_scores_gemma":[0.010357318,0.0009136143,0.0021031792,0.00016548873,0.000042795982,0.00009742085,0.00004064938,0.0048875194,0.028542846,0.8347948,0.1170135,0.0010408736],"about_ca_topic_score_codex":0.000048257287,"about_ca_topic_score_gemma":0.000047793645,"teacher_disagreement_score":0.8170474,"about_ca_system_score_codex":0.000039086884,"about_ca_system_score_gemma":0.00006693,"threshold_uncertainty_score":0.50679547},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.004967897182034475,"score_gpt":0.19394458703232492,"score_spread":0.18897668985029045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163934701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023545876,0.000013289219,0.97441304,0.00014263797,0.00034294135,0.00029116508,0.0000617412,0.0002811594,0.0009081253],"genre_scores_gemma":[0.97368556,0.000016357157,0.025820078,0.00024959666,0.000018112236,0.00012946218,0.000029129369,0.000005932793,0.00004578172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988389,0.00014023983,0.00042894893,0.00019390562,0.000187035,0.00021096694],"domain_scores_gemma":[0.9987926,0.00038273667,0.00016302645,0.0004300367,0.00015976562,0.00007184712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007676086,0.00017201072,0.00018207428,0.0012013926,0.00070011354,0.00026139338,0.0002593946,0.00009988058,0.00005398518],"category_scores_gemma":[0.000009680372,0.00016739454,0.00029401132,0.0016052512,0.00019837616,0.001533445,0.0000028707493,0.00019174998,0.000019455614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001882218,0.000110071254,0.00009123178,0.00002689297,0.00033196373,1.5713118e-7,0.00039638797,0.005791818,0.00021757433,0.81874925,0.00006567793,0.17403075],"study_design_scores_gemma":[0.0020549723,0.0006791161,0.0051255906,0.00003840227,0.0009675718,0.00003534003,0.0012790668,0.046874464,0.0093739135,0.92769873,0.0049479064,0.00092494214],"about_ca_topic_score_codex":0.000029365516,"about_ca_topic_score_gemma":0.000015868342,"teacher_disagreement_score":0.9501397,"about_ca_system_score_codex":0.000025216877,"about_ca_system_score_gemma":0.000031302712,"threshold_uncertainty_score":0.6826151},"labels":[],"label_agreement":null},{"id":"W2164324071","doi":"10.1109/bsc.2006.1644587","title":"Quadratic Bent Functions of Polynomial Forms and their Applications to Bent Sequences","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Computer science; Mathematics","score_opus":0.009744861985308707,"score_gpt":0.2181534547826079,"score_spread":0.20840859279729917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164324071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10783961,0.00006152959,0.8845032,0.00083903514,0.000048733196,0.00019075647,0.000004854227,0.000069015194,0.006443307],"genre_scores_gemma":[0.99144,0.0000017333604,0.008176327,0.00011320288,0.00003289712,0.000058161397,0.0000017145308,0.00000200715,0.00017393616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949944,0.0000132820005,0.00014195724,0.00017037352,0.00006630496,0.0001086476],"domain_scores_gemma":[0.9995796,0.00005624081,0.00003429975,0.00025277078,0.00002949855,0.00004756925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011148908,0.00006768696,0.00007909303,0.00009738428,0.0001245331,0.00005193297,0.00023633118,0.000018350009,0.000017468243],"category_scores_gemma":[0.0000020841394,0.000047028978,0.000043788838,0.0003360767,0.000045957368,0.00013637135,0.00008645502,0.000029037245,0.000008375561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044282074,0.000091147005,0.0009407934,0.0000084348885,0.00001119338,1.1778484e-7,0.0004136696,0.00013755233,0.005395751,0.9577463,0.00090573967,0.034344867],"study_design_scores_gemma":[0.00087904796,0.0011413787,0.037360437,0.00006159492,0.000043943935,0.000039972914,0.0024723683,0.010184155,0.056582324,0.8177675,0.07246123,0.0010060328],"about_ca_topic_score_codex":0.00009282589,"about_ca_topic_score_gemma":0.0001564244,"teacher_disagreement_score":0.8836004,"about_ca_system_score_codex":0.0000075822354,"about_ca_system_score_gemma":0.000018182303,"threshold_uncertainty_score":0.1917786},"labels":[],"label_agreement":null},{"id":"W2164380903","doi":"10.1007/3-540-36159-6_30","title":"Message Authentication Codes with Error Correcting Capabilities","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Authentication (law); Message authentication code; Computer security; Computer network; Cryptography","score_opus":0.017450033132082515,"score_gpt":0.22968309769738973,"score_spread":0.21223306456530722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164380903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086748315,0.00028577106,0.988501,0.00036427597,0.0009606939,0.00029859666,0.000003201912,0.00029099468,0.008427974],"genre_scores_gemma":[0.78190345,0.000015812875,0.21637723,0.00051433913,0.00024027299,0.000017050163,0.000002966679,0.000036732843,0.00089213613],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968729,0.000057232617,0.00038184712,0.0013314302,0.0007897044,0.00056687486],"domain_scores_gemma":[0.9972999,0.0007162231,0.00027160687,0.0013656345,0.00021521424,0.00013142517],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009158329,0.0004702915,0.00043115433,0.00071106513,0.000410571,0.0005926253,0.0024632479,0.00019805047,0.0000676645],"category_scores_gemma":[0.00007575343,0.00039251443,0.000119978504,0.00065395574,0.0010787825,0.0004882625,0.0005822501,0.00064988376,0.000031238786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001559284,0.00006172615,0.00024700921,0.000087201624,0.000027026274,0.000063780695,0.007120907,0.0065009734,0.000097370335,0.19879064,0.000024457015,0.78696334],"study_design_scores_gemma":[0.00041235206,0.00057055184,0.00024117743,0.0011633814,0.000034619745,0.00028426573,0.0000036410313,0.35274416,0.002170708,0.63935274,0.001539616,0.0014827793],"about_ca_topic_score_codex":0.000014982026,"about_ca_topic_score_gemma":0.000064315245,"teacher_disagreement_score":0.78548056,"about_ca_system_score_codex":0.00015512088,"about_ca_system_score_gemma":0.00017197219,"threshold_uncertainty_score":0.99985266},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008859276577574706,"score_gpt":0.24117491621440465,"score_spread":0.23231563963682994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164604678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06423735,0.00003454937,0.93061054,0.0003118567,0.000063310574,0.00041881014,0.0000762051,0.0001906172,0.0040567648],"genre_scores_gemma":[0.99553263,0.00013001442,0.0030465992,0.0008287162,0.000012261064,0.00023913817,0.0000055000805,0.0000057675834,0.00019938432],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991377,0.00013379002,0.00025672762,0.0001995132,0.00010630242,0.00016595048],"domain_scores_gemma":[0.9989977,0.00040398058,0.00005497541,0.00037502174,0.000046290326,0.00012207065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041652482,0.0001533172,0.00013789564,0.00026243238,0.00042429424,0.00021652252,0.00027157826,0.000053232092,0.00008483485],"category_scores_gemma":[0.00000401931,0.0001345551,0.00005197462,0.0003889473,0.00015483242,0.0011618115,0.000004564729,0.00012635197,0.00008921057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017600309,0.00007940279,0.000010673609,0.000028911087,0.000055520843,2.7502347e-7,0.014042925,0.0014717857,0.0005335577,0.14675097,0.00013933847,0.83671063],"study_design_scores_gemma":[0.004053199,0.0013548105,0.0033357632,0.0002773785,0.00012780809,0.0003236865,0.013093367,0.048289496,0.10493273,0.7191933,0.10256839,0.002450081],"about_ca_topic_score_codex":0.000005110688,"about_ca_topic_score_gemma":0.0000040846803,"teacher_disagreement_score":0.9312953,"about_ca_system_score_codex":0.000014884936,"about_ca_system_score_gemma":0.000018630311,"threshold_uncertainty_score":0.5486998},"labels":[],"label_agreement":null},{"id":"W2165199953","doi":"10.1109/arith.1993.378110","title":"Integer mapping architectures for the polynomial ring engine","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computation; Ring (chemistry); Computer science; Polynomial; Adder; Very-large-scale integration; Parallel computing; Integer (computer science); Construct (python library); Computational science; Theoretical computer science; Algorithm; Mathematics; Programming language; Embedded system","score_opus":0.02637814232108617,"score_gpt":0.2130629802508729,"score_spread":0.1866848379297867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165199953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014283477,0.00021583636,0.9757929,0.0019011955,0.0002929321,0.000111136666,3.5492633e-7,0.00016772807,0.0072344504],"genre_scores_gemma":[0.9769626,0.0000024891617,0.021807585,0.0005949488,0.00016338976,0.000018677203,6.5655826e-8,0.000003908593,0.00044628524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995161,0.000016941705,0.000081546845,0.00014852095,0.00006462439,0.00017225402],"domain_scores_gemma":[0.999302,0.0003579119,0.000018263145,0.00028461198,0.000009045915,0.000028120025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001929325,0.00006941002,0.00005657926,0.00007315243,0.00017068861,0.00009406056,0.00058174535,0.000017777475,0.00006362806],"category_scores_gemma":[0.000027537439,0.0000420081,0.00009316937,0.00018634509,0.00002845001,0.00003523697,0.00010283285,0.00007908131,0.000013034291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009956239,0.000036444748,0.00015769633,0.0000097830525,0.0000556239,0.0000016936725,0.0038285777,0.0009765376,0.00083781674,0.15719235,0.0055909557,0.8313026],"study_design_scores_gemma":[0.00048051946,0.000087122564,0.0007200328,0.000020294106,0.000008504839,0.000023162493,0.00012113257,0.8700101,0.0040102354,0.022501802,0.10173914,0.00027797619],"about_ca_topic_score_codex":0.00000493253,"about_ca_topic_score_gemma":0.0000029805803,"teacher_disagreement_score":0.96267915,"about_ca_system_score_codex":0.0000044422873,"about_ca_system_score_gemma":0.0000023032694,"threshold_uncertainty_score":0.17130408},"labels":[],"label_agreement":null},{"id":"W2165602610","doi":"10.1007/978-3-642-12200-2_35","title":"Ambiguity and Deficiency in Costas Arrays and APN Permutations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Ambiguity; Upper and lower bounds; Abelian group; Permutation group; Combinatorics; Computer science; Mathematics; Discrete mathematics","score_opus":0.012580546011538355,"score_gpt":0.23460573121406253,"score_spread":0.22202518520252418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165602610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057405257,0.0005543857,0.9890284,0.00052551995,0.0006066874,0.00025286665,0.0000048023157,0.00008304234,0.0032037601],"genre_scores_gemma":[0.82134986,0.000075391334,0.1776832,0.0007403114,0.00009585776,0.000006677075,0.0000019590836,0.00001613402,0.000030579144],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975099,0.00003879983,0.00033167936,0.0012131376,0.00044302002,0.0004634863],"domain_scores_gemma":[0.99840665,0.00044029768,0.00013484278,0.0007657469,0.00009560447,0.00015688757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009818946,0.0003544167,0.00034119558,0.0009223339,0.00034253867,0.0005382643,0.0013263436,0.00026004028,0.000009119482],"category_scores_gemma":[0.00008625609,0.00033592194,0.000056146135,0.0006588424,0.0012730066,0.0004856886,0.00089686614,0.0009615331,0.000004835413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051367915,0.000035438956,0.00064392574,0.000037483085,0.0000032201037,0.000052311847,0.0030900042,0.00056799303,0.0005357897,0.22320017,0.0000016577826,0.77182686],"study_design_scores_gemma":[0.00029832427,0.00015768774,0.003896589,0.00019212104,0.0000068376316,0.00013373322,8.520982e-7,0.06791926,0.0004252123,0.9259614,0.00039902446,0.0006089732],"about_ca_topic_score_codex":0.000022469509,"about_ca_topic_score_gemma":0.00036809692,"teacher_disagreement_score":0.81560934,"about_ca_system_score_codex":0.000058204892,"about_ca_system_score_gemma":0.0001944704,"threshold_uncertainty_score":0.9999093},"labels":[],"label_agreement":null},{"id":"W2166905766","doi":"10.1109/tit.2007.911261","title":"Affine Reflection Group Codes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Decoding methods; Correctness; Rank (graph theory); Mathematics; Affine transformation; Reflection (computer programming); Dimension (graph theory); Affine plane (incidence geometry); Affine space; Affine hull; Group (periodic table); Affine group; Homogeneous space; Vector space; Affine coordinate system; Affine combination; Combinatorics; Discrete mathematics; Algorithm; Computer science; Pure mathematics; Geometry","score_opus":0.015213679010986246,"score_gpt":0.2250112200735565,"score_spread":0.20979754106257026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166905766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071039135,0.000008655359,0.97830194,0.0001124573,0.00077525375,0.00012362609,0.0000062173644,0.00052063155,0.013047293],"genre_scores_gemma":[0.9939498,0.00004482575,0.0049572466,0.0006979788,0.000027689443,0.00004308605,0.0000034478007,0.000005137625,0.00027079473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908495,0.00012261872,0.00026682927,0.00012778948,0.00022116989,0.00017662391],"domain_scores_gemma":[0.9992447,0.00015008544,0.00008671193,0.0003823869,0.00006992913,0.00006619451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004539123,0.00012893176,0.00010307575,0.00041543777,0.0005913007,0.000076342745,0.00034051418,0.00007080781,0.00014228182],"category_scores_gemma":[0.000006118698,0.00012288455,0.00012040163,0.0006430352,0.0000839852,0.0024485176,0.0000019611061,0.00019592613,0.0003694683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021484194,0.00017358741,0.0000056650993,0.000018779243,0.000051920466,0.0000025065456,0.004607985,0.005440262,0.00056587567,0.68700904,0.00056937337,0.30134013],"study_design_scores_gemma":[0.0064874114,0.003376498,0.0022553175,0.00023536077,0.00012724778,0.001346791,0.0016261182,0.067072906,0.21525817,0.5582869,0.1408559,0.0030713868],"about_ca_topic_score_codex":0.000003936586,"about_ca_topic_score_gemma":0.0000024311923,"teacher_disagreement_score":0.98684585,"about_ca_system_score_codex":0.000041480533,"about_ca_system_score_gemma":0.000025848954,"threshold_uncertainty_score":0.50110865},"labels":[],"label_agreement":null},{"id":"W2167340446","doi":"10.1109/tcomm.2011.121410.090612","title":"Efficient Iterative Techniques for Soft Decision Decoding of Reed-Solomon Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Belief propagation; Sequential decoding; List decoding; Parity-check matrix; Berlekamp–Welch algorithm; Algorithm; Computer science; Low-density parity-check code; Binary number; Concatenated error correction code; Binary symmetric channel; Theoretical computer science; Mathematics; Block code; Arithmetic","score_opus":0.025563512691039552,"score_gpt":0.3060731576643248,"score_spread":0.28050964497328523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167340446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010434829,0.000033263605,0.9873825,0.00044192543,0.00026639376,0.0003554535,0.000046465408,0.00021741666,0.0008218043],"genre_scores_gemma":[0.663324,0.000026267273,0.33644092,0.00004190831,0.0000067221054,0.00013693153,0.000001925338,0.0000068466265,0.000014465751],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990949,0.00008831619,0.0003020534,0.00022373252,0.0001369699,0.00015405347],"domain_scores_gemma":[0.99609536,0.0015987597,0.00011644789,0.0019142008,0.00021790834,0.000057327205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051692995,0.000118033895,0.00015657622,0.00029994283,0.0006483833,0.00006507396,0.0015853052,0.00008736691,0.000011853087],"category_scores_gemma":[0.000029504487,0.0001194158,0.000179474,0.0005119292,0.00020876042,0.00013047595,0.000016289796,0.00032760677,0.0000047495637],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008864846,0.0011353404,0.000021813697,0.000022562193,0.00006329493,2.6956099e-7,0.002577312,0.0019810426,0.08122248,0.3140623,0.00009289969,0.59873205],"study_design_scores_gemma":[0.00077173975,0.00070976047,0.00012082023,0.00032417668,0.00007537595,0.00002007185,0.00016688423,0.41887143,0.481749,0.09118767,0.0054275207,0.0005755485],"about_ca_topic_score_codex":0.000012631024,"about_ca_topic_score_gemma":0.00018532858,"teacher_disagreement_score":0.6528892,"about_ca_system_score_codex":0.000017113165,"about_ca_system_score_gemma":0.000041032796,"threshold_uncertainty_score":0.49869058},"labels":[],"label_agreement":null},{"id":"W2167845685","doi":"10.1109/tc.2015.2401024","title":"Comments on “Low-Latency Digit-Serial Systolic Double Basis Multiplier over $GF(2^{m})$ Using Subquadratic Toeplitz Matrix-Vector Product Approach”","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toeplitz matrix; Arithmetic; Matrix multiplication; Multiplier (economics); Computer science; Multiplication (music); Numerical digit; Latency (audio); Parallel computing; GF(2); Basis (linear algebra); Mathematics; Algorithm; Discrete mathematics; Combinatorics; Finite field; Pure mathematics; Telecommunications","score_opus":0.0468885360226933,"score_gpt":0.2719314946344938,"score_spread":0.2250429586118005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167845685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2071242,0.000017136907,0.7872656,0.00020225531,0.0040370603,0.0006093396,0.000015118698,0.00047446805,0.00025480206],"genre_scores_gemma":[0.9708427,0.0000033797292,0.028390765,0.0003495895,0.00022429942,0.00005836604,0.000004702773,0.00004219009,0.00008401767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971511,0.00022045779,0.0004794864,0.0009435542,0.0006113344,0.0005940819],"domain_scores_gemma":[0.9980093,0.00015074642,0.00016119724,0.0012133475,0.000110220746,0.00035515183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038627672,0.00045835093,0.00043213408,0.00048041638,0.00044243233,0.0004569318,0.0010496321,0.00011843235,0.00001448896],"category_scores_gemma":[0.0000041740614,0.00043867182,0.0003084072,0.0010184321,0.00010648719,0.0007912538,0.000019331368,0.00039048606,0.000076879944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003049788,0.007602124,0.00026866762,0.00043456873,0.0010901716,0.000093513474,0.010065877,0.86976135,0.0048467745,0.021295706,0.0039467444,0.07754474],"study_design_scores_gemma":[0.010602465,0.0013620452,0.00029780678,0.0005324604,0.000202381,0.00013632109,0.00017248145,0.94783187,0.03370588,0.0015068743,0.0014827141,0.0021667168],"about_ca_topic_score_codex":0.00008605171,"about_ca_topic_score_gemma":0.00000571531,"teacher_disagreement_score":0.7637185,"about_ca_system_score_codex":0.00024124201,"about_ca_system_score_gemma":0.00012447956,"threshold_uncertainty_score":0.9998065},"labels":[],"label_agreement":null},{"id":"W2167854544","doi":"10.1007/s00037-010-0294-0","title":"Interpolation of Shifted-Lacunary Polynomials","year":2010,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lacunary function; Mathematics; Combinatorics; Interpolation (computer graphics); Polynomial; Logarithm; Degree (music); Modulo; Discrete mathematics; Prime (order theory); Exponent; Representation (politics); Rational function; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.031052942470248285,"score_gpt":0.2759480848059405,"score_spread":0.24489514233569223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167854544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46462458,0.000011187843,0.5310429,0.00038664823,0.00038794594,0.0000740985,0.000008960487,0.00010930915,0.003354406],"genre_scores_gemma":[0.7969331,1.4044997e-7,0.20284002,0.00014125828,0.000057011544,0.0000028204563,0.00001467621,0.000003937202,0.000007016077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990333,0.00009470724,0.00027431428,0.00023750699,0.000226199,0.00013399744],"domain_scores_gemma":[0.9990093,0.0003164158,0.00014266798,0.0003162201,0.0001479807,0.000067380344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041235465,0.000103394916,0.00015036803,0.00016936593,0.000116716314,0.000054958233,0.0006554416,0.000052452266,0.00013576212],"category_scores_gemma":[0.000058152593,0.00010559909,0.00010481493,0.00036877082,0.00021836211,0.00030377612,0.00021801109,0.00019872324,0.00002542216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016323207,0.00007274232,0.0015346468,0.000007668739,0.00001326896,9.408795e-7,0.0002470913,0.00015728163,0.0022191345,0.99017036,0.00026915854,0.0052913805],"study_design_scores_gemma":[0.00017601528,0.000051952906,0.082492165,0.0000068802387,0.0000029355797,0.000011671061,0.000006495755,0.10549893,0.00040829953,0.810923,0.0003148547,0.00010679983],"about_ca_topic_score_codex":0.000011773469,"about_ca_topic_score_gemma":0.000010468751,"teacher_disagreement_score":0.33230853,"about_ca_system_score_codex":0.0000063105936,"about_ca_system_score_gemma":0.00005637214,"threshold_uncertainty_score":0.43062058},"labels":[],"label_agreement":null},{"id":"W2168099167","doi":"10.1109/isit.1998.708704","title":"On Tanner graphs of lattices and codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tanner graph; Lambda; Quotient; Abelian group; Combinatorics; Decoding methods; Mathematics; Discrete mathematics; Lattice (music); Graph; Computational complexity theory; Block code; Computer science; Linear code; Algorithm; Physics","score_opus":0.017687294540916706,"score_gpt":0.21515438995446354,"score_spread":0.19746709541354684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168099167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85328656,0.00036534897,0.03741295,0.0006641087,0.00011343797,0.00005460181,9.894583e-7,0.00013551206,0.10796648],"genre_scores_gemma":[0.9954924,0.000023535318,0.0040438124,0.00021355799,0.0000032392554,8.469801e-7,3.6768252e-8,0.000001209362,0.00022133983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996812,0.000020200949,0.00005728091,0.000107659085,0.00006787364,0.00006580674],"domain_scores_gemma":[0.9996657,0.00010930941,0.000020284302,0.00016710686,0.000012206865,0.000025405077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086945074,0.000040460887,0.00005518502,0.00006874813,0.000034343313,0.000025890437,0.00017633334,0.00001438671,0.0000966634],"category_scores_gemma":[0.0000076057836,0.000030054076,0.000025136147,0.00017851449,0.000047990234,0.00010416469,0.000039783507,0.000026000433,0.000008493088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013998737,0.000027372165,0.00051428255,0.0000033572207,0.0000048167576,7.342384e-7,0.00018936492,0.0000021662963,0.00018520611,0.9850648,0.00056859653,0.013437919],"study_design_scores_gemma":[0.00032952402,0.00044111596,0.0048753913,0.000031986685,0.000007501968,0.000006790656,0.000042693344,0.015350243,0.006282538,0.9697979,0.0026355772,0.00019873636],"about_ca_topic_score_codex":0.0000026229325,"about_ca_topic_score_gemma":0.0000017950744,"teacher_disagreement_score":0.14220585,"about_ca_system_score_codex":6.0073984e-7,"about_ca_system_score_gemma":6.740662e-7,"threshold_uncertainty_score":0.12255697},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021632181448261484,"score_gpt":0.2330094041940499,"score_spread":0.2113772227457884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168888523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14745449,0.00006249122,0.84537387,0.00047566125,0.001036176,0.00045600225,0.00011788607,0.00082635693,0.004197049],"genre_scores_gemma":[0.97773093,0.00007389181,0.02014361,0.0008292502,0.000078763114,0.00016022645,0.000047407673,0.00003689001,0.00089901855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968065,0.0003074411,0.0007989524,0.0005327648,0.0008391189,0.00071521744],"domain_scores_gemma":[0.9973593,0.00028357652,0.0003674329,0.001407371,0.0002760175,0.00030631074],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00083691074,0.0006056311,0.0004288292,0.0009950476,0.0009953263,0.0005824753,0.0012359228,0.00026894882,0.0009011352],"category_scores_gemma":[0.000018646742,0.0005034014,0.00037306646,0.0014748471,0.0004404029,0.0048355823,0.000017000253,0.0005903822,0.002264004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038512186,0.0017333257,0.00018915231,0.0006327344,0.0017107454,0.000028216242,0.10607575,0.123263896,0.020755244,0.48936903,0.0015755371,0.25081515],"study_design_scores_gemma":[0.016432531,0.004614157,0.00378531,0.0030054606,0.0011426171,0.0019956117,0.002929908,0.0016233383,0.09006265,0.3369225,0.52624,0.011245944],"about_ca_topic_score_codex":0.000032670247,"about_ca_topic_score_gemma":0.0001362719,"teacher_disagreement_score":0.8302764,"about_ca_system_score_codex":0.00020239118,"about_ca_system_score_gemma":0.00020187684,"threshold_uncertainty_score":0.99974173},"labels":[],"label_agreement":null},{"id":"W2169200909","doi":"10.3233/fi-2011-390","title":"K-Comma Codes and Their Generalizations","year":2011,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Mathematics; Discrete mathematics; Theoretical computer science; Arithmetic; Algebra over a field; Pure mathematics","score_opus":0.033601372998993635,"score_gpt":0.20600116697538332,"score_spread":0.1723997939763897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169200909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11079495,0.00007504017,0.8180546,0.00018405264,0.00019282923,0.00015271772,0.000009402088,0.00025985544,0.070276536],"genre_scores_gemma":[0.96291417,0.000022910197,0.035832684,0.0011357375,0.000014114428,0.000015710697,0.0000045133106,0.000003688197,0.000056488992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948573,0.000026094873,0.00017751782,0.00008671424,0.000067401124,0.00015655578],"domain_scores_gemma":[0.9994785,0.00003856119,0.000051781262,0.00033371654,0.000021644692,0.00007580306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017533281,0.00009300535,0.00009055729,0.00009462576,0.000183026,0.00013847201,0.00039967222,0.000024858158,0.00010791692],"category_scores_gemma":[0.0000079652145,0.000071608614,0.000036634716,0.00020770048,0.000076442,0.00074524584,0.00022543376,0.000051830422,0.00004953882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030152905,0.000030053963,0.0018808861,0.000013593934,0.000023285083,4.605435e-7,0.014520749,0.0000015262942,0.000051274437,0.96092916,0.0008015827,0.021744441],"study_design_scores_gemma":[0.0017916888,0.0008088769,0.032563124,0.00014436846,0.000043029002,0.00017610402,0.005773008,0.07993834,0.01473541,0.67498296,0.18755683,0.001486271],"about_ca_topic_score_codex":0.000009064336,"about_ca_topic_score_gemma":0.0000034001303,"teacher_disagreement_score":0.8521192,"about_ca_system_score_codex":0.000006886849,"about_ca_system_score_gemma":0.0000111720265,"threshold_uncertainty_score":0.29201144},"labels":[],"label_agreement":null},{"id":"W2169627913","doi":"10.1016/j.ffa.2006.09.004","title":"On the parity of the number of irreducible factors of self-reciprocal polynomials over finite fields","year":2006,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monomial; Mathematics; Reciprocal; Parity (physics); Finite field; Polynomial; Pure mathematics; Irreducible polynomial; Binary number; Discrete mathematics; Combinatorics; Arithmetic; Mathematical analysis; Matrix polynomial","score_opus":0.012331227929558845,"score_gpt":0.23025769904817706,"score_spread":0.2179264711186182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169627913","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81299156,0.00006842693,0.1736612,0.0009478916,0.00008899298,0.0003484865,0.0000785616,0.00003467155,0.01178023],"genre_scores_gemma":[0.9993934,0.000012628138,0.00033712634,0.000127317,0.000026150166,0.000035732104,0.0000024108247,0.0000035231244,0.000061703206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932843,0.00006165839,0.00024268012,0.00016494094,0.00009767791,0.00010461881],"domain_scores_gemma":[0.99777067,0.0013412097,0.0001710489,0.000648509,0.00004808457,0.00002047186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020031843,0.000097099124,0.00014929993,0.000036058205,0.0001322327,0.000018081835,0.0005279577,0.00009169179,0.000053843713],"category_scores_gemma":[0.000027060689,0.00005341357,0.0001298024,0.00037299644,0.00011184147,0.000048544927,0.0001374636,0.00014050814,0.0000014398144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071343084,0.00018780876,0.006939673,0.00002037692,0.000028577002,2.8398535e-8,0.0008120844,0.00008673645,0.00022684515,0.98982406,0.00045047162,0.001416225],"study_design_scores_gemma":[0.00033332277,0.00013094471,0.061588787,0.000070762806,0.00003774897,0.0000016067721,0.00016483945,0.0027796803,0.039090432,0.88716453,0.0083959745,0.00024138487],"about_ca_topic_score_codex":0.00012817567,"about_ca_topic_score_gemma":0.000017713644,"teacher_disagreement_score":0.18640187,"about_ca_system_score_codex":0.000002657885,"about_ca_system_score_gemma":0.000026236201,"threshold_uncertainty_score":0.21781422},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03254854062645635,"score_gpt":0.28498527948146896,"score_spread":0.2524367388550126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170368342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4784621,0.000075922544,0.5205238,0.00016588178,0.0004929788,0.000025770783,5.0409596e-7,0.00001924399,0.00023377646],"genre_scores_gemma":[0.99657905,0.000034696255,0.0029466029,0.00019780776,0.00021371548,4.437835e-7,7.747017e-7,0.000004822174,0.000022086184],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99893814,0.00016165736,0.00038472094,0.000114188006,0.00024999864,0.00015128637],"domain_scores_gemma":[0.9987169,0.00056272966,0.00033092778,0.00013468157,0.00017164438,0.000083133935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089742977,0.00009285214,0.00019050874,0.0002775706,0.00007945159,0.0001505182,0.00038510055,0.000046849407,0.00002056294],"category_scores_gemma":[0.000127645,0.000083137485,0.00012290457,0.0004895453,0.000015762282,0.00051725906,0.0000625046,0.0001605129,0.000007454195],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042049334,0.0005643861,0.22033347,0.00004677978,0.0003819453,0.0002740958,0.01591017,0.05252951,0.0023205269,0.024736812,0.003963084,0.6785187],"study_design_scores_gemma":[0.0012992606,0.00048840744,0.91290253,0.0001278855,0.000022562826,0.00026688047,0.000066427296,0.04372567,0.00042574247,0.03650248,0.0038209297,0.00035123955],"about_ca_topic_score_codex":0.000029960327,"about_ca_topic_score_gemma":0.0000072494618,"teacher_disagreement_score":0.692569,"about_ca_system_score_codex":0.000025464276,"about_ca_system_score_gemma":0.00005128413,"threshold_uncertainty_score":0.3390248},"labels":[],"label_agreement":null},{"id":"W2170617647","doi":"10.1109/ccece.2005.1557343","title":"Phase coded nonlinear asymmetric chirp modulation","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Chirp; Modulation (music); Continuous phase modulation; Electronic engineering; Coding (social sciences); Telecommunications; Algorithm; Mathematics; Physics; Engineering; Acoustics; Optics; Statistics","score_opus":0.011936654878130719,"score_gpt":0.25106864555927993,"score_spread":0.2391319906811492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170617647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08549298,0.000031258354,0.88484496,0.00018657166,0.0001431301,0.000061405335,0.000001155656,0.00028098063,0.028957577],"genre_scores_gemma":[0.9101402,0.0000012451175,0.08923515,0.0001353667,0.00009544424,0.0000028348963,0.00000590417,0.0000034776358,0.00038033986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993554,0.00003022308,0.0001275497,0.00020172125,0.00014151844,0.00014361378],"domain_scores_gemma":[0.99953574,0.000046775764,0.000036920883,0.0003107299,0.00003553229,0.000034326386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017870055,0.00007340975,0.00007100748,0.00022713712,0.00009301433,0.00009596291,0.0003275194,0.000029734712,0.000025157093],"category_scores_gemma":[0.0000100772495,0.00006450683,0.00006202286,0.0010442208,0.00001721614,0.00026798947,0.00005900512,0.00004896497,0.00006287744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069600424,0.00038239785,0.00021683653,0.0000021270077,0.000004482969,0.0000031045138,0.000022416303,0.00021418967,0.0012269265,0.8625376,0.00080535194,0.13457759],"study_design_scores_gemma":[0.0016521617,0.00021170649,0.0033612452,0.0000053284393,0.000005396703,0.000007906448,0.0000038449166,0.80280805,0.010167405,0.17202376,0.009504755,0.00024842774],"about_ca_topic_score_codex":0.000025718055,"about_ca_topic_score_gemma":0.0000049312025,"teacher_disagreement_score":0.82464725,"about_ca_system_score_codex":0.000007785752,"about_ca_system_score_gemma":0.000010078891,"threshold_uncertainty_score":0.2630512},"labels":[],"label_agreement":null},{"id":"W2171404777","doi":"10.1109/isit.2006.261604","title":"Crosscorrelation of q-ary Power Residue Sequences of Period p","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Period (music); Discrete mathematics; Residue (chemistry); Physics; Mathematical analysis; Biology","score_opus":0.005439197043131822,"score_gpt":0.20807768464164716,"score_spread":0.20263848759851535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171404777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7438826,0.00015866614,0.22037116,0.00020799975,0.00012361258,0.00004309926,0.0000012198935,0.000057060723,0.035154577],"genre_scores_gemma":[0.9862993,0.0000010410662,0.013454225,0.000030425292,0.000008279125,9.3025335e-7,5.3950225e-7,0.0000015361607,0.00020374007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948955,0.00003157494,0.00016626676,0.00011440438,0.00012323754,0.000074963165],"domain_scores_gemma":[0.99958163,0.000046771518,0.00007655464,0.00022692308,0.000052580086,0.00001555893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018287657,0.00004614352,0.00007866642,0.00007420244,0.00003691647,0.000019440537,0.0002752335,0.000028058119,0.00009825421],"category_scores_gemma":[0.000009977969,0.000038549915,0.000056714136,0.00026755955,0.000090572896,0.00022132258,0.000051135157,0.000031263622,0.0000041984395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008053833,0.000042135085,0.013433711,0.000007866341,0.0000034982515,0.0000015293116,0.0003483725,0.00018434928,0.02006308,0.9644919,0.000395701,0.001019803],"study_design_scores_gemma":[0.00046696208,0.0004500312,0.19835773,0.000074317155,0.000010716227,0.000020530895,0.00016543578,0.0032734356,0.28828073,0.50730765,0.0012690532,0.00032340447],"about_ca_topic_score_codex":0.00010062692,"about_ca_topic_score_gemma":0.000012572911,"teacher_disagreement_score":0.45718426,"about_ca_system_score_codex":0.0000030229112,"about_ca_system_score_gemma":0.000030413325,"threshold_uncertainty_score":0.15720199},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005717826797967586,"score_gpt":0.1764861520601498,"score_spread":0.17076832526218222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171816248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55368483,0.000029317505,0.39089203,0.0005243654,0.00016501744,0.00013707957,0.0000023522837,0.00046432044,0.05410069],"genre_scores_gemma":[0.9801317,0.000004141923,0.013149007,0.00025779905,0.00010282952,0.000037445796,0.0000027341284,0.000011255936,0.006303101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937713,0.00002517151,0.000098320415,0.0001949695,0.00014084474,0.00016355672],"domain_scores_gemma":[0.9994422,0.000032524757,0.000027213104,0.00043050616,0.000017279765,0.000050279108],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000120558754,0.00009040272,0.00008995466,0.00005782728,0.00013051688,0.00011638974,0.00033818124,0.000024262155,0.0018125571],"category_scores_gemma":[0.0000020828506,0.00006713941,0.000054879627,0.0002576283,0.000033831893,0.0003068701,0.00003159292,0.00006758654,0.0009332761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008256294,0.0005184478,0.00035978018,0.000043994776,0.000094217176,0.0000638644,0.0043207733,0.000030297928,0.0015083943,0.7332458,0.0051792143,0.25455266],"study_design_scores_gemma":[0.00354297,0.0011483176,0.020744044,0.00042011368,0.00013075637,0.00089625985,0.00032077124,0.011846632,0.007593759,0.35722074,0.59364104,0.0024945992],"about_ca_topic_score_codex":0.000001898463,"about_ca_topic_score_gemma":0.0000014842375,"teacher_disagreement_score":0.5884618,"about_ca_system_score_codex":0.0000049289133,"about_ca_system_score_gemma":0.000009781067,"threshold_uncertainty_score":0.9998446},"labels":[],"label_agreement":null},{"id":"W2172054125","doi":"10.1016/j.ffa.2012.09.003","title":"MDS and self-dual codes over rings","year":2012,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Dual (grammatical number); Ideal (ethics); Principal ideal; Principal (computer security); Chain (unit); Mathematics; Ring (chemistry); Series (stratigraphy); Power (physics); Pure mathematics; Discrete mathematics; Algebra over a field; Computer science; Combinatorics; Physics; Law; Chemistry; Prime (order theory)","score_opus":0.013861690699695112,"score_gpt":0.23410461596485257,"score_spread":0.22024292526515746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172054125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029831128,0.002029268,0.9598468,0.0007113634,0.00016458704,0.0004216426,0.00008003508,0.00035446964,0.0065607065],"genre_scores_gemma":[0.99049646,0.0005151848,0.008071296,0.00034093304,0.00019233576,0.00028488188,0.000020877342,0.000009780569,0.00006823084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991371,0.00003622335,0.00015925575,0.00040331236,0.00006915797,0.00019493054],"domain_scores_gemma":[0.9988354,0.0002793644,0.000091699774,0.0006476946,0.000034054447,0.000111800866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022073228,0.00019635857,0.00018521557,0.00009425982,0.00022552948,0.00021230555,0.00038327157,0.00022952323,0.000020274585],"category_scores_gemma":[0.000005149286,0.00016781632,0.00007094434,0.00014179948,0.00006547198,0.000109195964,0.0010561683,0.0003773717,0.0000077129125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029120015,0.00012604904,0.00081945164,0.00010108381,0.00008209513,4.3481467e-7,0.003439461,0.000009042956,0.000038409686,0.95447063,0.0003324133,0.040577997],"study_design_scores_gemma":[0.00025588777,0.00005838595,0.007318944,0.000076362565,0.00005936717,0.000019248928,0.00007284228,0.008156847,0.00026781918,0.8079646,0.17507827,0.0006713767],"about_ca_topic_score_codex":0.000019090925,"about_ca_topic_score_gemma":0.0000055530286,"teacher_disagreement_score":0.96066535,"about_ca_system_score_codex":0.000005196562,"about_ca_system_score_gemma":0.00002211026,"threshold_uncertainty_score":0.6843351},"labels":[],"label_agreement":null},{"id":"W2173617107","doi":"","title":"Computing in Algebraic Closures of Finite Fields","year":2015,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Finite field; Mathematics; Extension (predicate logic); Construct (python library); Algebra over a field; Prime (order theory); Computation; Algebraic closure; Polynomial; Field (mathematics); Linear algebra; Algebraic number; Closure (psychology); Degree (music); Discrete mathematics; Computer science; Algorithm; Pure mathematics; Combinatorics","score_opus":0.10972654161549157,"score_gpt":0.30848342311086757,"score_spread":0.19875688149537601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173617107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9408164,0.00008449795,0.057927236,0.00014243106,0.00025877598,0.00010872873,0.0000025350146,0.00013136423,0.00052800373],"genre_scores_gemma":[0.998979,0.0000071770196,0.000529602,0.00019596731,0.000033967204,2.1845445e-7,0.0000023079524,0.000010559947,0.00024124143],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99825627,0.00035795674,0.0002699299,0.0004339505,0.0003240237,0.00035785732],"domain_scores_gemma":[0.99863,0.00024978205,0.00017261755,0.00062287133,0.0001287188,0.00019602208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079769007,0.00019732672,0.00028607444,0.0007232353,0.00007900832,0.00013611159,0.0015801713,0.00015013477,0.000003798437],"category_scores_gemma":[0.000077075296,0.00022531912,0.00012417934,0.0011936667,0.00009652807,0.0013022308,0.00069781544,0.00040174712,0.000032666117],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004719255,0.000084916246,0.987813,0.000023670453,0.00002097039,0.00015103296,0.001550292,0.00037918566,0.00007035252,0.008180231,8.343227e-7,0.0016783332],"study_design_scores_gemma":[0.0018296982,0.00035893652,0.9825197,0.00026484282,0.00002221084,0.000023891638,0.00030741162,0.000051654642,0.0023028732,0.0110017,0.00082042866,0.0004966936],"about_ca_topic_score_codex":0.000005875149,"about_ca_topic_score_gemma":0.0004255599,"teacher_disagreement_score":0.058162533,"about_ca_system_score_codex":0.00005769616,"about_ca_system_score_gemma":0.00010299262,"threshold_uncertainty_score":0.9188247},"labels":[],"label_agreement":null},{"id":"W2181210596","doi":"10.1016/j.disc.2015.10.040","title":"Constructing new covering arrays from LFSR sequences over finite fields","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Linear feedback shift register; Mathematics; Finite field; Combinatorics; Discrete mathematics; Arithmetic; Shift register; Computer science; Telecommunications","score_opus":0.03939350846225521,"score_gpt":0.26092098253967705,"score_spread":0.22152747407742185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181210596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06690722,0.00006669201,0.91646725,0.0003156321,0.00041787088,0.00007434538,0.000008214943,0.00019207559,0.015550703],"genre_scores_gemma":[0.6630592,0.000006299381,0.33633742,0.00025485814,0.00016535535,0.000003861888,0.000005366379,0.000012212993,0.0001554627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893713,0.00003829366,0.00025550055,0.00025304477,0.00028270003,0.00023334094],"domain_scores_gemma":[0.9987083,0.00041397338,0.00014130949,0.00052437175,0.000035967518,0.00017606038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002776407,0.0001581532,0.00020744318,0.000062405124,0.00008174469,0.00028495924,0.0006936497,0.00006951744,0.000057774265],"category_scores_gemma":[0.00021894851,0.00013825753,0.00009482135,0.0002641094,0.00006442255,0.00040464746,0.00024026998,0.00014669941,0.000045060668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064332653,0.000024229714,0.001419995,0.00003291251,0.000059625454,0.0000218688,0.013053097,0.00047933063,0.00015961753,0.9744179,0.0012688529,0.00905613],"study_design_scores_gemma":[0.00032933473,0.00005283481,0.00002682243,0.00012906491,0.000018814291,0.000012129262,0.0016346255,0.075705774,0.0016072972,0.9190781,0.0011097513,0.00029547198],"about_ca_topic_score_codex":0.00008002956,"about_ca_topic_score_gemma":0.00002249679,"teacher_disagreement_score":0.59615195,"about_ca_system_score_codex":0.000022894827,"about_ca_system_score_gemma":0.000078355224,"threshold_uncertainty_score":0.56379783},"labels":[],"label_agreement":null},{"id":"W2184118886","doi":"10.4208/aamm.09-m0989","title":"On Higher Order Pyramidal Finite Elements","year":2011,"lang":"en","type":"article","venue":"Advances in Applied Mathematics and Mechanics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Piecewise; Mathematics; Ansatz; Basis function; Convergence (economics); Quadratic equation; Polynomial; Basis (linear algebra); Finite element method; Order (exchange); Space (punctuation); Quadratic function; Element (criminal law); Mathematical analysis; Pure mathematics; Geometry; Physics; Mathematical physics; Computer science","score_opus":0.017533442501791945,"score_gpt":0.23635642702847687,"score_spread":0.21882298452668492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184118886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026733237,0.00016467799,0.94700557,0.000020067946,0.00025528186,0.00019270822,0.0000014230318,0.00009045907,0.04959648],"genre_scores_gemma":[0.48112562,0.00027100157,0.5181474,0.00033620995,0.000013649917,0.00004939335,7.9772093e-7,0.000013243326,0.000042638505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919134,0.00000641706,0.00020897032,0.00024635554,0.00014089834,0.00020602193],"domain_scores_gemma":[0.9994069,0.00010861282,0.000088146386,0.00033250204,0.000015261836,0.00004858626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026187883,0.00013373223,0.00014747404,0.00009560707,0.000057176316,0.000029361547,0.00034941308,0.000045258326,0.000039898812],"category_scores_gemma":[0.000013273151,0.00011590728,0.000022230262,0.0002874136,0.000020696913,0.0001239968,0.00014684716,0.00010494545,0.000017904673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008176932,0.0001248434,0.000001998804,0.000030350939,0.0000047277767,0.000002508203,0.000503744,0.000016073567,0.00016544825,0.9661875,0.000004710946,0.032949943],"study_design_scores_gemma":[0.0002913571,0.00007697766,0.0000026908986,0.00003062917,0.000004100977,9.923175e-7,0.000051947816,0.012521668,0.0012679895,0.9829474,0.0026544072,0.00014983542],"about_ca_topic_score_codex":3.0712036e-7,"about_ca_topic_score_gemma":0.0000023827902,"teacher_disagreement_score":0.47845232,"about_ca_system_score_codex":0.0000077936165,"about_ca_system_score_gemma":0.0000070456654,"threshold_uncertainty_score":0.47265616},"labels":[],"label_agreement":null},{"id":"W2185417891","doi":"10.1109/itict.2006.358286","title":"A High-Speed, Fully-Pipelined VLSI Architecture for Real-Time AES","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Field-programmable gate array; Architecture; Throughput; Encryption; Computer hardware; Embedded system; Computer architecture; Parallel computing; Arithmetic; Computer network; Operating system","score_opus":0.005962963814217241,"score_gpt":0.20799913870486728,"score_spread":0.20203617489065004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185417891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045023944,0.000029024692,0.93256944,0.0025839487,0.00024617312,0.00027242527,0.000010488988,0.0007621448,0.01850238],"genre_scores_gemma":[0.55242574,0.0000057180346,0.44026378,0.00061012857,0.0005923986,0.000036747297,0.000018502113,0.000025189222,0.0060217837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890494,0.000047413563,0.00019915422,0.00037455774,0.00015509946,0.00031881573],"domain_scores_gemma":[0.9990385,0.00026515577,0.00005590622,0.0005123593,0.000065269094,0.00006279166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027995394,0.0001581514,0.00017462793,0.00014723103,0.00015003105,0.0001461733,0.0007082352,0.00006393635,0.00010057036],"category_scores_gemma":[0.000022388442,0.00012665134,0.00016675335,0.0003764275,0.000047711474,0.00013940812,0.00012229949,0.00007231535,0.00007184697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052676485,0.000079544196,0.000033577562,0.000012327672,0.000013817527,0.0000045140855,0.00008351248,0.00044542193,0.016201776,0.9361889,0.020373682,0.026510252],"study_design_scores_gemma":[0.001049533,0.0002966346,0.0006979331,0.000026093136,0.000023900036,0.000026465841,0.000012062061,0.015217728,0.02783137,0.9111622,0.043083854,0.00057221344],"about_ca_topic_score_codex":0.000117027455,"about_ca_topic_score_gemma":0.000038849586,"teacher_disagreement_score":0.5074018,"about_ca_system_score_codex":0.000009572158,"about_ca_system_score_gemma":0.000024605457,"threshold_uncertainty_score":0.51646924},"labels":[],"label_agreement":null},{"id":"W2187726805","doi":"10.1007/s11432-013-4900-z","title":"On the Walsh spectrum of a family of quadratic APN functions with five terms","year":2013,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Bracken; Quadratic equation; Mathematics; Combinatorics; Polynomial; Spectrum (functional analysis); Quadratic function; Type (biology); Function (biology); Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.010447461242570639,"score_gpt":0.21776792569238676,"score_spread":0.2073204644498161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187726805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80351514,0.0000047872763,0.14753953,0.0014991835,0.00021191542,0.0002945082,0.0000025339311,0.000044460463,0.04688795],"genre_scores_gemma":[0.99737453,0.0000017802772,0.0022709828,0.00030417801,0.0000054763323,0.000019518973,2.4711758e-7,8.964866e-7,0.000022411412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982051,0.00004272837,0.00032591028,0.000186558,0.0009813702,0.00025831125],"domain_scores_gemma":[0.99876356,0.00020610799,0.0003400045,0.00046840392,0.00015874293,0.00006318667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001814892,0.000102602346,0.00011917092,0.00050909875,0.0007128951,0.00041167176,0.0020072348,0.000017414439,0.000043798627],"category_scores_gemma":[0.00017058894,0.00005235129,0.00004950655,0.004192958,0.0023918173,0.0053849663,0.00015314002,0.00008808768,0.00006315242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052790965,0.000036022244,0.0007035922,0.000009863181,0.0000039503147,6.598619e-8,0.0067862333,0.0016478607,0.0012121643,0.9762617,0.00022189031,0.013111424],"study_design_scores_gemma":[0.00050030166,0.0031800014,0.25174809,0.00025069274,0.000012080815,0.000023849516,0.009991175,0.20977566,0.025391905,0.49829388,0.00028060935,0.00055174815],"about_ca_topic_score_codex":0.000117327094,"about_ca_topic_score_gemma":0.0000050929,"teacher_disagreement_score":0.47796777,"about_ca_system_score_codex":0.000015124853,"about_ca_system_score_gemma":0.0002323177,"threshold_uncertainty_score":0.88127506},"labels":[],"label_agreement":null},{"id":"W2189617332","doi":"10.1080/09728600.2005.12088791","title":"Extremal Self-Dual Codes over Z6, Z8 and Z10","year":2005,"lang":"en","type":"article","venue":"AKCE International Journal of Graphs and Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Unimodular matrix; Combinatorics; Circulant matrix; Euclidean geometry; Dual (grammatical number); Construct (python library); Euclidean distance; Discrete mathematics; Computer science; Geometry","score_opus":0.006310433316867672,"score_gpt":0.23179990769262696,"score_spread":0.22548947437575928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189617332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9855039,0.0013408302,0.009701179,0.0014254613,0.0010616083,0.000035561898,0.0000024089627,0.00004278428,0.0008862528],"genre_scores_gemma":[0.99492264,0.0008469209,0.0037493373,0.0003382069,0.00010036874,8.126123e-7,3.9936643e-7,0.0000054892807,0.000035802845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989291,0.000049511582,0.00029190845,0.00015356486,0.00043873148,0.00013719435],"domain_scores_gemma":[0.99911404,0.00015400887,0.00021595678,0.00011559829,0.00027905224,0.00012133746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042746845,0.00012011986,0.00015397067,0.0002923962,0.00009346063,0.00024768803,0.00050213566,0.000051129744,0.000011000853],"category_scores_gemma":[0.000025637763,0.000104360464,0.000100199475,0.00020773672,0.00006337447,0.0006863123,0.00017542053,0.00019978311,0.0000012295313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031833475,0.00018157854,0.01295965,0.0000039149268,0.00012020184,0.00005434077,0.00046890293,0.0000038532276,0.0001850758,0.9647627,0.0005997789,0.020628178],"study_design_scores_gemma":[0.002354744,0.00070739514,0.036734812,0.00008898012,0.00005592178,0.0014356362,0.00011120737,0.0036274192,0.0008411092,0.9194807,0.034178365,0.0003837484],"about_ca_topic_score_codex":0.0000030291205,"about_ca_topic_score_gemma":0.0000019776464,"teacher_disagreement_score":0.04528203,"about_ca_system_score_codex":0.00002311025,"about_ca_system_score_gemma":0.000033082633,"threshold_uncertainty_score":0.42556962},"labels":[],"label_agreement":null},{"id":"W2202618705","doi":"10.1109/tit.2015.2401567","title":"New Constructions of Codes for Asymmetric Channels via Concatenation","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Concatenation (mathematics); Linear code; Block code; Ternary operation; Reed–Muller code; Expander code; Construct (python library); Binary number","score_opus":0.018501015907497177,"score_gpt":0.23904405395493267,"score_spread":0.2205430380474355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202618705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068716827,0.000014243866,0.99510455,0.00013986047,0.0015028217,0.00029821563,0.000027303642,0.00017433798,0.002051527],"genre_scores_gemma":[0.9754482,0.000005190491,0.024172375,0.0001757691,0.000028998671,0.000050745835,0.00000648306,0.0000048011334,0.00010746763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991061,0.00007537944,0.00035725563,0.00010556954,0.00021189461,0.00014376757],"domain_scores_gemma":[0.9988221,0.0002945627,0.00015893271,0.00027506473,0.0003278823,0.00012147386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071125175,0.00011113882,0.00013774817,0.00073877804,0.000153146,0.00007557206,0.00031352733,0.00007352575,0.000020678413],"category_scores_gemma":[0.000031237025,0.00010795201,0.00012525,0.00089277845,0.00006687068,0.0017196327,0.0000019803247,0.00009273617,0.000036229943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010730127,0.00003916603,9.920683e-7,0.000017599534,0.000044078693,4.956456e-8,0.0020088593,0.01871314,0.0000615041,0.5654219,0.0003660968,0.4132193],"study_design_scores_gemma":[0.0034067621,0.000958515,0.000023103454,0.000053026542,0.00008388185,0.000048662005,0.0013210317,0.11582833,0.13478553,0.73629034,0.00671837,0.00048246334],"about_ca_topic_score_codex":0.0000097539005,"about_ca_topic_score_gemma":0.0000012925428,"teacher_disagreement_score":0.974761,"about_ca_system_score_codex":0.000040928517,"about_ca_system_score_gemma":0.00013088324,"threshold_uncertainty_score":0.44021553},"labels":[],"label_agreement":null},{"id":"W2205827828","doi":"","title":"Near ML Performance for Linear Block Codes Using an Iterative Vector SISO Decoder","year":2006,"lang":"en","type":"article","venue":"Turbo Codes&Related Topics; 6th International ITG-Conference on Source and Channel Coding (TURBOCODING), 2006 4th International Symposium on","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Code word; Decoding methods; Algorithm; Parity-check matrix; BCH code; Mathematics; Binary number; Block code; Computer science; Arithmetic","score_opus":0.029415761844090386,"score_gpt":0.27146625306088795,"score_spread":0.24205049121679756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205827828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8724946,0.00011291963,0.10036342,0.006114384,0.0038265802,0.0009764467,0.00025364602,0.00059258525,0.015265431],"genre_scores_gemma":[0.991387,0.00011611683,0.003415355,0.00086619833,0.0011160894,0.00009293685,0.00021214446,0.00006143372,0.002732733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608237,0.00015653523,0.00090417586,0.0012717933,0.00088766176,0.00069749804],"domain_scores_gemma":[0.99763805,0.00029803906,0.00053764816,0.00053473597,0.0007591421,0.00023240075],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006352699,0.0006842677,0.00051842554,0.000496035,0.00081375823,0.0011257874,0.0015550201,0.0003550412,0.00010903885],"category_scores_gemma":[0.000073990544,0.00066374533,0.00027147352,0.00035833186,0.00022599907,0.0010645383,0.00027733427,0.0006457322,0.0000346269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00134056,0.0019631118,0.004624399,0.00014332622,0.0009944923,0.0000646278,0.006342507,0.21115719,0.013400443,0.7467379,0.00111354,0.012117885],"study_design_scores_gemma":[0.0018153156,0.0007859252,0.00075139327,0.00052851794,0.000058952617,0.00008373719,0.00011689762,0.9620506,0.014059133,0.010522455,0.008265616,0.00096144504],"about_ca_topic_score_codex":0.00011851277,"about_ca_topic_score_gemma":0.00002607672,"teacher_disagreement_score":0.7508934,"about_ca_system_score_codex":0.00027327205,"about_ca_system_score_gemma":0.00009871852,"threshold_uncertainty_score":0.9999111},"labels":[],"label_agreement":null},{"id":"W2219863946","doi":"10.1142/s0129054118500089","title":"On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hash function; Universal hashing; Hash chain; Cryptography; Perfect hash function; Integer (computer science); Secrecy; Information-theoretic security; Double hashing","score_opus":0.01575639365929202,"score_gpt":0.28787025731881577,"score_spread":0.2721138636595237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219863946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24372004,0.0000041806597,0.7548873,0.0005842855,0.00042178656,0.00007795403,0.0000019491808,0.000017010203,0.000285499],"genre_scores_gemma":[0.8416671,0.0000026120188,0.15787135,0.00028751258,0.0001590549,0.0000028218196,0.0000011661919,0.0000027754995,0.000005576672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987175,0.000039560273,0.0002561383,0.00023775705,0.00063871127,0.00011034103],"domain_scores_gemma":[0.9973842,0.00010956558,0.000263661,0.00029533374,0.0018171159,0.00013016148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063910877,0.00008332357,0.00009685984,0.00074654876,0.00023672725,0.00034545665,0.0014189093,0.000018070898,0.0000074513964],"category_scores_gemma":[0.00002710905,0.00007139496,0.00003288524,0.0007814733,0.00045572873,0.0015619107,0.00015464352,0.0000737531,0.000007910105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009851004,0.00017552072,0.0003199228,0.0000017459037,0.000038896695,0.0000013463844,0.0010837899,0.00048133577,0.0067205587,0.835677,0.000049063423,0.1553523],"study_design_scores_gemma":[0.0028713336,0.015429035,0.19385743,0.00051991985,0.00010650714,0.0005434119,0.0004890897,0.19575809,0.012762938,0.5634133,0.013336621,0.0009123241],"about_ca_topic_score_codex":0.000005641158,"about_ca_topic_score_gemma":0.0000058916635,"teacher_disagreement_score":0.59794706,"about_ca_system_score_codex":0.000048585287,"about_ca_system_score_gemma":0.00020684094,"threshold_uncertainty_score":0.33312464},"labels":[],"label_agreement":null},{"id":"W2237691421","doi":"","title":"Efficient Architecture and Implementation for NTRU Based Systems","year":2015,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"University of Windsor","keywords":"NTRU; Homomorphic encryption; Computer science; Cryptosystem; Adder; Systolic array; Modular design; Encryption; Parallel computing; Arithmetic; Theoretical computer science; Computer engineering; Algorithm; Latency (audio); Embedded system; Cryptography; Mathematics; Very-large-scale integration; Computer network","score_opus":0.02352955738986186,"score_gpt":0.2387419038935747,"score_spread":0.21521234650371282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237691421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77147144,0.00013542213,0.22691159,0.00061477406,0.00018964367,0.0003502737,0.000030038042,0.00008032204,0.00021650283],"genre_scores_gemma":[0.98646444,9.565654e-7,0.013312401,0.000076404045,0.000026470205,0.0000013972102,0.00001221449,0.000007764356,0.00009793296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99875957,0.00016810196,0.00012423543,0.00037612102,0.0003087969,0.00026319057],"domain_scores_gemma":[0.99893934,0.00014537276,0.00014639301,0.0003818573,0.00017053912,0.00021648196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010289714,0.00013941825,0.00019164385,0.00028262485,0.00033077403,0.00007909258,0.0006040872,0.000088459856,0.000010913342],"category_scores_gemma":[0.000036567828,0.00015966925,0.00011144567,0.000389651,0.00010489057,0.00022525412,0.00022053851,0.00013021946,0.0000069948323],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004031617,0.0011241335,0.23191103,0.0014750429,0.0007509234,0.00013314467,0.05335875,0.03863756,0.04215466,0.5165717,0.0041735168,0.105677895],"study_design_scores_gemma":[0.057011444,0.0073595047,0.42607176,0.0008492879,0.0009167123,0.00026573686,0.03419938,0.25200963,0.02185507,0.08772124,0.106302895,0.005437339],"about_ca_topic_score_codex":0.0000318229,"about_ca_topic_score_gemma":0.000033920336,"teacher_disagreement_score":0.42885047,"about_ca_system_score_codex":0.00005755249,"about_ca_system_score_gemma":0.00008920605,"threshold_uncertainty_score":0.6511123},"labels":[],"label_agreement":null},{"id":"W2237821232","doi":"10.2140/pjm.2015.279.155","title":"Essential dimension and error-correcting codes","year":2015,"lang":"en","type":"article","venue":"Pacific Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Dimension (graph theory); Pure mathematics","score_opus":0.029056162931955294,"score_gpt":0.2606997635452739,"score_spread":0.23164360061331862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237821232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37896684,0.0002472435,0.6185716,0.00022263848,0.00054641475,0.000030644514,2.2981911e-7,0.000024409956,0.0013899788],"genre_scores_gemma":[0.901274,0.000016331674,0.09859993,0.000012683268,0.00006518427,2.4578668e-7,5.4695427e-8,0.0000046325044,0.000026914078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991931,0.00005983205,0.00029140283,0.000078762896,0.0002594668,0.00011743611],"domain_scores_gemma":[0.9990703,0.00019136506,0.0002943418,0.00016697391,0.00015492475,0.0001220972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013867973,0.00007935376,0.00017657856,0.00011720441,0.00006432046,0.00010815309,0.00025842624,0.0000295153,0.0000028784928],"category_scores_gemma":[0.0001812067,0.000060613478,0.00005980036,0.00016657593,0.0000428314,0.00025958588,0.00009217563,0.00013195019,0.000005016318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013626151,0.0015203455,0.006951722,0.00044494314,0.0004067033,0.00041002987,0.17177261,0.000701111,0.011673528,0.6832034,0.011137079,0.111642264],"study_design_scores_gemma":[0.0016368319,0.0008675046,0.00012745445,0.0006597488,0.00011706143,0.0063129812,0.031104647,0.05952308,0.012831951,0.88454217,0.0017319696,0.00054461387],"about_ca_topic_score_codex":4.9640875e-7,"about_ca_topic_score_gemma":3.0587142e-7,"teacher_disagreement_score":0.52230716,"about_ca_system_score_codex":0.000010360763,"about_ca_system_score_gemma":0.000034339668,"threshold_uncertainty_score":0.24717459},"labels":[],"label_agreement":null},{"id":"W2240587687","doi":"","title":"Some Good Cyclic and Quasi-Twisted Z 4 -Linear Codes.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.021172871303082177,"score_gpt":0.22937721576246728,"score_spread":0.2082043444593851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240587687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990464,0.0006322278,0.002451104,0.0001497003,0.0018117629,0.00014623947,0.0000020746672,0.00039970962,0.0039431932],"genre_scores_gemma":[0.9968464,0.000050738665,0.002789645,0.00021218893,0.0000123087775,0.000010245729,0.0000011457603,0.000010953063,0.00006640908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892825,0.00009906933,0.000179685,0.0003581464,0.00016094164,0.0002738902],"domain_scores_gemma":[0.9990761,0.00008987388,0.00007086454,0.00058440835,0.000040624367,0.0001381011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034323474,0.0001528654,0.00017938673,0.000110519126,0.00015600673,0.00006203171,0.0006548969,0.00007426853,0.000015866697],"category_scores_gemma":[0.000026311729,0.00014886267,0.00006780293,0.00036178489,0.00010639318,0.00044348382,0.0002623722,0.00014996492,0.000062539744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001024919,0.0001556729,0.0024797143,0.0000063910747,0.00002089184,0.000013973415,0.001137437,5.0572165e-8,0.0002139434,0.9928326,0.000122011035,0.0030070376],"study_design_scores_gemma":[0.00058192597,0.00025979063,0.007208711,0.000014484603,0.000010291666,0.000013572772,0.000021801963,0.0005905898,0.0019005373,0.98797494,0.0012134336,0.00020992637],"about_ca_topic_score_codex":0.000027288657,"about_ca_topic_score_gemma":0.0000020241448,"teacher_disagreement_score":0.0063823774,"about_ca_system_score_codex":0.000011768614,"about_ca_system_score_gemma":0.000022427168,"threshold_uncertainty_score":0.6070444},"labels":[],"label_agreement":null},{"id":"W2242376712","doi":"10.1117/12.734195","title":"On matrix-vector product based sub-quadratic arithmetic complexity schemes for field multiplication","year":2007,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trinomial; Mathematics; Polynomial basis; Matrix multiplication; Polynomial; Finite field; Multiplication (music); Polynomial matrix; Basis (linear algebra); Field (mathematics); Toeplitz matrix; Discrete mathematics; Matrix (chemical analysis); Irreducible polynomial; Field extension; Matrix polynomial; Algebra over a field; Combinatorics; Pure mathematics","score_opus":0.01629122406793056,"score_gpt":0.2520449906508605,"score_spread":0.23575376658292993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242376712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9585589,0.000048573012,0.035265833,0.0043073455,0.0002702888,0.0009238762,0.000019385885,0.00016623954,0.00043951336],"genre_scores_gemma":[0.6608029,0.00000608838,0.33853364,0.00021252765,0.00023035366,0.00014869268,0.000005236299,0.000027944472,0.000032589625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99780756,2.8857954e-8,0.000623474,0.0005350936,0.0006013551,0.00043248164],"domain_scores_gemma":[0.99728554,0.0007316571,0.0003724595,0.0001313656,0.0013575891,0.00012137889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013773812,0.00029925056,0.0003404548,0.00017504724,0.00015171857,0.00016558611,0.0014662675,0.00013574747,0.0000044381563],"category_scores_gemma":[0.0011885338,0.00025703467,0.0006525397,0.0005221238,0.00018622041,0.00046501498,0.00013725659,0.00026406744,0.0000014035071],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014246869,0.00016483733,0.00011258751,0.0003230293,0.00011219159,3.73461e-8,0.00007614249,0.000035883404,0.28223822,0.71487427,0.00078364386,0.0011367337],"study_design_scores_gemma":[0.0014650577,0.00092904904,0.0011132441,0.00031421345,0.00009450152,0.000007085931,0.00016157265,0.15109167,0.8020223,0.040030893,0.0022736406,0.00049680634],"about_ca_topic_score_codex":0.000003578844,"about_ca_topic_score_gemma":2.3156562e-7,"teacher_disagreement_score":0.6748434,"about_ca_system_score_codex":0.00010408382,"about_ca_system_score_gemma":0.000034582426,"threshold_uncertainty_score":0.9999882},"labels":[],"label_agreement":null},{"id":"W2243098549","doi":"10.1109/tcomm.2015.2502952","title":"A New Class of Rateless Codes Based on Reed–Solomon Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure; Overhead (engineering); Online codes; Block code; Notation; Computer science; Class (philosophy); Raptor code; Discrete mathematics; Luby transform code; Coding (social sciences); Fountain code; Algorithm; Mathematics; Decoding methods; Theoretical computer science; Linear code; Arithmetic; Programming language; Statistics; Artificial intelligence","score_opus":0.06090656670449825,"score_gpt":0.2920649838029278,"score_spread":0.23115841709842955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243098549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015052619,0.00007309533,0.9882811,0.0026724765,0.0002304825,0.00017200402,0.000032354135,0.00021471122,0.0068185297],"genre_scores_gemma":[0.93898994,0.000051884428,0.060474347,0.0002652221,0.00000977021,0.000041002095,0.00000534385,0.000011356489,0.00015111276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867296,0.0003716898,0.00028436966,0.00023391785,0.00025936562,0.00017766783],"domain_scores_gemma":[0.9960274,0.0006593996,0.00011288274,0.0028609105,0.00016595902,0.00017343381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044679167,0.0001470033,0.0002043343,0.0003102354,0.00029643506,0.00006875309,0.0020793178,0.00008106432,0.000019972538],"category_scores_gemma":[0.000013256137,0.00015193096,0.00014957339,0.0009030303,0.00017385086,0.0002157827,0.0000116671645,0.00031993937,0.00004098639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005886661,0.0043431823,0.00013928894,0.000050554172,0.00027160769,0.0000051687693,0.0062268614,0.10102353,0.006516206,0.5670696,0.005068266,0.3086971],"study_design_scores_gemma":[0.0053640404,0.0031194622,0.000474611,0.00060619565,0.0002276003,0.000025165478,0.0009649639,0.7158412,0.14972404,0.08852809,0.033631373,0.0014933076],"about_ca_topic_score_codex":0.00015430027,"about_ca_topic_score_gemma":0.00035934997,"teacher_disagreement_score":0.9374847,"about_ca_system_score_codex":0.00004743831,"about_ca_system_score_gemma":0.00022712312,"threshold_uncertainty_score":0.6195565},"labels":[],"label_agreement":null},{"id":"W2253579863","doi":"10.1145/2930889.2930928","title":"Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interpolation (computer graphics); Computation; Univariate; Bilinear interpolation; Degree (music); Polynomial; Logarithm; Exponent; Notation; Nearest-neighbor interpolation","score_opus":0.01655662104108781,"score_gpt":0.25371881437530563,"score_spread":0.2371621933342178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253579863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21849169,0.0000077097775,0.77939594,0.00035316963,0.00007786123,0.000098905344,0.0000025955594,0.00003869036,0.0015334325],"genre_scores_gemma":[0.9439008,8.9635614e-7,0.055953186,0.00009767176,0.000014835681,0.000008939955,0.0000012199353,0.0000026660389,0.000019740199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947757,0.00002336222,0.00017718703,0.00014553411,0.00007111983,0.000105226856],"domain_scores_gemma":[0.99954706,0.0002274485,0.000059069855,0.00011055271,0.000033816854,0.00002206841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000204759,0.0000567661,0.00008186844,0.00016619837,0.0000215076,0.000016799151,0.00019212755,0.000024628687,0.000011516103],"category_scores_gemma":[0.000022551283,0.00003960511,0.0000568571,0.00018550364,0.000025641091,0.00044430318,0.000047317066,0.000018258437,0.000002425326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088682136,0.00008671708,0.005438315,0.000023209433,0.00000715761,5.500151e-7,0.0006893719,0.000005134154,0.0061034304,0.77091604,0.00017743206,0.21646394],"study_design_scores_gemma":[0.0019222731,0.0008084702,0.06226113,0.00028636228,0.0000068531526,0.0000034939508,0.0001615865,0.10944958,0.02160051,0.8028434,0.00034209722,0.00031422806],"about_ca_topic_score_codex":0.000007036028,"about_ca_topic_score_gemma":0.000026372665,"teacher_disagreement_score":0.72540915,"about_ca_system_score_codex":0.000008569722,"about_ca_system_score_gemma":0.000016310427,"threshold_uncertainty_score":0.16150497},"labels":[],"label_agreement":null},{"id":"W2256656669","doi":"10.1109/9780470546345.ch11","title":"Matching Viterbi Decoders and Reed-Solomon Decoders in a Concatenated System","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Viterbi decoder; Viterbi algorithm; Computer science; Soft output Viterbi algorithm; Convolutional code; Reed–Solomon error correction; Iterative Viterbi decoding; Matching (statistics); Concatenated error correction code; Speech recognition; Decoding methods; Algorithm; Mathematics; Sequential decoding; Statistics; Block code","score_opus":0.010024451949206327,"score_gpt":0.20342753340788897,"score_spread":0.19340308145868265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256656669","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017626762,0.0009888571,0.10771379,0.0003944606,0.000552083,0.00053470634,0.0000056817826,0.00096233055,0.88708544],"genre_scores_gemma":[0.86898786,0.00033618262,0.023253396,0.0019792153,0.00011099563,0.000024406527,0.00002185283,0.00011106774,0.10517505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806154,0.000058325804,0.0004756791,0.0007826567,0.00024436408,0.0003774291],"domain_scores_gemma":[0.9988508,0.00015289814,0.00019863987,0.0006060107,0.0000442367,0.0001474008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005245418,0.00042654344,0.0005157848,0.0005964186,0.00011824463,0.00026596634,0.0007622275,0.00035658057,0.000023537526],"category_scores_gemma":[0.000004501594,0.0004006543,0.00015060283,0.00013100263,0.00009031924,0.00031753394,0.00024457462,0.00042986174,0.000034886918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023075025,0.000009548492,0.000017943432,0.00007624599,0.000040473977,0.00015325574,0.0007204312,0.000019327987,0.00004817632,0.97078776,0.00016289108,0.027940841],"study_design_scores_gemma":[0.0021403441,0.00042789496,0.00015113622,0.0032332966,0.000099483346,0.00056122686,0.0005441178,0.015864847,0.0001886964,0.95462996,0.01953723,0.002621776],"about_ca_topic_score_codex":0.00006933734,"about_ca_topic_score_gemma":0.0002820623,"teacher_disagreement_score":0.86722517,"about_ca_system_score_codex":0.00008996281,"about_ca_system_score_gemma":0.000040968804,"threshold_uncertainty_score":0.99984455},"labels":[],"label_agreement":null},{"id":"W2262701818","doi":"10.26421/qic14.9-10-6","title":"Polynomial time quantum algorithms for certain bivariate hidden polynomial problems","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bivariate analysis; Mathematics; Diagonal; Polynomial; Oracle; Time complexity; Quantum algorithm; Quantum computer; Quantum; Quadratic equation; Discrete mathematics; Algorithm; Combinatorics; Computer science","score_opus":0.014882703486504776,"score_gpt":0.24132494968426194,"score_spread":0.22644224619775716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262701818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039115045,0.000019018355,0.95796984,0.0009319375,0.0005367387,0.00042640974,0.000010695042,0.00029988767,0.00069043617],"genre_scores_gemma":[0.9795131,0.0000057286798,0.019434553,0.0006623511,0.00017337938,0.000053309315,0.00011668904,0.000009867545,0.000031030493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872905,0.00010160247,0.00047606629,0.00021458122,0.00020435514,0.0002743257],"domain_scores_gemma":[0.9990773,0.00021414358,0.00027106106,0.00019318768,0.00013514738,0.00010916828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007646381,0.00018106554,0.00019437111,0.00030425313,0.0003439179,0.00050323573,0.00030728008,0.0000942704,0.0000067210053],"category_scores_gemma":[0.000054465687,0.00017487686,0.0000893681,0.0003090511,0.000047305573,0.0018224417,0.00009054082,0.00009432618,0.00008926183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015861928,0.00006467151,0.000050042432,0.000114969676,0.00004166871,2.3176595e-7,0.004174295,0.002065145,0.00032501755,0.30696145,0.011068096,0.67497575],"study_design_scores_gemma":[0.0010857161,0.00044009168,0.0005853327,0.000020768022,0.00000987008,0.000009624433,0.000056125205,0.9509624,0.00008116968,0.024815034,0.021690972,0.00024286205],"about_ca_topic_score_codex":0.0000269261,"about_ca_topic_score_gemma":0.0000012440995,"teacher_disagreement_score":0.9488973,"about_ca_system_score_codex":0.000024821995,"about_ca_system_score_gemma":0.000048547743,"threshold_uncertainty_score":0.7131271},"labels":[],"label_agreement":null},{"id":"W2275630553","doi":"10.1016/j.ffa.2014.04.002","title":"Roots and coefficients of polynomials over finite fields","year":2014,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Finite field; Polynomial; Field (mathematics); Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.00916860328750755,"score_gpt":0.22305209950568508,"score_spread":0.21388349621817754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275630553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044879206,0.00016090696,0.9505426,0.00041316586,0.000048412243,0.00013944582,0.000015651898,0.000043853,0.003756727],"genre_scores_gemma":[0.9980145,0.000045633362,0.0013392905,0.00043235355,0.00004402987,0.000039498114,0.000003995369,0.0000040121895,0.00007667072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993988,0.000037349106,0.00015949263,0.00022420881,0.000056611112,0.00012350094],"domain_scores_gemma":[0.99881583,0.00061641616,0.000070044734,0.00040304515,0.00003134322,0.00006332887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002024686,0.00009514295,0.00013517696,0.000082185274,0.00014160112,0.00005377557,0.00027091635,0.00008632258,0.000019321966],"category_scores_gemma":[0.000027722781,0.000078905316,0.000044576973,0.00022203001,0.00006876804,0.00007624869,0.00015542636,0.00009264883,0.0000038167395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010466598,0.000101824415,0.0015668846,0.000037722457,0.000027474776,1.5686247e-7,0.001191556,0.000100844874,0.00043714631,0.8083384,0.00033481294,0.1878527],"study_design_scores_gemma":[0.0015341537,0.0006717708,0.02597272,0.00011767043,0.000044622288,0.000010937722,0.00014641618,0.09757826,0.0053062197,0.62109697,0.24667771,0.00084255723],"about_ca_topic_score_codex":0.0000130270955,"about_ca_topic_score_gemma":0.000007683088,"teacher_disagreement_score":0.9531353,"about_ca_system_score_codex":0.0000014191148,"about_ca_system_score_gemma":0.000008402735,"threshold_uncertainty_score":0.32176653},"labels":[],"label_agreement":null},{"id":"W2279041755","doi":"","title":"PARTIAL SPREADS AND HYPERBENT FUNCTIONS IN ODD CHARACTERISTIC","year":2011,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Bent molecular geometry; Bent function; Finite field; Monomial; Mathematics; Bijection; Dimension (graph theory); Coding theory; Pure mathematics; TRACE (psycholinguistics); Boolean function; Discrete mathematics","score_opus":0.013015796143920934,"score_gpt":0.1984063041030562,"score_spread":0.18539050795913528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279041755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9691174,0.00015289025,0.0050280867,0.000033934728,0.0013235298,0.00022847955,0.000024993382,0.00018091223,0.023909776],"genre_scores_gemma":[0.9916848,0.000112874724,0.00020417535,0.000037425292,0.000058362457,0.0000024588219,0.00015012862,0.00001566112,0.00773411],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881876,0.000096721946,0.0001642023,0.00052277814,0.0001371338,0.0002603867],"domain_scores_gemma":[0.9992309,0.000053797517,0.00012279666,0.0004139532,0.00005473209,0.0001237811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011350546,0.00023233982,0.00024136144,0.0007453652,0.00016622643,0.00007268429,0.0005930525,0.00021252366,0.000101910264],"category_scores_gemma":[0.000013342538,0.00027434042,0.00010705319,0.00075869693,0.000048844075,0.00040991325,0.00011192092,0.00031890866,0.00005000542],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011429209,0.00088892324,0.5615834,0.00037876,0.00031243393,0.001165366,0.0012870051,0.00001441095,0.00011231121,0.3437594,0.0043141604,0.08504092],"study_design_scores_gemma":[0.004805775,0.0011683296,0.22241357,0.0011577163,0.0007540843,1.7724511e-7,0.030689,0.0016303756,0.003065112,0.020232532,0.7098962,0.0041871327],"about_ca_topic_score_codex":0.00013336801,"about_ca_topic_score_gemma":0.01903989,"teacher_disagreement_score":0.705582,"about_ca_system_score_codex":0.000041765776,"about_ca_system_score_gemma":0.000072504314,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W2281656048","doi":"10.2140/jsag.2024.14.1","title":"Schur indices in GAP: wedderga 4.7+","year":2024,"lang":"en","type":"article","venue":"Journal of Software for Algebra and Geometry","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; University of St Andrews","keywords":"Quaternion; Abelian group; Implementation; Mathematics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.012250126306855331,"score_gpt":0.2540045014615915,"score_spread":0.24175437515473616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281656048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58286935,0.012760548,0.40217945,0.0009818077,0.000985801,0.000078452984,0.000004859369,0.00007196895,0.000067760804],"genre_scores_gemma":[0.9772453,0.00022099729,0.02206246,0.00021536782,0.00019245814,0.0000028330305,5.2318717e-7,0.000008489501,0.00005157392],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991543,0.000027047665,0.00029367834,0.00016136389,0.00017976337,0.00018379705],"domain_scores_gemma":[0.9991396,0.00048267157,0.000096171825,0.00011770254,0.00007516673,0.00008870403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007992545,0.00009903853,0.00018289078,0.00095265545,0.000064911066,0.0002620018,0.00038189878,0.00006468567,0.000017669385],"category_scores_gemma":[0.00017534308,0.000078628706,0.00012649581,0.0011204506,0.0000385151,0.00071571075,0.00008275053,0.00023073213,0.0000034202383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010338043,0.00016103068,0.038359128,0.0005454406,0.00022133422,0.00029854476,0.0019715354,0.000031478663,0.00031611402,0.25979084,0.006754992,0.6914462],"study_design_scores_gemma":[0.0012068703,0.0011986765,0.029803919,0.0009202916,0.000060531976,0.0006151819,0.00025820697,0.00078398164,0.0008578105,0.9125269,0.051314957,0.00045264701],"about_ca_topic_score_codex":0.0000013037403,"about_ca_topic_score_gemma":0.0000016066039,"teacher_disagreement_score":0.69099355,"about_ca_system_score_codex":0.000013279469,"about_ca_system_score_gemma":0.00007029622,"threshold_uncertainty_score":0.32063854},"labels":[],"label_agreement":null},{"id":"W2284443012","doi":"10.1007/s12095-016-0208-3","title":"Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences","year":2016,"lang":"en","type":"preprint","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Character (mathematics); Autocorrelation; Stream cipher; Cipher; Algorithm; Cryptography; Binary number; Mathematics; Sequence (biology); Computer science; Discrete mathematics; Arithmetic; Statistics; Encryption","score_opus":0.02833204586572379,"score_gpt":0.2651129283421842,"score_spread":0.2367808824764604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284443012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5468581,0.03919182,0.27214074,0.06426697,0.003840672,0.0035696912,0.00066453626,0.0012101299,0.06825739],"genre_scores_gemma":[0.98475355,0.0022354277,0.012381619,0.0003965583,0.000056018634,0.00012544294,0.000010149226,0.000014473197,0.00002678737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781847,0.0006127069,0.00050454703,0.0004967466,0.00029006583,0.0002774566],"domain_scores_gemma":[0.99280155,0.00047781432,0.0005189154,0.0058848397,0.00021786854,0.00009902632],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006195752,0.00031581544,0.00036225753,0.00033035545,0.0006833759,0.0002187799,0.006819507,0.00021992392,0.000016595757],"category_scores_gemma":[0.0000393189,0.00020965737,0.000543879,0.0007228442,0.0015046311,0.00021334752,0.005623914,0.0006303356,0.000004223646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005728182,0.000109969515,0.007914962,0.00006251503,0.00016115289,2.7795974e-7,0.0017613638,0.0000017370847,0.0010171286,0.9711236,0.00024656745,0.017595014],"study_design_scores_gemma":[0.00016829095,0.000039390074,0.028506612,0.00058744213,0.00007699249,0.0000069978573,0.000117626994,0.00018550466,0.001082181,0.95898867,0.009872191,0.0003681075],"about_ca_topic_score_codex":0.000030300678,"about_ca_topic_score_gemma":0.00001991795,"teacher_disagreement_score":0.43789548,"about_ca_system_score_codex":0.000011162223,"about_ca_system_score_gemma":0.00012017234,"threshold_uncertainty_score":0.99855405},"labels":[],"label_agreement":null},{"id":"W22855264","doi":"10.1007/978-1-4615-0304-0_4","title":"Trace Representation of Hall’s Sextic Residue Sequences of Period P ≡ 7 (mod 8)","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Residue (chemistry); Conjecture; TRACE (psycholinguistics); Period (music); Hadamard transform; Mod; Mathematics; Representation (politics); Combinatorics; Physics; Chemistry; Mathematical analysis; Philosophy; Political science; Linguistics","score_opus":0.029561239920331994,"score_gpt":0.2522196155980865,"score_spread":0.22265837567775448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22855264","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008760969,0.0010023309,0.09222089,0.00033343938,0.00027261346,0.00023243585,0.000008956465,0.000093715615,0.9049595],"genre_scores_gemma":[0.47676995,0.0005568657,0.08681671,0.00031059395,0.00012371471,0.000021675187,0.000015440794,0.000074268864,0.43531078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856025,0.00006257759,0.0004430188,0.0004286989,0.0003674594,0.00013798593],"domain_scores_gemma":[0.9984999,0.00012786855,0.00037054025,0.00080369576,0.00014864166,0.00004938986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029723506,0.00020194326,0.0003880102,0.00024155127,0.000049453283,0.000035442612,0.00072275347,0.0001717163,0.00036492362],"category_scores_gemma":[0.000021745307,0.00018512711,0.00024347096,0.00012768051,0.00019766664,0.0002065324,0.00009449723,0.00015468929,0.000010796366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009813983,0.000017878769,0.000022848692,0.00006475999,0.000041298958,0.000009194118,0.00050566625,0.00003172941,0.00094384217,0.99142563,0.0003663647,0.0065609463],"study_design_scores_gemma":[0.00029326286,0.00036408094,0.00009836405,0.0003000179,0.00007405228,0.00005517969,0.00010545765,0.00028939496,0.029060232,0.9612358,0.0076273093,0.00049682707],"about_ca_topic_score_codex":0.00002814356,"about_ca_topic_score_gemma":0.000023640045,"teacher_disagreement_score":0.47589386,"about_ca_system_score_codex":0.000013669684,"about_ca_system_score_gemma":0.00007942715,"threshold_uncertainty_score":0.75492644},"labels":[],"label_agreement":null},{"id":"W2288543394","doi":"10.1007/s12190-015-0964-9","title":"On some classes of linear codes over $${\\mathbb {Z}}_{2}{\\mathbb {Z}}_{4}$$ Z 2 Z 4 and their covering radii","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Mathematics and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Simplex; Combinatorics; Binary number; Binary code; Theory of computation; Type (biology); Discrete mathematics; Upper and lower bounds; Algorithm; Arithmetic; Mathematical analysis","score_opus":0.011452824401838126,"score_gpt":0.22489385348864702,"score_spread":0.2134410290868089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288543394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6763976,0.00016208744,0.32274,0.00008357243,0.00007833182,0.000058966594,0.0000015767137,0.000021322501,0.00045653767],"genre_scores_gemma":[0.9356019,0.00013233273,0.0640817,0.00009019311,0.00007815336,5.473961e-7,5.7387926e-8,0.00001225072,0.0000028891538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988234,0.000017639339,0.00055864616,0.00017551718,0.00022520234,0.00019958377],"domain_scores_gemma":[0.99793035,0.0010324549,0.00063666207,0.00023482235,0.000066077446,0.00009964523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084248476,0.00018706625,0.0004494246,0.00018693671,0.00013205025,0.00008297963,0.00037389723,0.00005713617,0.0000032816831],"category_scores_gemma":[0.000041009283,0.00011177161,0.00010372507,0.00014510787,0.00010199288,0.00019262014,0.00021652033,0.0001433821,9.0466483e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041710035,0.00011977309,0.000019128493,0.00015138206,0.000075468735,0.0000047870367,0.002423177,0.0000851481,0.029452844,0.9218875,0.0000437051,0.04569538],"study_design_scores_gemma":[0.0015574545,0.0005384699,0.00022836142,0.001229108,0.000037990812,0.00017351043,0.0005532649,0.043327477,0.03440147,0.91727823,0.0003128749,0.00036180604],"about_ca_topic_score_codex":3.1419702e-7,"about_ca_topic_score_gemma":1.2358696e-7,"teacher_disagreement_score":0.25920427,"about_ca_system_score_codex":0.000012846194,"about_ca_system_score_gemma":0.00002793453,"threshold_uncertainty_score":0.45579138},"labels":[],"label_agreement":null},{"id":"W2288806573","doi":"10.1109/acssc.2015.7421165","title":"Low power design of a word-level finite field multiplier using Reordered Normal Basis","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Domino logic; Dissipation; CMOS; Computer science; Electronic engineering; Transistor; Integrated circuit design; Logic synthesis; Logic gate; Engineering; Voltage; Electrical engineering; Logic family","score_opus":0.08395138455365822,"score_gpt":0.26526578803928746,"score_spread":0.18131440348562924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288806573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030444924,0.000024058372,0.96564704,0.00013740473,0.00022785956,0.00009795288,0.0000013049598,0.00008246899,0.0033370098],"genre_scores_gemma":[0.7061679,0.0000010811692,0.29331142,0.0003451877,0.000014101979,0.0000025347836,2.1587479e-7,0.000004999481,0.00015256992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900454,0.00010868718,0.00020979166,0.00023692258,0.00020995706,0.00023007324],"domain_scores_gemma":[0.9988054,0.0003890182,0.000075172524,0.00048872083,0.00012956784,0.00011209252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005709963,0.00011834523,0.00015095831,0.00015628886,0.00005999015,0.000056459998,0.00057107105,0.0000681273,0.000112240545],"category_scores_gemma":[0.0001749908,0.00010412182,0.00008455121,0.0005252235,0.000039065195,0.00033822638,0.00021789024,0.00009164732,0.000016883294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022402036,0.0024928532,0.014230243,0.00016099254,0.0006105313,0.00017832688,0.033613287,0.07328842,0.042157944,0.36586773,0.019821163,0.4453383],"study_design_scores_gemma":[0.003554325,0.0012296415,0.0015732516,0.00020571408,0.00004562824,0.000041154966,0.0006449623,0.75324726,0.17953217,0.056217134,0.0024252795,0.0012834845],"about_ca_topic_score_codex":0.000029617637,"about_ca_topic_score_gemma":0.000004428039,"teacher_disagreement_score":0.6799588,"about_ca_system_score_codex":0.0000104859355,"about_ca_system_score_gemma":0.00008580795,"threshold_uncertainty_score":0.42459646},"labels":[],"label_agreement":null},{"id":"W2289857173","doi":"10.1007/978-3-319-17296-5_27","title":"An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm","year":2015,"lang":"en","type":"book-chapter","venue":"CIM series in mathematical sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matroid; Extension (predicate logic); Minimum weight; Sequence (biology); Mathematics; Discrete mathematics; Algorithm; Combinatorics; Computer science","score_opus":0.03635427763897129,"score_gpt":0.27348795480432964,"score_spread":0.23713367716535835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289857173","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012833979,0.0010722188,0.06468684,0.0012095612,0.0015544357,0.0006356609,0.000017199358,0.00017891469,0.92936176],"genre_scores_gemma":[0.10704807,0.00042005576,0.6865722,0.0014517511,0.0011415546,0.00011002573,0.000014143327,0.00018857731,0.20305361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976363,0.00009441372,0.0004998875,0.00057979434,0.0008764259,0.00031314453],"domain_scores_gemma":[0.9982189,0.00021609913,0.00026469593,0.0010644195,0.00011582681,0.00012006633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016251488,0.00027596563,0.0004376053,0.00018132034,0.0001994521,0.00013362028,0.0030138714,0.00018958272,0.00020856403],"category_scores_gemma":[0.000086100976,0.00016938275,0.00016580858,0.00036661254,0.0018923017,0.00063907413,0.0006724283,0.00026843563,0.00003757383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036189826,0.00004676053,0.000006549215,0.000035322886,0.000005448385,0.0000062954346,0.000474829,0.00000478316,0.00006140862,0.98307794,0.00041311045,0.015863923],"study_design_scores_gemma":[0.000076532335,0.00022765344,0.00003165746,0.0003503669,0.000011373802,0.000035773755,0.00005824705,0.0038179525,0.00025648,0.98736167,0.007522883,0.0002493994],"about_ca_topic_score_codex":0.0000017306563,"about_ca_topic_score_gemma":0.0000036053868,"teacher_disagreement_score":0.72630817,"about_ca_system_score_codex":0.000024894167,"about_ca_system_score_gemma":0.00014023828,"threshold_uncertainty_score":0.69722646},"labels":[],"label_agreement":null},{"id":"W2289924220","doi":"10.1016/j.aim.2017.02.012","title":"Normalizers of primitive permutation groups","year":2017,"lang":"en","type":"preprint","venue":"Advances in Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Research, Innovation and Economic Development, California State Polytechnic University, Pomona; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Mount Allison University; London Mathematical Society; National Science Foundation","keywords":"Primitive permutation group; Mathematics; Combinatorics; Permutation group; Permutation (music); Galois group; Group (periodic table); Sequence (biology); Discrete mathematics; Cyclic permutation; Symmetric group; Physics; Biology; Genetics","score_opus":0.01827990261158398,"score_gpt":0.3022645525345919,"score_spread":0.2839846499230079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289924220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0360675,0.0013821074,0.9340587,0.00008709747,0.000772849,0.0003585798,0.00001130011,0.00008670627,0.027175134],"genre_scores_gemma":[0.7538618,0.0013316952,0.24465445,0.000020756714,0.000032337026,0.000044685057,0.0000059505737,0.0000121688245,0.000036154488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883825,0.000054855987,0.0003845934,0.00029969495,0.00025611426,0.00016647483],"domain_scores_gemma":[0.9979638,0.00024510326,0.00066748407,0.0010075842,0.000086829205,0.000029186045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005226885,0.00017982213,0.00035070165,0.00018573686,0.000063619904,0.00007685023,0.0014951308,0.000115212555,0.0000063563352],"category_scores_gemma":[0.0001730963,0.00017372193,0.00012624628,0.00011226639,0.00014648214,0.0005454488,0.00077539176,0.00028147345,0.000004720646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053087633,0.0001315199,0.0003555078,0.0009815315,0.000019250829,0.0000088755105,0.0075267972,0.0018993278,0.00003818351,0.9582758,0.0000069986163,0.030750897],"study_design_scores_gemma":[0.00013984271,0.000029938416,0.00053795025,0.00070705474,0.000012477519,0.0000039688266,0.0001866075,0.014628597,0.0005503113,0.98278534,0.00021997013,0.00019793316],"about_ca_topic_score_codex":0.0000028303489,"about_ca_topic_score_gemma":0.000008789942,"teacher_disagreement_score":0.7177943,"about_ca_system_score_codex":0.000028240906,"about_ca_system_score_gemma":0.0000499923,"threshold_uncertainty_score":0.7084174},"labels":[],"label_agreement":null},{"id":"W2294545534","doi":"","title":"Quaternary quasi-cyclic codes with even length components","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quaternary; Mathematics; Geology; Paleontology","score_opus":0.02518241983312978,"score_gpt":0.22015279862893525,"score_spread":0.19497037879580548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294545534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98491675,0.00009430952,0.0068520475,0.0000957722,0.0010961309,0.00014630127,0.0000015169894,0.00035510963,0.006442075],"genre_scores_gemma":[0.9962111,0.000013602081,0.0035187742,0.0001369063,0.000006617564,0.000018599243,0.0000025112388,0.000016395328,0.000075487034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986179,0.00015469208,0.00019505413,0.00040389696,0.00028322762,0.00034526878],"domain_scores_gemma":[0.9988379,0.0000878289,0.0001040389,0.0007707715,0.000059242117,0.00014025849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030188865,0.00020070806,0.00021430691,0.00012744081,0.00018498242,0.000074614516,0.0012119099,0.000060171504,0.0000286151],"category_scores_gemma":[0.000009586925,0.00016983025,0.00007958565,0.0004042974,0.00010445204,0.00045338954,0.00023669383,0.00017123467,0.00011822527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059588532,0.00042109372,0.030766996,0.000008033128,0.000058203208,0.00005072191,0.0015367729,5.297951e-7,0.0003026323,0.9640816,0.00019861509,0.002515219],"study_design_scores_gemma":[0.001195659,0.00088695856,0.04715802,0.000069598864,0.000020398516,0.000040333023,0.00005987478,0.0008790798,0.0032579093,0.9446762,0.0013113698,0.00044458912],"about_ca_topic_score_codex":0.000111037756,"about_ca_topic_score_gemma":0.0000061713195,"teacher_disagreement_score":0.019405387,"about_ca_system_score_codex":0.000021074595,"about_ca_system_score_gemma":0.000027465263,"threshold_uncertainty_score":0.6925477},"labels":[],"label_agreement":null},{"id":"W2299317473","doi":"10.14288/1.0065096","title":"On the construction, dimensionality, and decoding of linear block code trellises","year":2008,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Decoding methods; Computer science; Code (set theory); Algorithm; Arithmetic; Mathematics; Programming language; Set (abstract data type)","score_opus":0.013916270494697593,"score_gpt":0.174035312746915,"score_spread":0.1601190422522174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299317473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927452,0.000069543894,0.0061946083,0.00018993042,0.000069600566,0.000068030626,0.00002255412,0.00003077562,0.0006097563],"genre_scores_gemma":[0.9969705,0.00012882629,0.002777799,0.000054101296,0.000007334738,1.00091555e-7,6.396594e-7,0.0000025708564,0.000058167214],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993728,0.000068540576,0.00008236249,0.00021133851,0.00016477211,0.00010022633],"domain_scores_gemma":[0.99928486,0.00022739398,0.00009138773,0.00024405752,0.000104056846,0.000048234466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017530032,0.000028527877,0.0001325214,0.00003639811,0.0004273653,0.000023723514,0.0003425966,0.00003775057,0.00001995103],"category_scores_gemma":[0.000028725924,0.00007164398,0.000073038194,0.0002775764,0.00058601314,0.00015580247,0.00016430292,0.00007503144,0.0000021145775],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013549296,0.0011414851,0.18409316,0.00025974918,0.0004750308,0.00059040834,0.005878468,0.0004147919,0.0036028982,0.075582094,0.018204119,0.7096223],"study_design_scores_gemma":[0.0005925205,0.00014733296,0.9721725,0.0001450694,0.00002008403,0.00036322823,0.0004354153,0.0018443433,0.000045471443,0.023788558,0.0002799039,0.00016555893],"about_ca_topic_score_codex":0.002612178,"about_ca_topic_score_gemma":0.0041132043,"teacher_disagreement_score":0.7880793,"about_ca_system_score_codex":0.0000072011076,"about_ca_system_score_gemma":0.000031021562,"threshold_uncertainty_score":0.39488494},"labels":[],"label_agreement":null},{"id":"W2313290072","doi":"10.1142/9789812703118_0009","title":"Worst-Case Redundancy of Solid Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Western University","funders":"","keywords":"Computer science; Redundancy (engineering)","score_opus":0.014410964426658983,"score_gpt":0.2592484445163404,"score_spread":0.2448374800896814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313290072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08797522,0.0001280852,0.8794612,0.0006617793,0.00011826397,0.000054067154,0.0000018394184,0.00019116561,0.031408336],"genre_scores_gemma":[0.924822,0.000004480857,0.07463013,0.00019154392,0.000039312443,0.0000018832039,1.3837403e-7,0.000002346177,0.0003081873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994869,0.000024314157,0.00013457608,0.0001447316,0.00008345874,0.00012601406],"domain_scores_gemma":[0.9994631,0.000058548045,0.000038478753,0.00036045938,0.000032684304,0.0000467248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020416395,0.00005859029,0.00008708587,0.0000780819,0.000058095116,0.000023259761,0.00034895577,0.00002247344,0.000086957996],"category_scores_gemma":[0.000011297928,0.000049610146,0.0000644248,0.00027664902,0.0000457202,0.00022363078,0.00010126225,0.000044247725,0.000027698123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038502308,0.00005615024,0.00006847203,0.000004108316,0.000008467116,0.000030064655,0.0003987029,0.000026983163,0.00088437967,0.91166866,0.00078124244,0.08606892],"study_design_scores_gemma":[0.0014037351,0.00059879466,0.0009115975,0.00011511929,0.000034202545,0.002292778,0.0003632938,0.052220624,0.23594792,0.62506664,0.080036186,0.0010090878],"about_ca_topic_score_codex":0.0000063595216,"about_ca_topic_score_gemma":0.000020316756,"teacher_disagreement_score":0.83684677,"about_ca_system_score_codex":0.000004253393,"about_ca_system_score_gemma":0.00001327763,"threshold_uncertainty_score":0.20230429},"labels":[],"label_agreement":null},{"id":"W2313609681","doi":"10.4153/cmb-2009-009-2","title":"A SAGBI Basis For 𝔽[<i>V</i><sub>2</sub> ⊕ <i>V</i><sub>2</sub> ⊕ <i>V</i><sub>3</sub>]<i><sup>C<sub>p</sub></sup></i>","year":2009,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Indecomposable module; Order (exchange); Prime (order theory); Basis (linear algebra); Field (mathematics); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.010120282510581542,"score_gpt":0.20231169813766037,"score_spread":0.19219141562707884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313609681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87417847,0.0009713124,0.09256756,0.018797899,0.0010980496,0.0038849285,0.00064350874,0.0017030638,0.0061552348],"genre_scores_gemma":[0.97013414,0.000410106,0.0072932183,0.019397944,0.0012270543,0.0008890807,0.00015026919,0.00042343573,0.00007473372],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9848872,0.0009418341,0.0029539736,0.0037692292,0.0021109285,0.0053368257],"domain_scores_gemma":[0.9862809,0.00287801,0.0009189801,0.004284374,0.0008167237,0.0048209704],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0038617612,0.0025408473,0.002670946,0.0018061162,0.0020288106,0.0016993332,0.004898062,0.0014293767,0.00027650883],"category_scores_gemma":[0.001987091,0.0027208761,0.00217013,0.0034499685,0.0010605564,0.0009103347,0.0007169738,0.0020874704,0.007659569],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038714794,0.0014685057,0.000056785797,0.0010314849,0.00059537456,0.00093593006,0.002922731,0.00042513537,0.49743512,0.17314908,0.17945574,0.14213695],"study_design_scores_gemma":[0.003576763,0.0013629172,0.00021224032,0.0015635614,0.0005846814,0.00071296014,0.00039479102,0.0066449814,0.7643391,0.15478247,0.06100342,0.0048221108],"about_ca_topic_score_codex":0.00012428113,"about_ca_topic_score_gemma":0.0010337349,"teacher_disagreement_score":0.26690397,"about_ca_system_score_codex":0.0009818142,"about_ca_system_score_gemma":0.0016374732,"threshold_uncertainty_score":0.99986696},"labels":[],"label_agreement":null},{"id":"W2316194124","doi":"10.4153/cjm-2013-014-9","title":"Multidimensional Vinogradov-type Estimates in Function Fields","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Type (biology); Polynomial; Finite field; Function (biology); Field (mathematics); Ring (chemistry); Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.015307846626546388,"score_gpt":0.21049611704891052,"score_spread":0.19518827042236414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2316194124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78632164,0.00025445502,0.21085894,0.0009708234,0.0007512482,0.00008972149,3.7866823e-7,0.000013697191,0.00073912274],"genre_scores_gemma":[0.9119225,0.000004347882,0.08779723,0.00021483022,0.00003193996,9.858487e-7,2.0225023e-7,0.000004300032,0.000023661698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993667,0.000022311802,0.00026079055,0.00006524634,0.00011026506,0.00017467275],"domain_scores_gemma":[0.99920684,0.00014236655,0.00011447587,0.00016199767,0.0001490292,0.00022528769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003041118,0.00007316327,0.00012827398,0.00031759002,0.000058856436,0.00007787808,0.00030765947,0.00004868771,0.00014134165],"category_scores_gemma":[0.00013702743,0.000061850704,0.00005706047,0.00030441687,0.000031941607,0.000315558,0.000015650065,0.00015587827,0.000046452744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000131216175,0.0003026777,0.035432056,0.00017328521,0.00015159517,0.0003325778,0.009779049,0.0020821746,0.0016226699,0.87377524,0.02404169,0.05229385],"study_design_scores_gemma":[0.000829407,0.00071326084,0.036191188,0.0005104867,0.000035766036,0.0005444483,0.0007089063,0.08294527,0.0008113628,0.87209266,0.0041444474,0.00047276547],"about_ca_topic_score_codex":0.00042370998,"about_ca_topic_score_gemma":0.0016237132,"teacher_disagreement_score":0.12560089,"about_ca_system_score_codex":0.00002858389,"about_ca_system_score_gemma":0.0002104173,"threshold_uncertainty_score":0.25221986},"labels":[],"label_agreement":null},{"id":"W2341519381","doi":"","title":"Trace Function Representation of a New Class of Sextic Residue Sequences of Period p≡ 7(mod 8)","year":2007,"lang":"en","type":"article","venue":"Jisuanji gongcheng","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"TRACE (psycholinguistics); Residue (chemistry); Period (music); Mod; Sequence (biology); Mathematics; Representation (politics); Prime (order theory); Computer science; Pure mathematics; Combinatorics; Discrete mathematics; Physics; Chemistry","score_opus":0.030085592985416184,"score_gpt":0.28649338792517265,"score_spread":0.25640779493975646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341519381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6965397,0.00029963773,0.30159587,0.00009034086,0.0001751789,0.000096785865,0.000001222485,0.000040562765,0.0011606781],"genre_scores_gemma":[0.9877405,0.000009970614,0.012082092,0.000015679316,0.000041387095,0.0000017622762,0.0000013485915,0.000006196737,0.000101039455],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865377,0.0000908202,0.00048134767,0.0002688085,0.00032575766,0.00017949009],"domain_scores_gemma":[0.99873805,0.00020787284,0.0003656974,0.0004819599,0.00014079173,0.00006563374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000804073,0.000108175394,0.00024948432,0.00024233072,0.000046591766,0.000017760693,0.0004166905,0.00008236254,0.00002915524],"category_scores_gemma":[0.0000898658,0.0001051796,0.00015078892,0.00096908835,0.000115824645,0.00036730172,0.00007248981,0.000105892155,0.0000023144544],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052480225,0.00032953906,0.025352366,0.0003050796,0.00014670628,0.000012445274,0.01594188,0.00076596066,0.50594366,0.3152425,0.00027844176,0.13515662],"study_design_scores_gemma":[0.0011017406,0.00097467384,0.20372702,0.00021418523,0.00010152517,0.000024721732,0.0026904582,0.0038548387,0.71597105,0.07060401,0.0003960276,0.00033976755],"about_ca_topic_score_codex":0.000114735856,"about_ca_topic_score_gemma":0.00004717196,"teacher_disagreement_score":0.29120082,"about_ca_system_score_codex":0.00001753669,"about_ca_system_score_gemma":0.000087702174,"threshold_uncertainty_score":0.42890996},"labels":[],"label_agreement":null},{"id":"W2348839133","doi":"","title":"A Fast Cryptanalysis of the Generalized Self-shrinking Sequences","year":2004,"lang":"en","type":"article","venue":"Journal of Electronics Information & Technology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Euler's totient function; Cryptanalysis; Linear feedback shift register; Algorithm; Mathematics; Euler's formula; Time complexity; Polynomial; Linear cryptanalysis; Discrete mathematics; Computer science; Shift register; Arithmetic; Cryptography; Mathematical analysis","score_opus":0.0045039401192205,"score_gpt":0.20962901545799206,"score_spread":0.20512507533877156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2348839133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33877793,0.0005285627,0.6558359,0.003962601,0.0001787425,0.00007365451,4.8043944e-7,0.00008797788,0.000554131],"genre_scores_gemma":[0.9631593,0.00019034739,0.036452826,0.00017811584,0.00001389954,0.0000017666171,1.6931062e-7,0.0000019933448,0.000001556527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988217,0.000037153837,0.0005956762,0.00005607093,0.00028870572,0.00020069306],"domain_scores_gemma":[0.9983273,0.00002504814,0.0009773569,0.00033009108,0.00031745396,0.000022734679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060962787,0.000086701584,0.00019413378,0.0006991223,0.00012783133,0.000054378088,0.0013811801,0.00010236245,0.0000042060005],"category_scores_gemma":[0.00007270315,0.00005939974,0.00019338093,0.0017856229,0.00007811079,0.0009824834,0.00013420872,0.0003644861,0.000002206703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007760205,0.000024047911,0.00019754232,0.000006790998,0.00009943136,8.3243106e-7,0.000636389,0.004548047,0.0015627258,0.9792576,0.000014443535,0.013644409],"study_design_scores_gemma":[0.0009158387,0.0004657161,0.00016461685,0.00005823737,0.00006975893,0.00042078673,0.00022187692,0.0028451232,0.058747366,0.9274594,0.008484161,0.00014708492],"about_ca_topic_score_codex":0.0000021426024,"about_ca_topic_score_gemma":0.00000643878,"teacher_disagreement_score":0.62438136,"about_ca_system_score_codex":0.00013027496,"about_ca_system_score_gemma":0.0003218309,"threshold_uncertainty_score":0.25665992},"labels":[],"label_agreement":null},{"id":"W2349480802","doi":"","title":"On the Avalanche Characteristics of the Boolean Function","year":2004,"lang":"en","type":"article","venue":"Dianzi xuebao","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Boolean function; Dimension (graph theory); Mathematics; Discrete mathematics; Degree (music); Function (biology); Set (abstract data type); Parity function; Class (philosophy); Space (punctuation); Combinatorics; Independence (probability theory); Vector-valued function; Boolean expression; Pure mathematics; Computer science; Physics; Artificial intelligence; Statistics","score_opus":0.008415222041752646,"score_gpt":0.18099641575339462,"score_spread":0.17258119371164196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2349480802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89017105,0.000042150135,0.090573035,0.006139299,0.0013910278,0.00021912978,0.000007014328,0.000112880094,0.011344423],"genre_scores_gemma":[0.9983552,0.0000035846456,0.00010431036,0.0013676261,0.000059821752,0.0000061013416,6.055297e-7,0.00000423872,0.00009848083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994094,0.00005918999,0.00010881081,0.00013564326,0.0001609876,0.00012600602],"domain_scores_gemma":[0.9991337,0.000110631976,0.000077905395,0.000625132,0.00002815591,0.000024491575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024668788,0.00007482796,0.00007261581,0.000030735442,0.00015489403,0.000050450228,0.00064952666,0.000029694065,0.000022870416],"category_scores_gemma":[0.00005186553,0.000040471063,0.000100512545,0.0003170376,0.000071596565,0.00008022274,0.000092455455,0.00013110909,0.00005306607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008818001,0.000041563824,0.00046647544,0.00000365556,0.000009795755,6.454405e-7,0.00036742835,0.000018853174,0.0005121183,0.9894948,0.00044869626,0.0086271465],"study_design_scores_gemma":[0.00049010967,0.0003014927,0.16165297,0.00014307107,0.000027031676,0.00000659971,0.00007612513,0.00038360924,0.012168682,0.80587834,0.018604008,0.00026795105],"about_ca_topic_score_codex":0.000008425225,"about_ca_topic_score_gemma":0.0000036881431,"teacher_disagreement_score":0.18361644,"about_ca_system_score_codex":0.000012300418,"about_ca_system_score_gemma":0.000026216048,"threshold_uncertainty_score":0.1650362},"labels":[],"label_agreement":null},{"id":"W2356387445","doi":"","title":"The Algorithm of High-Radix Transforms for Reed Solomon Codes Over Fermat Primes","year":2000,"lang":"en","type":"article","venue":"Wuhan University Journal","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Radix (gastropod); Fast Fourier transform; Split-radix FFT algorithm; Arithmetic; Rader's FFT algorithm; Algorithm; Decoding methods; Code (set theory); Reed–Solomon error correction; Mathematics; Prime-factor FFT algorithm; Cooley–Tukey FFT algorithm; Fermat number; Computer science; Fermat's Last Theorem; Discrete mathematics; Linear code; Fourier transform; Block code; Fourier analysis; Fractional Fourier transform","score_opus":0.005408295875339046,"score_gpt":0.18868057816124098,"score_spread":0.18327228228590192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2356387445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36415884,0.00017532533,0.6326165,0.000833681,0.00028301234,0.00015937063,0.000013551782,0.000060704977,0.0016989964],"genre_scores_gemma":[0.9782731,0.0004220896,0.020032514,0.00005753522,0.00007997375,2.1551683e-7,0.0000011801392,0.000005837701,0.0011275643],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929845,0.00007344723,0.00012508451,0.00012010361,0.00016765328,0.0002152751],"domain_scores_gemma":[0.9994468,0.00012996826,0.00008175676,0.000194916,0.00006363165,0.000082905775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038034163,0.00008347894,0.00012550766,0.0000946647,0.0007036976,0.00008768385,0.00083891425,0.000044440116,0.000039343955],"category_scores_gemma":[0.000003672834,0.00006410657,0.00018536382,0.00022800625,0.00012052266,0.00042257636,0.000031796706,0.00014546883,0.0000026997855],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000365757,0.000111130736,0.00017317862,0.000011639859,0.0001705903,0.000034066787,0.0027051845,0.00008381342,0.0008558615,0.17546031,0.0012847688,0.8187437],"study_design_scores_gemma":[0.014658793,0.0035661117,0.024301346,0.0004163913,0.00040099095,0.0010246893,0.0036248823,0.041533712,0.0370555,0.5155633,0.35608464,0.0017696685],"about_ca_topic_score_codex":0.00001532357,"about_ca_topic_score_gemma":0.000012694861,"teacher_disagreement_score":0.81697404,"about_ca_system_score_codex":0.000031637155,"about_ca_system_score_gemma":0.000051722494,"threshold_uncertainty_score":0.54123443},"labels":[],"label_agreement":null},{"id":"W2372168189","doi":"","title":"On the XOR Branch Numbers of the Transformations About Modulo 2~n Addition and Modulo 2 Addition","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Modulo; Finite field; XOR gate; Cipher; Primitive root modulo n; Mathematics; Discrete mathematics; Computer science; Differential cryptanalysis; Field (mathematics); Cryptanalysis; Cryptography; Arithmetic; Algorithm; Pure mathematics; Logic gate","score_opus":0.015365844412023388,"score_gpt":0.18289789819338081,"score_spread":0.16753205378135744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2372168189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34947354,0.000030751333,0.5195049,0.0018867198,0.00037708116,0.0004830614,0.000097114316,0.00016539526,0.12798144],"genre_scores_gemma":[0.99841714,0.000014026682,0.0009284054,0.0005160856,0.000015205852,0.00002940748,0.0000036989404,0.0000035266733,0.00007253203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993365,0.00009775456,0.00014831034,0.0001408125,0.00016045316,0.00011619453],"domain_scores_gemma":[0.9993332,0.00013340575,0.00006208901,0.00039959667,0.00004154703,0.00003016921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022971677,0.00008443529,0.000069352,0.000053409618,0.00025357658,0.00003873406,0.00041917167,0.000036514466,0.0005667779],"category_scores_gemma":[0.000016567548,0.00004699637,0.000088806606,0.0003202081,0.000114736766,0.0003756787,0.00003746547,0.00009673064,0.000013273325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009855237,0.00004833765,0.000022787806,0.0000063276343,0.000012338901,8.2456175e-8,0.002543161,0.0000152682,0.0001961079,0.9784959,0.003288206,0.01536161],"study_design_scores_gemma":[0.00040775808,0.00017080709,0.026534714,0.00010093091,0.000022915263,0.000011218933,0.00025046951,0.011723085,0.016892321,0.9414093,0.0022586982,0.00021776657],"about_ca_topic_score_codex":0.000024501413,"about_ca_topic_score_gemma":0.0000284749,"teacher_disagreement_score":0.64894354,"about_ca_system_score_codex":0.0000061014575,"about_ca_system_score_gemma":0.000011823938,"threshold_uncertainty_score":0.62058204},"labels":[],"label_agreement":null},{"id":"W2376869599","doi":"","title":"Research on the [56,28,12] Binary Codes with an Automorphism Order 7","year":2005,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Binary number; Equivalence (formal languages); Dual (grammatical number); Linear code; Block code; Order (exchange); Expander code; Automorphism; Binary code; Theoretical computer science; Discrete mathematics; Algorithm; Arithmetic; Mathematics; Decoding methods","score_opus":0.04079122127969027,"score_gpt":0.30921771762233136,"score_spread":0.2684264963426411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2376869599","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022807246,0.00007175716,0.9623772,0.009505984,0.000013423168,0.00076372747,0.0000058404066,0.00040851312,0.0040463456],"genre_scores_gemma":[0.48897117,0.00001275731,0.5060606,0.0031314953,0.00046500878,0.00095286756,0.000014234661,0.000027748043,0.0003641074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832165,0.00023273141,0.00017040901,0.00057246035,0.00031425295,0.00038850575],"domain_scores_gemma":[0.99804556,0.00035891283,0.00005011549,0.0012286993,0.00020178356,0.00011493555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007820061,0.0001643539,0.00011699888,0.00024581928,0.00091020647,0.00034007945,0.0019587402,0.00005826459,0.00003918769],"category_scores_gemma":[5.064631e-7,0.0001109939,0.000060666698,0.0013683211,0.00024943778,0.00027717857,0.00031398414,0.000385415,0.00034810844],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001621595,0.00042321923,0.000038080576,0.0000048222887,0.000030790918,0.000002326697,0.0006700312,0.0006796553,0.0015536306,0.81873935,0.009765082,0.16807678],"study_design_scores_gemma":[0.0003210781,0.00043312015,0.0010573394,0.000028932318,0.000008803672,0.000036623456,0.00008314902,0.021898115,0.002530999,0.02348697,0.9497935,0.0003213362],"about_ca_topic_score_codex":0.000010664656,"about_ca_topic_score_gemma":0.0000235703,"teacher_disagreement_score":0.9400284,"about_ca_system_score_codex":0.000038645016,"about_ca_system_score_gemma":0.00007562148,"threshold_uncertainty_score":0.70006645},"labels":[],"label_agreement":null},{"id":"W2382655367","doi":"","title":"Linear complexity of Whiteman-generalized cyclotomic sequence with order four","year":2011,"lang":"en","type":"article","venue":"Jisuanji yingyong yanjiu","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Alberta Paraplegic Foundation","funders":"","keywords":"Sequence (biology); Order (exchange); Computer science; Set (abstract data type); Class (philosophy); Algorithm; Mathematics; Discrete mathematics; Combinatorics; Artificial intelligence; Genetics; Biology","score_opus":0.146317956135932,"score_gpt":0.27790318012427695,"score_spread":0.13158522398834496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2382655367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78094506,0.00005413899,0.21276629,0.00014217148,0.00023869303,0.00027349437,0.0000074082873,0.00036294656,0.0052098213],"genre_scores_gemma":[0.8510914,0.000009098898,0.14850086,0.00018832274,0.00004702949,0.000016413667,0.0000032777907,0.000022225158,0.00012139623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802816,0.00017651058,0.00040565527,0.0005633091,0.00037878795,0.0004475661],"domain_scores_gemma":[0.99816686,0.000079966754,0.00027674693,0.0010595979,0.00026361243,0.0001532379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053644547,0.0002829994,0.00040639975,0.0002445811,0.00019124578,0.000055859804,0.0013227864,0.000095627795,0.00013987474],"category_scores_gemma":[0.00004439963,0.00023330125,0.00014663716,0.0011381559,0.00042471653,0.00046567887,0.0002889716,0.00021853231,0.00004600329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003731312,0.00046483116,0.04584342,0.00018036437,0.00023338554,0.00010652783,0.0053642187,0.0001585216,0.014200166,0.92842865,0.0002673523,0.0043794136],"study_design_scores_gemma":[0.009506887,0.0038963517,0.16729887,0.001217446,0.0003597954,0.00083054544,0.0006024295,0.10778941,0.15728325,0.5409509,0.005387321,0.0048768027],"about_ca_topic_score_codex":0.00021012318,"about_ca_topic_score_gemma":0.00007124631,"teacher_disagreement_score":0.3874778,"about_ca_system_score_codex":0.00002700768,"about_ca_system_score_gemma":0.00010328913,"threshold_uncertainty_score":0.9513749},"labels":[],"label_agreement":null},{"id":"W2392237044","doi":"10.1109/lcomm.2016.2540625","title":"A Secure Code Based Cryptosystem via Random Insertions, Deletions, and Errors","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cryptosystem; Hybrid cryptosystem; Goldwasser–Micali cryptosystem; Paillier cryptosystem; Computer science; Plaintext; Plaintext-aware encryption; Code word; Key encapsulation; Theoretical computer science; Key (lock); Public-key cryptography; Deterministic encryption; Threshold cryptosystem; Code (set theory); Cryptography; Key size; Decoding methods; Symmetric-key algorithm; Encryption; Algorithm; Computer security; Public key cryptosystem","score_opus":0.019223036240413736,"score_gpt":0.24071628676366347,"score_spread":0.22149325052324972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2392237044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054368123,0.00030692865,0.87493783,0.06955972,0.00015131681,0.0002191293,0.000013412956,0.0002923499,0.0001511962],"genre_scores_gemma":[0.94360894,0.000093183226,0.0527419,0.0033705158,0.000022515322,0.0001320605,0.000004475432,0.000012464976,0.000013927337],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847984,0.00054311927,0.00029158752,0.00029340724,0.00016232682,0.00022969661],"domain_scores_gemma":[0.9964219,0.0007362038,0.00012083941,0.0025423751,0.00007343418,0.000105279585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052860397,0.0001581887,0.00016915568,0.0002511856,0.00055959687,0.000108875036,0.0018476364,0.00005847761,0.000009876362],"category_scores_gemma":[0.00004209951,0.00012429128,0.00010498665,0.0004892271,0.00027776568,0.00040011827,0.00023646996,0.00014835065,0.000044153425],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019460569,0.00066779216,0.007942831,0.00010771552,0.00025021573,0.000016494225,0.002792926,0.00021003417,0.39892197,0.3728321,0.029331664,0.18673168],"study_design_scores_gemma":[0.022937039,0.0005088163,0.010850706,0.0021340318,0.00034166416,0.0003454673,0.0003660954,0.15727189,0.029580677,0.05849665,0.71287566,0.004291279],"about_ca_topic_score_codex":0.000012362051,"about_ca_topic_score_gemma":0.000054734766,"teacher_disagreement_score":0.88924086,"about_ca_system_score_codex":0.00004595337,"about_ca_system_score_gemma":0.000041224124,"threshold_uncertainty_score":0.5068452},"labels":[],"label_agreement":null},{"id":"W2392885651","doi":"10.1016/j.ffa.2017.01.006","title":"A note on inverses of cyclotomic mapping permutation polynomials over finite fields","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Permutation (music); Finite field; Cyclotomic polynomial; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; Polynomial","score_opus":0.02258834622883974,"score_gpt":0.2630967104058184,"score_spread":0.24050836417697866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2392885651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08789494,0.00005518158,0.8997267,0.00146025,0.00011706316,0.00028977258,0.000034541004,0.0000681442,0.010353412],"genre_scores_gemma":[0.9977545,0.000057510046,0.0014482543,0.0004944872,0.000072755174,0.00008008117,0.000005804106,0.0000052458586,0.00008134494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993486,0.0000287792,0.00017883506,0.00024632513,0.00006847391,0.00012898348],"domain_scores_gemma":[0.9984602,0.0005010633,0.00018202102,0.00077011075,0.00003647819,0.00005014534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016342304,0.000112168134,0.00014268958,0.000116119256,0.00044700698,0.00013806832,0.0005337365,0.00010283255,0.00002392682],"category_scores_gemma":[0.000058002977,0.00009726705,0.00008329822,0.00010804017,0.00007238279,0.00018848272,0.0001582639,0.0001305666,0.000011531976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042345586,0.00017086715,0.002844627,0.00007715842,0.00007247355,0.0000017750153,0.007467441,0.00044302887,0.0020041987,0.81250286,0.0005054642,0.17386776],"study_design_scores_gemma":[0.0017817721,0.00054470974,0.057405137,0.0003102589,0.000045958015,0.000009608838,0.00035966132,0.10379616,0.011915545,0.7442705,0.078530855,0.001029812],"about_ca_topic_score_codex":0.000042482443,"about_ca_topic_score_gemma":0.000017461683,"teacher_disagreement_score":0.9098596,"about_ca_system_score_codex":0.00000500055,"about_ca_system_score_gemma":0.000022128794,"threshold_uncertainty_score":0.39664352},"labels":[],"label_agreement":null},{"id":"W2393284108","doi":"","title":"The Decision of the Linearity for the Binary Image of One Special Quarter Code","year":2008,"lang":"en","type":"article","venue":"Journal of Kashgar Teachers College","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Linearity; Code (set theory); Image (mathematics); Binary number; Quarter (Canadian coin); Mathematics; Computer science; Algorithm; Arithmetic; Computer vision; Programming language; History; Physics; Set (abstract data type)","score_opus":0.022490469602254804,"score_gpt":0.24970726972771054,"score_spread":0.22721680012545573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2393284108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88104665,0.00072717643,0.10798966,0.0064488067,0.0021671415,0.00050374295,0.000030926116,0.000013988463,0.0010719275],"genre_scores_gemma":[0.985849,0.00012027072,0.013127553,0.00009968623,0.0005930001,0.0000032982412,8.3114095e-8,0.000008508986,0.00019858478],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998412,0.00023301298,0.0005592041,0.00011171946,0.00050965755,0.00017440524],"domain_scores_gemma":[0.99693644,0.001557172,0.0006119673,0.00055067765,0.00029309987,0.00005064857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001949123,0.000106762025,0.0002434676,0.00007986192,0.00052668556,0.000029939376,0.0017527745,0.000058664333,0.000012417627],"category_scores_gemma":[0.0003201761,0.000050558345,0.00049146713,0.00046977185,0.0004189215,0.00020695331,0.00016313931,0.00034071482,0.0000010892095],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0071226675,0.0036312244,0.0076333764,0.00010128328,0.0016860192,0.0001040922,0.051943693,0.00082190294,0.039581276,0.24205148,0.5421794,0.103143565],"study_design_scores_gemma":[0.015106771,0.007741296,0.2578757,0.0010145988,0.0007562032,0.0012925443,0.010429016,0.028268913,0.04268422,0.1920966,0.44146734,0.0012667695],"about_ca_topic_score_codex":0.0000029746084,"about_ca_topic_score_gemma":0.00001245659,"teacher_disagreement_score":0.25024232,"about_ca_system_score_codex":0.000028150915,"about_ca_system_score_gemma":0.00016696143,"threshold_uncertainty_score":0.4050893},"labels":[],"label_agreement":null},{"id":"W2395020125","doi":"","title":"Quasi-Twisted Codes over F 11 .","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics","score_opus":0.02143000357924769,"score_gpt":0.2298188217612,"score_spread":0.20838881818195232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395020125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9684154,0.0001242621,0.0076805945,0.00007849229,0.0027002434,0.00012008334,0.0000015830211,0.0005068374,0.020372497],"genre_scores_gemma":[0.9971422,0.000006714856,0.0024932441,0.00021579723,0.0000057736506,0.000010427732,9.872261e-7,0.0000096742315,0.00011518279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895453,0.000103716935,0.00016670533,0.00031384017,0.00018897551,0.00027223662],"domain_scores_gemma":[0.998985,0.00008247258,0.00006809327,0.0007054015,0.000052975563,0.000106043975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031909667,0.00013981703,0.00015107452,0.000104821855,0.00013395972,0.000072956296,0.0009609172,0.000065137545,0.00008829145],"category_scores_gemma":[0.000027570468,0.0001348334,0.00010206654,0.0005011435,0.00007543323,0.000360779,0.00022313504,0.000111281035,0.00010944812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008420669,0.00025353918,0.006755178,0.000003816431,0.00001533455,0.000014771209,0.00089339213,5.9401373e-8,0.00016991352,0.9889833,0.00095646014,0.0019458432],"study_design_scores_gemma":[0.0004590787,0.00022000761,0.017202849,0.000013873974,0.000007713431,0.000006456999,0.000021651656,0.0003224211,0.0020396241,0.9753253,0.004166361,0.00021468909],"about_ca_topic_score_codex":0.000059385366,"about_ca_topic_score_gemma":0.0000087256,"teacher_disagreement_score":0.02872679,"about_ca_system_score_codex":0.000015801686,"about_ca_system_score_gemma":0.00002588197,"threshold_uncertainty_score":0.54983467},"labels":[],"label_agreement":null},{"id":"W2395599031","doi":"","title":"De Bruijn Sequences Revisited.","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"De Bruijn sequence; Combinatorics; Sequence (biology); Alphabet; Mathematics; Order (exchange); Word (group theory); Word length; Integer (computer science); Discrete mathematics; Computer science; Linguistics; Geometry","score_opus":0.03425965544637269,"score_gpt":0.23280256328710497,"score_spread":0.19854290784073228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395599031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01842872,0.00010030431,0.68134034,0.00012326513,0.00007437051,0.000030394107,1.6218794e-7,0.000282884,0.29961956],"genre_scores_gemma":[0.8983547,0.000011361022,0.10039643,0.00081684353,0.000019895153,0.0000025201186,9.029839e-8,0.0000018429545,0.00039632435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999558,0.000038466365,0.00006380115,0.00013950958,0.000059490634,0.00014076146],"domain_scores_gemma":[0.9996123,0.000024378272,0.000017710714,0.00027608903,0.000016999411,0.000052568597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026369374,0.00004725811,0.000047025813,0.000050905193,0.00005553845,0.00005455707,0.00057262514,0.000020200096,0.0003247293],"category_scores_gemma":[0.000009703424,0.000037625992,0.000042180363,0.0002532758,0.000030494204,0.00022254058,0.000080984064,0.000041357496,0.00008877638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013106309,0.000011090371,0.0014630167,0.0000018245947,0.000003588882,0.0000063298144,0.00057147525,1.559872e-7,0.00025097126,0.976924,0.0005942724,0.02017198],"study_design_scores_gemma":[0.000097687276,0.00013066766,0.010319887,0.000020742144,0.0000051323614,0.000046771125,0.000057527082,0.0012960451,0.010581252,0.95991313,0.017301299,0.00022984698],"about_ca_topic_score_codex":0.000022895187,"about_ca_topic_score_gemma":0.0000011746853,"teacher_disagreement_score":0.87992597,"about_ca_system_score_codex":0.0000044729973,"about_ca_system_score_gemma":0.000015855867,"threshold_uncertainty_score":0.3555558},"labels":[],"label_agreement":null},{"id":"W2395673640","doi":"","title":"Feedback Number of Generalized Kautz Digraphs GK(2, n).","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic; Combinatorics","score_opus":0.008347526522832854,"score_gpt":0.2317459165341247,"score_spread":0.22339839001129186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395673640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9653391,0.000074477764,0.009543159,0.00020839222,0.0020809893,0.00010392589,0.0000012220901,0.00022010338,0.022428602],"genre_scores_gemma":[0.9945055,0.000012786742,0.0051405104,0.00018584602,0.000010143302,0.000009381939,0.0000016432468,0.000011179344,0.00012299113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986837,0.00018985092,0.0002623732,0.00032151662,0.0002674904,0.00027509817],"domain_scores_gemma":[0.9986689,0.00016534256,0.00012966675,0.0008330882,0.00009758808,0.0001054344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005143235,0.00015689024,0.0002498882,0.000096370066,0.00010450439,0.000067748944,0.0010014817,0.00007446952,0.000067121706],"category_scores_gemma":[0.00004885088,0.00014961159,0.0001801045,0.0006787668,0.00009703689,0.00025091754,0.00021555669,0.000115858835,0.00009859075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010046764,0.00009417917,0.008587205,0.000009780553,0.000024380344,0.0000012102613,0.00020334587,0.0000028135485,0.0005743644,0.98396677,0.001332182,0.0051936954],"study_design_scores_gemma":[0.00088409183,0.00008075853,0.004978316,0.000019563138,0.000009882449,0.000006257637,0.000005943104,0.0008866204,0.0035153376,0.9810231,0.008394353,0.00019582921],"about_ca_topic_score_codex":0.000020787133,"about_ca_topic_score_gemma":0.0000011508023,"teacher_disagreement_score":0.02916639,"about_ca_system_score_codex":0.000009202505,"about_ca_system_score_gemma":0.000021264103,"threshold_uncertainty_score":0.6100983},"labels":[],"label_agreement":null},{"id":"W2397001187","doi":"","title":"Unsolvable Block-Transitive Automorphism Groups of 2-(v, 31, 1) Designs.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Automorphism; Block (permutation group theory); Automorphism group; Pure mathematics; Combinatorics","score_opus":0.011688458019668297,"score_gpt":0.21346335886833115,"score_spread":0.20177490084866284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397001187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8427499,0.00018587196,0.13466577,0.00047926625,0.0027527635,0.0003021123,0.00000350865,0.0005157664,0.01834505],"genre_scores_gemma":[0.99598247,0.000008607475,0.0037285308,0.00018512108,0.000009247567,0.000011362981,0.0000014336252,0.0000114203285,0.00006179486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985958,0.00019428604,0.00026033865,0.00036152973,0.0002707097,0.0003173659],"domain_scores_gemma":[0.99863553,0.00031873834,0.00012467183,0.00068353064,0.00012652663,0.00011101184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077953417,0.00017336248,0.00026985377,0.00015223295,0.00014530064,0.00005729548,0.00091700186,0.000087296474,0.000012653815],"category_scores_gemma":[0.000049572347,0.00017307122,0.00013915414,0.0006647359,0.00012914733,0.00029926156,0.00013810303,0.00015650375,0.000037262904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012766891,0.00012280601,0.00029736364,0.000012529644,0.000028253722,0.000004704177,0.0005759,0.000018287543,0.0038053321,0.99233866,0.0008140073,0.001969372],"study_design_scores_gemma":[0.0007703659,0.00036767288,0.0014564091,0.000042512627,0.000017917535,0.000009775148,0.000019239156,0.004451795,0.018501412,0.97199965,0.002120112,0.00024314251],"about_ca_topic_score_codex":0.000016034386,"about_ca_topic_score_gemma":0.0000012552455,"teacher_disagreement_score":0.1532326,"about_ca_system_score_codex":0.000020748315,"about_ca_system_score_gemma":0.00004791001,"threshold_uncertainty_score":0.70576394},"labels":[],"label_agreement":null},{"id":"W2397286050","doi":"","title":"A New Construction of Multisender Authentication Codes with Simultaneous Model from Singular Symplectic Geometry over Finite Fields.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Finite field; Geometry; Finite geometry; Pure mathematics; Discrete mathematics","score_opus":0.014897913783867345,"score_gpt":0.2313137153047273,"score_spread":0.21641580152085996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397286050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5617074,0.000070797614,0.43748128,0.000051393,0.00038452644,0.00007712707,0.0000024632943,0.000079441714,0.00014560686],"genre_scores_gemma":[0.94797415,0.000003903937,0.051919203,0.00004737589,0.0000072105286,0.0000031409577,0.000005014956,0.000008912616,0.000031064246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989912,0.00006466451,0.00019314686,0.00029341184,0.00028957907,0.0001679984],"domain_scores_gemma":[0.99868727,0.00038967267,0.000138144,0.00049705326,0.0001576682,0.00013021023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015266986,0.00013277812,0.00017988891,0.00013889554,0.000065708744,0.00007033146,0.00035978624,0.00008353133,0.00000963135],"category_scores_gemma":[0.00015384701,0.0001240598,0.000052107043,0.0005132444,0.00007079039,0.00026591227,0.000088207256,0.00011792277,0.0000056743106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007699447,0.00010215452,0.0022633339,0.000009102329,0.00007446515,0.0000070415776,0.0021355872,0.008098242,0.0005391687,0.9775798,0.0001150033,0.008999157],"study_design_scores_gemma":[0.00077845476,0.00012262701,0.00016429207,0.000025629073,0.0000263611,0.0000045024467,0.000041170268,0.3409318,0.0017655451,0.6559861,0.000029073373,0.00012444079],"about_ca_topic_score_codex":0.00011159789,"about_ca_topic_score_gemma":0.0000082797915,"teacher_disagreement_score":0.38626683,"about_ca_system_score_codex":0.000032260203,"about_ca_system_score_gemma":0.00013709994,"threshold_uncertainty_score":0.5059012},"labels":[],"label_agreement":null},{"id":"W2397365124","doi":"","title":"On some important classes of row-cyclic array codes.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arithmetic","score_opus":0.01814946058551173,"score_gpt":0.24532041511584582,"score_spread":0.2271709545303341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397365124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98986,0.00049384014,0.0010080008,0.0003821678,0.0028498266,0.00012529473,0.000002812473,0.00020216087,0.0050759222],"genre_scores_gemma":[0.99890316,0.000024436098,0.0007650324,0.00023692216,0.000007821803,0.000008399065,0.0000015477686,0.000009863619,0.000042827076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870116,0.0000978548,0.00028984112,0.00030177349,0.0003575292,0.00025184083],"domain_scores_gemma":[0.9986514,0.00018853197,0.0001609202,0.00073480327,0.000096412085,0.00016797375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005796061,0.00014924184,0.00023246148,0.0001430654,0.00006237848,0.00005659904,0.0008546293,0.00006741508,0.000007689316],"category_scores_gemma":[0.00011683175,0.00013578177,0.000106593594,0.00047017226,0.00008270861,0.0003248256,0.00011516185,0.00014132887,0.00003584887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020956206,0.00017147763,0.0018017174,0.0000056258245,0.000020674965,0.000010608279,0.0002970224,0.000006104513,0.0012151292,0.9941209,0.0018015341,0.000528228],"study_design_scores_gemma":[0.00062180375,0.00040576168,0.0007468262,0.000026770866,0.0000069199336,0.0000049361274,0.000026823389,0.00011123481,0.0140979765,0.98230225,0.0014867776,0.00016194927],"about_ca_topic_score_codex":0.000009433709,"about_ca_topic_score_gemma":0.0000014690442,"teacher_disagreement_score":0.012882847,"about_ca_system_score_codex":0.000030156443,"about_ca_system_score_gemma":0.00009305339,"threshold_uncertainty_score":0.553702},"labels":[],"label_agreement":null},{"id":"W2398708703","doi":"","title":"A Class of Optimal Quaternary Codes.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Quaternary; Computer science; Artificial intelligence; Geology; Paleontology","score_opus":0.008590512753979802,"score_gpt":0.22932575634966754,"score_spread":0.22073524359568775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398708703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899381,0.000030108138,0.003330439,0.00020570381,0.0025652407,0.0000645213,0.0000013332769,0.00012659034,0.0037379996],"genre_scores_gemma":[0.99433786,0.0000034730192,0.0055286665,0.00006416593,0.000007066072,0.0000059205713,7.456572e-7,0.000006446008,0.00004563168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999191,0.00004508677,0.0001702796,0.00022154755,0.00018349172,0.00018862996],"domain_scores_gemma":[0.99904466,0.000104567065,0.00008180155,0.00062381214,0.00006757957,0.000077557794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003425597,0.000099814584,0.00014562231,0.000092527145,0.00006637659,0.000046444027,0.00096526096,0.0000683846,0.000028331857],"category_scores_gemma":[0.000028116685,0.00009608676,0.000092051705,0.00032378224,0.000098155826,0.00022654502,0.00022684244,0.00021333469,0.000029373025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009345253,0.00009243933,0.0026487238,0.0000051642846,0.000013387759,0.000007776726,0.0002675068,0.0000030968386,0.010253609,0.983578,0.0003938919,0.0027270566],"study_design_scores_gemma":[0.00059887813,0.00020973821,0.003018345,0.000014385148,0.000007488188,0.00001819834,0.000016459115,0.005300948,0.024239155,0.9620036,0.0043691294,0.0002037057],"about_ca_topic_score_codex":0.000014181551,"about_ca_topic_score_gemma":0.000002158708,"teacher_disagreement_score":0.02157443,"about_ca_system_score_codex":0.00000484978,"about_ca_system_score_gemma":0.00003566583,"threshold_uncertainty_score":0.39183044},"labels":[],"label_agreement":null},{"id":"W2399198710","doi":"","title":"A note on B-T unitals in PG(2, q 2 ).","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00832955309734428,"score_gpt":0.23864861226549516,"score_spread":0.23031905916815087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399198710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98231626,0.000008875672,0.000301585,0.00045286104,0.0023018399,0.00008583362,4.0444522e-7,0.0001436048,0.014388712],"genre_scores_gemma":[0.99877137,0.0000020669709,0.00081945694,0.00032530335,0.0000073769647,0.00001035571,5.713815e-7,0.0000067399264,0.000056773868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991375,0.000063223044,0.00013504508,0.00026520962,0.00016554495,0.00023348606],"domain_scores_gemma":[0.9990251,0.00019378761,0.000038576152,0.0006368078,0.000030605763,0.00007509133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043052118,0.00010871387,0.00011356007,0.00019267225,0.00007347457,0.00008475522,0.0008037176,0.00007484062,0.00002289451],"category_scores_gemma":[0.000079275036,0.00010566563,0.00005592691,0.00065649865,0.000044573088,0.00021397756,0.00013954574,0.0003598191,0.0001385475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072957578,0.00011145996,0.0014873422,0.000001668819,0.0000023321209,0.000017140808,0.0002665957,0.0000017851754,0.0010372282,0.98847884,0.0002822487,0.008306064],"study_design_scores_gemma":[0.00063147105,0.00015223338,0.007497392,0.000013146653,0.0000012138015,0.0000040731707,0.0000046337254,0.0004593811,0.0026596677,0.98381364,0.0046139057,0.00014925476],"about_ca_topic_score_codex":0.000011846844,"about_ca_topic_score_gemma":0.000019258268,"teacher_disagreement_score":0.016455071,"about_ca_system_score_codex":0.0000114846835,"about_ca_system_score_gemma":0.000030230934,"threshold_uncertainty_score":0.43089193},"labels":[],"label_agreement":null},{"id":"W2399318769","doi":"","title":"Partial permutation decoding of some binary codes from graphs on triples.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Combinatorics; Binary number; Decoding methods; Discrete mathematics; Arithmetic; Algorithm","score_opus":0.014593370501067508,"score_gpt":0.2449338908685824,"score_spread":0.23034052036751487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399318769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959403,0.00019813012,0.0014095338,0.00031692928,0.0012290017,0.00010316002,0.0000050890712,0.00015472302,0.0006431132],"genre_scores_gemma":[0.998604,0.000030549978,0.0010789451,0.00024879177,0.0000122193915,0.0000048657057,0.000007900853,0.000005789981,0.000006956477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988222,0.00012427857,0.00025649375,0.0003223688,0.00026074128,0.00021392136],"domain_scores_gemma":[0.9990555,0.00023032953,0.00013275271,0.0004543335,0.000050349667,0.000076736134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028316895,0.00014310298,0.00020893266,0.00019912413,0.00013748967,0.00006537466,0.00057352684,0.00006796093,0.00001339297],"category_scores_gemma":[0.00004520196,0.00014229283,0.00013633148,0.00048577503,0.00005257764,0.0004183983,0.00005533473,0.00012502859,0.00001558645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049390812,0.00019414269,0.0006460754,0.0000024884123,0.000016952768,0.000008976922,0.00050320773,0.000034628196,0.0052929446,0.9797625,0.00024208002,0.013246599],"study_design_scores_gemma":[0.00071007217,0.000525447,0.011446515,0.000042316475,0.000011710233,9.540281e-7,0.000025357353,0.0028882967,0.019574728,0.96448517,0.000121974896,0.00016744554],"about_ca_topic_score_codex":0.000011986375,"about_ca_topic_score_gemma":5.035024e-7,"teacher_disagreement_score":0.015277332,"about_ca_system_score_codex":0.000019472644,"about_ca_system_score_gemma":0.000028635937,"threshold_uncertainty_score":0.58025336},"labels":[],"label_agreement":null},{"id":"W2399524571","doi":"","title":"Cross recurrence relations for r-Lah numbers.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Recurrence relation; Combinatorics","score_opus":0.01372081933889435,"score_gpt":0.2596190871288584,"score_spread":0.24589826778996404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399524571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8697391,0.00023081707,0.10107455,0.0017830116,0.006761093,0.00090527354,0.0000065779213,0.0006304144,0.018869158],"genre_scores_gemma":[0.98987377,0.0000040543296,0.00916668,0.00014964963,0.000009335443,0.0001427871,0.0000030419887,0.000007828318,0.0006428327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990842,0.000045282217,0.00017322204,0.000300827,0.00013203848,0.00026442815],"domain_scores_gemma":[0.99884903,0.0002884521,0.00006942745,0.0005322236,0.00016814277,0.00009273408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002727273,0.00010737321,0.000105330866,0.00006517905,0.00029983665,0.0002797034,0.00075648254,0.00006299092,0.00009121534],"category_scores_gemma":[0.000106851214,0.00010798052,0.00010127942,0.00043607742,0.00006891376,0.00075409346,0.00013268623,0.00011230631,0.00034143863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020999196,0.000045347693,0.0040377816,0.0000040639948,0.00000815548,4.0395264e-7,0.00023713276,0.0000041227077,0.00004596108,0.981585,0.006459388,0.007570512],"study_design_scores_gemma":[0.00037556555,0.000072765484,0.008593094,0.000012670929,0.0000033900749,0.0000024443932,0.000009578626,0.0020099424,0.0002804969,0.97757876,0.010907382,0.00015391281],"about_ca_topic_score_codex":0.00002017868,"about_ca_topic_score_gemma":0.0000012032825,"teacher_disagreement_score":0.12013469,"about_ca_system_score_codex":0.000020495938,"about_ca_system_score_gemma":0.00003346866,"threshold_uncertainty_score":0.4403318},"labels":[],"label_agreement":null},{"id":"W2399684368","doi":"","title":"Some ternary codes invariant under the group M c L: 2.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ternary operation; Invariant (physics); Group (periodic table); Combinatorics; Pure mathematics; Discrete mathematics; Mathematical physics; Physics; Computer science; Programming language; Quantum mechanics","score_opus":0.015866921290328014,"score_gpt":0.23044727431546969,"score_spread":0.21458035302514167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399684368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587437,0.0032113849,0.01852441,0.0032987609,0.010840116,0.0003007128,0.0000023010994,0.00056881394,0.004509801],"genre_scores_gemma":[0.9978488,0.000033328426,0.0007111534,0.0012580233,0.00006161939,0.000018182336,0.0000011233482,0.000009957679,0.000057801335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988544,0.0001892671,0.00014633313,0.00020024153,0.00022455759,0.00038520969],"domain_scores_gemma":[0.9988183,0.00025880855,0.00006317039,0.00072190573,0.0000228072,0.0001150095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077623496,0.00013494772,0.00011909602,0.000061637445,0.00028154158,0.00014393008,0.0011618641,0.000053468644,0.000015519052],"category_scores_gemma":[0.0000149330635,0.00009409498,0.000091574904,0.00034174672,0.000093862865,0.0008502341,0.0003985039,0.0001805369,0.0001135217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004311302,0.00011975607,0.0023200843,0.0000025887766,0.000024537154,0.0000027798662,0.00042566122,0.0000016638893,0.00027740325,0.99455714,0.0013070526,0.0009570329],"study_design_scores_gemma":[0.0002508056,0.00005659691,0.0155499615,0.000010081177,0.000008978081,0.000017900134,0.00005896442,0.00028999956,0.00035736433,0.9781801,0.0050638593,0.00015535706],"about_ca_topic_score_codex":0.000015915917,"about_ca_topic_score_gemma":9.5237135e-7,"teacher_disagreement_score":0.039105114,"about_ca_system_score_codex":0.000021384,"about_ca_system_score_gemma":0.000016398022,"threshold_uncertainty_score":0.3837082},"labels":[],"label_agreement":null},{"id":"W2399866138","doi":"","title":"On the Nonexistence of q-ary Linear Codes Attaining the Griesmer Bound.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.017822214905014656,"score_gpt":0.2465012744620836,"score_spread":0.22867905955706896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399866138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97301424,0.00027258947,0.0031353105,0.006899718,0.0013457916,0.00021991156,0.0000019349193,0.00015175113,0.014958748],"genre_scores_gemma":[0.99768716,0.000013042793,0.00048572465,0.001741989,0.000009979146,0.0000061049705,5.0465445e-7,0.0000045795964,0.00005092319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998908,0.00018643413,0.00018499354,0.00021938795,0.00028312058,0.00021807391],"domain_scores_gemma":[0.99812233,0.0008036907,0.000107561114,0.0008517886,0.00006773871,0.000046876237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008564355,0.0001248837,0.00013780325,0.00004738949,0.0003894958,0.00008541099,0.0014086978,0.000041165258,0.000015898777],"category_scores_gemma":[0.00015138258,0.00007164952,0.00010657388,0.00055368413,0.00020305502,0.00013414642,0.00013002024,0.00022770342,0.000019903127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014625509,0.00006199819,0.00017310548,0.0000017116229,0.0000131231955,0.0000028975276,0.0008658211,0.000019851113,0.00016593278,0.9951136,0.0009906278,0.0025766713],"study_design_scores_gemma":[0.00017482834,0.00030885058,0.0021224273,0.000037428388,0.000006895183,0.000004164034,0.000098444674,0.0014039294,0.0015712038,0.9919795,0.0021836895,0.000108662716],"about_ca_topic_score_codex":0.000006756872,"about_ca_topic_score_gemma":6.3644234e-7,"teacher_disagreement_score":0.024672907,"about_ca_system_score_codex":0.00001094928,"about_ca_system_score_gemma":0.000048289658,"threshold_uncertainty_score":0.29957262},"labels":[],"label_agreement":null},{"id":"W2400913317","doi":"","title":"Polyadic codes of prime power length II.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Prime (order theory); Prime power; Power (physics); Discrete mathematics; Combinatorics; Physics","score_opus":0.006262531670610861,"score_gpt":0.2108940216835395,"score_spread":0.20463149001292863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400913317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9734421,0.00015959164,0.008741091,0.00027377193,0.0016611941,0.00008848218,0.0000010425598,0.00019561985,0.015437122],"genre_scores_gemma":[0.9983037,0.0000050551894,0.0014561265,0.00012717555,0.000004890414,0.0000038166772,6.0623023e-7,0.0000075719518,0.00009106579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990352,0.000112853035,0.00018341815,0.00024324076,0.00020866493,0.00021666054],"domain_scores_gemma":[0.99893713,0.00014859933,0.000096573756,0.0006746144,0.0000649147,0.00007819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005097434,0.00011458587,0.00018270516,0.00011233175,0.0001344563,0.000034327342,0.0008477847,0.00005532586,0.000025587278],"category_scores_gemma":[0.000062544466,0.00010855463,0.00009697673,0.0003948465,0.00008479596,0.00020432853,0.00027484554,0.000104752304,0.000026763611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005392299,0.000102228216,0.0012671133,0.000004002677,0.000015891777,7.878478e-7,0.00042401906,7.7340763e-7,0.0013952722,0.99205047,0.00046776404,0.0042662965],"study_design_scores_gemma":[0.0004745956,0.00042884354,0.004320192,0.000024393259,0.0000071910968,0.0000036309166,0.000011413558,0.00046227768,0.014488723,0.97172254,0.0078857625,0.00017041988],"about_ca_topic_score_codex":0.000008383805,"about_ca_topic_score_gemma":5.6752316e-7,"teacher_disagreement_score":0.024861608,"about_ca_system_score_codex":0.000009836951,"about_ca_system_score_gemma":0.000027127433,"threshold_uncertainty_score":0.44267294},"labels":[],"label_agreement":null},{"id":"W2401164932","doi":"","title":"The Commuting Graph of the Quaternion Algebra over Residue Classes of Integers.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quaternion; Residue (chemistry); Quaternion algebra; Graph; Algebra over a field; Discrete mathematics; Combinatorics; Pure mathematics; Division algebra; Filtered algebra; Geometry; Chemistry; Organic chemistry","score_opus":0.00715967029032019,"score_gpt":0.2261953475328709,"score_spread":0.2190356772425507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401164932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99473494,0.00007703436,0.0005836395,0.0004885487,0.0028102403,0.000100845544,9.585086e-7,0.000041934607,0.0011618822],"genre_scores_gemma":[0.99965614,0.000013595746,0.0002442237,0.000053552885,0.000005391654,0.0000043513733,2.3798925e-7,0.0000062824133,0.000016200425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894184,0.00020399484,0.0002615131,0.00015794294,0.00025408936,0.00018061507],"domain_scores_gemma":[0.99795526,0.0006140859,0.00024032145,0.0010598054,0.0000989884,0.0000315587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090402237,0.00010259265,0.0001356751,0.00005511179,0.00027765174,0.00006168542,0.0017902442,0.000061710336,0.0000055720175],"category_scores_gemma":[0.000148663,0.000060971604,0.00015358946,0.0005549792,0.00032372453,0.00015422245,0.00046604685,0.00032702615,0.0000017231644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009308446,0.00004142113,0.016933516,0.0000072839066,0.000018326466,3.1144242e-7,0.00043832668,0.000001060933,0.008665376,0.9706771,0.0002795897,0.002928379],"study_design_scores_gemma":[0.00023949558,0.00006219366,0.031111643,0.000037461672,0.0000073647548,0.0000024423389,0.000068535024,0.00027211776,0.055047486,0.9121424,0.00092405156,0.00008478706],"about_ca_topic_score_codex":0.00007542345,"about_ca_topic_score_gemma":0.000046399477,"teacher_disagreement_score":0.058534678,"about_ca_system_score_codex":0.000005177666,"about_ca_system_score_gemma":0.000037119888,"threshold_uncertainty_score":0.3326749},"labels":[],"label_agreement":null},{"id":"W2401383348","doi":"10.55016/ojs/cdm.v20i2.62715","title":"Reversed Dickson polynomials of the (k+1)-th kind over finite fields, II","year":2025,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Finite field; Combinatorics; Permutation (music); Mathematics; Prime (order theory); Generalization; Polynomial; Algebraic number; Discrete mathematics; Physics","score_opus":0.007535830103252515,"score_gpt":0.26938227219524385,"score_spread":0.2618464420919913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401383348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032725427,0.0000835667,0.9540989,0.0065583833,0.00044991067,0.0004710826,0.00013071447,0.00008180393,0.0054002022],"genre_scores_gemma":[0.99150914,0.000007145915,0.0065576276,0.00074314966,0.000028237188,0.000028340146,0.0000027137123,0.0000048412307,0.0011187892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989207,0.00008587363,0.00036310413,0.00020718477,0.00018558942,0.00023755335],"domain_scores_gemma":[0.99816865,0.00047555997,0.00014266874,0.001018732,0.0001335932,0.000060771086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004827638,0.00013561237,0.00024831985,0.00013809622,0.00039159288,0.000073201096,0.0010507923,0.00008200753,0.000039600065],"category_scores_gemma":[0.0008747748,0.00009792823,0.0002162165,0.0010038929,0.00008948166,0.000117696814,0.00070187007,0.00013676535,0.000009967486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072113485,0.00007736235,0.000122054094,0.000035638997,0.00004849967,5.407182e-7,0.0009374016,0.000088913024,0.00095682766,0.9903699,0.006563886,0.00079172524],"study_design_scores_gemma":[0.0015093719,0.00021075556,0.0034359153,0.0010226744,0.00020904481,0.0000044855133,0.00024572262,0.018247312,0.033455305,0.88548714,0.05560552,0.000566774],"about_ca_topic_score_codex":0.000009441919,"about_ca_topic_score_gemma":0.000010137151,"teacher_disagreement_score":0.95878375,"about_ca_system_score_codex":0.000037275568,"about_ca_system_score_gemma":0.00009673182,"threshold_uncertainty_score":0.39933974},"labels":[],"label_agreement":null},{"id":"W2401573281","doi":"","title":"SMT-LIB Sequences and Regular Expressions.","year":2012,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematics; Combinatorics","score_opus":0.01387313523128612,"score_gpt":0.22706727035515772,"score_spread":0.21319413512387161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401573281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54024214,0.0019574112,0.40742376,0.0017408624,0.00078375184,0.00011337277,5.808913e-7,0.0005320817,0.04720602],"genre_scores_gemma":[0.96840525,0.000018030221,0.030801604,0.0003534538,0.00006242496,0.0000041093267,1.3558598e-7,0.000001929729,0.0003530859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995203,0.000044575536,0.000059648253,0.00012232424,0.000084679385,0.00016845223],"domain_scores_gemma":[0.9995699,0.00005411541,0.000017210017,0.00025088617,0.000010072943,0.00009785047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002525289,0.000055178527,0.000052050225,0.000045103294,0.00010567269,0.00006309469,0.00026836665,0.000024239289,0.000056868095],"category_scores_gemma":[0.000009231735,0.000039827417,0.000023844803,0.0001520583,0.00005176355,0.0005737329,0.00016276853,0.000039645736,0.000018805895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001237109,0.000019483638,0.0040360712,0.0000031033226,0.000003936823,8.766356e-7,0.0005534368,3.529164e-7,0.003988191,0.972603,0.0013463304,0.017443975],"study_design_scores_gemma":[0.00059697527,0.0002015271,0.04940209,0.00010645088,0.000018783727,0.00015361035,0.0006099495,0.0020853186,0.0774409,0.6044785,0.26393533,0.00097060314],"about_ca_topic_score_codex":0.0000033158092,"about_ca_topic_score_gemma":3.3197497e-7,"teacher_disagreement_score":0.42816308,"about_ca_system_score_codex":0.0000020452824,"about_ca_system_score_gemma":0.0000055490214,"threshold_uncertainty_score":0.16241148},"labels":[],"label_agreement":null},{"id":"W2401651790","doi":"","title":"Three Constructions of Authentication Codes from Power Function over Finite Fields with Perfect Secrecy.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Secrecy; Mathematics; Finite field; Function (biology); Authentication (law); Power (physics); Discrete mathematics; Computer security; Computer science; Physics; Quantum mechanics; Cell biology","score_opus":0.008987900367935085,"score_gpt":0.21028665324216422,"score_spread":0.20129875287422913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401651790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8151628,0.00011293403,0.18174309,0.00005116662,0.0015356472,0.000082354985,0.0000044081744,0.00008284948,0.0012247748],"genre_scores_gemma":[0.99806845,0.0000035843016,0.0018365156,0.000046077887,0.000011963078,0.000010472852,0.000005683309,0.000006177789,0.000011091146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992828,0.000055590404,0.00014176141,0.00017614738,0.00017268106,0.00017104261],"domain_scores_gemma":[0.9990502,0.00025471067,0.00009909675,0.00045622067,0.00007309038,0.00006665437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020350299,0.00010309053,0.00012456303,0.000086217624,0.00011662363,0.000040113475,0.0002459223,0.000068496964,0.0001345097],"category_scores_gemma":[0.000024773617,0.00008982738,0.000062307365,0.00034754977,0.000087881104,0.00044969562,0.000067267705,0.00011557736,0.0000162939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029642688,0.000096386655,0.05831793,0.0000032483927,0.000052093597,2.4827406e-7,0.0007215576,0.0000043532614,0.00045077136,0.93874264,0.00011671353,0.0014644156],"study_design_scores_gemma":[0.0005351167,0.0002516753,0.15433481,0.000030090141,0.00004721864,0.000003344961,0.00006613583,0.0008631732,0.0015666367,0.8416554,0.0004844931,0.00016194358],"about_ca_topic_score_codex":0.00004235179,"about_ca_topic_score_gemma":0.000010696091,"teacher_disagreement_score":0.18290566,"about_ca_system_score_codex":0.000012331744,"about_ca_system_score_gemma":0.000024110166,"threshold_uncertainty_score":0.3663054},"labels":[],"label_agreement":null},{"id":"W2402289345","doi":"","title":"Lower bounds for quaternary covering codes.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quaternary; Combinatorics; Geology; Paleontology","score_opus":0.023112464159223516,"score_gpt":0.23306696475913471,"score_spread":0.2099545005999112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402289345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.868159,0.00017627404,0.10735955,0.00010977437,0.008105426,0.00029365183,0.000004113631,0.0004955058,0.015296724],"genre_scores_gemma":[0.9937162,0.000007069688,0.0059149186,0.00017909582,0.000009550463,0.000033197695,0.0000011066825,0.000011933932,0.00012693858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912345,0.0000324408,0.00015166838,0.000288943,0.00012668643,0.0002768265],"domain_scores_gemma":[0.9991937,0.000087739514,0.000059448816,0.0005185026,0.000057563997,0.00008302485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032177672,0.0001245765,0.00013525279,0.000076564924,0.00016130824,0.00009174807,0.00082504883,0.0000537275,0.000026818328],"category_scores_gemma":[0.000020754866,0.00012526855,0.00011955771,0.00022306065,0.000049548424,0.00036925057,0.00018499854,0.00007964437,0.00003766871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034114677,0.00010237986,0.0015741778,0.000007914457,0.000021980251,0.00000979864,0.0005999084,5.691991e-7,0.00021333876,0.9941142,0.00083042623,0.002491153],"study_design_scores_gemma":[0.00053327694,0.00030759178,0.00116048,0.000017225215,0.000007342306,0.0000060000984,0.000011630794,0.0012289834,0.0031340509,0.9861076,0.007286948,0.00019885767],"about_ca_topic_score_codex":0.000018537938,"about_ca_topic_score_gemma":0.0000013151389,"teacher_disagreement_score":0.12555721,"about_ca_system_score_codex":0.000019886013,"about_ca_system_score_gemma":0.0000271764,"threshold_uncertainty_score":0.5108303},"labels":[],"label_agreement":null},{"id":"W2402809063","doi":"","title":"Cyclic and Negacyclic codes of length 2 m over finite fields.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017466509688733475,"score_gpt":0.2408639349457849,"score_spread":0.22339742525705142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402809063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917053,0.0004307835,0.0024193584,0.00022222952,0.00091508153,0.00007112219,0.000001273985,0.000090717826,0.004144107],"genre_scores_gemma":[0.9988942,0.000035933397,0.0008479524,0.00015962093,0.000006124343,0.0000041937374,7.2870625e-7,0.000005361881,0.000045896944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919945,0.00007907502,0.00016182884,0.00021617016,0.00017617065,0.00016727684],"domain_scores_gemma":[0.9990762,0.00024842226,0.00007431457,0.0004291289,0.000053444885,0.00011847434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032178595,0.00010346801,0.0001656622,0.000094727846,0.000053064425,0.000058632726,0.0004390232,0.0000617247,0.0000060966313],"category_scores_gemma":[0.00010297239,0.00009803732,0.00005076343,0.00032038515,0.000080264115,0.00029088708,0.00022924325,0.00010789548,0.0000078455105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011239872,0.000058744325,0.00616771,0.000007728278,0.000016696597,0.0000042128413,0.00082634814,0.000006392699,0.00010547912,0.9867832,0.0010433391,0.004968932],"study_design_scores_gemma":[0.0007832645,0.00020617196,0.005310406,0.00001985523,0.000008214726,0.0000041163075,0.000036777437,0.0012621423,0.0015547501,0.98731047,0.003358675,0.00014516644],"about_ca_topic_score_codex":0.000029944753,"about_ca_topic_score_gemma":0.0000036431618,"teacher_disagreement_score":0.0071888613,"about_ca_system_score_codex":0.000007664517,"about_ca_system_score_gemma":0.000028660521,"threshold_uncertainty_score":0.3997846},"labels":[],"label_agreement":null},{"id":"W2402992158","doi":"","title":"Decoding of Blockwise-Burst Errors in Row-Cyclic Array Codes.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Mathematics; Burst error; Algorithm; Arithmetic","score_opus":0.010168663790176925,"score_gpt":0.22999640153959613,"score_spread":0.21982773774941922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402992158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9820339,0.000102585815,0.009488407,0.00026650509,0.0014305213,0.00011376853,8.008857e-7,0.00012926492,0.006434216],"genre_scores_gemma":[0.99700266,0.000010845062,0.002826563,0.00010694183,0.00000753043,0.000010487194,9.5148897e-7,0.0000112399675,0.000022788554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855393,0.00017787491,0.0003317245,0.0003601044,0.00024282659,0.0003335252],"domain_scores_gemma":[0.9987256,0.00028802946,0.00014155399,0.00069420406,0.000052710195,0.00009788241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089091377,0.00016238203,0.00028732533,0.00027263077,0.00008834788,0.000050158633,0.0010351719,0.00008226775,0.0000129049795],"category_scores_gemma":[0.000116977455,0.00016799185,0.00011350093,0.00088236196,0.00008951958,0.00025639127,0.00015240567,0.00018455417,0.00001990333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000907286,0.0001155853,0.0146779055,0.000013855812,0.0000114232125,0.000002907553,0.0005339041,0.000028810367,0.004106419,0.97581786,0.000098359684,0.0045839227],"study_design_scores_gemma":[0.0009557273,0.00016235905,0.0124927405,0.00009195206,0.000008317487,0.000004494934,0.000039572773,0.0024761937,0.015202305,0.9665101,0.0017765716,0.00027965236],"about_ca_topic_score_codex":0.000027489528,"about_ca_topic_score_gemma":0.000013297249,"teacher_disagreement_score":0.014968721,"about_ca_system_score_codex":0.000029277067,"about_ca_system_score_gemma":0.000029886642,"threshold_uncertainty_score":0.68505085},"labels":[],"label_agreement":null},{"id":"W2404051240","doi":"","title":"A New Construction of Multisender Authentication Codes from Symplectic Geometry over Finite Fields.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Finite field; Authentication (law); Geometry; Finite geometry; Pure mathematics; Discrete mathematics; Computer science; Computer security","score_opus":0.012724433974006313,"score_gpt":0.2380994169142365,"score_spread":0.22537498294023017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404051240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86032313,0.00027389385,0.1362774,0.00008041045,0.0024608108,0.000081732076,0.00000314244,0.00009234851,0.00040714256],"genre_scores_gemma":[0.9877263,0.000012402759,0.012149774,0.000052196967,0.000021024664,0.0000038485023,0.0000040930813,0.0000057139296,0.000024685723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917865,0.00007851889,0.00018779289,0.00018073668,0.00017804996,0.00019627255],"domain_scores_gemma":[0.998925,0.00038071803,0.00012096444,0.00042578718,0.000046792404,0.00010077764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019009865,0.0000999138,0.00013877221,0.00013736647,0.000072555114,0.00004187736,0.00032011085,0.000078637255,0.00009917299],"category_scores_gemma":[0.00008429865,0.000102146805,0.000076969605,0.00049078907,0.00004495897,0.0004390916,0.000103029066,0.00010355484,0.000021730064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008209033,0.00006949035,0.030036049,0.000005924519,0.000038238104,2.3758415e-7,0.0010090979,0.0000026681105,0.00083293114,0.95731884,0.0002479253,0.010430398],"study_design_scores_gemma":[0.00054091064,0.00004797355,0.049640663,0.000023515362,0.000027696455,0.0000025813629,0.000040734143,0.0014030469,0.007894088,0.93988055,0.00035157814,0.00014669068],"about_ca_topic_score_codex":0.00009300574,"about_ca_topic_score_gemma":0.0000024280746,"teacher_disagreement_score":0.12740315,"about_ca_system_score_codex":0.000018031611,"about_ca_system_score_gemma":0.000031110107,"threshold_uncertainty_score":0.4165426},"labels":[],"label_agreement":null},{"id":"W2404171455","doi":"","title":"Codes from embeddings of the strong product of triangular graphs and K 2 and certain induced subgraphs.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Product (mathematics); Combinatorics; Discrete mathematics; Geometry","score_opus":0.013755864142924078,"score_gpt":0.23026023959278832,"score_spread":0.21650437544986426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404171455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99763376,0.0012192893,0.000070830894,0.00010016049,0.0006299396,0.0001594318,0.0000045577194,0.000028645854,0.00015336089],"genre_scores_gemma":[0.999417,0.000023781095,0.00052006374,0.000018605031,0.0000045732295,0.0000050757626,6.7697465e-7,0.0000061233463,0.000004083391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903256,0.00016275224,0.00020551553,0.00021986557,0.00018340051,0.00019588626],"domain_scores_gemma":[0.9990233,0.00018363925,0.00016544558,0.00050184363,0.00005420828,0.00007155754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057136995,0.00012022187,0.00021995918,0.00010141792,0.00009489665,0.000029270945,0.0004192098,0.000047749956,0.0000031156699],"category_scores_gemma":[0.00007572759,0.000090867,0.000075071686,0.0005103591,0.00017235753,0.00029387957,0.00024807203,0.000110077235,2.0251042e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014042199,0.00007086679,0.08799516,0.000014000489,0.000041472045,2.3843631e-7,0.0017854031,1.381581e-7,0.014134268,0.89334565,0.000035357923,0.00256343],"study_design_scores_gemma":[0.000700184,0.00009304452,0.16187708,0.000049051778,0.00003511132,0.0000030854042,0.00015434183,0.00006512975,0.06960619,0.76719284,0.00008093059,0.0001430333],"about_ca_topic_score_codex":0.00010693159,"about_ca_topic_score_gemma":0.000003014952,"teacher_disagreement_score":0.12615281,"about_ca_system_score_codex":0.000004303281,"about_ca_system_score_gemma":0.000016698386,"threshold_uncertainty_score":0.37054485},"labels":[],"label_agreement":null},{"id":"W2404868863","doi":"","title":"Self-dual Codes and Cyclic Codes over F p + vF p .","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dual (grammatical number); Discrete mathematics; Linguistics; Philosophy","score_opus":0.006912133094755612,"score_gpt":0.2196881174003381,"score_spread":0.2127759843055825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404868863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98852164,0.00020728138,0.0034875243,0.00025028738,0.0012042606,0.0000994436,0.0000015772049,0.00047923814,0.0057487627],"genre_scores_gemma":[0.9963145,0.000034951543,0.003272898,0.00030332495,0.00001592426,0.00000849316,0.0000012578263,0.000009606894,0.00003903178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885356,0.00016270565,0.00015317129,0.00035724705,0.00020160875,0.00027171732],"domain_scores_gemma":[0.99896175,0.00030955,0.000062590676,0.00050327275,0.000039179653,0.00012367828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053428067,0.0001550574,0.00018652948,0.000093960785,0.00020764583,0.0001985874,0.00045880178,0.000069237074,0.000009680305],"category_scores_gemma":[0.000044016528,0.00014745112,0.000060359656,0.00030782775,0.000083589824,0.0003082185,0.000272023,0.00013292945,0.000029613937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047694143,0.00006940294,0.0044286437,0.000011295275,0.00002255793,0.0000032694072,0.00040152215,6.918055e-7,0.00029341673,0.99019617,0.0007101614,0.0038581174],"study_design_scores_gemma":[0.0006670044,0.00017677275,0.010544471,0.000016863129,0.000013837803,0.000013724624,0.0000125196175,0.0038252675,0.0011719239,0.9663149,0.01699514,0.0002475754],"about_ca_topic_score_codex":0.000009932538,"about_ca_topic_score_gemma":0.0000033504712,"teacher_disagreement_score":0.023881253,"about_ca_system_score_codex":0.000012659855,"about_ca_system_score_gemma":0.00001622755,"threshold_uncertainty_score":0.60128826},"labels":[],"label_agreement":null},{"id":"W2404878880","doi":"10.48550/arxiv.1212.3849","title":"Every locally characterized affine-invariant property is testable","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Affine transformation; Invariant (physics); Bounded function; Discrete mathematics; Linear subspace; Property testing; Combinatorics; Inverse; Pure mathematics","score_opus":0.05273397533382641,"score_gpt":0.16332131999734845,"score_spread":0.11058734466352203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404878880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35120496,0.000053610504,0.62975055,0.0003258251,0.00045811667,0.00021769785,0.0000054948036,0.00043648417,0.017547226],"genre_scores_gemma":[0.9935861,0.00003130413,0.0012679294,0.0005412789,0.00008731775,7.122717e-7,0.0000016842635,0.000010138455,0.0044735298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987666,0.00011111356,0.000120191915,0.0004344594,0.00007461762,0.0004929921],"domain_scores_gemma":[0.9988333,0.00007257228,0.00008214777,0.00071689516,0.000073065385,0.00022202697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035019225,0.00017860328,0.000172857,0.00015435168,0.00020616998,0.00007806604,0.00092796003,0.00008006092,0.0002172402],"category_scores_gemma":[0.000020540192,0.00014773294,0.0001317107,0.00096188684,0.000090093905,0.0014444588,0.00028180584,0.00015143072,0.00033794125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013723879,0.0006060289,0.012948585,0.000024581246,0.00008318542,0.00011775362,0.0011001051,0.00015019371,0.0057820254,0.97072,0.0020371738,0.0062931394],"study_design_scores_gemma":[0.010448896,0.0015118297,0.10266822,0.0007290136,0.00053123996,0.00031386287,0.00080671534,0.39933,0.031575438,0.20074984,0.2448628,0.006472158],"about_ca_topic_score_codex":0.000021056145,"about_ca_topic_score_gemma":0.0000017515978,"teacher_disagreement_score":0.7699701,"about_ca_system_score_codex":0.000056098685,"about_ca_system_score_gemma":0.00006667129,"threshold_uncertainty_score":0.60243744},"labels":[],"label_agreement":null},{"id":"W2405745185","doi":"","title":"A self-orthogonal doubly-even code invariant under M c L.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Invariant (physics); Combinatorics; Pure mathematics; Mathematical physics","score_opus":0.01297457008147015,"score_gpt":0.23292094683837236,"score_spread":0.2199463767569022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405745185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.875129,0.00060124433,0.062507,0.0098079145,0.0052702134,0.00063226477,0.000007278509,0.0025393476,0.043505754],"genre_scores_gemma":[0.99181205,0.000015968586,0.0066592903,0.0014043633,0.000016665526,0.0000080746595,0.0000023928849,0.00000864019,0.00007254873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851817,0.00012482441,0.00022332538,0.00043236863,0.00031879498,0.00038254334],"domain_scores_gemma":[0.99886,0.00010950782,0.00008381874,0.00070769154,0.00007544595,0.00016352603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004869936,0.00018919345,0.00019174846,0.00013493995,0.00021900526,0.00019513874,0.001090431,0.00009206641,0.000024451347],"category_scores_gemma":[0.000018241702,0.00018426728,0.00012942319,0.00070408673,0.00003563402,0.00043412624,0.00016916283,0.00022123032,0.000101726175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012236944,0.00022532283,0.00023662814,0.0000031165828,0.000026054193,0.000025359544,0.00030443165,0.00001270318,0.00021675637,0.995172,0.0011249528,0.0026404045],"study_design_scores_gemma":[0.0007583864,0.00022750816,0.00682067,0.000014152006,0.000011450191,0.00002758626,0.000009855817,0.0012934628,0.00044072722,0.983368,0.0067693326,0.00025889938],"about_ca_topic_score_codex":0.0000026735183,"about_ca_topic_score_gemma":0.000002135095,"teacher_disagreement_score":0.11668308,"about_ca_system_score_codex":0.000038541446,"about_ca_system_score_gemma":0.0000918848,"threshold_uncertainty_score":0.75142014},"labels":[],"label_agreement":null},{"id":"W2405774736","doi":"","title":"The digraphs from finite fields.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Finite field; Pure mathematics; Combinatorics","score_opus":0.017489910646369483,"score_gpt":0.20540920711880778,"score_spread":0.1879192964724383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405774736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86227846,0.0016656134,0.03348972,0.0010734425,0.012751076,0.00030082755,0.0000051951847,0.0008421964,0.08759349],"genre_scores_gemma":[0.99858934,0.00005148171,0.0010075852,0.000250948,0.0000068949976,0.00001185868,6.8404256e-7,0.000005093598,0.000076116376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992012,0.00008350899,0.00013248515,0.00022401508,0.00014042434,0.00021840745],"domain_scores_gemma":[0.99861026,0.00046046838,0.00005294762,0.00077386614,0.000036257035,0.000066181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024152169,0.00009971192,0.00008377033,0.000039945127,0.0003133695,0.00011719199,0.0012765101,0.000051962917,0.000032642627],"category_scores_gemma":[0.000047217894,0.00007190434,0.00009885232,0.00033225567,0.0000746507,0.00020289513,0.00021842189,0.0001464318,0.00008278228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007812083,0.000034072855,0.0020512922,4.7333364e-7,0.000019772042,0.0000058225023,0.0009068423,1.847601e-7,0.000010723294,0.98526025,0.0010406497,0.010662091],"study_design_scores_gemma":[0.00017820114,0.00006569002,0.0064559532,0.000006034521,0.0000046657497,5.734409e-7,0.0000276302,0.00023170939,0.00083126035,0.98407805,0.008012264,0.000107945045],"about_ca_topic_score_codex":0.000068379486,"about_ca_topic_score_gemma":0.000012304548,"teacher_disagreement_score":0.13631089,"about_ca_system_score_codex":0.0000046140435,"about_ca_system_score_gemma":0.000015552121,"threshold_uncertainty_score":0.2932174},"labels":[],"label_agreement":null},{"id":"W2406073954","doi":"","title":"Lattices Generated by Subspaces under Symplectic Group over a Finite Field.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear subspace; Symplectic geometry; Mathematics; Pure mathematics; Group (periodic table); Symplectic group; Field (mathematics); Finite field; Combinatorics; Physics; Quantum mechanics","score_opus":0.008412945792830077,"score_gpt":0.23048592114800145,"score_spread":0.22207297535517137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406073954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876171,0.0001961994,0.0060536116,0.0007591715,0.0033717977,0.00010022357,0.0000018023488,0.0002857587,0.0016143763],"genre_scores_gemma":[0.9981104,0.00001667695,0.00081539253,0.0008847548,0.000017086051,0.000015170302,0.0000040723107,0.000012258872,0.0001241982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881697,0.000097088945,0.00016263638,0.0003832354,0.00021718441,0.00032287033],"domain_scores_gemma":[0.9986228,0.0005183463,0.000082128325,0.00060181454,0.000056478242,0.000118463184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031286973,0.00017277055,0.00015418438,0.00010592603,0.0002337761,0.00030187008,0.000809749,0.00012583869,0.00012100425],"category_scores_gemma":[0.00006890155,0.00016351156,0.00008323711,0.0006720825,0.000057721347,0.0004480068,0.00017639174,0.0003351871,0.000044130236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007992124,0.00010234083,0.0026263713,0.0000050684766,0.00002969186,0.000004985751,0.0001927507,0.000002940991,0.012126833,0.97892976,0.0046598916,0.0013113945],"study_design_scores_gemma":[0.0006683719,0.00023561422,0.0027272173,0.000011237068,0.000016095582,0.000006393554,0.000015550355,0.0035842871,0.0077616167,0.9765966,0.008036789,0.0003402183],"about_ca_topic_score_codex":0.000043842865,"about_ca_topic_score_gemma":0.000051906387,"teacher_disagreement_score":0.010493332,"about_ca_system_score_codex":0.000009720464,"about_ca_system_score_gemma":0.000027265674,"threshold_uncertainty_score":0.6667808},"labels":[],"label_agreement":null},{"id":"W2406442302","doi":"","title":"Two Constructions of Multireceiver Authentication Codes from Symplectic Geometry over Finite Fields.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Finite field; Geometry; Pure mathematics; Discrete mathematics","score_opus":0.018435253564025006,"score_gpt":0.23745136593627753,"score_spread":0.21901611237225252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406442302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97992647,0.000065280896,0.015817488,0.00002307143,0.0016213623,0.00008817379,0.000008609261,0.00011668812,0.0023328336],"genre_scores_gemma":[0.9928387,0.000011795491,0.0070705814,0.000036351943,0.000005589648,0.000008301909,0.0000034890911,0.0000058632536,0.000019335726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915314,0.000087932945,0.00020698177,0.00024999864,0.00014679167,0.00015518151],"domain_scores_gemma":[0.9988294,0.00036506695,0.00012324922,0.0005340217,0.00008874277,0.00005948988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015600432,0.00010475364,0.00014854532,0.00016522242,0.000108974564,0.000031581072,0.0004971582,0.000059325874,0.00018668264],"category_scores_gemma":[0.000077758035,0.00010759725,0.00009085124,0.0005417645,0.00012044235,0.0002733602,0.00012378668,0.00010939266,0.00002641066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000097564025,0.00011825877,0.018696707,0.0000043327977,0.000049970127,0.0000012328314,0.0016929146,0.0000022375475,0.0009069126,0.97604436,0.0000609714,0.0024123355],"study_design_scores_gemma":[0.00057237624,0.00006868125,0.030680247,0.0000229104,0.00002817183,0.0000017502828,0.00006400071,0.0020319568,0.009678348,0.9566479,0.00006512014,0.00013857703],"about_ca_topic_score_codex":0.00018311081,"about_ca_topic_score_gemma":0.000009767763,"teacher_disagreement_score":0.01939651,"about_ca_system_score_codex":0.000013139934,"about_ca_system_score_gemma":0.000027478773,"threshold_uncertainty_score":0.43876886},"labels":[],"label_agreement":null},{"id":"W2406936419","doi":"","title":"External Difference Families over GF(q 2k ).","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Combinatorics","score_opus":0.00790448847446348,"score_gpt":0.21598888469067273,"score_spread":0.20808439621620925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406936419","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93939155,0.00010405803,0.050530635,0.00011786503,0.0024344993,0.00006525593,6.0569596e-7,0.00027060055,0.0070849387],"genre_scores_gemma":[0.9977316,0.00001704523,0.0016910702,0.00034905385,0.000017209648,0.000009517117,4.8200064e-7,0.000008197126,0.00017579584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988167,0.00012544947,0.00015935152,0.00034335427,0.0002675277,0.0002875788],"domain_scores_gemma":[0.9988853,0.00019959512,0.00006465688,0.00070058,0.000044018045,0.00010584992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032147585,0.00015370449,0.00016004517,0.00011130772,0.00016290751,0.00017176406,0.0010990992,0.000056049164,0.000028142353],"category_scores_gemma":[0.00005146536,0.0001408581,0.00009565956,0.00035785572,0.000076305514,0.00024676014,0.00029860585,0.00015391002,0.000079992824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048939223,0.00005207686,0.0073701623,0.000004511755,0.000006838721,0.0000027385356,0.00022927452,0.0000012653235,0.0009837357,0.96278435,0.00026619335,0.028293945],"study_design_scores_gemma":[0.00040282993,0.00011830313,0.06920004,0.000025796056,0.0000042130623,0.0000042681036,0.000006811514,0.0021239168,0.0011709966,0.92314297,0.0036064333,0.00019339767],"about_ca_topic_score_codex":0.000017036762,"about_ca_topic_score_gemma":0.0000020260886,"teacher_disagreement_score":0.061829876,"about_ca_system_score_codex":0.000014678159,"about_ca_system_score_gemma":0.000017111777,"threshold_uncertainty_score":0.5744027},"labels":[],"label_agreement":null},{"id":"W2406936546","doi":"","title":"On Vertex-Robust Identifying Codes of Level Three.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.03658330796721529,"score_gpt":0.2541426917889521,"score_spread":0.2175593838217368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406936546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97518575,0.000029419905,0.016309055,0.00011453017,0.0047056573,0.00009098007,0.00000279208,0.00012940353,0.003432423],"genre_scores_gemma":[0.99639773,0.0000029138973,0.003469715,0.00007489226,0.000005064057,0.0000058503306,9.0068903e-7,0.0000085874135,0.00003433184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901366,0.00004191739,0.00018748958,0.0002784561,0.00026689013,0.00021157047],"domain_scores_gemma":[0.99874574,0.0002759748,0.00009464758,0.0007280224,0.000082755716,0.0000728457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004540249,0.00012426602,0.0001664837,0.000140216,0.00013801685,0.00008371655,0.0010259849,0.00007417563,0.00003536564],"category_scores_gemma":[0.000092242044,0.0001196541,0.00010331674,0.0004267178,0.00009277055,0.00025695554,0.0002005659,0.0002663323,0.000046366305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008966204,0.00011042317,0.0016542271,0.000009066081,0.000016950493,0.000004370156,0.00017271374,0.000006658976,0.005211084,0.9868912,0.00044692235,0.005467427],"study_design_scores_gemma":[0.000401692,0.00011053975,0.010910006,0.00003229846,0.0000061543924,0.000003898373,0.000009027802,0.0010110538,0.009812671,0.97739315,0.00016755183,0.00014196364],"about_ca_topic_score_codex":0.00001815178,"about_ca_topic_score_gemma":0.000026913161,"teacher_disagreement_score":0.021212006,"about_ca_system_score_codex":0.000007778257,"about_ca_system_score_gemma":0.000030868036,"threshold_uncertainty_score":0.48793525},"labels":[],"label_agreement":null},{"id":"W2407306632","doi":"","title":"Some results on transverse Steiner quadruple systems of type g t u 1 .","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Transverse plane; Combinatorics; Mathematical analysis; Pure mathematics; Structural engineering; Geology; Engineering","score_opus":0.029344809867676774,"score_gpt":0.24558135880408888,"score_spread":0.21623654893641212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407306632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818198,0.00053126644,0.00042201293,0.00027672618,0.008797069,0.00021616962,0.000008458611,0.00023345108,0.007695017],"genre_scores_gemma":[0.99953336,0.000009644687,0.00017935509,0.000043913937,0.000017336168,0.000004116625,0.0000024848284,0.000007860407,0.00020192111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886084,0.00013406923,0.00024544258,0.00025554447,0.0003163029,0.0001877817],"domain_scores_gemma":[0.9988383,0.0001209216,0.00009739577,0.0006669767,0.00014943395,0.00012698524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065030216,0.00011601726,0.0001851962,0.00012168125,0.000044036653,0.0000454713,0.0006408211,0.00006138173,0.0000013182985],"category_scores_gemma":[0.00007494711,0.000104111394,0.00006484581,0.00052518037,0.000044216344,0.00026221006,0.000062067375,0.00010432319,0.000064082255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012787167,0.00012082305,0.0000867084,0.00001004326,0.000017276772,0.000007645565,0.00075935706,0.00017619258,0.00021149365,0.99476993,0.0033834362,0.00032923266],"study_design_scores_gemma":[0.0046583647,0.002435524,0.00030802801,0.00014152715,0.000022803055,0.000008624078,0.0002937235,0.006607665,0.004484393,0.95618093,0.024391254,0.00046718415],"about_ca_topic_score_codex":0.000051311807,"about_ca_topic_score_gemma":0.0000010481897,"teacher_disagreement_score":0.038589012,"about_ca_system_score_codex":0.000023723514,"about_ca_system_score_gemma":0.00006324214,"threshold_uncertainty_score":0.42455396},"labels":[],"label_agreement":null},{"id":"W2407691524","doi":"","title":"A Note on Set Families and Codes.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Set (abstract data type); Combinatorics; Discrete mathematics; Computer science; Programming language","score_opus":0.01383771580167542,"score_gpt":0.2441813027448969,"score_spread":0.2303435869432215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407691524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876518,0.00030280693,0.0018404977,0.0003089367,0.0019767666,0.00008399239,0.0000019976217,0.00019549803,0.0076376908],"genre_scores_gemma":[0.9986986,0.000029464492,0.0008485132,0.0003678878,0.000009932238,0.0000066215352,7.651012e-7,0.0000054018874,0.000032809818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929893,0.000061923354,0.00008489357,0.00017136548,0.00013521616,0.00024765363],"domain_scores_gemma":[0.9993208,0.00016422744,0.00003122039,0.0003552806,0.000019253275,0.00010923546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000325468,0.00010168286,0.00010402594,0.000082539125,0.00012649012,0.00006751196,0.00030873748,0.000043269723,0.000005755987],"category_scores_gemma":[0.000027451908,0.00009268364,0.000037109447,0.00024445157,0.000054542357,0.00030153416,0.00015262268,0.000102075835,0.000054535656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000598393,0.000048556394,0.0033190374,0.0000036245578,0.0000063903085,0.00000144207,0.0011729597,3.9175947e-7,0.00011047653,0.9854964,0.00075006054,0.009084657],"study_design_scores_gemma":[0.0005248073,0.0001988871,0.015752314,0.00002281984,0.0000076291326,0.00001058988,0.000051811283,0.00036558384,0.002040091,0.9604765,0.020302039,0.00024689385],"about_ca_topic_score_codex":0.0000055441556,"about_ca_topic_score_gemma":6.0731975e-7,"teacher_disagreement_score":0.025019884,"about_ca_system_score_codex":0.000011221005,"about_ca_system_score_gemma":0.000009679814,"threshold_uncertainty_score":0.37795287},"labels":[],"label_agreement":null},{"id":"W2407759797","doi":"","title":"An alternative a pproach to the classification of the regular near hexagons with parameters (s, t, t 2 ) = (2, 11, 1).","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Uniqueness; Addendum; Binary Golay code; Ternary Golay code; Mathematics; Ternary operation; Characterization (materials science); Code (set theory); Section (typography); Combinatorics; Elementary proof; Discrete mathematics; Pure mathematics; Algorithm; Computer science; Mathematical analysis; Programming language; Linear code; Law","score_opus":0.030475987556596498,"score_gpt":0.24732872936238037,"score_spread":0.21685274180578387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407759797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9821577,0.000027693055,0.013574517,0.0026321285,0.00074246863,0.00032657624,0.0000019203185,0.000058096422,0.0004789216],"genre_scores_gemma":[0.99484515,7.2948825e-7,0.0048722797,0.00020847977,0.0000057761945,0.000035461104,9.72965e-7,0.000007980154,0.000023145247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986999,0.00034310366,0.00014114154,0.0002809221,0.00036006616,0.00017487741],"domain_scores_gemma":[0.99823815,0.000085626605,0.00011908443,0.0012874936,0.00015514181,0.00011452476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007228677,0.00011170798,0.00011365761,0.00004449743,0.00018411897,0.00013469707,0.0016814263,0.000032178374,6.7010353e-7],"category_scores_gemma":[0.000053793454,0.0000612594,0.0000546565,0.00082217075,0.00017042618,0.00024317135,0.00016064705,0.00011220217,0.000006034383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024545385,0.00011088985,0.0025406922,0.0000017983302,0.000020998532,7.668293e-7,0.0038119722,0.0003868546,0.00019437916,0.9903989,0.00066869246,0.0018395339],"study_design_scores_gemma":[0.00095254276,0.0008945778,0.029059872,0.000046736943,0.000035022244,0.000014970379,0.0009919473,0.026416833,0.004743534,0.92957205,0.0069690356,0.0003028847],"about_ca_topic_score_codex":0.00006169906,"about_ca_topic_score_gemma":0.000019121971,"teacher_disagreement_score":0.060826834,"about_ca_system_score_codex":0.000030373529,"about_ca_system_score_gemma":0.00009856741,"threshold_uncertainty_score":0.31245366},"labels":[],"label_agreement":null},{"id":"W2407946072","doi":"","title":"Construction of Authentication Codes with Arbitration from Singular Symplectic Geometry.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Arbitration; Geometry; Authentication (law); Computer science; Computer security; Law","score_opus":0.013167111322832261,"score_gpt":0.22219339557439616,"score_spread":0.2090262842515639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407946072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91533583,0.00007039203,0.08277615,0.00009442653,0.00080855313,0.00008768564,0.0000013005748,0.00009863008,0.0007270405],"genre_scores_gemma":[0.983912,0.000002311463,0.016031707,0.00002513495,0.0000061591354,0.00000572301,0.000007393672,0.0000052165833,0.0000043614596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917656,0.000090233196,0.00016099792,0.00021250529,0.00024729493,0.0001124048],"domain_scores_gemma":[0.99911934,0.00009450596,0.00013972259,0.00038378654,0.00019513858,0.0000675254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028360996,0.00008718037,0.00012645751,0.00012873087,0.00006471968,0.0000685106,0.00027512253,0.000044098328,0.0000051666234],"category_scores_gemma":[0.00006117185,0.00008066029,0.00003204397,0.00066104566,0.00009551517,0.00034469852,0.00004133113,0.00007015659,0.0000072726966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021496762,0.0000634976,0.0054608816,0.000003997973,0.000027457161,0.0000010666474,0.00066421437,0.000008988911,0.0015374036,0.99030215,0.000025512263,0.0018833602],"study_design_scores_gemma":[0.0005416431,0.00023301698,0.0032145928,0.00002639129,0.000023641369,0.0000054014845,0.00009177525,0.0025038556,0.012553463,0.9805968,0.00010097283,0.00010848029],"about_ca_topic_score_codex":0.00004150932,"about_ca_topic_score_gemma":0.0000033521555,"teacher_disagreement_score":0.06857617,"about_ca_system_score_codex":0.000029372099,"about_ca_system_score_gemma":0.00007348858,"threshold_uncertainty_score":0.32892314},"labels":[],"label_agreement":null},{"id":"W2407994100","doi":"","title":"Extended Binary Linear Codes from Legendre Sequences.","year":2011,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Legendre polynomials; Circulant matrix; Dimension (graph theory); Code (set theory); Binary number; Class (philosophy); Linear code; Combinatorics; Discrete mathematics; Algorithm; Arithmetic; Block code; Mathematical analysis; Computer science; Decoding methods","score_opus":0.042127991172726274,"score_gpt":0.24057544816841164,"score_spread":0.19844745699568536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407994100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21923706,0.00035665144,0.6758749,0.00027729632,0.00071431213,0.000121212775,0.00000897616,0.0009623828,0.10244719],"genre_scores_gemma":[0.881055,0.000014423894,0.118201055,0.00037235583,0.00005132087,0.0000050881727,0.0000020333875,0.0000046725027,0.00029404514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917704,0.000061567334,0.00012710581,0.00031520947,0.00012812794,0.00019096422],"domain_scores_gemma":[0.9992674,0.000051340332,0.00003583764,0.00052747276,0.000034832377,0.000083119725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016389007,0.00010551573,0.00010502523,0.00007703583,0.00010057541,0.000041194828,0.00089202117,0.000047154914,0.000663804],"category_scores_gemma":[0.0000073503256,0.00008607294,0.00008053066,0.00029784872,0.00007703887,0.00037895978,0.00020002187,0.000087163295,0.00021128393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016421387,0.000113239745,0.0012185846,0.000002907257,0.00003309398,0.00006745653,0.0018804985,0.0000022623806,0.003717481,0.9721537,0.00080349506,0.01999083],"study_design_scores_gemma":[0.00052135834,0.00043352586,0.02709897,0.000039318365,0.000022301952,0.000026339974,0.00038883413,0.014561394,0.094033845,0.8544124,0.007717601,0.0007441287],"about_ca_topic_score_codex":0.0001824749,"about_ca_topic_score_gemma":0.000015397549,"teacher_disagreement_score":0.66181797,"about_ca_system_score_codex":0.0000057580464,"about_ca_system_score_gemma":0.00002737658,"threshold_uncertainty_score":0.72681886},"labels":[],"label_agreement":null},{"id":"W2408040767","doi":"","title":"A New Construction of Authentication Code with Arbitration from (2v+2+e)-dimensional Singular Pseudo-Symplectic Space.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Symplectic geometry; Mathematics; Arbitration; Space (punctuation); Code (set theory); Authentication (law); Pure mathematics; Computer science; Computer security; Programming language; Law; Political science","score_opus":0.009213695797496143,"score_gpt":0.21617221121582117,"score_spread":0.20695851541832502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408040767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8851658,0.000116643816,0.1124091,0.00025244307,0.0014449221,0.00012842486,0.0000018847397,0.00010719167,0.0003735899],"genre_scores_gemma":[0.9318986,0.0000022588506,0.06799427,0.000045887227,0.000022550252,0.0000051102247,0.000009009128,0.000008438535,0.000013909676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989614,0.00009963092,0.00019688248,0.0002344619,0.00029533097,0.00021231893],"domain_scores_gemma":[0.99902886,0.00013630817,0.00017903745,0.00042835873,0.00010386585,0.00012357724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024773524,0.00012814342,0.00015253735,0.00011277343,0.000116849646,0.000053002266,0.00024926194,0.000063975785,0.000036023222],"category_scores_gemma":[0.000030004663,0.00011988414,0.000055299428,0.000500328,0.00007248061,0.00057766767,0.000056042572,0.00010667847,0.000015806245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032372653,0.00009451656,0.0071533932,0.0000044460317,0.00003930808,5.859826e-7,0.0007302827,0.0000069945886,0.01097354,0.9792785,0.00013117118,0.0015549131],"study_design_scores_gemma":[0.0007372058,0.00016666204,0.015380294,0.0000492453,0.000050417282,0.000016526277,0.000033972665,0.002059417,0.021840412,0.95921373,0.00026263238,0.0001894589],"about_ca_topic_score_codex":0.000059418504,"about_ca_topic_score_gemma":0.000004417862,"teacher_disagreement_score":0.04673277,"about_ca_system_score_codex":0.0000322977,"about_ca_system_score_gemma":0.0000978277,"threshold_uncertainty_score":0.48887333},"labels":[],"label_agreement":null},{"id":"W2408505849","doi":"","title":"Linear Codes over Finite Chain Rings.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Chain (unit); Combinatorics; Physics","score_opus":0.008299404830640298,"score_gpt":0.23027268935407647,"score_spread":0.22197328452343618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408505849","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98243505,0.000040532952,0.00595884,0.00033786276,0.0046356134,0.00009843286,0.0000020083987,0.00038803223,0.006103644],"genre_scores_gemma":[0.9953532,0.0000067343058,0.0041221497,0.00030983382,0.000025814228,0.000009486627,0.0000013888517,0.000010487501,0.00016086274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990074,0.000051012685,0.00015109315,0.0003130551,0.0002017845,0.00027563988],"domain_scores_gemma":[0.9988586,0.00020413572,0.00006315401,0.0007043529,0.000055922228,0.00011384923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046160223,0.00013859481,0.0001388676,0.00010897202,0.0001749686,0.00011809887,0.0009257186,0.00008909133,0.00006548768],"category_scores_gemma":[0.00010019999,0.00013394645,0.00009388004,0.00045486598,0.00007897029,0.000293284,0.0002682057,0.00034378617,0.000115919174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004611126,0.00006526783,0.0028680272,0.0000036484903,0.0000106420175,0.000008687344,0.0002497419,0.0000034593932,0.0020577959,0.99131924,0.0005868391,0.0028220154],"study_design_scores_gemma":[0.00048828087,0.00008617629,0.004777846,0.000011547945,0.000004862112,0.000005246878,0.0000054722777,0.007015249,0.004791478,0.9586858,0.023884604,0.00024344397],"about_ca_topic_score_codex":0.000011603815,"about_ca_topic_score_gemma":0.0000059810895,"teacher_disagreement_score":0.032633472,"about_ca_system_score_codex":0.0000068892446,"about_ca_system_score_gemma":0.000027875936,"threshold_uncertainty_score":0.5462178},"labels":[],"label_agreement":null},{"id":"W2408564972","doi":"","title":"The Cubic Mapping Graph of the Residue Classes of Integers.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cubic graph; Residue (chemistry); Combinatorics; Coxeter graph; Graph; Discrete mathematics; Line graph; Voltage graph; Chemistry; Organic chemistry","score_opus":0.008461089982739612,"score_gpt":0.21446173894352819,"score_spread":0.20600064896078857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408564972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911236,0.00013582615,0.001059032,0.0007908832,0.0038276128,0.00011572154,8.454881e-7,0.000044844895,0.0029016014],"genre_scores_gemma":[0.99931246,0.000018414865,0.00057485583,0.000043714914,0.0000054108004,0.000005733379,1.0598874e-7,0.0000048738452,0.00003445606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990949,0.00012390538,0.00022877156,0.00015980197,0.00022239189,0.00017021422],"domain_scores_gemma":[0.9982039,0.0004763062,0.00018415421,0.0009923544,0.000111644295,0.000031693253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068696495,0.00009052386,0.00012642001,0.00006821506,0.00022794683,0.00004700578,0.0017936063,0.000053650638,0.0000044941958],"category_scores_gemma":[0.0001545882,0.000053422944,0.00015395033,0.00082217384,0.00033534807,0.0001276017,0.00034550385,0.00027569363,0.0000021352596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045532925,0.00003108297,0.0038931894,0.000007294738,0.000017755825,3.593728e-7,0.00038147825,9.0598775e-7,0.015298791,0.9774784,0.00046686022,0.00241935],"study_design_scores_gemma":[0.00016047002,0.000040314862,0.014264323,0.00002943054,0.000005133532,0.0000027647723,0.000091065485,0.00008654632,0.040121097,0.94160664,0.003521197,0.000071013885],"about_ca_topic_score_codex":0.000020644891,"about_ca_topic_score_gemma":0.000018016697,"teacher_disagreement_score":0.035871737,"about_ca_system_score_codex":0.0000040763375,"about_ca_system_score_gemma":0.0000515228,"threshold_uncertainty_score":0.33329967},"labels":[],"label_agreement":null},{"id":"W2412425389","doi":"10.48550/arxiv.1604.06878","title":"On the performance of optimal double circulant even codes","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Dual (grammatical number); Decoding methods; Mathematics; Weight distribution; Bounded function; Minimum weight; Combinatorics; Minimum distance; Discrete mathematics; Algorithm; Physics; Mathematical analysis","score_opus":0.0579139264674636,"score_gpt":0.17644874557363305,"score_spread":0.11853481910616945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412425389","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8378062,0.000018254485,0.15717772,0.00011516173,0.00026181035,0.00015624744,0.000009115867,0.00008588486,0.0043696086],"genre_scores_gemma":[0.9993511,0.00006612698,0.00015226055,0.000052821677,0.000030853156,0.0000010237544,0.0000014729058,0.000007638,0.00033670783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988725,0.00010952376,0.00013362123,0.00055395556,0.00009661528,0.00023374821],"domain_scores_gemma":[0.9981534,0.0002286358,0.00020061151,0.0012665605,0.00008816962,0.00006265664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039461243,0.00019966907,0.00021706658,0.0001648555,0.00015653358,0.000043689528,0.0022130678,0.00012340657,0.00004344417],"category_scores_gemma":[0.0000089805635,0.00014313309,0.0002196433,0.00033439152,0.00018192129,0.00016164606,0.0011540559,0.00029969236,0.000049003356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104938365,0.000050432263,0.000959929,0.00003506269,0.00006963957,0.000018772424,0.0001596296,0.02804598,0.00013800676,0.97006786,0.0001193757,0.00023040308],"study_design_scores_gemma":[0.0020649696,0.00068828795,0.0041297167,0.0012736955,0.00016244057,0.000014729058,0.0001155605,0.43315428,0.013634108,0.542239,0.0011243545,0.0013988705],"about_ca_topic_score_codex":0.000012267953,"about_ca_topic_score_gemma":0.0000015387216,"teacher_disagreement_score":0.42782885,"about_ca_system_score_codex":0.000045242978,"about_ca_system_score_gemma":0.000089085835,"threshold_uncertainty_score":0.5836798},"labels":[],"label_agreement":null},{"id":"W245240986","doi":"","title":"Quantum Generalized Reed-Solomon codes concatenated with random rate one inner stabilizer codes asymptotically attain the Quantum Gilbert-Varshamov bound","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum convolutional code; Linear code; Concatenated error correction code; Block code; Mathematics; Discrete mathematics; Reed–Solomon error correction; Physics; Algorithm; Decoding methods","score_opus":0.04632656506599503,"score_gpt":0.1938842783798743,"score_spread":0.14755771331387926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W245240986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.702186,0.00010120917,0.29433963,0.0005857045,0.0007372976,0.0008482709,0.000039325336,0.0004608259,0.0007017329],"genre_scores_gemma":[0.9973794,0.00022103079,0.00096859835,0.00055551657,0.00013609823,0.000011945008,0.000057690373,0.000063745734,0.00060598174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946749,0.0014804975,0.00057057914,0.0019969968,0.00031218288,0.00096482766],"domain_scores_gemma":[0.9938246,0.0015409712,0.000644283,0.0027853167,0.0008823157,0.00032252044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024259887,0.0008297992,0.0010762822,0.0004122523,0.00082418724,0.000718361,0.0038324122,0.000697374,0.00010846953],"category_scores_gemma":[0.00033340623,0.0006596334,0.000491681,0.0014385171,0.0015147591,0.00053577975,0.0020743744,0.0020341612,0.000056726374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020795825,0.00036562566,0.0018289379,0.00009501412,0.00070560584,0.00025743453,0.0006043974,0.01747418,0.002841975,0.97336626,0.00024199695,0.00013896091],"study_design_scores_gemma":[0.008600189,0.00061092275,0.00303275,0.0004062486,0.0007219901,0.000026925589,0.0002539622,0.54200196,0.0027300182,0.43747133,0.0019082606,0.0022354147],"about_ca_topic_score_codex":0.0005545858,"about_ca_topic_score_gemma":0.00084926886,"teacher_disagreement_score":0.53589493,"about_ca_system_score_codex":0.00013753699,"about_ca_system_score_gemma":0.0004521034,"threshold_uncertainty_score":0.9995855},"labels":[],"label_agreement":null},{"id":"W2460746400","doi":"10.1017/cbo9780511546907.002","title":"Historical Introduction","year":2005,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fibonacci number; Lucas sequence; Sequence (biology); Pseudorandom number generator; Mathematics; Combinatorics; Pseudorandom binary sequence; Hadamard transform; Lucas number; Arithmetic; Algebra over a field; Genealogy; History; Algorithm; Binary number; Pure mathematics; Fibonacci polynomials; Mathematical analysis; Orthogonal polynomials; Biology","score_opus":0.016376964127753874,"score_gpt":0.17567393401157894,"score_spread":0.15929696988382505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460746400","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007793453,0.00020860162,0.04661285,0.00022445727,0.0009114882,0.00013402876,0.0000069855237,0.00037701818,0.95151675],"genre_scores_gemma":[0.0001788191,0.00005198918,0.0014236005,0.000054727116,0.0009777406,3.0882836e-7,0.0000044466706,0.000018339228,0.99729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998729,0.000038187314,0.00014901912,0.0006206118,0.00024036688,0.00022282978],"domain_scores_gemma":[0.9986833,0.00003794578,0.00015994272,0.0008762311,0.000102173,0.00014042296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012656502,0.0002705322,0.0002787949,0.0002869962,0.00019634444,0.00006130761,0.0011025843,0.00025727172,0.0000054693273],"category_scores_gemma":[0.0000052314995,0.00033237156,0.00027125565,0.00001616928,0.00009235139,0.00019288734,0.0005067055,0.00043739725,0.000024328101],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020394527,0.0000075090093,2.3400258e-7,0.000011433518,0.000038713322,0.000057828667,0.000022714154,0.0000017400138,0.000016256497,0.85261124,0.13283539,0.014376574],"study_design_scores_gemma":[0.0001804936,0.00005268576,0.000002668393,0.000021845184,0.000054772903,0.000024813198,0.0000014408656,0.000060426333,0.00008140342,0.0002151391,0.99895996,0.00034437195],"about_ca_topic_score_codex":0.00001756681,"about_ca_topic_score_gemma":4.5200312e-7,"teacher_disagreement_score":0.8661246,"about_ca_system_score_codex":0.0005435206,"about_ca_system_score_gemma":0.000055842054,"threshold_uncertainty_score":0.99991286},"labels":[],"label_agreement":null},{"id":"W2463179629","doi":"10.1007/978-3-319-30927-9_18","title":"Enhancement of GSM Stream Cipher Security Using Variable Taps Mechanism and Nonlinear Combination Functions on Linear Feedback Shift Registers","year":2016,"lang":"en","type":"book-chapter","venue":"Smart innovation, systems and technologies","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Stream cipher; Stream cipher attack; Computer science; Correlation attack; GSM; Cipher; Shift register; Brute-force attack; Encryption; Affine cipher; Wireless; Embedded system; Computer hardware; Computer network; Chip; CBC-MAC; Telecommunications","score_opus":0.02223892483837167,"score_gpt":0.22860404869823636,"score_spread":0.2063651238598647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2463179629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0403197,0.0012724895,0.87953126,0.0016527812,0.0030127058,0.0019524684,0.00023436984,0.0016187212,0.07040552],"genre_scores_gemma":[0.972064,0.00034203267,0.011526643,0.000072742856,0.00014073007,0.0000720958,0.00005720043,0.000058930575,0.01566559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983767,0.000026123558,0.0006007625,0.0005289236,0.00027352475,0.00019390877],"domain_scores_gemma":[0.99817294,0.0000912538,0.0006410211,0.0006784407,0.0003970948,0.000019224377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000580834,0.00030588417,0.00039890248,0.000737057,0.00024870769,0.000106062565,0.00032343628,0.00042261533,0.00000677039],"category_scores_gemma":[0.000052128882,0.00025652873,0.000043134627,0.00041882813,0.00023553701,0.00025070735,0.00029331943,0.00024535987,0.0000034938212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001062033,0.000032037213,0.000043061613,0.00016662158,0.00007750642,0.0000010958864,0.000067712725,0.0000017690759,0.00045950728,0.99615353,0.00011610283,0.0028704202],"study_design_scores_gemma":[0.0005530594,0.00054090377,0.000015578491,0.0015118449,0.00004391821,0.000015013914,0.00018875429,0.0016230559,0.0016702566,0.96506745,0.028296575,0.000473573],"about_ca_topic_score_codex":0.000023498029,"about_ca_topic_score_gemma":0.0000038649964,"teacher_disagreement_score":0.93174434,"about_ca_system_score_codex":0.000054065556,"about_ca_system_score_gemma":0.00005710952,"threshold_uncertainty_score":0.9999887},"labels":[],"label_agreement":null},{"id":"W2464210557","doi":"10.1109/lcomm.2016.2587698","title":"Ternary Convolutional Codes for Ternary Phase Shift Keying","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Ternary operation; Binary number; Keying; Notation; Convolutional code; Mathematics; Combinatorics; Discrete mathematics; Algorithm; Computer science; Arithmetic; Decoding methods; Telecommunications","score_opus":0.04351049413457335,"score_gpt":0.3080357761184908,"score_spread":0.26452528198391745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464210557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056545563,0.00019188914,0.8964496,0.045735788,0.00032098513,0.00020460265,0.000043433327,0.00023595418,0.00027213164],"genre_scores_gemma":[0.9223343,0.00004834851,0.07415571,0.0031509025,0.00008691322,0.00015428023,0.000009846224,0.0000116241545,0.00004804079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989557,0.00015556987,0.00023770642,0.0002623532,0.00013659935,0.0002520349],"domain_scores_gemma":[0.99680007,0.00093864166,0.0001080544,0.002030179,0.000048564823,0.00007450684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036508628,0.00013121603,0.00012520383,0.00015826781,0.00047329007,0.00008854294,0.0029602675,0.000038077866,0.0000117269365],"category_scores_gemma":[0.00003141232,0.00010731682,0.00014711874,0.00020051571,0.00030558766,0.0005172109,0.00034052046,0.0001000174,0.000042540687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013833215,0.0007449596,0.0034452588,0.000028331491,0.00020877992,0.000008824473,0.0016544596,0.000037253812,0.277213,0.5749926,0.027139073,0.11438915],"study_design_scores_gemma":[0.016298441,0.0012078085,0.013271321,0.0010340087,0.00018179661,0.0001921025,0.00012672677,0.061626326,0.029451873,0.31393823,0.55949366,0.003177694],"about_ca_topic_score_codex":0.000008138922,"about_ca_topic_score_gemma":0.000006541923,"teacher_disagreement_score":0.86578876,"about_ca_system_score_codex":0.0000456644,"about_ca_system_score_gemma":0.000032313055,"threshold_uncertainty_score":0.5500963},"labels":[],"label_agreement":null},{"id":"W2473555732","doi":"10.1023/a:1022540524423","title":"Extremal Self-Dual Codes over $$\\mathbb{F}$$2 × $$\\mathbb{F}$$2","year":2003,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hermitian matrix; Dual (grammatical number); Minimum distance; Binary number; Combinatorics; Mathematics; Code (set theory); Binary code; Discrete mathematics; Computer science; Pure mathematics; Arithmetic; Philosophy","score_opus":0.019193295064878105,"score_gpt":0.23292103967894506,"score_spread":0.21372774461406696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473555732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26032668,0.0032219281,0.71816725,0.00016543933,0.0006410594,0.00055176794,0.000026652411,0.0014644299,0.015434783],"genre_scores_gemma":[0.8901381,0.00043210224,0.108535774,0.00065177685,0.00008619741,0.00007044889,0.0000060053217,0.00004356388,0.00003602568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996453,0.00048942474,0.0005256985,0.0010534218,0.0005538606,0.0009246231],"domain_scores_gemma":[0.9978072,0.00040989948,0.00019672405,0.0010336332,0.00012874213,0.0004237883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011544479,0.00058760744,0.00055235706,0.0006777,0.00070244865,0.0007030659,0.0007806725,0.00023085882,0.00013032898],"category_scores_gemma":[0.00004637246,0.0005418478,0.00044694325,0.0017691546,0.00030439906,0.0007552905,0.00020010513,0.00035113623,0.00003162377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003006579,0.0002972594,0.0054485085,0.00004827926,0.00017717262,0.00006173679,0.0010416915,0.000008520422,0.0033607364,0.9820381,0.0013516811,0.006136273],"study_design_scores_gemma":[0.004785072,0.0019269991,0.018451195,0.00026582595,0.00040421484,0.0008571934,0.0009474621,0.0069976635,0.0140433125,0.76590145,0.18109244,0.0043271836],"about_ca_topic_score_codex":0.000014980164,"about_ca_topic_score_gemma":0.000010414724,"teacher_disagreement_score":0.6298114,"about_ca_system_score_codex":0.000019913354,"about_ca_system_score_gemma":0.00008003987,"threshold_uncertainty_score":0.9997033},"labels":[],"label_agreement":null},{"id":"W2475918252","doi":"10.1109/isit.1991.695198","title":"Burst And Unidirectional Error Detecting Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Upper and lower bounds; Minimum distance; Burst error; Computer science; Error detection and correction; Algorithm; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.016092920704553742,"score_gpt":0.24017987902856905,"score_spread":0.22408695832401532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475918252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40801054,0.00019558027,0.5565658,0.0018365743,0.00018021248,0.000049342532,4.7360498e-7,0.00047678573,0.03268466],"genre_scores_gemma":[0.9522646,0.0000033353222,0.047141645,0.0002590683,0.00006141229,0.0000019921347,9.089855e-8,0.0000018566999,0.0002659844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996113,0.00002242435,0.00005810942,0.0001441417,0.00006540401,0.000098578676],"domain_scores_gemma":[0.99973327,0.000079701844,0.000014855547,0.00011581864,0.000016822236,0.000039553634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018444355,0.000047255726,0.00004286422,0.00005775203,0.00014856247,0.00007209289,0.00014607217,0.000017355293,0.000034423916],"category_scores_gemma":[0.000013042238,0.000041356736,0.00002199488,0.00017177472,0.000028507468,0.00021836568,0.00007390867,0.00004798293,0.000013076622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004417358,0.00002325751,0.0015798936,0.0000027332383,0.000010660141,0.0000011761407,0.0002909961,0.00004866462,0.0013273482,0.7047923,0.00020771804,0.29171082],"study_design_scores_gemma":[0.0015871064,0.00051603664,0.034212112,0.00007587505,0.000029636003,0.0005243008,0.0006028981,0.28151447,0.08877702,0.2500073,0.34066373,0.0014894922],"about_ca_topic_score_codex":0.0000062163535,"about_ca_topic_score_gemma":0.00003230388,"teacher_disagreement_score":0.54425406,"about_ca_system_score_codex":0.0000057104057,"about_ca_system_score_gemma":0.0000069536327,"threshold_uncertainty_score":0.16864787},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics","score_opus":0.018603007480891432,"score_gpt":0.2252885695491036,"score_spread":0.20668556206821215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2477064046","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.169778e-7,0.000047115645,0.48412246,0.00016785492,0.00025032085,0.00005889187,0.0000012713296,0.00013849314,0.5152129],"genre_scores_gemma":[0.00087283354,0.000015114433,0.0060064234,0.0014035219,0.00015828972,0.00001740375,0.0000106241505,0.000009326084,0.99150646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992068,0.000024437977,0.00015071103,0.0002842699,0.00017435396,0.00015944586],"domain_scores_gemma":[0.99862176,0.00047779287,0.000066083776,0.00072463317,0.000047241156,0.000062515304],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011018809,0.00015230983,0.00013813842,0.00016268966,0.000086524604,0.00018867246,0.00088109163,0.00020376762,0.0025722221],"category_scores_gemma":[0.00002571042,0.0001330935,0.00015978828,0.00011194906,0.000032529813,0.00022490526,0.00026211375,0.00023647644,0.0012214916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.345583e-7,0.000005939497,7.0936875e-7,0.00000478152,0.0000132384685,0.0000014112468,0.000054083983,0.000007824129,4.3114784e-7,0.81125844,0.17802483,0.010628066],"study_design_scores_gemma":[0.000045379187,0.000028285398,0.00000700721,0.000021558253,0.0000060645407,5.851187e-7,5.6990837e-7,0.0049552056,0.000003681656,0.5801902,0.41457516,0.00016631949],"about_ca_topic_score_codex":0.000006566644,"about_ca_topic_score_gemma":0.00000735763,"teacher_disagreement_score":0.47811604,"about_ca_system_score_codex":0.00001694189,"about_ca_system_score_gemma":0.00011260511,"threshold_uncertainty_score":0.9995562},"labels":[],"label_agreement":null},{"id":"W2480990550","doi":"10.1109/tvlsi.2016.2585980","title":"Low-Power Design for a Digit-Serial Polynomial Basis Finite Field Multiplier Using Factoring Technique","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Application-specific integrated circuit; Multiplier (economics); Finite field; CMOS; Adder; Factoring; Computer science; Arithmetic; Integrated circuit design; Standard cell; Mathematics; Algorithm; Computer hardware; Embedded system; Integrated circuit; Electronic engineering; Engineering; Discrete mathematics","score_opus":0.026242531316206776,"score_gpt":0.2524753020851617,"score_spread":0.22623277076895495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480990550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0142652085,0.000011049601,0.97943217,0.00011668996,0.004437372,0.0011469027,0.00012850616,0.00037070003,0.00009139714],"genre_scores_gemma":[0.9833262,0.000006018124,0.01554551,0.000083155144,0.00021274848,0.00051833765,0.0000017659886,0.000032531774,0.00027372938],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978717,0.00023156453,0.00053887896,0.0005977738,0.0002966656,0.00046343144],"domain_scores_gemma":[0.9978222,0.0010491998,0.00017114895,0.0006332189,0.0001853858,0.00013881619],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062513596,0.00032442287,0.00032846883,0.000417762,0.00049244415,0.00034286015,0.0005206835,0.00027810113,0.000046723242],"category_scores_gemma":[0.00004509531,0.00024894383,0.00036102423,0.00042929436,0.00004518737,0.0010817047,0.000006074878,0.00021551404,0.000023753057],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002234666,0.0013745582,0.000083883875,0.00016650757,0.00036692008,0.0000146749635,0.005027766,0.021695966,0.8797519,0.0040525217,0.0011883257,0.0840423],"study_design_scores_gemma":[0.0013853039,0.00056016695,0.000007158917,0.00063389377,0.00003555033,0.00001942536,0.00018128497,0.053810857,0.93980616,0.00025729355,0.0027574187,0.000545493],"about_ca_topic_score_codex":0.00003288806,"about_ca_topic_score_gemma":0.000028122768,"teacher_disagreement_score":0.969061,"about_ca_system_score_codex":0.00016899205,"about_ca_system_score_gemma":0.000096862575,"threshold_uncertainty_score":0.9999963},"labels":[],"label_agreement":null},{"id":"W2481688892","doi":"10.1017/cco9781139696456.016","title":"Index bounds for value sets of polynomials over finite fields","year":2014,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Index (typography); Value (mathematics); Combinatorics; Discrete mathematics; Statistics; Computer science","score_opus":0.011613955384744655,"score_gpt":0.2516021101276953,"score_spread":0.23998815474295063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481688892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05195597,0.000012937231,0.936449,0.00031395728,0.00026967083,0.00007981411,0.0000018819782,0.00006350854,0.010853269],"genre_scores_gemma":[0.98556244,0.0000012335038,0.013139109,0.0009526258,0.000047021877,0.000007693804,6.650319e-7,0.0000036033082,0.0002855946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938995,0.00004475773,0.00015033694,0.00017042675,0.00009610975,0.00014841039],"domain_scores_gemma":[0.9989902,0.0004997616,0.000056614277,0.00037928874,0.000032581665,0.000041592157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046247384,0.0000713529,0.00012329742,0.00008537721,0.000059639453,0.00005153603,0.00045780334,0.000060230435,0.00004833456],"category_scores_gemma":[0.0000709605,0.000060879327,0.00011160829,0.0001642074,0.00003319561,0.00014556381,0.00010374044,0.00004272551,0.0000042443785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017555563,0.000029796449,0.001281636,0.000015295393,0.000014700546,1.2404534e-7,0.00020648728,0.00011969627,0.00028181897,0.9715724,0.0025940223,0.023866484],"study_design_scores_gemma":[0.0010145929,0.0005040204,0.00828299,0.00002759363,0.000012552124,0.0000019857928,0.000012637952,0.17352931,0.011075335,0.76058406,0.044644665,0.00031027064],"about_ca_topic_score_codex":0.000020655541,"about_ca_topic_score_gemma":0.000007211078,"teacher_disagreement_score":0.9336065,"about_ca_system_score_codex":0.000003399974,"about_ca_system_score_gemma":0.000018330971,"threshold_uncertainty_score":0.2482587},"labels":[],"label_agreement":null},{"id":"W2494427850","doi":"10.1016/j.jnt.2016.06.013","title":"On the addition of squares of units modulo n","year":2016,"lang":"en","type":"preprint","venue":"Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Ring (chemistry); Arithmetic; Chemistry","score_opus":0.023088353609455135,"score_gpt":0.2486681475493973,"score_spread":0.22557979393994218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494427850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46990567,0.0004905248,0.48029807,0.0019874962,0.0034761992,0.00035795858,0.0005307622,0.00005604382,0.042897288],"genre_scores_gemma":[0.99867713,0.00004947327,0.0008511546,0.00012798326,0.00018508524,0.0000035334742,0.0000018576067,0.000010867227,0.000092899245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781734,0.00081164786,0.0005986665,0.00015900351,0.00047469497,0.00013865466],"domain_scores_gemma":[0.9947615,0.0023414718,0.0015225444,0.00074863655,0.00056963373,0.000056204462],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002262303,0.00017330346,0.00037271075,0.00020889861,0.00005267477,0.000033244614,0.001697296,0.00013275692,0.00095312664],"category_scores_gemma":[0.00046985553,0.00009657765,0.00036834055,0.00026484067,0.0001944433,0.00015225017,0.0004240145,0.0005158941,0.000011049564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017969063,0.0000985092,0.000033593627,0.000051937084,0.00016368664,0.000007762537,0.00070008764,0.00008376418,0.00036632724,0.977509,0.008428187,0.012377454],"study_design_scores_gemma":[0.00019021476,0.00016198166,0.00037603176,0.0013821834,0.00003391565,0.00003544102,0.00007759548,0.00004819738,0.004214951,0.9923601,0.0010102761,0.000109091685],"about_ca_topic_score_codex":9.81365e-7,"about_ca_topic_score_gemma":2.770732e-7,"teacher_disagreement_score":0.52877146,"about_ca_system_score_codex":0.000023765768,"about_ca_system_score_gemma":0.00015784943,"threshold_uncertainty_score":0.9999601},"labels":[],"label_agreement":null},{"id":"W2497076220","doi":"10.1090/fim/020/40","title":"Kloosterman sums and Selberg’s conjecture","year":2009,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Toronto","funders":"","keywords":"Kloosterman sum; Conjecture; Mathematics; Selberg trace formula; Pure mathematics; Riemann hypothesis","score_opus":0.009663095765218184,"score_gpt":0.21854811873724242,"score_spread":0.20888502297202424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497076220","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022340218,0.00018250436,0.054851647,0.00078751805,0.00006776866,0.0003559582,0.000009354664,0.00046536882,0.94305646],"genre_scores_gemma":[0.036965784,0.00023300321,0.17819412,0.0154724335,0.0006460572,0.000057069934,0.000018693307,0.00024348422,0.76816934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816954,0.000033491055,0.00036320844,0.00065519486,0.0003788706,0.00039971902],"domain_scores_gemma":[0.9982842,0.00030876577,0.00028966292,0.0008238947,0.000043966887,0.0002494747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026287895,0.00049444364,0.0007150694,0.000052844036,0.00020114989,0.00020841381,0.00075457594,0.00023226878,0.000067001994],"category_scores_gemma":[0.000010191391,0.00042497332,0.000556513,0.00004431212,0.00096203963,0.00006705993,0.00036138765,0.0005743642,0.00007264264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023925256,0.000012102998,8.119752e-7,0.00005227173,0.00010040691,0.000010483756,0.0012005494,9.901243e-8,0.000015966094,0.85609734,0.0013507928,0.14115675],"study_design_scores_gemma":[0.0001607096,0.00026277322,0.000008168727,0.00016775045,0.00007691842,0.00007980671,0.000039128212,0.00035035922,0.000028419247,0.9187557,0.07950306,0.00056720787],"about_ca_topic_score_codex":0.0000023626224,"about_ca_topic_score_gemma":0.0000011212393,"teacher_disagreement_score":0.17488712,"about_ca_system_score_codex":0.00003476646,"about_ca_system_score_gemma":0.000049967806,"threshold_uncertainty_score":0.99982023},"labels":[],"label_agreement":null},{"id":"W2504337894","doi":"10.1002/sec.1456","title":"Two new message authentication codes based on APN functions and stream ciphers","year":2016,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Message authentication code; Authentication (law); Stream cipher; Code (set theory); Data Authentication Algorithm; CBC-MAC; Theoretical computer science; Computer security; Hash-based message authentication code; Block cipher; Computer network; Authentication protocol; Cryptography; Programming language","score_opus":0.01103032498939654,"score_gpt":0.2337092692993262,"score_spread":0.22267894430992966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504337894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05245133,0.0022034934,0.91714436,0.011615095,0.00018282948,0.00030987515,0.0000074075615,0.0004012116,0.015684398],"genre_scores_gemma":[0.99712336,0.00048216106,0.0018931658,0.00035958583,0.000031274754,0.000015046898,0.000008261096,0.0000053684366,0.00008177134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991299,0.00025173448,0.00013991423,0.00023409793,0.000100215875,0.0001441594],"domain_scores_gemma":[0.99838203,0.00048062165,0.00008006815,0.0009102254,0.000037017493,0.000110050816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004018201,0.00010812644,0.000098622484,0.00006962098,0.0003600896,0.00013392356,0.0004378202,0.00006149639,0.000024305682],"category_scores_gemma":[0.000021757374,0.00008585737,0.000037469097,0.00023683427,0.00014734831,0.00027564476,0.00016887627,0.00013755583,0.000004554677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042808693,0.00010478353,0.0010767011,0.000005446232,0.000021986563,2.859983e-7,0.00091281015,0.00017778092,0.000052226274,0.74919164,0.00081339356,0.24760012],"study_design_scores_gemma":[0.0030224067,0.00039653067,0.01270083,0.0004671767,0.00007875391,0.000009008203,0.000555327,0.47853222,0.00017615338,0.488849,0.014494696,0.00071789103],"about_ca_topic_score_codex":0.000024449877,"about_ca_topic_score_gemma":0.00007033674,"teacher_disagreement_score":0.94467205,"about_ca_system_score_codex":0.000012309765,"about_ca_system_score_gemma":0.000021802234,"threshold_uncertainty_score":0.3501162},"labels":[],"label_agreement":null},{"id":"W2504616652","doi":"10.4018/978-1-59904-168-1.ch002","title":"Wireless Web Security Using a Neural Network-Based Cipher","year":2007,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cipher; Computer network; Computer security; Encryption","score_opus":0.029279138037962633,"score_gpt":0.257678022246668,"score_spread":0.22839888420870538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504616652","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033771654,0.00038292122,0.039501842,0.00003388254,0.0016030759,0.0003361507,0.00003753906,0.00059688324,0.95413053],"genre_scores_gemma":[0.9845589,0.0000018010707,0.007409095,0.0029297196,0.0012519719,0.000007803781,0.0000036677475,0.000078233155,0.003758849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734,0.00006589057,0.00045011198,0.0008344929,0.00055942184,0.000750044],"domain_scores_gemma":[0.998115,0.000086091284,0.00030197145,0.0010939703,0.00013283927,0.0002701171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044522047,0.000597387,0.0005284422,0.00012144563,0.00026583055,0.00027052587,0.0013724578,0.00051574694,0.00003675421],"category_scores_gemma":[0.0000044952462,0.00062374223,0.00052738906,0.00010890643,0.00020768394,0.00010407452,0.00044355958,0.0005565906,0.00004066775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047110454,0.000011836024,0.000041368243,0.000024343322,0.000054294764,0.00019045491,0.0000308319,0.00031686242,0.0000075996672,0.98897856,0.00051848456,0.009778263],"study_design_scores_gemma":[0.00053263485,0.00012631503,0.000011437543,0.00033510945,0.00008116686,0.000079546575,0.000001733189,0.07359987,0.000017968812,0.8991254,0.025105042,0.0009837836],"about_ca_topic_score_codex":0.000027934802,"about_ca_topic_score_gemma":0.00011255105,"teacher_disagreement_score":0.9811817,"about_ca_system_score_codex":0.00016829207,"about_ca_system_score_gemma":0.00028699642,"threshold_uncertainty_score":0.9996214},"labels":[],"label_agreement":null},{"id":"W2506540977","doi":"10.11606/d.45.2016.tde-05102015-225032","title":"Idempotentes centrais primitivos em algumas álgebras de grupos","year":2016,"lang":"pt","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Idempotence; Mathematics; Abelian group; Group (periodic table); Simple (philosophy); Nilpotent; Dimension (graph theory); Subject (documents); Algebra over a field; Pure mathematics; Combinatorics; Computer science; Library science; Epistemology","score_opus":0.011795673180954843,"score_gpt":0.2505804127538334,"score_spread":0.23878473957287857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506540977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16547835,0.0013471167,0.7869887,0.0012326171,0.0053793574,0.0011494127,0.00004775571,0.0010792176,0.03729752],"genre_scores_gemma":[0.9589163,0.00045150597,0.007335916,0.0013121761,0.00046033107,0.00010566831,0.000135928,0.00011097667,0.03117119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953632,0.00045726734,0.00079025363,0.001376415,0.0007143539,0.0012985562],"domain_scores_gemma":[0.9968771,0.0005810954,0.0004836046,0.0012290187,0.00033218373,0.0004970171],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008928584,0.000829435,0.00065294123,0.0005335982,0.00066481566,0.0006922314,0.00229084,0.000594341,0.0015796405],"category_scores_gemma":[0.00018293901,0.0006834759,0.0007780679,0.00077150855,0.0001337499,0.0007081407,0.0002623214,0.0005427299,0.00086625176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021244433,0.00043201057,0.0036975497,0.00031503095,0.00045883257,0.000107681495,0.012606013,0.0000030651356,0.009855317,0.67109054,0.003343641,0.29787785],"study_design_scores_gemma":[0.007029075,0.0026872994,0.10090199,0.008335465,0.0013406869,0.00043609267,0.012262244,0.009460358,0.2315462,0.58136237,0.03342151,0.0112167215],"about_ca_topic_score_codex":0.000054315566,"about_ca_topic_score_gemma":0.0000764484,"teacher_disagreement_score":0.79343796,"about_ca_system_score_codex":0.0001157417,"about_ca_system_score_gemma":0.00043907078,"threshold_uncertainty_score":0.99991167},"labels":[],"label_agreement":null},{"id":"W2509864339","doi":"10.1109/isit.2016.7541347","title":"On vectorial bent functions with Dillon-type exponents","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bent molecular geometry; Monomial; Bent function; Mathematics; Domain (mathematical analysis); Algebraic number; Type (biology); Degree (music); Boolean function; Pure mathematics; Combinatorics; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.009656603842348767,"score_gpt":0.19766322552817187,"score_spread":0.1880066216858231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509864339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.274742,0.0000062999907,0.7044599,0.0008351776,0.0027814878,0.00008742603,0.0000010808876,0.00032441248,0.016762186],"genre_scores_gemma":[0.9972877,0.0000016187962,0.0012002205,0.000121235615,0.00012553998,0.000005175631,3.1311237e-7,0.000003883786,0.0012543332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999399,0.000027716871,0.000061148305,0.00021178093,0.0001599774,0.00014037568],"domain_scores_gemma":[0.99941444,0.000105445986,0.000019696225,0.00036433863,0.00003541559,0.000060646602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008371926,0.00007315048,0.00005482867,0.00006480033,0.00009762716,0.000040913554,0.00027125023,0.000020900225,0.00018659086],"category_scores_gemma":[0.000014698902,0.000036932277,0.000032974724,0.00024230918,0.000026712292,0.00016977126,0.0000584563,0.000033046166,0.0002726352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013308704,0.000096360105,0.00072620815,9.1198706e-7,0.000021884392,0.000003840193,0.000078650024,0.000004783554,0.0025130895,0.9711732,0.0042580375,0.0209899],"study_design_scores_gemma":[0.010760847,0.015557588,0.043829147,0.0004766995,0.00007965771,0.00006778007,0.000108312764,0.00068407174,0.044072993,0.524803,0.35696885,0.0025910437],"about_ca_topic_score_codex":0.0000036140195,"about_ca_topic_score_gemma":0.0000053248805,"teacher_disagreement_score":0.7225457,"about_ca_system_score_codex":0.0000137332245,"about_ca_system_score_gemma":0.00001630187,"threshold_uncertainty_score":0.3504265},"labels":[],"label_agreement":null},{"id":"W2513122423","doi":"10.1145/3055282.3055291","title":"Black box linear algebra","year":2017,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Preconditioner; Matrix (chemical analysis); Computation; Algebra over a field; Linear algebra; Discrete mathematics; Algorithm; Applied mathematics; Pure mathematics; Iterative method","score_opus":0.050840463047151535,"score_gpt":0.31764888645870837,"score_spread":0.26680842341155686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513122423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06803255,0.00045477485,0.8978995,0.023687482,0.00082785543,0.00041076686,0.0000050493013,0.0006023125,0.008079718],"genre_scores_gemma":[0.62976116,0.0001690513,0.3691716,0.000721679,0.00009281398,0.000024768386,0.0000062584763,0.000013090027,0.000039607236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982175,0.00028270765,0.00041385353,0.0004840158,0.00021938073,0.0003824913],"domain_scores_gemma":[0.9818866,0.00057518954,0.00023816571,0.01708179,0.000106621585,0.00011163445],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0007975336,0.00022518387,0.00026190706,0.00027014787,0.0010379793,0.00068139716,0.020927059,0.00010824136,0.000018530945],"category_scores_gemma":[0.00018243596,0.00023769223,0.0001539043,0.0003847343,0.00055994495,0.0010486695,0.010556163,0.0004902426,0.00024325692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005811001,0.00031741156,0.006440996,0.000010988088,0.000042307944,0.000010739662,0.0016491612,0.000063426305,0.00004968576,0.8342049,0.0017965217,0.15540801],"study_design_scores_gemma":[0.0011709415,0.00015896566,0.06329592,0.00017824168,0.00001753254,0.000030406454,0.0000315039,0.2188921,0.0003386605,0.67411244,0.040967662,0.0008056051],"about_ca_topic_score_codex":0.000051962656,"about_ca_topic_score_gemma":0.00007339468,"teacher_disagreement_score":0.5617286,"about_ca_system_score_codex":0.000038272046,"about_ca_system_score_gemma":0.00006289069,"threshold_uncertainty_score":0.9974463},"labels":[],"label_agreement":null},{"id":"W2516281809","doi":"10.1017/cbo9781139195768.007","title":"Bifix codes","year":2009,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Object (grammar); Computer science; Mathematics; Artificial intelligence","score_opus":0.018890302355487193,"score_gpt":0.18794733945916545,"score_spread":0.16905703710367825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516281809","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002119697,0.00012487304,0.02572486,0.00003140042,0.00023832404,0.0001802343,0.000043132302,0.0004649627,0.973171],"genre_scores_gemma":[0.0008234349,0.000071719725,0.0014645504,0.0001789392,0.00009263745,2.2101507e-7,0.000009975007,0.00001840214,0.99734014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863845,0.00004594493,0.00014533088,0.00061899005,0.00026009264,0.00029121185],"domain_scores_gemma":[0.9984574,0.00007398541,0.00016453577,0.0010220653,0.000107286105,0.00017476465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013177563,0.00033248914,0.000338357,0.0002995388,0.00024327662,0.00012420595,0.0017409215,0.00028593556,0.000002781214],"category_scores_gemma":[0.0000037385887,0.00041259706,0.00031989897,0.000018402165,0.0001821873,0.00017170561,0.000552554,0.00040671494,0.000029144909],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002176088,0.000007516394,2.688424e-7,0.000015826394,0.000059236867,0.00020037503,0.0000340173,0.0000011112861,0.000026044881,0.95412344,0.013573022,0.031937357],"study_design_scores_gemma":[0.00025282608,0.00008695783,0.0000103817265,0.00010618939,0.00006558194,0.000016223017,0.0000035782546,0.00013173517,0.00021546654,0.0015081617,0.9971204,0.00048251214],"about_ca_topic_score_codex":0.000014704455,"about_ca_topic_score_gemma":6.1377773e-7,"teacher_disagreement_score":0.9835474,"about_ca_system_score_codex":0.00007021778,"about_ca_system_score_gemma":0.00007338649,"threshold_uncertainty_score":0.9998326},"labels":[],"label_agreement":null},{"id":"W2518633271","doi":"10.1109/tit.2016.2595778","title":"The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Victoria","keywords":"Cayley graph; Ramanujan's sum; Modulo; Abelian group; Conjecture; Ring of integers; Vertex-transitive graph; Prime number; Gaussian integer","score_opus":0.007879767939820391,"score_gpt":0.2004266449231333,"score_spread":0.1925468769833129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518633271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045202393,0.000030770003,0.9514991,0.00069738535,0.00063419895,0.00028291997,0.000043483782,0.00054362306,0.0010660951],"genre_scores_gemma":[0.99881446,0.00008904833,0.00020785465,0.00057330757,0.000011022275,0.00010588865,0.0000022295276,0.000011386184,0.00018480694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821675,0.000402132,0.0003777967,0.00020977938,0.00041132324,0.00038220588],"domain_scores_gemma":[0.99741447,0.0013057773,0.00028221324,0.00071577885,0.00017068753,0.00011108672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014012954,0.0002454837,0.00018617397,0.0004071144,0.0011785176,0.00031297255,0.0007909596,0.00010616953,0.000033035307],"category_scores_gemma":[0.000036881505,0.0001351235,0.00021516214,0.0007939925,0.00032068175,0.002844074,0.0000044258686,0.00024527204,0.00012652784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002782014,0.00014208036,0.000057552257,0.000010276378,0.00021489045,0.0000016036826,0.0015911441,0.00038323578,0.00016330431,0.8515061,0.00020869754,0.1454429],"study_design_scores_gemma":[0.0035134633,0.0014154348,0.0025459179,0.00051424897,0.00012959931,0.00004160564,0.0015256199,0.001710265,0.028979825,0.95557564,0.002888142,0.0011602265],"about_ca_topic_score_codex":0.0000045936945,"about_ca_topic_score_gemma":0.000030319368,"teacher_disagreement_score":0.9536121,"about_ca_system_score_codex":0.000061564235,"about_ca_system_score_gemma":0.00005603846,"threshold_uncertainty_score":0.90643233},"labels":[],"label_agreement":null},{"id":"W2522333197","doi":"10.1016/j.jalgebra.2016.09.005","title":"Normal supercharacter theories and their supercharacters","year":2016,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Unipotent; Character (mathematics); Pure mathematics; Geometry","score_opus":0.006979465219030541,"score_gpt":0.19479759248630035,"score_spread":0.18781812726726982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522333197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90569437,0.00014792108,0.08924179,0.004262436,0.0003831119,0.000025821568,0.0000021142835,0.000022325436,0.0002201454],"genre_scores_gemma":[0.99777913,0.00017889883,0.0012565274,0.0005602865,0.00017729372,6.268061e-7,1.0535837e-7,0.000005764241,0.000041356056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919325,0.00010782661,0.00025278286,0.00011841068,0.0001404047,0.00018731249],"domain_scores_gemma":[0.99913794,0.0003188105,0.00010493824,0.00021077669,0.00010764353,0.00011990625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007261878,0.000112841415,0.00017620163,0.00016475318,0.000079185724,0.00010910495,0.00053049374,0.000041413943,0.000060708404],"category_scores_gemma":[0.00005595395,0.0000565585,0.00012685744,0.00013300167,0.00012602701,0.0013940294,0.00013020332,0.00012737459,0.000009265921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012536228,0.00007628076,0.009664492,0.000010036166,0.000106758496,0.00004437355,0.005257971,1.1483356e-7,0.07084864,0.6677156,0.00030714288,0.24584325],"study_design_scores_gemma":[0.002218599,0.0014325575,0.13896914,0.00034745317,0.000034225945,0.0022939078,0.00060897396,0.00004783132,0.059468746,0.7567944,0.03711298,0.00067121664],"about_ca_topic_score_codex":6.093675e-7,"about_ca_topic_score_gemma":4.76551e-7,"teacher_disagreement_score":0.24517202,"about_ca_system_score_codex":0.000011420534,"about_ca_system_score_gemma":0.000032656884,"threshold_uncertainty_score":0.23063888},"labels":[],"label_agreement":null},{"id":"W2522783957","doi":"10.1007/978-3-319-46298-1_25","title":"A New Adaptable Construction of Modulo Addition with Scalable Security for Stream Ciphers","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Stream cipher; Computer science; Modulo; S-box; Theoretical computer science; Cryptanalysis; Cryptography; Probabilistic logic; Scalability; Advanced Encryption Standard; Polynomial; Differential cryptanalysis; Algorithm; Block cipher; Discrete mathematics; Mathematics; Database","score_opus":0.009222008055489535,"score_gpt":0.2080644522710631,"score_spread":0.19884244421557357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522783957","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013474292,0.00012603322,0.9943155,0.00023743826,0.0007221951,0.00043397944,0.00003226358,0.000108847256,0.003889025],"genre_scores_gemma":[0.10611305,0.000021999935,0.8930544,0.00016777897,0.0003626523,0.000017376184,0.0000066668485,0.000027859676,0.00022818116],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976185,0.00002403009,0.00034346926,0.0010103844,0.00055306643,0.00045056615],"domain_scores_gemma":[0.99793065,0.00039356254,0.00034698678,0.00089166994,0.0002882681,0.00014885735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004924489,0.00035487433,0.0004230916,0.0005382019,0.0001866374,0.00017623311,0.0014159074,0.0002096836,0.000053626365],"category_scores_gemma":[0.000032336517,0.00027545463,0.00013726996,0.00053158164,0.0006607029,0.00070444087,0.00030307463,0.00025834053,0.0000038768526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005255717,0.000017915427,0.000027052027,0.000046663336,0.000020459416,0.0000036428742,0.000266628,0.0017785819,0.00010049605,0.3798464,0.000087995344,0.6177516],"study_design_scores_gemma":[0.0005990634,0.00060353347,0.000015908272,0.00077244185,0.000016985701,0.000042788324,5.606939e-7,0.045754246,0.004391406,0.9456528,0.0017012308,0.00044902405],"about_ca_topic_score_codex":0.000016968803,"about_ca_topic_score_gemma":0.000049055405,"teacher_disagreement_score":0.6173026,"about_ca_system_score_codex":0.00011469184,"about_ca_system_score_gemma":0.0005909861,"threshold_uncertainty_score":0.9999698},"labels":[],"label_agreement":null},{"id":"W2523739031","doi":"10.4064/aa8228-5-2016","title":"On the structure of long unsplittable minimal zero-sum sequences","year":2016,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Combinatorics; Zero (linguistics); Abelian group; Order (exchange); Discrete mathematics","score_opus":0.011380642454377522,"score_gpt":0.22125090047260387,"score_spread":0.20987025801822634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523739031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9012904,0.00005933792,0.08516207,0.0082557155,0.00032998156,0.00015555616,0.000018596898,0.00010340689,0.004624944],"genre_scores_gemma":[0.99561614,0.000008220576,0.003933115,0.00027998173,0.000026163076,0.0000021046142,2.765032e-7,0.000005281983,0.00012869506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898213,0.00010652279,0.00015799163,0.00026612417,0.0002483249,0.00023888382],"domain_scores_gemma":[0.9983114,0.0008375318,0.00008110636,0.00066413486,0.000052487507,0.000053325693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024194233,0.000117456075,0.00012843598,0.00007621608,0.00012083707,0.000063988446,0.0010958412,0.00005149137,0.00019100597],"category_scores_gemma":[0.00012572431,0.00005706992,0.00007916725,0.0003505503,0.0002307955,0.00020609489,0.00016619507,0.00009267649,0.000015366862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001638817,0.00003600867,0.00046740327,0.000006114223,0.000025880678,0.0000048777506,0.00017014665,0.0000011739365,0.046480495,0.937842,0.0007835252,0.014165948],"study_design_scores_gemma":[0.00030568038,0.00045292603,0.0044321925,0.00012877425,0.000020217674,0.000023431841,0.000024481473,0.00023862394,0.22232738,0.76890206,0.0028819093,0.00026229522],"about_ca_topic_score_codex":0.0000060359594,"about_ca_topic_score_gemma":0.000003149536,"teacher_disagreement_score":0.17584687,"about_ca_system_score_codex":0.000009829781,"about_ca_system_score_gemma":0.00003583769,"threshold_uncertainty_score":0.23272437},"labels":[],"label_agreement":null},{"id":"W2527601443","doi":"10.1007/978-3-319-30976-7_8","title":"Kneser–Hecke-Operators for Codes over Finite Chain Rings","year":2016,"lang":"en","type":"book-chapter","venue":"Association for Women in Mathematics series","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"King's University College","funders":"","keywords":"Chain (unit); Prime (order theory); Mathematics; Pure mathematics; Operator (biology); Set (abstract data type); Finite field; Discrete mathematics; Combinatorics; Physics; Computer science; Quantum mechanics; Chemistry","score_opus":0.01231474716306036,"score_gpt":0.22832508417942346,"score_spread":0.2160103370163631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527601443","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020541556,0.00023536572,0.09615256,0.002017794,0.0021332318,0.0041339826,0.0012054346,0.0008434109,0.8912241],"genre_scores_gemma":[0.004067716,0.00007477934,0.008216965,0.000091782116,0.00017525908,0.0006959318,0.000022510341,0.00007594009,0.9865791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817073,0.000023886025,0.00056303636,0.00039569454,0.00032782153,0.00051882066],"domain_scores_gemma":[0.9969724,0.0016012078,0.00069299235,0.00044031534,0.00021599547,0.00007709914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001830536,0.00033842344,0.00058150385,0.00030229124,0.00019876688,0.00023566704,0.0006198434,0.00033633568,0.000060206366],"category_scores_gemma":[0.00050591846,0.00030381724,0.00024567102,0.00009434654,0.00004743698,0.00045992766,0.00015371792,0.00013625619,0.000028911549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019588702,0.000027742739,0.00007949855,0.00025185986,0.00012724797,5.5971776e-7,0.0042675524,0.0000034802595,0.000022236267,0.9942159,0.0006870934,0.00029720902],"study_design_scores_gemma":[0.00045942466,0.00014708194,0.000014387354,0.00021872208,0.000015554635,6.4598174e-7,0.000088302,0.00036650707,0.0000921072,0.9095527,0.08867989,0.0003647035],"about_ca_topic_score_codex":4.342028e-7,"about_ca_topic_score_gemma":0.000014292579,"teacher_disagreement_score":0.09535505,"about_ca_system_score_codex":0.00053322053,"about_ca_system_score_gemma":0.00008060948,"threshold_uncertainty_score":0.9999414},"labels":[],"label_agreement":null},{"id":"W2527744876","doi":"10.1016/j.dam.2016.09.009","title":"Compositional inverses and complete mappings over finite fields","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bijection, injection and surjection; Mathematics; Permutation (music); TRACE (psycholinguistics); Class (philosophy); Linear subspace; Combinatorics; Discrete mathematics; Inverse; Kernel (algebra); Trace class; Bijection; Algebra over a field; Pure mathematics; Hilbert space; Computer science","score_opus":0.01648350929686105,"score_gpt":0.21993622258225462,"score_spread":0.20345271328539358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527744876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0404136,0.000015249136,0.9461066,0.00085090793,0.000059199967,0.00012844743,0.000016394473,0.0001457477,0.012263864],"genre_scores_gemma":[0.9018766,0.0000210592,0.09717045,0.0007899705,0.000037668244,0.000022390128,0.0000029142336,0.00000982233,0.00006912569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919116,0.000011931629,0.00018361314,0.0002371243,0.0001841873,0.00019199318],"domain_scores_gemma":[0.9990288,0.00043740176,0.00008173409,0.00035404167,0.000020076035,0.00007791549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001540433,0.00013820309,0.00016063696,0.00007540205,0.00012722607,0.000091851536,0.00036044003,0.000051565778,0.00006727171],"category_scores_gemma":[0.00001404258,0.00009569667,0.000055173976,0.00013825207,0.00012964674,0.00015723956,0.00025792734,0.00006350755,0.00004936941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005213785,0.000022489507,0.000030104242,0.00003532384,0.00002017787,0.000001941545,0.0006328585,0.0000014625153,0.011004044,0.9852607,0.00039925933,0.0025863713],"study_design_scores_gemma":[0.0006335001,0.000049386384,0.0005008788,0.00010285768,0.000016378672,0.000013319184,0.00007881921,0.0034488726,0.0021378587,0.9868592,0.005834106,0.0003248191],"about_ca_topic_score_codex":0.0000010302011,"about_ca_topic_score_gemma":0.0000010006324,"teacher_disagreement_score":0.861463,"about_ca_system_score_codex":0.000008109467,"about_ca_system_score_gemma":0.00000975028,"threshold_uncertainty_score":0.3902397},"labels":[],"label_agreement":null},{"id":"W2535290256","doi":"10.1109/tit.2018.2823326","title":"Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Danmarks Frie Forskningsfond; University of Toronto","keywords":"Finite field; Secret sharing; Mathematics; Algebraic number; Algebraic geometry; Construct (python library); Computer science; Discrete mathematics; Field (mathematics); Theoretical computer science; Topology (electrical circuits); Cryptography; Algorithm; Geometry; Combinatorics; Computer network; Pure mathematics","score_opus":0.008154257861510495,"score_gpt":0.22425740015464313,"score_spread":0.21610314229313263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535290256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090727575,0.000017644998,0.90556276,0.00014557638,0.00021566286,0.00016453276,0.000016576894,0.00024666905,0.0029030256],"genre_scores_gemma":[0.99496764,0.000008661603,0.0042828294,0.0006587469,0.000015592623,0.000030816977,0.0000074730856,0.0000066084117,0.000021632004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898887,0.00012944096,0.00026490202,0.0001777259,0.00024764458,0.00019139612],"domain_scores_gemma":[0.9986648,0.00030355845,0.00011857577,0.0007181684,0.00011415195,0.00008075334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089568814,0.00015671526,0.00011428515,0.000540826,0.00062343455,0.0002544004,0.00053960306,0.00008236689,0.000105262516],"category_scores_gemma":[0.000014346036,0.00014922823,0.000073871815,0.00056852313,0.00019142512,0.00088562566,0.000008784802,0.0002475781,0.000095383955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002573702,0.00017422663,0.00002396297,0.00005173934,0.000049357757,2.712459e-7,0.004231348,0.028493496,0.00010906047,0.85608834,0.00006326522,0.11045755],"study_design_scores_gemma":[0.0013624383,0.000701443,0.0004735628,0.0002683622,0.000035440626,0.000009667768,0.0007877651,0.93202627,0.025500085,0.035883147,0.0024279363,0.00052386563],"about_ca_topic_score_codex":0.000002512649,"about_ca_topic_score_gemma":0.0000019979207,"teacher_disagreement_score":0.9042401,"about_ca_system_score_codex":0.00003857692,"about_ca_system_score_gemma":0.00003005463,"threshold_uncertainty_score":0.60853505},"labels":[],"label_agreement":null},{"id":"W254188420","doi":"10.1007/978-3-540-24654-1_20","title":"Additive Autocorrelation of Resilient Boolean Functions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Boolean function; Function (biology); Transformation (genetics); Nonlinear system; Algebraic number; Dual (grammatical number); Mathematics; Computer science; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.011021309562656836,"score_gpt":0.22364868040168678,"score_spread":0.21262737083902994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W254188420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009954269,0.0001466421,0.98821396,0.00022746631,0.0014396489,0.00034993162,0.000015150808,0.00012492965,0.009382705],"genre_scores_gemma":[0.7202911,0.00003179416,0.27805007,0.0006172982,0.00041891605,0.00002233017,0.00002126543,0.000039114995,0.0005081301],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735886,0.000033709013,0.00046364137,0.0010306134,0.00072742184,0.00038575171],"domain_scores_gemma":[0.99784416,0.00034709336,0.00033508317,0.0011149455,0.00024526927,0.000113464615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063212233,0.00034928368,0.00036273577,0.0010422058,0.00023711663,0.00014989442,0.0017906016,0.00023251037,0.000067617504],"category_scores_gemma":[0.00006647936,0.00033416308,0.00019612379,0.00085271057,0.00076087116,0.00047347305,0.00066206517,0.00059599447,0.00003838874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010440736,0.000039056984,0.000022048978,0.000018769446,0.000012912624,0.000016827022,0.0007957539,0.040295724,0.000076589895,0.39569706,0.000023738878,0.5629911],"study_design_scores_gemma":[0.00029623692,0.0003952463,0.00047751077,0.00064339215,0.000014927522,0.000026076945,4.1094083e-7,0.06473769,0.0014909041,0.9299451,0.001460416,0.00051207875],"about_ca_topic_score_codex":0.000012568834,"about_ca_topic_score_gemma":0.000026835334,"teacher_disagreement_score":0.72019154,"about_ca_system_score_codex":0.00022164924,"about_ca_system_score_gemma":0.0005261679,"threshold_uncertainty_score":0.99991107},"labels":[],"label_agreement":null},{"id":"W2545228891","doi":"10.1109/milcom.1990.117389","title":"On the weight distributions of m-sequences in AWGN","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Additive white Gaussian noise; Mathematics; Gaussian; Decimation; Statistics; Merge (version control); Algorithm; Discrete mathematics; Combinatorics; White noise; Computer science; Telecommunications; Physics","score_opus":0.021146027848582872,"score_gpt":0.21144000811550884,"score_spread":0.19029398026692596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545228891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4511144,0.00019417903,0.32725233,0.016020145,0.00038576341,0.00017732575,0.0000067380306,0.00014435191,0.20470478],"genre_scores_gemma":[0.99912417,0.000009365695,0.00057949615,0.00014150667,0.000005296523,0.0000041635444,1.3721711e-7,6.085358e-7,0.00013527555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962467,0.00004840221,0.000078254634,0.000088238725,0.00007907228,0.0000813671],"domain_scores_gemma":[0.9994963,0.00021513285,0.000019303217,0.00024491615,0.00001083141,0.0000135467735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016450498,0.000035290526,0.000041717427,0.000043201242,0.00005036063,0.000016886795,0.00044332538,0.000012722437,0.0003107201],"category_scores_gemma":[0.000025127385,0.00002008914,0.000034536464,0.0004536593,0.000060312024,0.00007458252,0.000040848172,0.00004969229,0.00003074604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.7070915e-7,0.000035022567,0.0003419778,5.029035e-7,0.0000014279825,8.9503556e-7,0.000107026004,0.0000041891176,0.00008384628,0.9959975,0.0010603474,0.0023668262],"study_design_scores_gemma":[0.00011461929,0.000100893674,0.0031318257,0.000023610575,0.0000015931898,0.000003045765,0.00003484084,0.008603642,0.007664766,0.97647643,0.0037469885,0.000097749624],"about_ca_topic_score_codex":0.000008127953,"about_ca_topic_score_gemma":0.00000966558,"teacher_disagreement_score":0.54800975,"about_ca_system_score_codex":0.0000044356184,"about_ca_system_score_gemma":0.0000029984135,"threshold_uncertainty_score":0.3402167},"labels":[],"label_agreement":null},{"id":"W2546840736","doi":"10.1109/itw2.2006.323689","title":"Interleaved Construction of Binary Sequences with Optimal Autocorrelation Magnitude","year":2006,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autocorrelation; Binary number; Combinatorics; Magnitude (astronomy); Mathematics; Algorithm; Computer science; Discrete mathematics; Statistics; Physics; Arithmetic","score_opus":0.005295139646072724,"score_gpt":0.19367686286974772,"score_spread":0.188381723223675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546840736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31157544,0.000018821293,0.68265355,0.00018461044,0.0000746055,0.00007712368,3.9962833e-7,0.00012190073,0.00529354],"genre_scores_gemma":[0.7869308,7.342489e-7,0.21295117,0.000019833482,0.000011335312,0.000003987638,0.0000014256542,0.0000016966512,0.00007903399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948436,0.00003901785,0.00013569996,0.00014497129,0.00010742446,0.000088522465],"domain_scores_gemma":[0.999669,0.000028481687,0.00008716355,0.00015439742,0.000044015127,0.000016946622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012462075,0.00006172498,0.00007762027,0.00010706154,0.000052182237,0.000036220208,0.00019413479,0.000020106867,0.000030795116],"category_scores_gemma":[0.0000019319045,0.0000469031,0.00003182866,0.00031412733,0.00011127147,0.0003313931,0.00003830179,0.000043516735,0.0000042886004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025375017,0.00004773507,0.0069956305,0.000009033334,0.000011001452,0.0000029952266,0.00020068408,0.0021980512,0.0024751406,0.9686137,0.000118126336,0.019302532],"study_design_scores_gemma":[0.0034859958,0.0064692413,0.24178325,0.00052443857,0.00006163925,0.0006288247,0.0017393074,0.3796832,0.06803767,0.29298025,0.00300868,0.0015975235],"about_ca_topic_score_codex":0.00005593483,"about_ca_topic_score_gemma":0.000010943954,"teacher_disagreement_score":0.67563343,"about_ca_system_score_codex":0.000008543692,"about_ca_system_score_gemma":0.000029172994,"threshold_uncertainty_score":0.1912653},"labels":[],"label_agreement":null},{"id":"W2551168410","doi":"10.1016/j.disc.2016.09.008","title":"A simple shift rule for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml13\" display=\"inline\" overflow=\"scroll\" altimg=\"si13.gif\"><mml:mi>k</mml:mi></mml:math>-ary de Bruijn sequences","year":2016,"lang":"nl","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; De Bruijn sequence; Mathematics; Sequence (biology); Combinatorics; Order (exchange); Amortized analysis; String (physics); Simple (philosophy); Discrete mathematics; Algorithm; Data structure; Computer science","score_opus":0.020056188282154667,"score_gpt":0.25692419384793713,"score_spread":0.23686800556578247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551168410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.846795,0.00044975997,0.14750166,0.0010588861,0.00086369587,0.00023460024,0.00058016815,0.0003287671,0.0021874078],"genre_scores_gemma":[0.96452,0.00031940342,0.03251043,0.00093954406,0.0007417136,0.0003900932,0.000103660925,0.00019878914,0.0002764073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948797,0.00019112561,0.0012172224,0.0011419065,0.0010398822,0.0015301215],"domain_scores_gemma":[0.99439824,0.0019334551,0.0010153801,0.0019540917,0.000114855364,0.00058399217],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019569544,0.00075670274,0.0005696456,0.00022330353,0.0010281972,0.0009639608,0.0022243652,0.0006364426,0.00016461105],"category_scores_gemma":[0.0008256281,0.0007101104,0.0010794215,0.0005934854,0.00078817236,0.0010892202,0.0011634006,0.00048322824,0.0011293628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001919071,0.00028263338,0.000029875404,0.001065896,0.00038348977,0.00012684985,0.0039812517,0.00010992856,0.0013584965,0.9891107,0.0013607577,0.0019982164],"study_design_scores_gemma":[0.0011423689,0.0008148888,0.000056006575,0.0013881396,0.000453755,0.00020718823,0.00089130964,0.8137662,0.0057955473,0.16919814,0.0052871346,0.0009993531],"about_ca_topic_score_codex":0.00009889299,"about_ca_topic_score_gemma":0.0000893873,"teacher_disagreement_score":0.81991255,"about_ca_system_score_codex":0.00004059789,"about_ca_system_score_gemma":0.0006088197,"threshold_uncertainty_score":0.9996484},"labels":[],"label_agreement":null},{"id":"W2560133215","doi":"10.1216/rmj-2016-46-5-1587","title":"The number of irreducible polynomials with the first two prescribed coefficients over a finite field","year":2016,"lang":"en","type":"article","venue":"Rocky Mountain Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monic polynomial; Finite field; Irreducible polynomial; Field (mathematics); Degree (music); Discrete orthogonal polynomials; Base (topology); Difference polynomials; Combinatorics; Orthogonal polynomials; Pure mathematics; Quadratic equation; Discrete mathematics; Algebra over a field; Polynomial; Mathematical analysis; Matrix polynomial; Geometry","score_opus":0.010651027634308148,"score_gpt":0.2543227377251943,"score_spread":0.24367171009088617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560133215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31048927,0.00012411535,0.6829716,0.005208048,0.00021965338,0.00015783988,0.0000025794645,0.000017079308,0.0008097885],"genre_scores_gemma":[0.99392194,0.00003841453,0.005490739,0.00023981609,0.00007965579,0.000003913711,3.3912336e-8,0.000010436798,0.00021505138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863595,0.0000918875,0.00046459658,0.00011168847,0.0004674524,0.00022841235],"domain_scores_gemma":[0.99559665,0.0028982144,0.0006536259,0.0005876133,0.00020438009,0.00005953312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014085724,0.00013483684,0.0002286858,0.00005987846,0.0002630794,0.00012357924,0.0013552352,0.00003430498,0.00003678578],"category_scores_gemma":[0.0002683886,0.000052589552,0.0001475082,0.00029437026,0.00010829471,0.00023122056,0.00017266482,0.0001379807,0.000008630593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010034927,0.0019183154,0.015556987,0.00029316978,0.0013315071,0.000075926844,0.025418077,0.0020636928,0.004063784,0.8562921,0.046939507,0.045043383],"study_design_scores_gemma":[0.017614417,0.0048370394,0.0039960346,0.007713995,0.00087926106,0.002961135,0.00637216,0.02583828,0.09981716,0.6469641,0.18061483,0.0023916468],"about_ca_topic_score_codex":0.0000045566935,"about_ca_topic_score_gemma":0.000009884096,"teacher_disagreement_score":0.68343264,"about_ca_system_score_codex":0.000022268145,"about_ca_system_score_gemma":0.00007577778,"threshold_uncertainty_score":0.25183868},"labels":[],"label_agreement":null},{"id":"W2560190413","doi":"10.1007/978-3-319-69453-5","title":"Selected Areas in Cryptography – SAC 2016","year":2017,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Cryptography; Computer security","score_opus":0.010671932868329733,"score_gpt":0.2361436477429395,"score_spread":0.22547171487460976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560190413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028554045,0.00087829103,0.98832077,0.00044041383,0.0022135125,0.00044652566,0.0000055780915,0.00029123938,0.007118117],"genre_scores_gemma":[0.2830726,0.00037210938,0.70943636,0.0033878554,0.0021092359,0.00012395316,0.00003758843,0.00016479468,0.0012954917],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947849,0.00016990877,0.0006145763,0.002169151,0.0010376988,0.0012237825],"domain_scores_gemma":[0.99528944,0.0006942348,0.00045457925,0.0029846365,0.00032439936,0.0002526894],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017146377,0.00072190247,0.000782527,0.0028835307,0.0005305129,0.0013013203,0.0087786205,0.00049682317,0.00001952296],"category_scores_gemma":[0.0002583647,0.00067228323,0.00026279534,0.0033783833,0.001281253,0.0010833322,0.0017494867,0.0013956839,0.00005020724],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027984446,0.00016283336,0.002117445,0.00008230277,0.000029988452,0.00029571075,0.0013131198,0.0022847624,0.00017740316,0.027931346,0.0011685893,0.9644085],"study_design_scores_gemma":[0.00080426526,0.00033445616,0.0059369183,0.0015557411,0.000013209726,0.00008793688,1.8806162e-7,0.06505365,0.0007686866,0.9147001,0.009117763,0.0016270833],"about_ca_topic_score_codex":0.00004166518,"about_ca_topic_score_gemma":0.0002382508,"teacher_disagreement_score":0.9627814,"about_ca_system_score_codex":0.0003020806,"about_ca_system_score_gemma":0.0020335375,"threshold_uncertainty_score":0.9997354},"labels":[],"label_agreement":null},{"id":"W2561596263","doi":"10.82308/22604","title":"Two mathematical security aspects of the RSA cryptosystem : signature padding schemes and key generation with a backdoor","year":2008,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Padding; Cryptosystem; Backdoor; Correctness; Computer science; Theoretical computer science; Cryptography; Key (lock); Mathematics; Discrete mathematics; Algorithm; Computer security","score_opus":0.015601072044488786,"score_gpt":0.20781668010864351,"score_spread":0.19221560806415472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561596263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9814282,0.00018117721,0.00047072684,0.000063478175,0.0001638918,0.0003815235,0.00003672271,0.00017578495,0.017098516],"genre_scores_gemma":[0.9907164,0.000016802614,0.008985017,0.00015954886,0.00003542446,0.00002530184,0.0000019907193,0.000026100814,0.000033387954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756634,0.00041308213,0.0004078279,0.0006203605,0.00060739333,0.00038497197],"domain_scores_gemma":[0.9982778,0.00023754369,0.00026468915,0.00084485364,0.00020300038,0.00017212017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079095963,0.00032113848,0.0003697457,0.00013956185,0.0011072409,0.000090431895,0.0008343659,0.00015466807,0.000023243923],"category_scores_gemma":[0.00019104558,0.00022501346,0.00016010262,0.000856088,0.00020240982,0.00085481623,0.0004250314,0.00057506707,0.000011294292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002144389,0.000094026735,0.00014745943,0.00007367778,0.00005692256,0.000027314096,0.0000622081,0.000023614757,0.036236405,0.960241,0.0000016685708,0.0030142595],"study_design_scores_gemma":[0.0023724982,0.00048494214,0.0008249743,0.00071860984,0.00012128858,0.001316997,0.00015740332,0.0073475973,0.47727945,0.50314605,0.005068598,0.0011615474],"about_ca_topic_score_codex":0.000008710833,"about_ca_topic_score_gemma":0.00003342122,"teacher_disagreement_score":0.4570949,"about_ca_system_score_codex":0.00007203369,"about_ca_system_score_gemma":0.00003736594,"threshold_uncertainty_score":0.9175783},"labels":[],"label_agreement":null},{"id":"W2566607440","doi":"10.1090/mcom/3247","title":"An analog of the prime number theorem for finite fields via truncated polylogarithm expansions","year":2016,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polylogarithm; Mathematics; Monic polynomial; Asymptotic expansion; Asymptotic analysis; Riemann zeta function; Bell polynomials; Function (biology); Prime (order theory); Generating function; Asymptotic formula; Analytic number theory; Applied mathematics; Integer (computer science); Pure mathematics; Mathematical analysis; Combinatorics; Polynomial; Prime zeta function; Arithmetic zeta function","score_opus":0.015230427623292483,"score_gpt":0.26658078482223646,"score_spread":0.251350357198944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566607440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13081335,0.000004172518,0.86834925,0.00024771705,0.00009838801,0.00017798952,0.0000067034957,0.00003934849,0.00026308038],"genre_scores_gemma":[0.8925977,7.855017e-7,0.107324146,0.000033242875,0.000011896206,0.0000078894045,0.0000016473302,0.000005649807,0.000017077615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924135,0.00007037609,0.00028996082,0.00013133888,0.00016125568,0.00010569554],"domain_scores_gemma":[0.99834996,0.00078856805,0.00025386846,0.00041123558,0.00016847457,0.000027909971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038298304,0.000083303814,0.0001521916,0.000062446234,0.00007262277,0.000017168995,0.00050820614,0.000052054307,0.000009924715],"category_scores_gemma":[0.00008745701,0.000048263657,0.00011404026,0.00026798306,0.00008373047,0.00015698638,0.000067399385,0.000033399832,0.00000246839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018952154,0.00035267312,0.00026753655,0.00007893914,0.0000448735,2.0160648e-7,0.0034919817,0.00076209335,0.015651831,0.91079944,0.000077508485,0.068453945],"study_design_scores_gemma":[0.00029934297,0.00010977386,0.00077015965,0.0000823604,0.000015806567,0.0000027153699,0.000034658366,0.15966864,0.026666265,0.8122604,0.000012705111,0.00007716711],"about_ca_topic_score_codex":0.0000025302609,"about_ca_topic_score_gemma":0.0000020533876,"teacher_disagreement_score":0.7617843,"about_ca_system_score_codex":0.0000060038583,"about_ca_system_score_gemma":0.00002674675,"threshold_uncertainty_score":0.19681348},"labels":[],"label_agreement":null},{"id":"W2571232930","doi":"10.1016/j.ffa.2016.11.015","title":"Lee weights of cyclic self-dual codes over Galois rings of characteristic p2","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea; Ministry of Education","keywords":"Mathematics; Dual (grammatical number); Pure mathematics","score_opus":0.010565505448550283,"score_gpt":0.23184939417082684,"score_spread":0.22128388872227656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571232930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6314146,0.000114894014,0.36222565,0.00035403782,0.00006854343,0.00021804424,0.00006523193,0.000073760406,0.005465263],"genre_scores_gemma":[0.9976497,0.00007375857,0.0021013161,0.000046988924,0.00003968109,0.00004134303,0.000003848778,0.000003683365,0.00003967735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994784,0.000016243652,0.00016691569,0.0001789734,0.000059872502,0.00009959543],"domain_scores_gemma":[0.9987954,0.00019607517,0.0001978658,0.0007235219,0.00004566019,0.00004150806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012242401,0.00008504396,0.0001501307,0.00006217232,0.00025294363,0.00006104933,0.00049475505,0.000059206257,0.000017432074],"category_scores_gemma":[0.000012883968,0.00006915479,0.00006488334,0.00008307664,0.00009495688,0.00014093652,0.00017891258,0.00007957795,0.0000034920758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008237664,0.00014652926,0.0053118276,0.00006166263,0.00005663633,4.189623e-7,0.0018042198,8.84426e-7,0.0028300465,0.9700456,0.00005305667,0.019680869],"study_design_scores_gemma":[0.00080700824,0.0003009779,0.30780938,0.00014415686,0.00006299138,0.000012198104,0.00008251378,0.006559628,0.02412113,0.6217694,0.03780157,0.0005289859],"about_ca_topic_score_codex":0.000026358852,"about_ca_topic_score_gemma":0.0000067344054,"teacher_disagreement_score":0.36623514,"about_ca_system_score_codex":0.00000194983,"about_ca_system_score_gemma":0.000012463973,"threshold_uncertainty_score":0.28200504},"labels":[],"label_agreement":null},{"id":"W2574055986","doi":"","title":"On locating-dominating codes in the infinite king grid.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Grid; Geometry","score_opus":0.012978371822295554,"score_gpt":0.23708129340028522,"score_spread":0.22410292157798967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574055986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98420435,0.000050091352,0.005771785,0.0015921084,0.0014415983,0.00014567471,9.586431e-7,0.00012805492,0.006665393],"genre_scores_gemma":[0.99889964,0.000005898825,0.000483145,0.0005523946,0.0000131926645,0.000022182423,3.0083066e-7,0.0000067682954,0.000016493139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987358,0.0002641987,0.00019747931,0.00027543286,0.0002528556,0.00027423367],"domain_scores_gemma":[0.9974608,0.001795837,0.00008959964,0.0005799692,0.00003855302,0.0000352716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012729432,0.00012578942,0.00012124027,0.00014219608,0.00018961752,0.00012211631,0.0011308352,0.000042900858,0.0000078264275],"category_scores_gemma":[0.00032042587,0.000074200565,0.00006007659,0.00064275117,0.00007090904,0.00025736445,0.00015523244,0.00015402831,0.00004727693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065152162,0.00005590996,0.0023729587,0.0000032048106,0.000004165786,0.000009909132,0.00095570815,0.000004449273,0.00031638925,0.9651189,0.00020275892,0.03094915],"study_design_scores_gemma":[0.0006322093,0.00014324841,0.0050556352,0.00015908062,0.0000022733936,0.0000053642552,0.00006246596,0.00054818764,0.00090634404,0.99160516,0.0007291791,0.00015086647],"about_ca_topic_score_codex":0.000011716467,"about_ca_topic_score_gemma":0.000005947868,"teacher_disagreement_score":0.030798282,"about_ca_system_score_codex":0.000028047207,"about_ca_system_score_gemma":0.000021541067,"threshold_uncertainty_score":0.30258113},"labels":[],"label_agreement":null},{"id":"W2574354056","doi":"10.21700/ijcis.2016.127","title":"Stream Cipher with Space-Time Block Code","year":2016,"lang":"en","type":"article","venue":"International Journal of Computing and Information Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stream cipher; Block cipher; CBC-MAC; Computer science; Transposition cipher; Block (permutation group theory); Code (set theory); Stream cipher attack; Arithmetic; Parallel computing; Algorithm; Mathematics; Programming language; Cryptography; Computer security; Running key cipher; Cipher; Encryption; Combinatorics","score_opus":0.007954300909816695,"score_gpt":0.2482061534531479,"score_spread":0.2402518525433312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574354056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49907345,0.000023555123,0.4912865,0.0045923516,0.00041172106,0.000025336347,0.0000013982235,0.000030682866,0.004555024],"genre_scores_gemma":[0.9866742,0.000016914211,0.012913685,0.00029422675,0.00007731422,1.2645701e-7,9.462589e-8,9.188167e-7,0.000022541371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998994,0.000030150917,0.00028017003,0.000067049434,0.0005281411,0.00010048573],"domain_scores_gemma":[0.9989111,0.00018811876,0.0003810817,0.000063345535,0.00040028253,0.000056092787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008274088,0.00006346751,0.000082438,0.0002822032,0.00011641267,0.00036832655,0.00071103586,0.00001645155,0.000011607934],"category_scores_gemma":[0.0000640269,0.000033992663,0.00003529753,0.00020976373,0.00015230774,0.003371724,0.0000984879,0.00004855439,0.000012051622],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093322626,0.00006107896,0.009918244,0.0000064810583,0.00013302971,0.0000119032175,0.0039297226,0.003094137,0.00093629427,0.3044598,0.0016739765,0.675682],"study_design_scores_gemma":[0.013553643,0.008084272,0.098864965,0.0042255046,0.00008170672,0.009530035,0.0025848607,0.42055875,0.023113344,0.11118281,0.30579564,0.0024244727],"about_ca_topic_score_codex":0.0000015021413,"about_ca_topic_score_gemma":2.949414e-7,"teacher_disagreement_score":0.6732575,"about_ca_system_score_codex":0.0000138243595,"about_ca_system_score_gemma":0.000073235904,"threshold_uncertainty_score":0.35517812},"labels":[],"label_agreement":null},{"id":"W2576980341","doi":"","title":"The weight distributions of some binary cyclic codes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary number; Arithmetic","score_opus":0.007962786466257624,"score_gpt":0.220176913721359,"score_spread":0.2122141272551014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576980341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97405773,0.001082023,0.011940373,0.0063665723,0.0041005523,0.00019372953,0.000024958437,0.0002747469,0.0019593048],"genre_scores_gemma":[0.99953747,0.00015008546,0.000141296,0.000034897846,0.000008506292,0.000014290304,9.665481e-7,0.000004820346,0.000107641165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908125,0.00010728976,0.00019047153,0.00019864709,0.00018117367,0.0002411926],"domain_scores_gemma":[0.9984992,0.0005316033,0.000092273534,0.00074240105,0.00006683082,0.000067703404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038935532,0.00009713873,0.00011598264,0.000050116992,0.00031276266,0.000038816834,0.0010524918,0.000042207146,0.000009130408],"category_scores_gemma":[0.00006534279,0.000054159274,0.00010926847,0.0003992149,0.0002210656,0.0003054644,0.00026335922,0.00006824499,0.00004221559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065082154,0.000060834234,0.0008618592,0.0000017554848,0.000018386481,0.000002452642,0.000037546928,9.496156e-8,0.0032016402,0.9860685,0.0016611076,0.008079333],"study_design_scores_gemma":[0.0003438197,0.000090958965,0.0044592842,0.000024683155,0.000005863307,0.000003031764,0.0000041306685,0.000034804998,0.00910355,0.97183275,0.01400155,0.000095567695],"about_ca_topic_score_codex":0.0000030398844,"about_ca_topic_score_gemma":6.741839e-7,"teacher_disagreement_score":0.025479756,"about_ca_system_score_codex":0.000023381264,"about_ca_system_score_gemma":0.000037955448,"threshold_uncertainty_score":0.24055491},"labels":[],"label_agreement":null},{"id":"W2577240032","doi":"","title":"On the weight distributions of some q-ary cyclic codes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.00941256638059285,"score_gpt":0.21472464694898438,"score_spread":0.20531208056839154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577240032","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97633797,0.00015308041,0.010189562,0.007282267,0.0020163865,0.00016004173,0.000025179996,0.00017381775,0.0036617015],"genre_scores_gemma":[0.99961287,0.000026576363,0.0000717979,0.00019721006,0.0000069611797,0.000013970097,9.3701294e-7,0.0000045425927,0.00006512135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991557,0.00011611095,0.0001516435,0.00019862434,0.00018762724,0.00019029737],"domain_scores_gemma":[0.9983337,0.00074096065,0.00007618094,0.00073660025,0.000045131765,0.00006741822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033463442,0.000097118434,0.000114115726,0.00005613144,0.00016458455,0.000024693627,0.00090917386,0.000039954924,0.00004966475],"category_scores_gemma":[0.00011916061,0.000052499803,0.00010444952,0.00034625476,0.00014647462,0.00020409883,0.00017034695,0.00008035317,0.00007233144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059385548,0.000087915636,0.00033644252,0.0000015129672,0.000016332506,0.0000018428145,0.000044254542,1.3414797e-7,0.0015903938,0.9923199,0.00324056,0.0023547797],"study_design_scores_gemma":[0.00027524558,0.00009594737,0.002234132,0.00003686148,0.0000048929915,0.0000016901178,0.0000025404142,0.000022625201,0.014365868,0.9804698,0.0024042276,0.000086151755],"about_ca_topic_score_codex":0.000002537764,"about_ca_topic_score_gemma":3.128109e-7,"teacher_disagreement_score":0.02327492,"about_ca_system_score_codex":0.000021041868,"about_ca_system_score_gemma":0.00003206848,"threshold_uncertainty_score":0.21408798},"labels":[],"label_agreement":null},{"id":"W2577529735","doi":"","title":"A new class of 2-fold perfect 4-splitting authentication codes.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fold (higher-order function); Class (philosophy); Authentication (law); Discrete mathematics; Combinatorics; Computer science; Computer security; Programming language; Artificial intelligence","score_opus":0.010592016452183836,"score_gpt":0.22818995684599572,"score_spread":0.2175979403938119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577529735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87102205,0.00015238352,0.12214435,0.0011713845,0.0015739299,0.0001563281,0.0000015091517,0.00024772246,0.0035303412],"genre_scores_gemma":[0.9965542,0.000009648725,0.003136039,0.000040024144,0.000008870658,0.0000050175445,3.4026877e-7,0.000007158897,0.00023867832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990373,0.00008850986,0.0002108832,0.0002645006,0.00019846488,0.00020032882],"domain_scores_gemma":[0.99882996,0.0002837946,0.00012596011,0.0005993344,0.00007208268,0.00008886701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047698867,0.000102252234,0.00014598717,0.000102327554,0.00007319296,0.000040360137,0.0006798258,0.00005211093,0.00003145243],"category_scores_gemma":[0.00008993922,0.00007740041,0.00009949526,0.000401437,0.00004562896,0.00028370466,0.00015986765,0.000057037967,0.000037437225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065272866,0.000034103457,0.0026260721,0.0000060650136,0.000015167412,8.4848045e-7,0.0003389599,1.509304e-7,0.013918157,0.9405606,0.000550062,0.04194332],"study_design_scores_gemma":[0.00066039566,0.00011857207,0.0046024485,0.00008430169,0.000011549383,0.0000032035286,0.00001057567,0.00039238055,0.023554744,0.96858144,0.0018360545,0.00014430995],"about_ca_topic_score_codex":0.000011215683,"about_ca_topic_score_gemma":7.9326196e-7,"teacher_disagreement_score":0.12553217,"about_ca_system_score_codex":0.0000248213,"about_ca_system_score_gemma":0.00006241089,"threshold_uncertainty_score":0.3156297},"labels":[],"label_agreement":null},{"id":"W2582163805","doi":"10.1049/iet-com.2016.0303","title":"Code‐based security with random interleaving","year":2017,"lang":"en","type":"article","venue":"IET Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Interleaving; Code (set theory); Programming language; Theoretical computer science; Operating system","score_opus":0.03582894615192945,"score_gpt":0.2998896858542459,"score_spread":0.26406073970231647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582163805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021797847,0.00030592878,0.8890475,0.015032224,0.00026506645,0.00031691196,0.000016286003,0.00047559463,0.07274264],"genre_scores_gemma":[0.96374434,0.000018768913,0.0359011,0.00024174729,0.000015169753,0.00003371544,0.000004225911,0.000005337995,0.00003559664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999355,0.00014206837,0.00011209282,0.00015870496,0.00010008524,0.000132025],"domain_scores_gemma":[0.9936417,0.00026771243,0.00012892993,0.0057744253,0.000132604,0.00005463443],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00039371717,0.0000823593,0.000104292034,0.00005689696,0.0013296881,0.00044707826,0.005180295,0.000027873893,0.000012385842],"category_scores_gemma":[0.00011752085,0.00007102033,0.000063557585,0.000107326014,0.000299773,0.0004251134,0.00079823355,0.0001911979,0.000020674985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007542442,0.0003220038,0.0078053246,0.000014060157,0.00006202159,0.000003692658,0.0024830762,0.000034472498,0.00018031924,0.9640556,0.0017733728,0.023190608],"study_design_scores_gemma":[0.008328295,0.00048217704,0.025932468,0.000619201,0.0001014726,0.000026654203,0.0003585249,0.26109844,0.0027495595,0.29063946,0.40833044,0.0013333191],"about_ca_topic_score_codex":0.000041075193,"about_ca_topic_score_gemma":0.00036190372,"teacher_disagreement_score":0.9419465,"about_ca_system_score_codex":0.000010865893,"about_ca_system_score_gemma":0.000041207655,"threshold_uncertainty_score":0.99997044},"labels":[],"label_agreement":null},{"id":"W2582439668","doi":"10.48550/arxiv.1701.05705","title":"Construction and nonexistence of strong external difference families","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lambda; Algebraic number; Scope (computer science); Mathematics; Range (aeronautics); Character (mathematics); Construct (python library); Combinatorics; Pure mathematics; Discrete mathematics; Physics; Computer science; Mathematical analysis; Quantum mechanics; Geometry","score_opus":0.06656221915557264,"score_gpt":0.1883878140078955,"score_spread":0.12182559485232286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582439668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5214992,0.00006549297,0.4759247,0.0000083217365,0.0002619656,0.00006154497,0.0000066411776,0.000045130793,0.0021270097],"genre_scores_gemma":[0.9943822,0.00034483333,0.0050957855,0.000005764762,0.000023797358,3.1011436e-7,9.721504e-7,0.000004253671,0.00014207861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989523,0.000077431,0.00012686655,0.00060922874,0.000067396264,0.00016675316],"domain_scores_gemma":[0.9984586,0.000072635376,0.00032685188,0.0009785192,0.00008355639,0.000079819125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014998608,0.0001826443,0.00024942655,0.00019838255,0.00018919514,0.00011326928,0.0013656095,0.00012978604,0.000005092873],"category_scores_gemma":[0.00001982138,0.00020345392,0.00011501546,0.00012237902,0.00054885034,0.00022175135,0.0015563639,0.00028538879,0.0000021887965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002626881,0.000024815621,0.023874354,0.000080117214,0.000035304744,0.000035898418,0.00023736221,0.00096291455,0.0002369554,0.96335185,0.0000018192421,0.011132342],"study_design_scores_gemma":[0.0006290638,0.00014936045,0.057937678,0.0006438961,0.00010254804,0.000029059816,0.00030758794,0.095075935,0.0009568971,0.84345466,0.000060086095,0.0006532018],"about_ca_topic_score_codex":0.00009611494,"about_ca_topic_score_gemma":0.000014988711,"teacher_disagreement_score":0.47288302,"about_ca_system_score_codex":0.000021554259,"about_ca_system_score_gemma":0.00006527616,"threshold_uncertainty_score":0.829661},"labels":[],"label_agreement":null},{"id":"W2583679202","doi":"10.4230/lipics.aofa.2018.30","title":"Periods of Iterations of Mappings over Finite Fields with Restricted Preimage Sizes","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Modulo; Mathematics; Product (mathematics); Combinatorics; Set (abstract data type); Discrete mathematics; Heuristic; Finite set; Mathematical analysis; Mathematical optimization; Geometry; Computer science","score_opus":0.013656057012199144,"score_gpt":0.24707481273719306,"score_spread":0.23341875572499393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583679202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3269811,0.00005169534,0.66485065,0.0001533955,0.0007286333,0.0011926595,0.0008691736,0.00018594768,0.004986718],"genre_scores_gemma":[0.91349036,0.00004532054,0.08541915,0.0002656959,0.000121891564,0.00013628569,0.0003348368,0.000034277993,0.00015216986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706984,0.00007228675,0.0014141614,0.00039208878,0.0005656288,0.0004859935],"domain_scores_gemma":[0.99579036,0.00034601658,0.0013061283,0.0016760462,0.0007483551,0.0001330658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046194124,0.00049562886,0.00074901036,0.00061375933,0.00021668618,0.00035375718,0.0019583602,0.00045591142,0.00005524314],"category_scores_gemma":[0.00014295144,0.00042393198,0.00043512828,0.00060484634,0.00045353975,0.00097481726,0.0014452802,0.0006808943,0.000007849689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036463018,0.0047024693,0.05208861,0.027301917,0.0064061396,0.00004120285,0.33307877,0.009162699,0.0012687184,0.5079879,0.029610405,0.02470488],"study_design_scores_gemma":[0.021087931,0.010807816,0.031192461,0.014663623,0.0013164951,0.0001587786,0.004312635,0.64314306,0.026112814,0.10919283,0.1301446,0.007866942],"about_ca_topic_score_codex":0.000023703098,"about_ca_topic_score_gemma":0.000015093187,"teacher_disagreement_score":0.6339804,"about_ca_system_score_codex":0.000038329494,"about_ca_system_score_gemma":0.00022373564,"threshold_uncertainty_score":0.99982125},"labels":[],"label_agreement":null},{"id":"W2587862547","doi":"10.3934/amc.2017002","title":"New almost perfect, odd perfect, and perfect sequences from difference balanced functions with &lt;i&gt;d&lt;/i&gt;-form property","year":2017,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Perfect power; Interleaving; Combinatorics; Complementary sequences; Property (philosophy); QAM; Discrete mathematics; Algorithm; Quadrature amplitude modulation; Decoding methods","score_opus":0.021027546917038314,"score_gpt":0.26668051688441313,"score_spread":0.24565296996737482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587862547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36221895,0.017303523,0.5428477,0.0029757568,0.0003713979,0.0014841955,0.00009521272,0.00038403162,0.07231926],"genre_scores_gemma":[0.79859436,0.0032925813,0.19758502,0.000023691076,0.000020357536,0.000079794976,0.000010155658,0.000015065594,0.00037900015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998418,0.00014112929,0.00044451925,0.00039718268,0.00030446562,0.00029474933],"domain_scores_gemma":[0.994225,0.00090514467,0.0004934421,0.004109094,0.00014591239,0.000121396086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046773333,0.0002771895,0.00044380283,0.00015357135,0.0010141426,0.00028123506,0.0037370173,0.00007386189,0.000027928558],"category_scores_gemma":[0.00024672807,0.00019359462,0.00008836904,0.00032201243,0.0008138673,0.0013779001,0.00096151006,0.00029117023,0.000009927511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000637875,0.00077614776,0.014779115,0.00025863684,0.00014807729,0.000004629367,0.011235098,0.00016119397,0.016354494,0.84667987,0.00014803406,0.10939094],"study_design_scores_gemma":[0.00269366,0.0012256631,0.052042022,0.0029829673,0.00022879842,0.00008914204,0.0009970107,0.08367741,0.0025320516,0.8272712,0.02456528,0.0016947986],"about_ca_topic_score_codex":0.0000725885,"about_ca_topic_score_gemma":0.0016884694,"teacher_disagreement_score":0.43637538,"about_ca_system_score_codex":0.000033377393,"about_ca_system_score_gemma":0.00013103787,"threshold_uncertainty_score":0.78945595},"labels":[],"label_agreement":null},{"id":"W2590834615","doi":"10.1109/tit.2017.2780233","title":"Some Results on the Existence of $t$ -All-or-Nothing Transforms Over Arbitrary Alphabets","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Tuple; Integer (computer science); Mathematics; Bijection; Nothing; Alphabet; Combinatorics; Discrete mathematics; Literal (mathematical logic); Algorithm; Computer science","score_opus":0.03565162858536676,"score_gpt":0.2716290594767765,"score_spread":0.23597743089140977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590834615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0104576135,0.000050156512,0.9715892,0.0015616098,0.0027312518,0.0007975145,0.00031991422,0.0003514225,0.012141314],"genre_scores_gemma":[0.99482024,0.00030778087,0.0016033746,0.0027172472,0.000086834305,0.00015633543,0.000017099697,0.000020130135,0.00027096822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733984,0.00026730308,0.0009541323,0.0003854815,0.00069912797,0.00035413034],"domain_scores_gemma":[0.99560416,0.001074334,0.0008119084,0.0022775962,0.0001261831,0.00010579605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002270412,0.00042983476,0.0003894366,0.000577831,0.00068483356,0.00047909815,0.0026403181,0.00034791956,0.00005695336],"category_scores_gemma":[0.00005298234,0.00028789265,0.0005223145,0.00022495273,0.00030990227,0.0027494417,0.000024674226,0.0013490529,0.00007473998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018371758,0.00022465925,2.7564434e-7,0.00029782837,0.00032209564,0.00000490573,0.02669823,0.011811134,0.00006883512,0.787976,0.0002663275,0.17049249],"study_design_scores_gemma":[0.0020286397,0.0007797889,0.00012041711,0.0019576475,0.00015683445,0.000026706497,0.00084829784,0.01811285,0.045542635,0.92215896,0.0070527857,0.0012144155],"about_ca_topic_score_codex":0.000018768911,"about_ca_topic_score_gemma":0.000003974733,"teacher_disagreement_score":0.9843626,"about_ca_system_score_codex":0.00007068651,"about_ca_system_score_gemma":0.00022048254,"threshold_uncertainty_score":0.9999573},"labels":[],"label_agreement":null},{"id":"W2591853747","doi":"10.1109/cjece.2016.2638962","title":"New Systolic Array Architecture for Finite Field Inversion","year":2017,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"King Abdulaziz City for Science and Technology","keywords":"Architecture; Inversion (geology); Ranging; Systolic array; Application-specific integrated circuit; Power consumption; Computer science; Euclidean geometry; Finite field; Parallel computing; Algorithm; Computer engineering; Power (physics); Mathematics; Embedded system; Discrete mathematics; Telecommunications; Very-large-scale integration; Geometry","score_opus":0.0070217334734645745,"score_gpt":0.1827183458549758,"score_spread":0.1756966123815112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591853747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071298755,0.00035507925,0.9907838,0.0011624786,0.00047236492,0.000039574585,4.2933112e-7,0.000010869918,0.000045508517],"genre_scores_gemma":[0.924722,0.00000827359,0.07443312,0.0003172286,0.0004938852,6.844529e-7,1.4003508e-7,0.0000056951294,0.000018935067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947554,0.000008338593,0.00012674219,0.00010463151,0.00005924158,0.00022552683],"domain_scores_gemma":[0.9990491,0.00019488377,0.0000759189,0.00017897776,0.000039961342,0.00046115217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011062662,0.0000866606,0.00013836924,0.00023415625,0.00020668808,0.00028279284,0.00060978986,0.000046928264,0.0000019761794],"category_scores_gemma":[0.00009428673,0.00007635651,0.000090443966,0.00009138084,0.000009433124,0.00017263845,0.000022726492,0.00018740057,3.9698278e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027503942,0.000008820586,0.0011438002,0.000055018525,0.00010178469,0.00012447726,0.00062937126,0.0059333015,0.00062054285,0.12539893,0.006506758,0.8594497],"study_design_scores_gemma":[0.002439411,0.0030964972,0.009483159,0.0006100543,0.00007336765,0.001031924,0.0000045032116,0.6676368,0.0049424744,0.061657693,0.24796633,0.0010577675],"about_ca_topic_score_codex":0.00011968852,"about_ca_topic_score_gemma":0.00008645554,"teacher_disagreement_score":0.91759217,"about_ca_system_score_codex":0.000017230725,"about_ca_system_score_gemma":0.00014899592,"threshold_uncertainty_score":0.31137282},"labels":[],"label_agreement":null},{"id":"W2592025126","doi":"10.1109/tc.2017.2676763","title":"Efficient Composited de Bruijn Sequence Generators","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Institute of Standards and Technology; Cisco Systems","keywords":"De Bruijn sequence; Sequence (biology); Computer science; Application-specific integrated circuit; Algorithm; Stream cipher; Parallel computing; Discrete mathematics; Mathematics; Cryptography; Computer hardware","score_opus":0.026515201882527626,"score_gpt":0.26316942932266646,"score_spread":0.23665422744013884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592025126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1190168,0.000008360625,0.8778011,0.0005366704,0.0017759503,0.00010680566,0.00000576882,0.00030523018,0.0004433211],"genre_scores_gemma":[0.94885004,0.000003550766,0.050438218,0.0005939325,0.000049345297,0.000012572574,3.2713163e-7,0.000010698489,0.000041304385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874306,0.00009985438,0.00017244539,0.00042081595,0.00021912613,0.0003447089],"domain_scores_gemma":[0.99840707,0.000112521186,0.00009894265,0.001157328,0.000049552695,0.00017456891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002507725,0.00018505323,0.00015535469,0.00026320067,0.0012625402,0.00051592715,0.0015773554,0.000053948028,0.0000114065515],"category_scores_gemma":[0.0000018835469,0.00018889278,0.0001762843,0.0002677734,0.00015848712,0.00017106158,0.000010153537,0.00023268239,0.00005168462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058061454,0.0005139946,0.00014397573,0.000019190611,0.00013722766,0.00010559662,0.0011378663,0.71896595,0.012805053,0.033629715,0.00063809473,0.23184524],"study_design_scores_gemma":[0.00056833477,0.00015913227,0.00060543366,0.0000748307,0.00001919242,0.00004805109,0.0000063495077,0.9490164,0.04740735,0.0010467111,0.0006665484,0.0003816807],"about_ca_topic_score_codex":0.000039700466,"about_ca_topic_score_gemma":0.000016251432,"teacher_disagreement_score":0.82983327,"about_ca_system_score_codex":0.00007438815,"about_ca_system_score_gemma":0.000055562166,"threshold_uncertainty_score":0.97105664},"labels":[],"label_agreement":null},{"id":"W2592036444","doi":"","title":"On The Extended Lee Weights Modulo 2e Of Linear Codes Over Z 2s .","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modulo; Mathematics; Arithmetic; Combinatorics; Discrete mathematics","score_opus":0.01572812407434099,"score_gpt":0.2523891981314223,"score_spread":0.2366610740570813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592036444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98690474,0.00005602757,0.0012026043,0.0007211128,0.0018429675,0.00013055658,0.0000028483205,0.00007955145,0.009059562],"genre_scores_gemma":[0.99914575,0.0000136535,0.00052884186,0.00015256352,0.0000132497,0.000008421513,4.6454306e-7,0.000007955816,0.00012910042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896693,0.0001048596,0.00016313657,0.0002746234,0.00028343094,0.0002070087],"domain_scores_gemma":[0.9976,0.00031204504,0.00018695227,0.001772278,0.00007164924,0.00005703396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048307024,0.00013567664,0.00017066817,0.00006166048,0.00062241673,0.00014803192,0.002040734,0.000057693356,0.0000338639],"category_scores_gemma":[0.00013107756,0.000092891176,0.0001320577,0.00012544141,0.0001874962,0.00027199366,0.0003453882,0.0001561293,0.000036147027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017452938,0.00011441392,0.00043797155,0.0000042241313,0.000026295516,0.000004511254,0.0002324508,0.0000024477806,0.00043048974,0.9960123,0.00089863344,0.0018188494],"study_design_scores_gemma":[0.00039916162,0.00015245334,0.011507082,0.000037849397,0.000006905767,0.0000012907641,0.0000070697565,0.002419253,0.008980831,0.97542036,0.00094394386,0.00012381248],"about_ca_topic_score_codex":0.000020647132,"about_ca_topic_score_gemma":0.0000025255642,"teacher_disagreement_score":0.020591913,"about_ca_system_score_codex":0.000010728821,"about_ca_system_score_gemma":0.000026088323,"threshold_uncertainty_score":0.4787189},"labels":[],"label_agreement":null},{"id":"W2592298307","doi":"","title":"Complexity evaluation of sova based algorithms for decoding of block codes on a sectionalized trellis","year":2002,"lang":"en","type":"article","venue":"International Symposium on Antenna Technology and Applied Electromagnetics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"","keywords":"Trellis (graph); Algorithm; Decoding methods; Soft-decision decoder; Computer science; Viterbi decoder; Convolutional code; Viterbi algorithm; Space–time trellis code; Code (set theory); Block (permutation group theory); Block code; Concatenated error correction code; Mathematics; Set (abstract data type)","score_opus":0.03971983485582078,"score_gpt":0.27656002404918595,"score_spread":0.23684018919336516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592298307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77495044,0.0002266547,0.20845072,0.006693256,0.00033433855,0.0008664127,0.000059886836,0.00026613692,0.008152163],"genre_scores_gemma":[0.9837218,0.000044062184,0.015943436,0.00015313111,0.000023320468,0.00007370103,0.000007972342,0.000007717747,0.000024853554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988175,0.00003681657,0.00029273517,0.0003224702,0.000356061,0.00017442911],"domain_scores_gemma":[0.999029,0.00022716685,0.00019733296,0.00023919318,0.00028036247,0.000026973132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004093063,0.00014343066,0.00020650287,0.0004892755,0.0000989127,0.000019855628,0.00045287958,0.0001320648,0.000028204138],"category_scores_gemma":[0.000046374615,0.00014225583,0.00008127286,0.00046053273,0.00023502907,0.000035431087,0.000046353445,0.00013804297,0.0000017328946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014010156,0.00036256737,0.00009205228,0.000012877577,0.000063752326,3.4277227e-7,0.000052724838,0.00023099365,0.17223057,0.8110419,0.000049903654,0.015722254],"study_design_scores_gemma":[0.002254746,0.0017981086,0.00026530927,0.000050659277,0.00005063146,0.000013703524,0.000018903267,0.63438374,0.18482788,0.17577633,0.00036679706,0.00019316773],"about_ca_topic_score_codex":0.0000015913722,"about_ca_topic_score_gemma":0.000002989562,"teacher_disagreement_score":0.6352655,"about_ca_system_score_codex":0.000033504064,"about_ca_system_score_gemma":0.000015923279,"threshold_uncertainty_score":0.58010244},"labels":[],"label_agreement":null},{"id":"W2593294883","doi":"10.1090/surv/210/12","title":"Denis-Mordell-Lang conjecture","year":2016,"lang":"en","type":"book-chapter","venue":"Mathematical surveys and monographs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Waterloo","funders":"","keywords":"Conjecture; Mathematics; Pure mathematics","score_opus":0.017302824789876062,"score_gpt":0.2177017726850823,"score_spread":0.20039894789520624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593294883","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013427332,0.00094375625,0.5557777,0.00026308993,0.00017667441,0.00023685781,0.00003923185,0.0002476073,0.44218075],"genre_scores_gemma":[0.19982265,0.0034914012,0.0626722,0.001641054,0.0010917778,0.00017862848,0.00008541788,0.00051283353,0.73050404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819756,0.00017426586,0.00037292397,0.00059668743,0.00029556965,0.00036299418],"domain_scores_gemma":[0.9982048,0.00057870516,0.00015572304,0.00076698745,0.00005683125,0.00023692004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015391894,0.00043924683,0.00054565945,0.00034914783,0.00016703553,0.00021757241,0.00067393074,0.00034999277,0.00036608483],"category_scores_gemma":[0.000028277133,0.0003009865,0.0003328112,0.000115867864,0.00026549306,0.0001341223,0.00034973546,0.00029354697,0.00015452811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020986022,0.000016687658,0.00002672391,0.000054723012,0.000077609235,0.000021709426,0.00008754663,4.6917627e-8,0.0000067800324,0.91124654,0.00045252853,0.08800702],"study_design_scores_gemma":[0.00021219943,0.00010863689,0.000062783205,0.00028565392,0.00003640664,0.00004528964,0.0000024295334,0.000076160235,0.000018386325,0.9659213,0.032755956,0.00047482163],"about_ca_topic_score_codex":9.248559e-7,"about_ca_topic_score_gemma":0.0000036632034,"teacher_disagreement_score":0.49310556,"about_ca_system_score_codex":0.000008708467,"about_ca_system_score_gemma":0.00002186885,"threshold_uncertainty_score":0.9999442},"labels":[],"label_agreement":null},{"id":"W2596944507","doi":"10.5539/jmr.v9n2p56","title":"The Cardinality of the Set of Zeros of Homogeneous Linear Recurring Sequences over Finite Fields","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cardinality (data modeling); Finite field; Combinatorics; Upper and lower bounds; Homogeneous; Order (exchange); Finite set; Discrete mathematics; Degree (music); Homogeneous polynomial; Polynomial; Mathematical analysis; Matrix polynomial","score_opus":0.15299439491424796,"score_gpt":0.41425802827489294,"score_spread":0.26126363336064495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596944507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9842785,0.00029493083,0.013252117,0.0006755233,0.00020594215,0.00011269639,0.000006201959,0.0000023521463,0.00117171],"genre_scores_gemma":[0.9951427,0.0001680822,0.004573353,0.000003854687,0.000054224536,9.932066e-7,1.9335317e-8,0.0000035702087,0.000053222044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783957,0.00032731815,0.00054786616,0.00007862034,0.0010278611,0.00017877485],"domain_scores_gemma":[0.9954156,0.0018693733,0.0009049482,0.0010646174,0.0007009265,0.000044512642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007516654,0.000065813845,0.0002531475,0.00010024946,0.00038411794,0.00009147759,0.002994071,0.00005209161,0.0000059667955],"category_scores_gemma":[0.0019257267,0.000034296147,0.00026590066,0.00021847601,0.0005380421,0.00014822552,0.00063507276,0.00040781675,5.1970056e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003498605,0.0010448036,0.029464304,0.002936287,0.0013496422,0.00012254139,0.04364367,0.003330685,0.044325046,0.81684464,0.0021117078,0.05447684],"study_design_scores_gemma":[0.000628656,0.0009296894,0.0059533385,0.0016937177,0.00005365797,0.00015397821,0.0015757523,0.012523305,0.19912864,0.7761831,0.0009953995,0.00018074736],"about_ca_topic_score_codex":0.000024678064,"about_ca_topic_score_gemma":0.000008155884,"teacher_disagreement_score":0.1548036,"about_ca_system_score_codex":0.000012750564,"about_ca_system_score_gemma":0.0001543391,"threshold_uncertainty_score":0.5563778},"labels":[],"label_agreement":null},{"id":"W2605666455","doi":"10.1016/j.ffa.2017.03.010","title":"A note on character sums in finite fields","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; Fondation Mathématique Jacques Hadamard","keywords":"Character (mathematics); Mathematics; Finite field; Combinatorics; Pure mathematics; Algebra over a field; Discrete mathematics; Geometry","score_opus":0.01970817639311891,"score_gpt":0.257624574949498,"score_spread":0.23791639855637906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605666455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025409536,0.00006131891,0.9425239,0.007350082,0.00016441254,0.000325535,0.000023818138,0.000095897965,0.024045508],"genre_scores_gemma":[0.9975498,0.000061274,0.0007958012,0.0011325943,0.000090527756,0.00015368014,0.000005109375,0.00000491286,0.00020635706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932766,0.000023474848,0.00013530784,0.00028665425,0.000056413108,0.00017050009],"domain_scores_gemma":[0.9984798,0.00038242902,0.000078652454,0.0009798623,0.000021469696,0.00005780655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017337102,0.0001136824,0.000118509124,0.00009913643,0.000396093,0.00023032798,0.00069911627,0.00011164896,0.00002404677],"category_scores_gemma":[0.00003453783,0.000093560295,0.00005873292,0.00011402112,0.000054343505,0.00018432968,0.00018636213,0.00023459988,0.00004159784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000165073,0.00012656806,0.0015357917,0.000013820976,0.00001182245,0.000003221119,0.0017786643,0.000027694652,0.00007316041,0.7651603,0.00017611118,0.23107632],"study_design_scores_gemma":[0.000988205,0.00032522687,0.05814797,0.00013319228,0.000009763101,0.0000069303505,0.00006033084,0.026360877,0.0013032717,0.6660635,0.24591143,0.0006893164],"about_ca_topic_score_codex":0.000024062994,"about_ca_topic_score_gemma":0.000061679835,"teacher_disagreement_score":0.9721402,"about_ca_system_score_codex":0.00000394094,"about_ca_system_score_gemma":0.000012778273,"threshold_uncertainty_score":0.38152778},"labels":[],"label_agreement":null},{"id":"W2611888257","doi":"10.1090/mcom/3363","title":"Computing isomorphisms and embeddings of finite fields","year":2018,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Isomorphism (crystallography); Embedding; Factorization; Mathematics; Field (mathematics); Polynomial; Algebra over a field; Code (set theory); Discrete mathematics; Combinatorics; Pure mathematics; Algorithm; Computer science; Programming language; Mathematical analysis","score_opus":0.014111342457953875,"score_gpt":0.2583754253024896,"score_spread":0.2442640828445357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611888257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3179711,0.000015280564,0.68098706,0.00005058173,0.00005921033,0.00004486099,4.6603444e-7,0.000028474144,0.0008429981],"genre_scores_gemma":[0.7381548,0.0000012055175,0.26179558,0.000025289619,0.000015269401,3.4780285e-7,4.603422e-7,0.0000027627214,0.00000423882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993777,0.000024211447,0.00026789506,0.00011226746,0.0001361226,0.00008176953],"domain_scores_gemma":[0.99905866,0.00038891673,0.000229939,0.00015535919,0.00014323779,0.000023857227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033034474,0.00006740199,0.00015510374,0.000114364455,0.000053116968,0.000025914083,0.00020883075,0.000034093653,0.000004422138],"category_scores_gemma":[0.000055671288,0.00006509098,0.000037791233,0.00024065583,0.000116414456,0.00011458999,0.0001226241,0.000039346116,0.0000025275303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009814887,0.00016905932,0.0003375843,0.000379411,0.000042300533,0.000001029336,0.02143487,0.0013587917,0.0025645366,0.9176411,0.00017299571,0.05588852],"study_design_scores_gemma":[0.0001598035,0.0001959555,0.00034507486,0.000106327796,0.000007447226,0.000004896597,0.00009068252,0.64328796,0.0069691343,0.348748,0.000014397471,0.000070346105],"about_ca_topic_score_codex":0.0000022275112,"about_ca_topic_score_gemma":4.4258525e-7,"teacher_disagreement_score":0.64192915,"about_ca_system_score_codex":0.0000024704184,"about_ca_system_score_gemma":0.000009626631,"threshold_uncertainty_score":0.2654333},"labels":[],"label_agreement":null},{"id":"W2612667250","doi":"10.1007/s12095-018-0300-y","title":"A lower bound on the 2-adic complexity of the modified Jacobi sequence","year":2018,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundamental Research Funds for the Central Universities; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Mathematics; Gauss; Upper and lower bounds; Combinatorics; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.10689209376763982,"score_gpt":0.29245332446002376,"score_spread":0.18556123069238395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612667250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73764414,0.0014671006,0.14590825,0.03364762,0.00065852236,0.00096906896,0.000057840174,0.00029275968,0.07935468],"genre_scores_gemma":[0.9954916,0.00011067559,0.0031723336,0.001152535,0.00001994126,0.000037326434,0.0000012283724,0.000004901994,0.000009409724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988581,0.0003817242,0.00020202906,0.00020589317,0.0001740325,0.00017820341],"domain_scores_gemma":[0.99574506,0.0004392198,0.00013311482,0.0035039042,0.00012807561,0.00005064223],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0004849225,0.00012472188,0.00011812039,0.00010261604,0.0014374331,0.00012110652,0.0035693008,0.00004600602,0.000020245121],"category_scores_gemma":[0.000041203482,0.00007512157,0.00017336382,0.001406779,0.004168596,0.00013811249,0.00082192576,0.00025116408,0.0000059068293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000087473345,0.000096752585,0.0003430838,0.0000029308649,0.000026171967,6.502059e-8,0.0009194221,8.3548605e-7,0.000577452,0.99464285,0.0002445352,0.0031371652],"study_design_scores_gemma":[0.0001919403,0.00019967616,0.015391289,0.00007957648,0.000023027398,0.0000061803703,0.00017134355,0.0027377212,0.0012791529,0.97067463,0.009070066,0.00017538205],"about_ca_topic_score_codex":0.00003504654,"about_ca_topic_score_gemma":0.00006342391,"teacher_disagreement_score":0.2578475,"about_ca_system_score_codex":0.0000056522913,"about_ca_system_score_gemma":0.00003439222,"threshold_uncertainty_score":0.99986255},"labels":[],"label_agreement":null},{"id":"W2612757204","doi":"10.3934/amc.2017034","title":"Cycle structure of iterating Redei functions","year":2017,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Quadratic equation; Prime (order theory); Reciprocity law; Exponentiation; Reciprocity (cultural anthropology); Pure mathematics; Mathematical analysis; Mathematical physics; Combinatorics; Geometry","score_opus":0.019119330575086114,"score_gpt":0.31570619899013586,"score_spread":0.2965868684150497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612757204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12115971,0.004073122,0.76679415,0.0016901214,0.0003175004,0.00039550505,0.000054785312,0.000101136895,0.105413996],"genre_scores_gemma":[0.7019414,0.00017110423,0.2978559,0.000005285213,0.0000033904173,0.000004136449,0.0000015319049,0.0000026842729,0.0000145434815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993704,0.000043387987,0.00031524745,0.00008747456,0.000102457045,0.000081029124],"domain_scores_gemma":[0.99577874,0.0003625027,0.00043628024,0.0033213838,0.00008402032,0.000017073788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020929959,0.00006303244,0.00015255435,0.000093244285,0.00029311754,0.00004785565,0.0028462615,0.00002672488,0.0000093928775],"category_scores_gemma":[0.00024265933,0.0000605996,0.000051048133,0.00015475226,0.0002542117,0.0007433903,0.0006124067,0.00011134307,0.0000010068461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.507678e-7,0.000103380306,0.0006775246,0.000053404565,0.000007308883,8.501698e-8,0.0016507229,0.0002850288,0.0023349386,0.986186,0.0000073505616,0.008693302],"study_design_scores_gemma":[0.00013733369,0.00002747386,0.00057800254,0.00017375886,0.000005968557,0.0000023430027,0.0002385214,0.015681077,0.0024918537,0.97922313,0.001358252,0.00008225601],"about_ca_topic_score_codex":0.000004489301,"about_ca_topic_score_gemma":0.00007170784,"teacher_disagreement_score":0.5807817,"about_ca_system_score_codex":0.0000055302294,"about_ca_system_score_gemma":0.0000152575385,"threshold_uncertainty_score":0.52891093},"labels":[],"label_agreement":null},{"id":"W2612896625","doi":"10.5539/jmr.v9n3p8","title":"Quadratic form Approach for the Number of Zeros of Homogeneous Linear Recurring Sequences over Finite Fields","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cardinality (data modeling); Finite field; Sequence (biology); Homogeneous; Combinatorics; Order (exchange); Homogeneous polynomial; Finite set; Quadratic equation; Degree (music); Polynomial; Discrete mathematics; Field (mathematics); Pure mathematics; Mathematical analysis; Matrix polynomial; Geometry","score_opus":0.15525263400656467,"score_gpt":0.4206935265602448,"score_spread":0.2654408925536801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612896625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24154182,0.00015823511,0.75583315,0.0002713235,0.00012335714,0.00023982991,0.0000035421913,0.000004339377,0.0018243825],"genre_scores_gemma":[0.8590414,0.00008637758,0.14069444,0.0000069334656,0.00007608532,0.0000070423534,8.182731e-8,0.0000061378882,0.000081528684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835515,0.00008897521,0.00050823175,0.000097070464,0.0007331917,0.00021736657],"domain_scores_gemma":[0.9956326,0.0023346809,0.0006514218,0.00074133876,0.00058517477,0.000054787623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005194861,0.000079080826,0.0002669727,0.00013606739,0.00035419138,0.00015002118,0.0022149833,0.00006246319,0.0000135354385],"category_scores_gemma":[0.001297565,0.000047769965,0.0002274318,0.00016580668,0.00025669174,0.00027375662,0.00029792901,0.0003254451,0.0000011204577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024093829,0.0016813471,0.0035954933,0.0033911392,0.0008010052,0.000046692905,0.029012095,0.0029036382,0.0055292067,0.91160876,0.0011648719,0.040024813],"study_design_scores_gemma":[0.00086215086,0.00078305014,0.00033075135,0.00066715054,0.00005532141,0.00022190568,0.0015390699,0.25359276,0.02429694,0.7171854,0.00027419385,0.00019131739],"about_ca_topic_score_codex":0.000008955183,"about_ca_topic_score_gemma":0.0000019327056,"teacher_disagreement_score":0.61749953,"about_ca_system_score_codex":0.00001293575,"about_ca_system_score_gemma":0.00011563098,"threshold_uncertainty_score":0.4116027},"labels":[],"label_agreement":null},{"id":"W2619009655","doi":"10.1007/978-3-319-59250-3_1","title":"The Two-Point Fano and Ideal Binary Clutters","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fano plane; Ideal (ethics); Combinatorics; Binary number; Physics; Clutter; Mathematics; Pure mathematics; Computer science; Arithmetic; Telecommunications; Philosophy","score_opus":0.013322530168720365,"score_gpt":0.24383165557086064,"score_spread":0.23050912540214027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619009655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001837088,0.00119505,0.9868996,0.0031495574,0.002139198,0.00026156477,0.0000022968532,0.00012921187,0.0060398187],"genre_scores_gemma":[0.702233,0.0008645576,0.28740913,0.0067434325,0.0016451253,0.000034134926,0.000003895829,0.000096844095,0.0009698759],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970436,0.00005658234,0.00034577033,0.0012592803,0.0006481828,0.00064657954],"domain_scores_gemma":[0.9964557,0.00082788634,0.00029788815,0.002134061,0.00010904842,0.0001753617],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00163863,0.00045037488,0.0003591743,0.00043070433,0.001529614,0.0017159143,0.004937543,0.0001688176,0.0000051402744],"category_scores_gemma":[0.0000812432,0.0003228976,0.00014752349,0.00018814724,0.0021975613,0.0005995107,0.00260932,0.00076305144,0.000018656854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009574665,0.000008803074,0.00003685724,0.000011815758,0.000011787387,0.00007360731,0.00046505657,0.000538509,0.00008284376,0.20282954,0.000053944575,0.79587764],"study_design_scores_gemma":[0.00028862833,0.00024753268,0.0002504986,0.00029908394,0.000009243187,0.0001323737,2.6738942e-7,0.08168649,0.00022236098,0.90820163,0.008045944,0.00061596744],"about_ca_topic_score_codex":0.000018555742,"about_ca_topic_score_gemma":0.00007406666,"teacher_disagreement_score":0.7952617,"about_ca_system_score_codex":0.00007670209,"about_ca_system_score_gemma":0.00022760405,"threshold_uncertainty_score":0.99992234},"labels":[],"label_agreement":null},{"id":"W2624155812","doi":"10.1007/s12095-017-0233-x","title":"The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation","year":2017,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Shandong Province","keywords":"Autocorrelation; Pseudorandom binary sequence; Mathematics; Binary number; Sequence (biology); Complementary sequences; Class (philosophy); Distribution (mathematics); Stream cipher; Autocorrelation matrix; Combinatorics; Discrete mathematics; Time complexity; Algorithm; Cryptography; Computer science; Statistics; Arithmetic; Mathematical analysis","score_opus":0.03889153615739618,"score_gpt":0.2767834628078698,"score_spread":0.23789192665047362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624155812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63121897,0.0018664874,0.3607044,0.0032807721,0.00008861298,0.0007065044,0.000063068874,0.00009579555,0.001975378],"genre_scores_gemma":[0.9859459,0.00054793566,0.013405264,0.000008806517,0.000005386429,0.00005078899,0.000029375806,0.0000038284643,0.000002745703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999068,0.00019578704,0.0002669401,0.00018657146,0.00014944917,0.00013323568],"domain_scores_gemma":[0.99718523,0.0003763301,0.0004817288,0.0017553718,0.00014731931,0.000054036627],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.00052831136,0.00011698764,0.00015581356,0.00008833462,0.0020638134,0.0001827666,0.0012373903,0.00006022655,0.0000015995814],"category_scores_gemma":[0.00004529404,0.000086148975,0.000070268856,0.0003282612,0.0029695635,0.0005861986,0.0004376844,0.00017622084,2.5762557e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003940711,0.00007042112,0.031638257,0.00001563527,0.000045537618,1.8720779e-7,0.0006848994,0.000037508733,0.0002678574,0.9487461,0.000016447124,0.01843775],"study_design_scores_gemma":[0.0005504471,0.00045395203,0.81859297,0.00016896674,0.000067786525,0.000015999693,0.000462122,0.059536535,0.00024355213,0.117746785,0.0019495921,0.00021132111],"about_ca_topic_score_codex":0.00007608389,"about_ca_topic_score_gemma":0.000056293982,"teacher_disagreement_score":0.8309993,"about_ca_system_score_codex":0.0000062287218,"about_ca_system_score_gemma":0.000039855342,"threshold_uncertainty_score":0.99974376},"labels":[],"label_agreement":null},{"id":"W2634535468","doi":"10.1017/s0305004119000100","title":"Chebyshev’s bias for analytic<i>L</i>-functions","year":2019,"lang":"en","type":"article","venue":"Mathematical Proceedings of the Cambridge Philosophical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Logarithm; Chebyshev filter; Chebyshev equation; Dirichlet distribution; Pure mathematics; Prime (order theory); Independence (probability theory); Chebyshev polynomials; Discrete mathematics; Combinatorics; Mathematical analysis; Statistics; Orthogonal polynomials","score_opus":0.027308256757302043,"score_gpt":0.23471868974642648,"score_spread":0.20741043298912443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2634535468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6797856,0.0000887491,0.1662557,0.07273766,0.00085599825,0.0027997084,0.000048628946,0.0006752513,0.07675268],"genre_scores_gemma":[0.9839054,0.0000024699607,0.014271281,0.0009872435,0.00016113691,0.00005673534,8.281797e-7,0.000020327998,0.0005945887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982448,0.000011277124,0.00044732777,0.00045928126,0.00046854775,0.00036875007],"domain_scores_gemma":[0.9985124,0.00042160138,0.0002298076,0.00043084612,0.00027677894,0.0001285913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009814184,0.00022257428,0.00039942385,0.0000388647,0.00021683142,0.000121178244,0.0014921334,0.00015323612,0.000023656416],"category_scores_gemma":[0.00027607608,0.00014905405,0.001087848,0.0007655091,0.00024226078,0.0003111581,0.0005407773,0.00030669148,0.000053616754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013447974,0.00017000233,0.0003608063,0.00031771522,0.00007969843,3.5431267e-8,0.00015899043,0.0000035265932,0.0037677546,0.9903595,0.0045726113,0.00019594113],"study_design_scores_gemma":[0.00056332856,0.00017326357,0.00038914612,0.00012698163,0.00008049637,0.000012560192,0.000080418205,0.028591456,0.003860513,0.9638792,0.0019695428,0.00027303878],"about_ca_topic_score_codex":5.0684235e-7,"about_ca_topic_score_gemma":1.5031446e-8,"teacher_disagreement_score":0.30411977,"about_ca_system_score_codex":0.000040066254,"about_ca_system_score_gemma":0.00003087608,"threshold_uncertainty_score":0.60782474},"labels":[],"label_agreement":null},{"id":"W2635647965","doi":"10.1093/imrn/rnz217","title":"The Image Size of Iterated Rational Maps over Finite Fields","year":2019,"lang":"en","type":"preprint","venue":"International Mathematics Research Notices","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Iterated function; Mathematics; Finite field; Image (mathematics); Modulo; Prime (order theory); Combinatorics; Discrete mathematics; Degree (music); Rational function; Number theory; Field (mathematics); Algebraic number field; Connection (principal bundle); Pure mathematics; Mathematical analysis; Geometry; Physics","score_opus":0.06299207860439189,"score_gpt":0.38053121133398315,"score_spread":0.3175391327295913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2635647965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14942507,0.00082749844,0.6924502,0.019274885,0.008117451,0.0023549623,0.00046971513,0.00030680356,0.12677339],"genre_scores_gemma":[0.9589567,0.00013198744,0.037849303,0.000079708334,0.00023447059,0.000080284386,0.000032140568,0.000020016936,0.0026153654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665415,0.0003041468,0.0005607501,0.00040333945,0.0017703875,0.0003072008],"domain_scores_gemma":[0.9863581,0.010953669,0.0003611965,0.0009955746,0.0012704785,0.000060960363],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003061265,0.00019018492,0.00023587997,0.00030029885,0.00019828217,0.0011871543,0.004000427,0.00016699878,0.00021498924],"category_scores_gemma":[0.0025473402,0.00013849461,0.0002054249,0.00031187004,0.0002734059,0.00033396969,0.0027272452,0.00091720244,0.00010441508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051008694,0.00027561476,0.00009998666,0.0003961757,0.00033349177,0.000012403267,0.0021983928,0.003234751,0.00047128028,0.9863967,0.0051227794,0.0014074319],"study_design_scores_gemma":[0.0002085038,0.00005849978,0.0002753756,0.00037984992,0.00000764633,0.000002197978,0.00009947953,0.31400523,0.0010189099,0.6798555,0.0039162547,0.00017254964],"about_ca_topic_score_codex":0.000019992403,"about_ca_topic_score_gemma":0.00001354594,"teacher_disagreement_score":0.8095316,"about_ca_system_score_codex":0.000053196578,"about_ca_system_score_gemma":0.00025301037,"threshold_uncertainty_score":0.99984974},"labels":[],"label_agreement":null},{"id":"W26459003","doi":"10.1016/j.bbagen.2015.10.003","title":"Double-Change Circular Covering Designs: Constructions And Applications","year":2014,"lang":"en","type":"article","venue":"Biochimica et Biophysica Acta","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Architectural engineering; Arithmetic; Geography; Engineering drawing; Mathematics; Engineering","score_opus":0.03365512668181491,"score_gpt":0.24889415553739289,"score_spread":0.21523902885557797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26459003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35011297,0.00010419294,0.6425286,0.0022368375,0.00023311914,0.00063047017,0.000014559523,0.0005687802,0.003570467],"genre_scores_gemma":[0.99072325,0.000043432494,0.008418677,0.00047694624,0.00016890398,0.00014482401,0.000004963916,0.000010601532,0.000008409105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990648,0.000066894325,0.00013965827,0.00040543335,0.00011924973,0.0002039592],"domain_scores_gemma":[0.999089,0.000099081204,0.00007937707,0.0005910869,0.000036344296,0.00010508363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001748267,0.00014791248,0.00014215244,0.00011323067,0.00024945082,0.0001862582,0.0004590039,0.000053439046,0.0000038130454],"category_scores_gemma":[0.00000764826,0.00014713359,0.00007862141,0.00042016248,0.00015720869,0.00035766937,0.00020691616,0.0001096736,0.000021768228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008208081,0.00006675736,0.000032492047,0.000020639278,0.000024945552,3.3090353e-7,0.00029510356,9.297142e-7,0.1782398,0.8082597,0.00005920813,0.012991855],"study_design_scores_gemma":[0.004224922,0.00073603605,0.013295776,0.00022806128,0.00021345104,0.0002110597,0.00017194539,0.012543198,0.33505318,0.44013733,0.1902634,0.0029216425],"about_ca_topic_score_codex":0.00001181766,"about_ca_topic_score_gemma":0.0000010930883,"teacher_disagreement_score":0.6406103,"about_ca_system_score_codex":0.000009814719,"about_ca_system_score_gemma":0.000017768052,"threshold_uncertainty_score":0.59999335},"labels":[],"label_agreement":null},{"id":"W2725281740","doi":"10.5539/jmr.v9n4p23","title":"Sign of Permutations Induced by Anick and Nagata-Anick Automorphisms over Finite Fields","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science","keywords":"Mathematics; Automorphism; Sign (mathematics); Finite field; Prime (order theory); Combinatorics; Inner automorphism; Automorphism group; Field (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.131082758862121,"score_gpt":0.4011813500062456,"score_spread":0.2700985911441246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725281740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84940004,0.00018579605,0.14626549,0.0017676292,0.00013490854,0.00013964128,0.00000671246,0.000010978579,0.0020888222],"genre_scores_gemma":[0.98779786,0.000061019822,0.011933683,0.00002287844,0.00003356877,0.0000017363776,1.8849008e-7,0.0000065470995,0.00014252852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983778,0.00015413092,0.00041046436,0.00011814517,0.0007366249,0.00020285843],"domain_scores_gemma":[0.9972829,0.0011182931,0.00044315076,0.00061815826,0.00042079744,0.000116677154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033276863,0.00008100758,0.00024015254,0.00025372437,0.00035491594,0.00033816448,0.0013414196,0.00007570497,0.000058640628],"category_scores_gemma":[0.0010840779,0.00006430339,0.00010000293,0.00017236879,0.0001673094,0.00048207163,0.00037433897,0.0004574807,0.00000552886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008069356,0.001483573,0.00091229577,0.00057370757,0.0004926581,0.00012969678,0.019917028,0.00005277793,0.09307995,0.8331948,0.022458486,0.027624354],"study_design_scores_gemma":[0.0017934982,0.0019580903,0.004798231,0.00055422663,0.00005873983,0.0001668222,0.0010060419,0.046288908,0.019183094,0.92201346,0.0018196548,0.0003592442],"about_ca_topic_score_codex":0.000008731315,"about_ca_topic_score_gemma":0.000003181101,"teacher_disagreement_score":0.13839783,"about_ca_system_score_codex":0.000015030528,"about_ca_system_score_gemma":0.00010481454,"threshold_uncertainty_score":0.32609278},"labels":[],"label_agreement":null},{"id":"W2730685951","doi":"","title":"Architectures matérielles pour le décodage des codes polaires","year":2011,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Physics; Humanities; Computer science; Philosophy","score_opus":0.028100078602222692,"score_gpt":0.22655887871947694,"score_spread":0.19845880011725425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730685951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13088803,0.0056666574,0.7005948,0.011615329,0.000525217,0.00047223934,0.000078802215,0.00060153665,0.14955744],"genre_scores_gemma":[0.75646704,0.00078970124,0.2242013,0.0002205465,0.000068404144,0.00007081637,0.000083914565,0.0000763339,0.018021904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9837978,0.012034384,0.00090845866,0.0016712897,0.000588459,0.0009996159],"domain_scores_gemma":[0.9893358,0.0031962283,0.0007833489,0.004186999,0.0019997207,0.00049795536],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007655926,0.0008335604,0.0007500835,0.0004755931,0.0016134116,0.0013709668,0.005137192,0.00050465245,0.0003756663],"category_scores_gemma":[0.0014379455,0.0008955525,0.00074479496,0.0009317977,0.0018836777,0.00034364112,0.004034736,0.0012252835,0.00020464098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030715466,0.00088916015,0.0017018722,0.00022172288,0.00016892357,0.000020108648,0.03312453,0.00016087611,0.0028905948,0.8464661,0.0007834723,0.113541916],"study_design_scores_gemma":[0.0008624238,0.0000030971808,0.025024274,0.0047885114,0.0001246866,0.00013068257,0.0005504728,0.015186226,0.120308764,0.80224156,0.029212782,0.0015665261],"about_ca_topic_score_codex":0.010688087,"about_ca_topic_score_gemma":0.0065052104,"teacher_disagreement_score":0.62557906,"about_ca_system_score_codex":0.000100688965,"about_ca_system_score_gemma":0.00092643575,"threshold_uncertainty_score":0.99968636},"labels":[],"label_agreement":null},{"id":"W2731346518","doi":"10.1017/s0963548318000342","title":"Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives","year":2018,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Mathematics; Upper and lower bounds; Bounding overwatch; Combinatorics; Hermite polynomials; Uniqueness; Polynomial; Context (archaeology); Grid; Orthogonal polynomials; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.03031485595492576,"score_gpt":0.2887224744568492,"score_spread":0.2584076185019234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731346518","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8664152,0.0002613118,0.1307729,0.00014351019,0.0010360989,0.0007330406,0.000015614114,0.00011162674,0.00051072746],"genre_scores_gemma":[0.9918423,0.000013187449,0.0080301305,0.00002958151,0.000047563117,0.000012006076,0.0000035480414,0.000018827059,0.0000028270756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627286,0.0011901347,0.0010024441,0.0008458577,0.00029313954,0.0003955377],"domain_scores_gemma":[0.99352795,0.0028798534,0.0013519062,0.0015630483,0.0005861666,0.000091048685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003395704,0.0004511034,0.00095798174,0.00012379762,0.00043435546,0.00017881802,0.0020407313,0.00026548374,0.0000030103192],"category_scores_gemma":[0.0005907389,0.00034107003,0.00028610678,0.00061211886,0.0014009402,0.00014325175,0.005928988,0.00071226485,8.25048e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036736583,0.00047287942,0.0588283,0.0006623022,0.00023406505,8.8476924e-7,0.017573388,0.00007616388,0.00077665906,0.91661364,0.00001549482,0.0047094785],"study_design_scores_gemma":[0.00040306197,0.00011117742,0.021083705,0.0005137997,0.00002777391,0.000008683751,0.00016321658,0.011886277,0.009403174,0.9560233,0.00003109236,0.00034475417],"about_ca_topic_score_codex":0.00009572018,"about_ca_topic_score_gemma":0.0000017628472,"teacher_disagreement_score":0.12542716,"about_ca_system_score_codex":0.00008323867,"about_ca_system_score_gemma":0.00021341367,"threshold_uncertainty_score":0.99990416},"labels":[],"label_agreement":null},{"id":"W2732089117","doi":"10.13069/jacodesmath.327375","title":"On the equivalence of cyclic and quasi-cyclic codes over finite fields","year":2017,"lang":"en","type":"article","venue":"Journal of Algebra Combinatorics Discrete Structures and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cyclic code; Huffman coding; Mathematics; Cyclic group; Combinatorics; Discrete mathematics; Equivalence (formal languages); Prime (order theory); Linear code; Block code; Algorithm; Decoding methods; Data compression","score_opus":0.012767901897734298,"score_gpt":0.2660729161778279,"score_spread":0.2533050142800936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732089117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8913795,0.00074390636,0.103968136,0.0024332535,0.00019197138,0.00017943412,0.000010490766,0.000012525284,0.0010807891],"genre_scores_gemma":[0.99897295,0.0004211493,0.00040603572,0.0001332195,0.00004442435,0.000005749859,2.808933e-7,0.0000046247987,0.000011578521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919355,0.000048478913,0.0002625844,0.00015309129,0.0002195716,0.00012273225],"domain_scores_gemma":[0.9981673,0.0005180784,0.00054405926,0.00060171663,0.000085095424,0.00008376432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002969275,0.00011468135,0.00018690803,0.00008033489,0.0005775093,0.00025351823,0.0009651737,0.000056120876,0.0000073799447],"category_scores_gemma":[0.0001058637,0.0000733705,0.00008905469,0.00012574357,0.0002510468,0.00023487932,0.00022891248,0.00024169513,2.2634397e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091587335,0.000023812541,0.0009462793,0.000013913617,0.000028471884,9.100539e-7,0.00016186654,0.0000067115357,0.00021045297,0.9937739,0.00008230788,0.0047422447],"study_design_scores_gemma":[0.00023925115,0.00020790406,0.028303456,0.000033184555,0.000022457027,0.00001620995,0.000039272094,0.00036194563,0.00059743295,0.9695349,0.000555171,0.00008887088],"about_ca_topic_score_codex":0.0000059525196,"about_ca_topic_score_gemma":0.0000015464566,"teacher_disagreement_score":0.10759345,"about_ca_system_score_codex":0.0000058335836,"about_ca_system_score_gemma":0.000021102955,"threshold_uncertainty_score":0.4441793},"labels":[],"label_agreement":null},{"id":"W2734990741","doi":"10.1145/3092951","title":"High-Performance Ideal Lattice-Based Cryptography on 8-Bit AVR Microcontrollers","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Public Works and Government Services Canada; Hansung University","keywords":"Computer science; Cryptography; Lattice-based cryptography; Encryption; Microcontroller; BLISS; Ring oscillator; Lattice (music); Embedded system; Computer engineering; Computer hardware; Quantum cryptography; Quantum; Algorithm; Computer security; Operating system; Quantum information; Physics; Quantum mechanics","score_opus":0.018539254408967837,"score_gpt":0.2495674323668857,"score_spread":0.23102817795791786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734990741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24248058,0.00004783262,0.7516709,0.00058449735,0.0027675289,0.00045545102,0.000009272815,0.0006282585,0.0013556563],"genre_scores_gemma":[0.9687617,0.0000082372935,0.030441005,0.00045256905,0.00020478707,0.00005031509,0.000002413395,0.000037559246,0.000041408297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969501,0.00027220912,0.0005977118,0.0009029377,0.00057092065,0.00070612703],"domain_scores_gemma":[0.99492496,0.00067932974,0.0004962209,0.0035360383,0.00014901835,0.00021440051],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009714152,0.00046671758,0.00053764496,0.00061373116,0.0027320064,0.0011357507,0.0035123555,0.00018863982,0.000011942512],"category_scores_gemma":[0.000042101474,0.00044807818,0.00038955922,0.0004866221,0.00018415833,0.0004689801,0.000044225493,0.000593396,0.00014372652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010315572,0.001612422,0.0012442128,0.0004985779,0.0010264245,0.00009319573,0.0025472292,0.4811226,0.0031087876,0.26941046,0.0007213062,0.23758323],"study_design_scores_gemma":[0.01548548,0.003962766,0.009479783,0.0032046586,0.00029394554,0.00010983848,0.00050804665,0.9253006,0.018098768,0.015648423,0.0042502373,0.0036574288],"about_ca_topic_score_codex":0.00010667134,"about_ca_topic_score_gemma":0.000006573484,"teacher_disagreement_score":0.7262811,"about_ca_system_score_codex":0.000077155026,"about_ca_system_score_gemma":0.00008132618,"threshold_uncertainty_score":0.9999012},"labels":[],"label_agreement":null},{"id":"W2735846137","doi":"10.13154/tosc.v2017.i2.27-58","title":"New Constructions of MACs from (Tweakable) Block Ciphers","year":2017,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Block (permutation group theory); Computer science; Block cipher; Arithmetic; Parallel computing; Mathematics; Algorithm; Cryptography; Combinatorics","score_opus":0.21282791171314513,"score_gpt":0.5227469216745202,"score_spread":0.30991900996137506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735846137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8583402,0.010543491,0.07866969,0.00085453544,0.004057564,0.000579694,0.00009527634,0.00015567946,0.04670388],"genre_scores_gemma":[0.9848358,0.0018899946,0.012638982,0.000113029135,0.00020177496,0.000007691796,0.000001998207,0.00002293441,0.0002878188],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99769586,0.00019073456,0.00070226745,0.0004959736,0.0005707292,0.00034443772],"domain_scores_gemma":[0.9959733,0.00034559338,0.0013654868,0.0017266293,0.00025120724,0.0003378189],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00081061595,0.0002682912,0.00064517616,0.00051592727,0.0007224272,0.0025896204,0.009592125,0.000107621265,0.004426534],"category_scores_gemma":[0.0002056813,0.00025781943,0.0003033119,0.0006197913,0.00033123855,0.0037328128,0.0022184588,0.00033942572,0.000015717384],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020264016,0.00030346282,0.5169842,0.000055617857,0.0007911593,0.000056208963,0.0006629416,0.00025384154,0.08934586,0.047415648,0.054313872,0.2896145],"study_design_scores_gemma":[0.0013873006,0.000028450893,0.55850106,0.0006914749,0.0001653342,0.000040060484,0.0001391396,0.0002960481,0.068993695,0.33854008,0.030401958,0.0008153979],"about_ca_topic_score_codex":0.0022341798,"about_ca_topic_score_gemma":0.0000788414,"teacher_disagreement_score":0.29112443,"about_ca_system_score_codex":0.000032044998,"about_ca_system_score_gemma":0.00024690625,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W2736709020","doi":"10.1016/j.ffa.2017.06.003","title":"Ambiguity, deficiency and differential spectrum of normalized permutation polynomials over finite fields","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Carleton University","keywords":"Mathematics; Permutation (music); Spectrum (functional analysis); Ambiguity; Degree (music); Finite field; Differential (mechanical device); Combinatorics; Pure mathematics","score_opus":0.014462414056729801,"score_gpt":0.24901569412702437,"score_spread":0.23455328007029458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736709020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25848627,0.00012866815,0.73689455,0.0008353477,0.00007883017,0.00018529792,0.00003086431,0.000037408696,0.0033227564],"genre_scores_gemma":[0.9989496,0.000120936296,0.0006420115,0.00009254253,0.000058144724,0.000046068497,0.0000065879835,0.000004357125,0.00007977062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993105,0.000029255258,0.00018894424,0.00025118465,0.00007382149,0.00014630005],"domain_scores_gemma":[0.9988804,0.00024417188,0.00016403185,0.0006234625,0.000029148201,0.00005882704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013990111,0.00011450693,0.0001581556,0.0000827733,0.0005309258,0.00021440396,0.00047449235,0.000094624666,0.000043638527],"category_scores_gemma":[0.000030940686,0.000096490716,0.00006601721,0.00008885852,0.0001383046,0.00021165774,0.00029448717,0.00011244743,0.0000025383881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034363584,0.00016570723,0.0051829214,0.00006935109,0.0000398965,8.8121004e-7,0.002785233,0.000022787415,0.0016557518,0.8965649,0.00009993282,0.093378246],"study_design_scores_gemma":[0.0013760313,0.00034028807,0.13800295,0.000059332393,0.000049900933,0.000011475732,0.00011864846,0.023260895,0.0066170557,0.8262148,0.0034070094,0.0005415946],"about_ca_topic_score_codex":0.00007141126,"about_ca_topic_score_gemma":0.00003503924,"teacher_disagreement_score":0.7404633,"about_ca_system_score_codex":0.0000025257227,"about_ca_system_score_gemma":0.000015460988,"threshold_uncertainty_score":0.40835056},"labels":[],"label_agreement":null},{"id":"W2736937761","doi":"","title":"Enumeration of Combinatorial Classes of Single Variable Complex Polynomial Vector Fields","year":2008,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Variable (mathematics); Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.029770559900625687,"score_gpt":0.22766958401789977,"score_spread":0.19789902411727409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736937761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3210708,0.000024775716,0.6522779,0.0001590063,0.0012528452,0.000107253705,0.0000035294522,0.00009610977,0.025007816],"genre_scores_gemma":[0.9827627,0.000001882254,0.017058535,0.00004877628,0.00006952736,0.0000014710621,0.0000017546749,0.0000024308563,0.000052909203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938357,0.000053539592,0.00019681737,0.00012643055,0.00013961543,0.00010005054],"domain_scores_gemma":[0.9994225,0.00013557248,0.000084369414,0.00024894252,0.000080159625,0.00002847297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011736127,0.00006235949,0.00014309076,0.000068411704,0.00006839719,0.000013325974,0.00030991327,0.00004989822,0.00010823627],"category_scores_gemma":[0.000029016135,0.000058770973,0.000058275906,0.00029324795,0.000068224836,0.00018130011,0.00007404625,0.00004418472,0.0000022567292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040409683,0.00027761929,0.0007399168,0.000013982544,0.00001922611,0.0000010811135,0.00041054556,0.00004294779,0.09901155,0.8949393,0.003657301,0.00084611884],"study_design_scores_gemma":[0.004354067,0.0036873396,0.016980518,0.00006869097,0.000041642033,0.000053586307,0.0000899551,0.02201177,0.7950838,0.13511612,0.021694861,0.0008176093],"about_ca_topic_score_codex":0.00006326773,"about_ca_topic_score_gemma":0.0000026472671,"teacher_disagreement_score":0.7598232,"about_ca_system_score_codex":0.0000065639915,"about_ca_system_score_gemma":0.00004854652,"threshold_uncertainty_score":0.23966107},"labels":[],"label_agreement":null},{"id":"W2737359669","doi":"10.48550/arxiv.1707.05846","title":"On the Computation of Neumann Series","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Rendering (computer graphics); Computation; Basis (linear algebra); Series (stratigraphy); Von Neumann architecture; Neumann series; Binary number; Algorithm; Theoretical computer science; Mathematics; Arithmetic; Pure mathematics; Artificial intelligence","score_opus":0.08182257507973612,"score_gpt":0.18887596494283454,"score_spread":0.10705338986309842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737359669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41734597,0.000024868752,0.571498,0.00038773188,0.0006675622,0.0001758774,0.000006863128,0.00012088986,0.009772278],"genre_scores_gemma":[0.99928504,0.00003404052,0.00026768557,0.00005295225,0.000021873597,3.766691e-7,0.000002284359,0.0000053398026,0.00033042513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991171,0.00014661114,0.000100109646,0.0004373166,0.00006620377,0.0001327101],"domain_scores_gemma":[0.99822307,0.00015759064,0.00029825617,0.0011857122,0.00009617369,0.000039178078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002797302,0.00015329088,0.00017140494,0.00013411073,0.00028680128,0.0001105579,0.0019958094,0.00010180858,0.000009629387],"category_scores_gemma":[0.000036394707,0.00013310004,0.00018124655,0.00017212264,0.000216201,0.00021889481,0.001089481,0.0002907229,0.000020444952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026312282,0.00003072952,0.00015884734,0.000023994791,0.000037823593,0.000020519456,0.00020424601,0.050597727,0.000009174109,0.9480771,0.00020758512,0.00060596364],"study_design_scores_gemma":[0.000115610484,0.00008353854,0.0011956512,0.00011808105,0.000022302263,0.0000013696293,0.00003372686,0.086456366,0.00016331272,0.91146535,0.00017806879,0.00016659916],"about_ca_topic_score_codex":0.000024365896,"about_ca_topic_score_gemma":0.000009422634,"teacher_disagreement_score":0.58193904,"about_ca_system_score_codex":0.00002141461,"about_ca_system_score_gemma":0.00005682152,"threshold_uncertainty_score":0.5427662},"labels":[],"label_agreement":null},{"id":"W2738883014","doi":"10.1145/3087604.3087645","title":"Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Degree (music); Mathematics; Polynomial; Iterated function; Function (biology); Algebraic number; Discrete mathematics; Rational function; Rank (graph theory); Algorithm; Combinatorics; Applied mathematics; Mathematical analysis","score_opus":0.018551030756057768,"score_gpt":0.23704309874496082,"score_spread":0.21849206798890305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738883014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34191817,0.000065649074,0.6531223,0.00007056581,0.0025549904,0.00031911398,0.0000019335862,0.00020029492,0.0017470062],"genre_scores_gemma":[0.99189126,0.000009753453,0.007565946,0.000016466647,0.00013740407,0.000061739214,0.000011469603,0.000009441736,0.00029651722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986714,0.00012649782,0.00023266753,0.0005658357,0.0002489214,0.00015465305],"domain_scores_gemma":[0.9988514,0.00017377015,0.00029966916,0.0005055143,0.00012259367,0.00004705985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006402377,0.00018816466,0.00021188683,0.0006747815,0.00022170178,0.0005547961,0.00033679316,0.00018836865,0.0000043435844],"category_scores_gemma":[0.00008021728,0.00016641042,0.000058475594,0.00030757894,0.000038634564,0.00066076964,0.00028087705,0.00036273693,0.000006441429],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001762744,0.0006149263,0.10399121,0.0019290195,0.00045390625,0.00011901487,0.0033408795,0.02899648,0.0006876696,0.22621542,0.0009700129,0.63091874],"study_design_scores_gemma":[0.00056410505,0.0005322519,0.4201344,0.00089672033,0.00004079634,0.000051770017,0.00008030793,0.57106405,0.00015940834,0.00583864,0.00011568878,0.00052182603],"about_ca_topic_score_codex":0.00016498698,"about_ca_topic_score_gemma":0.00008773066,"teacher_disagreement_score":0.6499731,"about_ca_system_score_codex":0.000109375316,"about_ca_system_score_gemma":0.00010242107,"threshold_uncertainty_score":0.678602},"labels":[],"label_agreement":null},{"id":"W2739099558","doi":"","title":"Classification of optimal binary self-orthogonal codes up to length 24","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary number; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.015138935895520962,"score_gpt":0.24782273497306154,"score_spread":0.23268379907754058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739099558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90828747,0.00016791363,0.07949987,0.00019687046,0.010989665,0.00021188038,0.0000020400432,0.00007796436,0.0005663111],"genre_scores_gemma":[0.94732404,0.00001078179,0.05191188,0.000013667105,0.0007117256,0.0000018797557,9.859348e-7,0.000020231451,0.0000047897806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970785,0.00016879817,0.0013203475,0.00028944697,0.000797994,0.00034495766],"domain_scores_gemma":[0.99677664,0.000712721,0.0012143303,0.00039623978,0.0007076468,0.00019242245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020713282,0.00028914027,0.00071930577,0.00043053756,0.00026089267,0.00024657234,0.0009732342,0.00014221093,0.0000033536387],"category_scores_gemma":[0.00016471953,0.0002678482,0.00025779102,0.0007678415,0.00008089906,0.00037518004,0.00038755778,0.0003693285,0.0000020776376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008085361,0.00061058707,0.00032921793,0.00010317256,0.00007297672,0.000010914946,0.0011913407,0.00018636421,0.0036931627,0.99234873,0.00045885736,0.0009137945],"study_design_scores_gemma":[0.003788937,0.0022293048,0.0022423894,0.00042107163,0.00012391801,0.00014338508,0.00037329385,0.033196017,0.0037356445,0.95185673,0.001339476,0.0005498195],"about_ca_topic_score_codex":0.0000049904365,"about_ca_topic_score_gemma":2.2965878e-7,"teacher_disagreement_score":0.040492017,"about_ca_system_score_codex":0.000057727022,"about_ca_system_score_gemma":0.00016241524,"threshold_uncertainty_score":0.99997735},"labels":[],"label_agreement":null},{"id":"W2739627166","doi":"","title":"A class of mutually inequivalent circulant weighing matrices.","year":2012,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Order (exchange); Prime (order theory); Matrix (chemical analysis); Weight function; Prime power; Euler's totient function; Ternary operation; Discrete mathematics; Class (philosophy); Euler's formula; Mathematical analysis","score_opus":0.023509549341280165,"score_gpt":0.250974437196984,"score_spread":0.22746488785570382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739627166","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9308344,0.0004996554,0.060376,0.00045399077,0.0012879962,0.00019061641,0.000005000757,0.0002605049,0.0060918247],"genre_scores_gemma":[0.99473965,0.00002447006,0.0048890607,0.0001223222,0.000119466145,0.000007718256,0.0000019255583,0.000009538278,0.00008586361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985722,0.00009680298,0.00031188136,0.000232673,0.0003125458,0.00047394447],"domain_scores_gemma":[0.9988704,0.00013747372,0.00015765514,0.0006087948,0.000055143373,0.00017058608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005919345,0.00016180206,0.00022093495,0.00018352084,0.00008479506,0.00005933404,0.0009016961,0.00007485114,0.00007020604],"category_scores_gemma":[0.000023434179,0.00014844011,0.00015954813,0.00057571224,0.00006804882,0.00057655096,0.00027551432,0.00017889767,0.00006183363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015333566,0.00038513515,0.037478216,0.00009424316,0.000092220194,0.000012860837,0.0021041688,0.00004407132,0.0065552597,0.9361264,0.002206071,0.014885989],"study_design_scores_gemma":[0.006384505,0.0020808221,0.5482679,0.0011096353,0.00049283175,0.0005769682,0.0012676225,0.010771241,0.08517919,0.15377145,0.18535191,0.0047459523],"about_ca_topic_score_codex":0.000017407367,"about_ca_topic_score_gemma":0.0000012536754,"teacher_disagreement_score":0.78235495,"about_ca_system_score_codex":0.000024429848,"about_ca_system_score_gemma":0.00003308771,"threshold_uncertainty_score":0.6053212},"labels":[],"label_agreement":null},{"id":"W2739858881","doi":"","title":"Orthogonal designs and MDS self-dual codes","year":2006,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Dual (grammatical number); Combinatorics; Orthogonal array; Arithmetic; Statistics; Taguchi methods; Philosophy; Linguistics","score_opus":0.013060633229469244,"score_gpt":0.22629292382948352,"score_spread":0.21323229060001428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739858881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91491526,0.000559779,0.0786632,0.0020439948,0.0008318071,0.00009934441,0.0000015262074,0.000088603185,0.0027964844],"genre_scores_gemma":[0.99582916,0.000032109674,0.00388126,0.000048667906,0.00012205152,7.4955483e-7,1.8924281e-7,0.0000071129693,0.00007871175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987731,0.00018760691,0.0003396869,0.000119271484,0.00033973527,0.00024058935],"domain_scores_gemma":[0.99901223,0.00021045185,0.0002746465,0.00025852982,0.00014108347,0.00010305908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011773,0.00013816457,0.00019350761,0.0001365506,0.00021498768,0.0001967412,0.0007120642,0.00005383024,0.0000053357867],"category_scores_gemma":[0.000017040116,0.00009508916,0.00011655171,0.00047845958,0.000110134606,0.00036964603,0.00009480354,0.0003245745,0.000003104843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013842524,0.000117170544,0.0047424794,0.000006839331,0.000037531543,0.00006917701,0.00031992194,0.00003534725,0.00020683865,0.9921188,0.0011068211,0.001225262],"study_design_scores_gemma":[0.00079213193,0.00060934323,0.03421901,0.000035205016,0.00006416178,0.0015121143,0.00009491856,0.00025240195,0.0011297455,0.9567513,0.0043332055,0.00020647624],"about_ca_topic_score_codex":0.0000015919892,"about_ca_topic_score_gemma":6.973455e-7,"teacher_disagreement_score":0.08091389,"about_ca_system_score_codex":0.000022264976,"about_ca_system_score_gemma":0.000077461154,"threshold_uncertainty_score":0.38776237},"labels":[],"label_agreement":null},{"id":"W2744871629","doi":"10.1007/s10623-017-0452-3","title":"New constructions of permutation polynomials of the form $$x^rh\\left( x^{q-1}\\right) $$ x r h x q - 1 over $${\\mathbb F}_{q^2}$$ F q 2","year":2017,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; Program for New Century Excellent Talents in University; State Key Laboratory of Cryptography","keywords":"Trinomial; Permutation (music); Multiplicative function; Cyclic permutation; Permutation graph; Finite field; Partial permutation; Generalized permutation matrix","score_opus":0.01736009532675113,"score_gpt":0.2515466679506085,"score_spread":0.23418657262385736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744871629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51929903,0.00038610055,0.4744396,0.00042590217,0.0005651183,0.0003684941,0.000036214544,0.00007565685,0.0044038533],"genre_scores_gemma":[0.97495687,0.00008956735,0.02480074,0.0000619555,0.000046939316,0.000006128568,0.0000012678664,0.000009646439,0.00002687253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986837,0.00009437839,0.00038516446,0.00032083815,0.00027436606,0.00024157195],"domain_scores_gemma":[0.9979881,0.0001458475,0.0005321187,0.0011126347,0.00010999838,0.00011127525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036796325,0.00019622344,0.00031356516,0.00025215844,0.0007311159,0.00022072849,0.0011657506,0.00009831254,0.00006171289],"category_scores_gemma":[0.00004349392,0.00014381912,0.00035340455,0.00032730232,0.00060113444,0.00056641595,0.0002513955,0.00012245806,9.784874e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003315802,0.00005388296,0.022383811,0.000042256645,0.000112234695,0.0000011600495,0.0011975066,0.0000059741355,0.016653072,0.9354339,0.0007693161,0.023313712],"study_design_scores_gemma":[0.0015397379,0.00035086743,0.24693634,0.00023629407,0.00017174607,0.00007024885,0.0002928054,0.0009615742,0.06461336,0.68078023,0.0034914294,0.0005553958],"about_ca_topic_score_codex":0.00012291434,"about_ca_topic_score_gemma":0.000039989805,"teacher_disagreement_score":0.45565784,"about_ca_system_score_codex":0.0000059994095,"about_ca_system_score_gemma":0.0000891094,"threshold_uncertainty_score":0.58647734},"labels":[],"label_agreement":null},{"id":"W2750547415","doi":"10.1007/978-3-319-66396-8_6","title":"A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Concatenation (mathematics); Lexicographical order; Sequence (biology); String (physics); Necklace; Computer science; Combinatorics; Shift register; Discrete mathematics; Mathematics; Telecommunications","score_opus":0.03179502160440214,"score_gpt":0.27607926042371983,"score_spread":0.24428423881931768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750547415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008955272,0.00018317618,0.9922908,0.00075390976,0.0010807666,0.00027971936,0.000014669151,0.000080860125,0.004420586],"genre_scores_gemma":[0.763683,0.000022517213,0.23483035,0.0010283567,0.0001836063,0.000007721424,0.0000035700818,0.000026063697,0.00021481492],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734116,0.00008432533,0.0005173694,0.00090110017,0.0006589831,0.00049708475],"domain_scores_gemma":[0.9967294,0.00046580005,0.0008658965,0.0016433651,0.00020537732,0.00009016576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012510186,0.00035390529,0.00041078852,0.00038377734,0.0006680272,0.0005286496,0.0045339772,0.00015584851,0.00001172675],"category_scores_gemma":[0.00014037355,0.0002798822,0.00018833035,0.00031974717,0.00228622,0.0004403852,0.001367284,0.00063687627,0.0000023753078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011469509,0.000025658157,0.0016563667,0.00008562566,0.000034434,0.000018440573,0.0012669982,0.0026014252,0.007764176,0.22952183,0.000059898877,0.7569537],"study_design_scores_gemma":[0.0004896358,0.000120488934,0.0003745626,0.0017598177,0.000026066335,0.00018177961,0.0000012664357,0.19283769,0.020524554,0.78016627,0.0027240035,0.00079385866],"about_ca_topic_score_codex":0.00005399438,"about_ca_topic_score_gemma":0.0000732577,"teacher_disagreement_score":0.76278746,"about_ca_system_score_codex":0.00016154713,"about_ca_system_score_gemma":0.00036136355,"threshold_uncertainty_score":0.9999653},"labels":[],"label_agreement":null},{"id":"W2751038856","doi":"10.5539/jmr.v9n5p54","title":"Sign of Permutation Induced by Nagata Automorphism over Finite Fields","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Automorphism; Mathematics; Permutation (music); Inner automorphism; Sign (mathematics); Automorphism group; Prime (order theory); Field (mathematics); Finite field; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Physics","score_opus":0.13284878583619505,"score_gpt":0.4036273196044981,"score_spread":0.2707785337683031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751038856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7409723,0.00010651196,0.25127366,0.0015726258,0.00025278353,0.00013690496,0.0000038078326,0.000013193873,0.0056682527],"genre_scores_gemma":[0.9886564,0.00003234723,0.011119303,0.000018679953,0.000048168546,0.0000013984436,2.0029614e-7,0.000005894788,0.0001176135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982345,0.00015738577,0.0003944866,0.00009978785,0.0009205478,0.00019327608],"domain_scores_gemma":[0.99730116,0.00093437673,0.0005192091,0.00066874275,0.00048725973,0.00008925869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040363003,0.00007118049,0.0002037684,0.00028820845,0.00026914538,0.00027991273,0.0018338555,0.00007767344,0.000054180757],"category_scores_gemma":[0.0012114886,0.00005676723,0.00011122949,0.00017078385,0.00011641263,0.0005180555,0.00030568347,0.00045809807,0.000008973932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012727047,0.0018938698,0.0007191317,0.0007402794,0.00037109727,0.00016810143,0.019919505,0.00011693922,0.16736326,0.7098735,0.03151718,0.067189895],"study_design_scores_gemma":[0.0011863179,0.0011963116,0.002487574,0.0005471873,0.000020284993,0.00006713941,0.000408675,0.041485805,0.029605744,0.92168236,0.0010882291,0.0002243627],"about_ca_topic_score_codex":0.000007375852,"about_ca_topic_score_gemma":0.0000011925915,"teacher_disagreement_score":0.24768414,"about_ca_system_score_codex":0.000020170055,"about_ca_system_score_gemma":0.000110138746,"threshold_uncertainty_score":0.34077904},"labels":[],"label_agreement":null},{"id":"W2755348373","doi":"10.46298/dmtcs.3550","title":"Hamming distance from irreducible polynomials over $\\mathbb {F}_2$","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hamming distance; Polynomial; Degree (music); Conjecture; Irreducible polynomial; Discrete mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.01240369567851942,"score_gpt":0.2623634053157415,"score_spread":0.24995970963722206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755348373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07296696,0.00008571483,0.91639066,0.0003243644,0.00092897034,0.0002450737,0.0000104248675,0.0003871629,0.008660654],"genre_scores_gemma":[0.6350238,0.000003068672,0.36445788,0.0002975459,0.00018147471,0.000005513297,0.0000018463792,0.000017569106,0.0000113344195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953763,0.000094535746,0.00080520066,0.0012623027,0.0012516923,0.0012099874],"domain_scores_gemma":[0.99575233,0.0012279077,0.00026631472,0.0020373564,0.00016434572,0.0005517563],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0043970477,0.00043584534,0.00049506756,0.00036939833,0.00078632316,0.0012329908,0.0043096663,0.000112473295,0.00014547676],"category_scores_gemma":[0.00021745077,0.00036225913,0.00026096983,0.0019544146,0.0027511958,0.0011113029,0.0016102826,0.00034372188,0.00011292612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013960373,0.000112513604,0.00007610175,0.000018208548,0.000015331654,0.000025659252,0.0024391348,0.0000121278745,0.0033151675,0.9805519,0.000054034757,0.013365835],"study_design_scores_gemma":[0.00029007666,0.00011479174,0.0005254775,0.00014963519,0.000018467983,0.000022256896,0.0000983235,0.17058754,0.011272817,0.81590813,0.00045443972,0.0005580299],"about_ca_topic_score_codex":0.000008817699,"about_ca_topic_score_gemma":0.000003205346,"teacher_disagreement_score":0.56205684,"about_ca_system_score_codex":0.000078132936,"about_ca_system_score_gemma":0.00010744964,"threshold_uncertainty_score":0.99996275},"labels":[],"label_agreement":null},{"id":"W2756157712","doi":"10.1016/j.ffa.2018.01.011","title":"A group action on multivariate polynomials over finite fields","year":2018,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Finite field; Invariant (physics); Combinatorics; Prime power; Polynomial ring; Prime (order theory); Polynomial; Group ring; Invariant theory; Group (periodic table); Action (physics); Finite group; Algebraic number; Discrete mathematics; Pure mathematics; Algebra over a field; Physics; Mathematical physics; Mathematical analysis; Quantum mechanics","score_opus":0.034434389097119385,"score_gpt":0.2819874740633739,"score_spread":0.2475530849662545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756157712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009646717,0.00013154137,0.9830859,0.0010368193,0.00054601155,0.0005950224,0.00011434092,0.00026167478,0.0045820135],"genre_scores_gemma":[0.99275565,0.000191557,0.0041890815,0.0012904446,0.0006312504,0.00063058,0.00007443474,0.000019343353,0.00021765285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842227,0.00010707744,0.00031312197,0.0007643866,0.00012453915,0.0002686277],"domain_scores_gemma":[0.99745744,0.00083820504,0.0002255433,0.0012977953,0.000064053704,0.000116971685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003191303,0.00032767866,0.00029255755,0.00023003618,0.0003716336,0.000300939,0.00083885057,0.00052330294,0.00009629052],"category_scores_gemma":[0.000036018555,0.0002822124,0.00020386782,0.00027684952,0.00008442305,0.00012550682,0.00081601733,0.0006767129,0.000057399466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011243845,0.00050622056,0.00017214459,0.00018615743,0.00028634316,0.0000026465577,0.003483073,0.00043166574,0.00036727148,0.7804618,0.0037239278,0.21026629],"study_design_scores_gemma":[0.00058127247,0.00039266088,0.0022279061,0.00022393542,0.000048008467,0.0000044431904,0.0000525861,0.031607203,0.0009269014,0.84620404,0.116849884,0.0008811762],"about_ca_topic_score_codex":0.000082406776,"about_ca_topic_score_gemma":0.000035687524,"teacher_disagreement_score":0.98310894,"about_ca_system_score_codex":0.000016752687,"about_ca_system_score_gemma":0.0000383656,"threshold_uncertainty_score":0.999963},"labels":[],"label_agreement":null},{"id":"W2757847923","doi":"10.1007/s12095-017-0256-3","title":"Characteristic digit-sum sequences","year":2017,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Autocorrelation; Complementary sequences; Binary number; Mathematics; Numerical digit; Nonlinear system; Primitive polynomial; Sequence (biology); Discrete mathematics; Combinatorics; Arithmetic; Statistics; Biology; Physics; Genetics","score_opus":0.03788298953616897,"score_gpt":0.2873308536251481,"score_spread":0.24944786408897912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757847923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3289704,0.00638813,0.4516016,0.029061664,0.0011286517,0.0007730598,0.00007574141,0.0013525647,0.1806482],"genre_scores_gemma":[0.9811884,0.0010758436,0.01741202,0.00022363222,0.000024035116,0.000045036242,0.000006399493,0.0000052836194,0.000019335634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991957,0.00008553284,0.00016727866,0.00024963537,0.00010308427,0.00019877538],"domain_scores_gemma":[0.99541277,0.00014875668,0.0001652644,0.0041017276,0.00006229946,0.00010918101],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022108135,0.00012748722,0.0001356122,0.00014324451,0.0025148925,0.0010703806,0.0040636663,0.00005015138,0.000010441323],"category_scores_gemma":[0.000051399387,0.0001203966,0.00011173609,0.00019990439,0.00082813884,0.00087969686,0.0011217603,0.00017518457,0.000013273634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022400732,0.000050445684,0.010101264,0.0000056568097,0.000024783823,0.0000010926126,0.00038650143,6.4946974e-8,0.00021365845,0.8978069,0.000068025285,0.091339365],"study_design_scores_gemma":[0.00032651724,0.00010352466,0.20042974,0.00008247268,0.00003217372,0.00002545778,0.00013762772,0.0007077483,0.00037046504,0.71877307,0.07854818,0.00046304194],"about_ca_topic_score_codex":0.000025460013,"about_ca_topic_score_gemma":0.000019839541,"teacher_disagreement_score":0.652218,"about_ca_system_score_codex":0.0000033702327,"about_ca_system_score_gemma":0.000021333199,"threshold_uncertainty_score":0.9999666},"labels":[],"label_agreement":null},{"id":"W2759330492","doi":"","title":"Semisymmetric Cubic Graphs Of Order 10p n .","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cubic graph; Order (exchange); Combinatorics; Graph; Line graph; Business","score_opus":0.013466573888961155,"score_gpt":0.24626373044304853,"score_spread":0.23279715655408736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759330492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96554357,0.00036135377,0.0030966266,0.00038769885,0.0034012902,0.00013737792,0.0000017471729,0.0001619263,0.026908407],"genre_scores_gemma":[0.99803734,0.000033554425,0.0017490312,0.00005399062,0.00000430328,0.0000060361535,5.145876e-7,0.000007675993,0.000107541055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899065,0.00005716581,0.00018748778,0.00028388307,0.0002452249,0.00023555954],"domain_scores_gemma":[0.99787796,0.00011726511,0.00021781269,0.0015534426,0.00014850771,0.00008502749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004329213,0.00012492621,0.00019219492,0.00023809665,0.00036386453,0.00016520385,0.0020813723,0.00006468869,0.000018510322],"category_scores_gemma":[0.00019778215,0.00012006013,0.00012126254,0.0007203221,0.00013260216,0.00043685353,0.0004257515,0.00012466623,0.000028380473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046165683,0.00008396417,0.008756738,0.000009267241,0.000023023385,0.0000051927873,0.000113330294,7.852676e-7,0.00036749485,0.9783684,0.0006869098,0.011580291],"study_design_scores_gemma":[0.00051608396,0.00010767723,0.01681932,0.000022078912,0.000009233416,0.0000037232676,0.0000071490167,0.0002847496,0.004650842,0.975542,0.0018799147,0.00015719452],"about_ca_topic_score_codex":0.000029074341,"about_ca_topic_score_gemma":0.0000015147408,"teacher_disagreement_score":0.03249378,"about_ca_system_score_codex":0.00000898192,"about_ca_system_score_gemma":0.00003818846,"threshold_uncertainty_score":0.489591},"labels":[],"label_agreement":null},{"id":"W2760258650","doi":"","title":"Skew-quasi-cyclic codes over Ml(F q )[X, θ].","year":2017,"lang":"nl","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Skew; Mathematics; Combinatorics; Computer science; Telecommunications","score_opus":0.01811014444861419,"score_gpt":0.26818527129966757,"score_spread":0.2500751268510534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760258650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93169487,0.001527822,0.0015464621,0.0019215682,0.023251044,0.00043950728,0.000029078177,0.000392726,0.03919692],"genre_scores_gemma":[0.9965444,0.00024561453,0.00049029995,0.00039729383,0.000094882904,0.000022829072,0.0000044937974,0.00004683435,0.002153326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636436,0.00032889616,0.000533776,0.0011026358,0.00068618153,0.0009841417],"domain_scores_gemma":[0.9942695,0.00035681503,0.0006170148,0.0041740714,0.00017048832,0.00041213032],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011723951,0.00055591465,0.00062780856,0.00021440278,0.0024545821,0.0022499508,0.004621385,0.00032845017,0.00039150903],"category_scores_gemma":[0.00034571838,0.0005866387,0.00045662074,0.00036115793,0.0006543905,0.0013800942,0.0016394373,0.00063263456,0.0013762456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004454509,0.0005545517,0.015352632,0.00004003321,0.00013253556,0.00008931002,0.0006680554,9.0254474e-7,0.00028576996,0.9604447,0.0115668615,0.010820136],"study_design_scores_gemma":[0.0016072775,0.00051324634,0.05141029,0.00021056323,0.00007454,0.000014773667,0.000027208815,0.0011380829,0.0012167189,0.9070236,0.035994645,0.0007690218],"about_ca_topic_score_codex":0.00017114809,"about_ca_topic_score_gemma":0.000027480814,"teacher_disagreement_score":0.064849555,"about_ca_system_score_codex":0.00007445642,"about_ca_system_score_gemma":0.00015280732,"threshold_uncertainty_score":0.9996585},"labels":[],"label_agreement":null},{"id":"W2766579298","doi":"10.1016/j.ffa.2018.02.002","title":"Existence of primitive 1-normal elements in finite fields","year":2018,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Combinatorics; Dimension (graph theory); Primitive element; Normal basis; Prime (order theory); Linear subspace; Mathematics; Subspace topology; Space (punctuation); Vector space; Physics; Finite field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.022613683833424547,"score_gpt":0.25630218835844,"score_spread":0.23368850452501544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766579298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023036905,0.0002762477,0.96212566,0.0004179093,0.00014878093,0.00054658373,0.00010673636,0.00006581514,0.013275389],"genre_scores_gemma":[0.9871552,0.00022062272,0.011736101,0.00028775452,0.00008898732,0.0003847746,0.00003680154,0.000007803029,0.00008194891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870867,0.000067504014,0.00040570958,0.000490773,0.00010840672,0.00021894752],"domain_scores_gemma":[0.9982658,0.0004624375,0.00023282395,0.0008714972,0.00010350179,0.00006394004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033279383,0.00020748566,0.00026694578,0.00021058977,0.00010773336,0.00007175301,0.0009318076,0.0002777597,0.000039428818],"category_scores_gemma":[0.000031522894,0.00019029301,0.000113267444,0.00034827317,0.00012750897,0.000099258454,0.0010730636,0.00045061557,0.000007648288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004651913,0.00047223276,0.005020967,0.0003888408,0.00014727657,0.0000036090214,0.009916935,0.00027539863,0.000057329406,0.85640943,0.00034741324,0.12691407],"study_design_scores_gemma":[0.0004764176,0.00029066196,0.006933183,0.0003827455,0.000024481116,0.0000035809067,0.00021304133,0.021199523,0.0015489244,0.95431405,0.013993726,0.00061967655],"about_ca_topic_score_codex":0.000032666565,"about_ca_topic_score_gemma":0.000041828655,"teacher_disagreement_score":0.9641183,"about_ca_system_score_codex":0.0000087946655,"about_ca_system_score_gemma":0.00006256217,"threshold_uncertainty_score":0.77599233},"labels":[],"label_agreement":null},{"id":"W2766744273","doi":"10.1109/isit.2018.8437698","title":"On the List-Decodability of Random Linear Rank-Metric Codes","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Rank (graph theory); Mathematics; Metric (unit); Hamming distance; Constant (computer programming); RADIUS; Discrete mathematics; Computer science","score_opus":0.02531693207324356,"score_gpt":0.2669588836877031,"score_spread":0.24164195161445953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766744273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16326615,0.00014117348,0.79811627,0.0011527082,0.0013349557,0.00068864704,0.00002076172,0.0002953626,0.034983955],"genre_scores_gemma":[0.98919237,0.000048887443,0.010036517,0.00038506745,0.0001308033,0.000032667525,0.0000026968191,0.000009320971,0.00016169935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977743,0.00053497945,0.0004298498,0.0006256363,0.00040540472,0.00022985534],"domain_scores_gemma":[0.9943581,0.0027620888,0.00025794966,0.0023220435,0.00023300343,0.000066812885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030431794,0.0002568467,0.0004414417,0.00030104636,0.0001427126,0.00011977081,0.0027296257,0.00018894844,0.00035223042],"category_scores_gemma":[0.0008122773,0.00015088897,0.000474937,0.0008383489,0.00032735366,0.00006475881,0.0015935223,0.00046908,0.000050273404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040980775,0.00042978994,0.0006116417,0.00017209932,0.00020926894,0.0000025043003,0.0007997491,0.0004880095,0.00008011649,0.97139186,0.006512229,0.018892908],"study_design_scores_gemma":[0.00094856706,0.00029563077,0.0009108885,0.00013756349,0.000041134925,0.0000023029818,0.000016839518,0.03060239,0.0072461027,0.9570968,0.0022923313,0.00040944715],"about_ca_topic_score_codex":0.00006161867,"about_ca_topic_score_gemma":0.000010591555,"teacher_disagreement_score":0.8259262,"about_ca_system_score_codex":0.000020237894,"about_ca_system_score_gemma":0.00009170042,"threshold_uncertainty_score":0.61530733},"labels":[],"label_agreement":null},{"id":"W2768936014","doi":"10.4153/cmb-2018-027-x","title":"Irreducible Polynomials Over a Finite Field with Restricted Coefficients","year":2018,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Finite field; Field (mathematics); Degree (music); Function field; Function (biology); Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.010190630557633737,"score_gpt":0.22021462390097324,"score_spread":0.2100239933433395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768936014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20001583,0.000056728244,0.6158313,0.015448655,0.00042671693,0.0006021706,0.000020211613,0.00038100046,0.16721734],"genre_scores_gemma":[0.98521197,8.8273794e-7,0.009867822,0.0034545858,0.00010763979,0.000016953087,0.0000014796643,0.000013805572,0.0013248771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987239,0.000060488488,0.00019407894,0.00034755858,0.00019395718,0.0004799858],"domain_scores_gemma":[0.99830145,0.00041628923,0.000048515434,0.0006573173,0.000076495795,0.0004999425],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023349891,0.00014945323,0.00017445747,0.00023766886,0.00021939268,0.00019123392,0.0006958127,0.00008351572,0.0058236164],"category_scores_gemma":[0.00033832094,0.00012288195,0.000055585675,0.0006156032,0.00014498219,0.00005251032,0.00007354795,0.00013023191,0.003962727],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006222311,0.00014785651,0.0002025361,0.000046331985,0.000058087877,0.00013499898,0.0011839354,0.000009242756,0.00019396997,0.8487195,0.13968377,0.009557568],"study_design_scores_gemma":[0.0016405544,0.0019204366,0.0014203865,0.0005211096,0.00005496176,0.00012806183,0.00011979577,0.008015516,0.003949525,0.13034791,0.850552,0.0013297257],"about_ca_topic_score_codex":0.0005152038,"about_ca_topic_score_gemma":0.00044514379,"teacher_disagreement_score":0.7851961,"about_ca_system_score_codex":0.00004043069,"about_ca_system_score_gemma":0.0001922242,"threshold_uncertainty_score":0.9968128},"labels":[],"label_agreement":null},{"id":"W2769119271","doi":"","title":"On triplanes of order twelve admitting an automorphism of order six and their binary and ternary codes","year":2017,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ternary operation; Isomorphism (crystallography); Combinatorics; Automorphism; Order (exchange); Automorphism group; Binary number; Dimension (graph theory); Binary code; Residual; Discrete mathematics; Arithmetic; Algorithm; Computer science","score_opus":0.021984553661439928,"score_gpt":0.2662980361193844,"score_spread":0.2443134824579445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769119271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98735696,0.000302653,0.009436084,0.0002235016,0.00006342355,0.00016775551,0.000017183836,0.00006085298,0.0023715834],"genre_scores_gemma":[0.97989345,0.000022099586,0.01998861,0.000036776037,0.0000114889535,0.000005765878,0.0000011894463,0.000008795559,0.00003185082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905616,0.00008322223,0.00027688086,0.00028101847,0.00013879973,0.00016390937],"domain_scores_gemma":[0.99811,0.0005858347,0.00025375755,0.0008957234,0.00007733639,0.00007737544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061296916,0.0001605237,0.0003277078,0.00011334103,0.00021963243,0.00007590151,0.0006027973,0.000057635076,0.000033159602],"category_scores_gemma":[0.0002908934,0.0001176033,0.000045187364,0.00010212023,0.00036162743,0.00028838875,0.0003015663,0.00008619244,0.0000018766091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014685286,0.0007558378,0.003365378,0.0008913676,0.00016201466,0.000021290913,0.013754354,0.000006239769,0.0051207007,0.9311555,0.00020696783,0.044413477],"study_design_scores_gemma":[0.0011953189,0.0015575518,0.017982274,0.0010642889,0.00005518903,0.00009448014,0.0010731864,0.08460987,0.006363917,0.88529944,0.00023724217,0.00046722428],"about_ca_topic_score_codex":0.000012040218,"about_ca_topic_score_gemma":0.000002562362,"teacher_disagreement_score":0.08460364,"about_ca_system_score_codex":0.0000026590901,"about_ca_system_score_gemma":0.000022577318,"threshold_uncertainty_score":0.47957233},"labels":[],"label_agreement":null},{"id":"W2770344099","doi":"10.3842/sigma.2018.050","title":"Evaluation of Certain Hypergeometric Functions over Finite Fields","year":2018,"lang":"en","type":"article","venue":"Symmetry Integrability and Geometry Methods and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Ministry of Science and Technology, Taiwan; National Center for Theoretical Sciences","keywords":"Prime (order theory); Character (mathematics); Hypergeometric function; Finite field; Mathematics; Hypergeometric distribution; Multiplicative function; Order (exchange); Combinatorics; Matrix (chemical analysis); Field (mathematics); Group (periodic table); Pure mathematics; Physics; Mathematical analysis; Geometry; Quantum mechanics","score_opus":0.04308796895526812,"score_gpt":0.36609163102773973,"score_spread":0.3230036620724716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770344099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10022471,0.00077015854,0.8955921,0.00024070856,0.00012539723,0.00032087674,0.000020101364,0.000056873345,0.0026490598],"genre_scores_gemma":[0.8835216,0.000056490033,0.11603436,0.0001035407,0.00008483018,0.00013086454,0.000005205601,0.0000051364113,0.000057952835],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797326,0.0006530304,0.00034467442,0.00051010435,0.0003271341,0.00019177684],"domain_scores_gemma":[0.9967936,0.0016386117,0.00012688265,0.0007243652,0.000598111,0.00011839907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00697877,0.0001519948,0.00023445016,0.000684643,0.00033251298,0.00007252484,0.00031350355,0.00013201385,0.00015957566],"category_scores_gemma":[0.0013208187,0.00013203389,0.00009886067,0.003773207,0.00038857336,0.00022709857,0.00018595206,0.00020183594,0.0000055061555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051984125,0.0001044368,0.0029933164,0.000023582692,0.000038032205,2.1788129e-8,0.000119807904,0.0000033847075,0.00028828788,0.19961224,0.0000342875,0.79677737],"study_design_scores_gemma":[0.000551081,0.0004624077,0.04176698,0.000027793321,0.00025296782,0.000009810176,0.0004236231,0.035323072,0.0036318523,0.89498067,0.022185862,0.00038388927],"about_ca_topic_score_codex":0.00007144242,"about_ca_topic_score_gemma":0.00001539172,"teacher_disagreement_score":0.7963935,"about_ca_system_score_codex":0.000022657734,"about_ca_system_score_gemma":0.00005451694,"threshold_uncertainty_score":0.5384186},"labels":[],"label_agreement":null},{"id":"W2773164695","doi":"10.1016/j.jsc.2020.06.007","title":"Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields","year":2020,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Public Works and Government Services Canada; National Science Foundation","keywords":"Mathematics; Finite field; Lift (data mining); Polynomial ring; Invariant (physics); Hasse principle; Multiplication (music); Complex multiplication; Polynomial; Discrete mathematics; Combinatorics; Pure mathematics; Algebraic number field; Elliptic curve; Computer science","score_opus":0.04452285834766072,"score_gpt":0.28032262866603996,"score_spread":0.23579977031837923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773164695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26756898,0.0001036473,0.7300653,0.0016871666,0.0002937074,0.00014812457,0.0000048827146,0.00004652272,0.00008172347],"genre_scores_gemma":[0.9550528,0.000057690562,0.044249486,0.00030902325,0.0003026961,0.00000431757,0.0000069530165,0.00001383052,0.0000032357866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983778,0.00012909755,0.0006121081,0.00035114397,0.0003604723,0.00016936332],"domain_scores_gemma":[0.9979326,0.00038547692,0.00094318535,0.00028616464,0.0002836729,0.00016891025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036354526,0.0002478979,0.00047264417,0.0003258938,0.00012612861,0.000443364,0.00061779545,0.00014435353,0.000006834738],"category_scores_gemma":[0.000084930376,0.00021694375,0.00012984537,0.0002620392,0.000053011456,0.000405749,0.00050767907,0.000562998,0.0000018774979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009054853,0.00085044216,0.04596716,0.0013556329,0.0022645856,0.00029082835,0.058843095,0.39825365,0.00933909,0.099940635,0.0033583278,0.3786311],"study_design_scores_gemma":[0.0019935276,0.00057336903,0.39331895,0.0007797079,0.00013842894,0.00016269276,0.00012851579,0.48624167,0.0005646635,0.11444291,0.00089573325,0.00075984176],"about_ca_topic_score_codex":0.000026559737,"about_ca_topic_score_gemma":0.00000512717,"teacher_disagreement_score":0.6874838,"about_ca_system_score_codex":0.000038652,"about_ca_system_score_gemma":0.00012630915,"threshold_uncertainty_score":0.884671},"labels":[],"label_agreement":null},{"id":"W2778151000","doi":"10.1007/s10623-018-0543-9","title":"Variations of the Primitive Normal Basis Theorem","year":2018,"lang":"en","type":"preprint","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Multiplicative function; Conjecture; Mathematics; Basis (linear algebra); Combinatorics; Order (exchange); TRACE (psycholinguistics); Finite field; Element (criminal law); Primitive element; Field (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Philosophy","score_opus":0.022971389642472372,"score_gpt":0.23831660111904404,"score_spread":0.21534521147657168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778151000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04150022,0.00053364114,0.9483416,0.00035884578,0.0007890095,0.0005372206,0.000103930804,0.00016323333,0.007672264],"genre_scores_gemma":[0.9478417,0.00019642546,0.051460303,0.00027250228,0.00011793805,0.00007271599,0.000007742363,0.00001959248,0.00001107502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976661,0.00047751144,0.0004273566,0.0006854788,0.00038653566,0.00035698529],"domain_scores_gemma":[0.99742585,0.0003508019,0.00042737013,0.0013992761,0.0002841661,0.000112508176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008506054,0.00037683916,0.0004157791,0.00040862738,0.00044924064,0.0002670033,0.0018635144,0.00027185393,0.000038937567],"category_scores_gemma":[0.000047824098,0.000275477,0.0006146224,0.0010759484,0.0007477882,0.00017926634,0.0017011233,0.0004510766,0.0000025447391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025621592,0.00011362436,0.003943297,0.000078198434,0.00025712483,0.0000014303793,0.0017029326,0.000028057475,0.00046136556,0.9844489,0.00046733124,0.008472108],"study_design_scores_gemma":[0.0003837122,0.00026388819,0.041421555,0.00035117604,0.00023362081,0.000014537522,0.00011924902,0.0033021988,0.0063115014,0.9453149,0.00160338,0.0006803253],"about_ca_topic_score_codex":0.00003168946,"about_ca_topic_score_gemma":0.000010757957,"teacher_disagreement_score":0.9063415,"about_ca_system_score_codex":0.000010713479,"about_ca_system_score_gemma":0.00012679156,"threshold_uncertainty_score":0.9999697},"labels":[],"label_agreement":null},{"id":"W2778234656","doi":"10.1007/s10623-018-0548-4","title":"A recursive construction of permutation polynomials over $${\\mathbb {F}}_{q^2}$$ F q 2 with odd characteristic related to Rédei functions","year":2018,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Trinomial; Permutation (music); Permutation graph; Partial permutation; Cyclic permutation; Derangement; Bit-reversal permutation; Parity of a permutation; Simple (philosophy)","score_opus":0.010034828526057249,"score_gpt":0.2343974115810328,"score_spread":0.22436258305497556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778234656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52709526,0.00006163754,0.47117394,0.00014351052,0.00020672151,0.00024839785,0.000020368718,0.00011356707,0.0009365929],"genre_scores_gemma":[0.9589631,0.000028136092,0.040709253,0.00017240136,0.00004983612,0.00003817235,0.00001009266,0.00001445627,0.000014542878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854714,0.00014320607,0.0003344578,0.00047586008,0.00021992142,0.00027943283],"domain_scores_gemma":[0.99881893,0.0001377119,0.00021271576,0.00041165872,0.00025881437,0.00016016049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031964364,0.00021895551,0.0002827374,0.0006215907,0.00032914427,0.00013773526,0.00026349092,0.00009481471,0.00007816149],"category_scores_gemma":[0.000028189688,0.00019094738,0.00011593391,0.0016616323,0.00045045983,0.00037547472,0.000065084074,0.00010904784,0.000012427842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006109108,0.00019874953,0.011584065,0.000057000943,0.00034277557,0.000011601938,0.0061451425,0.000012739223,0.031781,0.88402146,0.00065987883,0.06457469],"study_design_scores_gemma":[0.0063308906,0.018038616,0.4191358,0.0010838122,0.0008743486,0.0010266618,0.0043560746,0.004282241,0.037835836,0.48886585,0.014520446,0.0036493908],"about_ca_topic_score_codex":0.000018417617,"about_ca_topic_score_gemma":0.0000104140745,"teacher_disagreement_score":0.43186787,"about_ca_system_score_codex":0.000011795526,"about_ca_system_score_gemma":0.000043346896,"threshold_uncertainty_score":0.77866083},"labels":[],"label_agreement":null},{"id":"W2778339298","doi":"10.1137/1.9781611975031.36","title":"Time and Space Efficient Representations of Distributive Lattices","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Distributive property; Joins; Lattice (music); Distributive lattice; Combinatorics; Mathematics; Binary logarithm; Discrete mathematics; Space (punctuation); Data structure; Computer science; Pure mathematics; Physics","score_opus":0.039126921472558585,"score_gpt":0.24990642846794822,"score_spread":0.21077950699538964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778339298","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016646195,0.00029685278,0.15128152,0.0003726133,0.0004938429,0.0049588196,0.001518504,0.00039386252,0.8240378],"genre_scores_gemma":[0.049043104,0.00015157352,0.50271636,0.00035332228,0.0032469623,0.0005735453,0.000405412,0.00037345104,0.4431363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894845,0.0000045281,0.0003216358,0.00036220936,0.00018952166,0.00017364489],"domain_scores_gemma":[0.998654,0.00047268352,0.00038211924,0.00033048366,0.00008186488,0.000078868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041390193,0.00023784795,0.00039847937,0.00003942262,0.00022134425,0.000083162755,0.00026232176,0.0003232432,0.000016361098],"category_scores_gemma":[0.000016472262,0.00021049121,0.00024306345,0.000027563661,0.0005838515,0.000020844924,0.00029416406,0.00019247789,0.00000396466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012996127,0.000019324621,7.4942626e-8,0.00010018486,0.00017288118,1.2518032e-7,0.0030865998,0.0000017798588,0.00021736736,0.9915378,0.0017709472,0.0030799236],"study_design_scores_gemma":[0.0011257192,0.0001977443,3.044162e-7,0.00027926278,0.00033656677,0.000004863355,0.00048247437,0.0029946011,0.002301542,0.97620666,0.01561116,0.00045908848],"about_ca_topic_score_codex":6.3159035e-7,"about_ca_topic_score_gemma":2.808108e-7,"teacher_disagreement_score":0.3809015,"about_ca_system_score_codex":0.000012216359,"about_ca_system_score_gemma":0.00004843238,"threshold_uncertainty_score":0.8583582},"labels":[],"label_agreement":null},{"id":"W2779154616","doi":"10.1109/cns.2017.8228669","title":"Cryptanalysis of stream cipher using density evolution","year":2017,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Stream cipher; Correlation attack; Stream cipher attack; Ciphertext; Computer science; Cryptanalysis; Keystream; Algorithm; Theoretical computer science; Cryptography; Computer security; Encryption","score_opus":0.026266682278312393,"score_gpt":0.27037643313201004,"score_spread":0.24410975085369765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779154616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43254176,0.000010171373,0.5630735,0.00003883055,0.000062200204,0.000014803152,1.9373311e-7,0.00002622348,0.004232333],"genre_scores_gemma":[0.9651676,9.553582e-7,0.034732293,0.000014355784,0.000017731012,2.9861548e-7,8.5641894e-8,0.0000016096529,0.00006511263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994897,0.000031186944,0.00009999269,0.0001571027,0.00012172865,0.00010024336],"domain_scores_gemma":[0.9988844,0.000019596699,0.00012157669,0.00086793076,0.00007349075,0.000033048836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022939785,0.000053997228,0.000100663434,0.000069080095,0.0002851012,0.000091459304,0.00064397394,0.000027411881,0.00003949213],"category_scores_gemma":[0.000033815395,0.000047041765,0.00010503037,0.00012146544,0.00006908397,0.00037100483,0.00021893019,0.000033720808,0.000005148181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007179057,0.000057980433,0.06942662,0.000006269802,0.00006211926,0.0000028344798,0.00011471228,0.00012999639,0.009963879,0.9053324,0.00005596571,0.014840068],"study_design_scores_gemma":[0.0004391566,0.000090063986,0.3338748,0.000042052718,0.00011567884,0.000009604754,0.00008538835,0.26727453,0.032553595,0.36495808,0.0001734651,0.00038359198],"about_ca_topic_score_codex":0.00024315549,"about_ca_topic_score_gemma":0.000055825694,"teacher_disagreement_score":0.54037434,"about_ca_system_score_codex":0.000014137084,"about_ca_system_score_gemma":0.000018780313,"threshold_uncertainty_score":0.21927969},"labels":[],"label_agreement":null},{"id":"W2782009702","doi":"10.1070/im8739","title":"Asymptotic bounds for spherical codes","year":2018,"lang":"en","type":"article","venue":"Izvestiya Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamming code; Cardinality (data modeling); Code (set theory); Unit square; Set (abstract data type); Linear code; Alphabet; Hamming distance; Domain (mathematical analysis)","score_opus":0.024722990702615473,"score_gpt":0.2728183929624516,"score_spread":0.24809540225983612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782009702","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016345317,0.000031015694,0.97602075,0.00032148501,0.0003456474,0.00017391948,0.000002490376,0.00028824472,0.0064711007],"genre_scores_gemma":[0.25838235,0.0000025482727,0.740664,0.00033694453,0.00020854821,0.000029309804,9.639724e-7,0.0000148330155,0.00036047914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904776,0.00002504737,0.00022144985,0.00024588982,0.00017381641,0.00028603032],"domain_scores_gemma":[0.9987253,0.00040199715,0.00008352108,0.00058417866,0.00010705462,0.000097981705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040037493,0.00013671136,0.00018386584,0.00005254368,0.00021004863,0.00020688004,0.0007608785,0.00005640216,0.00003308674],"category_scores_gemma":[0.00019449324,0.000118590404,0.00010202402,0.0003267929,0.00020420799,0.00019485418,0.00013682096,0.00006066095,0.000119662414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004132896,0.00011306784,0.00005024874,0.000052656338,0.00002034397,0.0000014856788,0.0011307237,0.00000265521,0.0005057196,0.99042755,0.0025356375,0.0051557524],"study_design_scores_gemma":[0.00022997915,0.00038198693,0.00008802864,0.00005833621,0.000020032885,0.000027117845,0.000045379467,0.04455159,0.0024222266,0.9404198,0.011533639,0.00022189946],"about_ca_topic_score_codex":9.520154e-7,"about_ca_topic_score_gemma":0.0000025541012,"teacher_disagreement_score":0.24203704,"about_ca_system_score_codex":0.000014529171,"about_ca_system_score_gemma":0.00003950698,"threshold_uncertainty_score":0.48359764},"labels":[],"label_agreement":null},{"id":"W2782312501","doi":"10.1109/tit.2017.2789208","title":"Explicit Full Correlation Distribution of Sequence Families Using Plateaued Functions","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Orta Doğu Teknik Üniversitesi","keywords":"Correlation; Sequence (biology); Mathematics; Distribution (mathematics); Statistics; Computer science; Genetics; Biology; Mathematical analysis","score_opus":0.020004070796250637,"score_gpt":0.2379385320035846,"score_spread":0.21793446120733398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782312501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08476172,0.0000039369465,0.9127135,0.000026731146,0.0009371505,0.00015426106,0.000071125134,0.00020408531,0.0011274886],"genre_scores_gemma":[0.9971849,0.0000071923782,0.0026077232,0.0000935591,0.000026899796,0.000018354924,0.000021462445,0.0000045457564,0.00003538219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888635,0.00011661571,0.0004495206,0.00013885897,0.00023499434,0.0001736719],"domain_scores_gemma":[0.99888575,0.00016386666,0.00022981754,0.00040487887,0.00026055734,0.000055149136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000544783,0.00013666126,0.00012238654,0.00033559278,0.0004729233,0.00007451898,0.0002887529,0.00009271122,0.0000782744],"category_scores_gemma":[0.000016475564,0.00013641689,0.00011359041,0.00084851665,0.00016385343,0.0025091416,0.000003640167,0.00015430007,0.00014881122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059677503,0.00018381064,0.000023097105,0.00005883089,0.00010520072,4.73575e-7,0.008425645,0.06282837,0.008243756,0.7052203,0.0001426495,0.2141711],"study_design_scores_gemma":[0.0015629461,0.0013753899,0.000462813,0.0002421314,0.0001284775,0.000085144995,0.0030448302,0.7949523,0.110363446,0.08332767,0.0036086165,0.0008462445],"about_ca_topic_score_codex":0.000013285409,"about_ca_topic_score_gemma":0.0000032432342,"teacher_disagreement_score":0.9124232,"about_ca_system_score_codex":0.000071098264,"about_ca_system_score_gemma":0.000058486017,"threshold_uncertainty_score":0.55629194},"labels":[],"label_agreement":null},{"id":"W2783366629","doi":"10.26493/1855-3974.938.1ae","title":"On t-fold covers of coherent configurations","year":2017,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Fold (higher-order function); Combinatorics; Computer science","score_opus":0.032275262402703966,"score_gpt":0.2719553988205454,"score_spread":0.23968013641784147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783366629","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26432052,0.00005714183,0.3294641,0.0035130437,0.00064004306,0.0008007872,0.00002327729,0.00027206657,0.400909],"genre_scores_gemma":[0.9970845,0.0000030125098,0.0024561181,0.0001319307,0.000008297037,0.00001890339,0.0000011482232,0.0000071069394,0.00028898445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990938,0.00005048935,0.00028280012,0.00022011476,0.00020228614,0.00015056423],"domain_scores_gemma":[0.9977293,0.00033467042,0.00034984708,0.001440602,0.000074233474,0.00007134057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039621937,0.00012737351,0.00024308175,0.00007558039,0.00029227167,0.00017885352,0.0011683025,0.00004188505,0.00007916289],"category_scores_gemma":[0.00022972826,0.00010868645,0.00013450376,0.00006596792,0.00016921267,0.00029953735,0.00010631891,0.000080690916,0.00008551332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013017717,0.00011172603,0.000057000754,0.000027945327,0.000034440767,0.000005833556,0.0005462608,0.000003099726,0.002053297,0.99498,0.000980352,0.0011870626],"study_design_scores_gemma":[0.0009025088,0.00027751425,0.0005162162,0.00024913004,0.0000195246,0.000007950192,0.000082659855,0.0028105548,0.011248401,0.98210055,0.0015352481,0.00024971852],"about_ca_topic_score_codex":0.000009896826,"about_ca_topic_score_gemma":0.0000040712534,"teacher_disagreement_score":0.73276395,"about_ca_system_score_codex":0.000008309857,"about_ca_system_score_gemma":0.000035985464,"threshold_uncertainty_score":0.44321048},"labels":[],"label_agreement":null},{"id":"W278832587","doi":"10.1049/iet-com.2010.0078","title":"Efficient soft decoding of Reed–Solomon codes based on sphere decoding","year":2011,"lang":"en","type":"article","venue":"IET Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; List decoding; Code word; Algorithm; Sequential decoding; Computer science; Mathematics; Coding (social sciences); Theoretical computer science; Concatenated error correction code; Block code; Statistics","score_opus":0.0626680418802916,"score_gpt":0.2730091243760964,"score_spread":0.21034108249580483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W278832587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07793902,0.00035857144,0.8504979,0.0006534604,0.00021806205,0.0002691493,0.000014656017,0.00036105743,0.06968815],"genre_scores_gemma":[0.84232354,0.000017234233,0.15745614,0.00015464629,0.000006255815,0.00001970163,0.000003760579,0.000007989554,0.000010731868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988935,0.00022970475,0.000285762,0.00022149319,0.0001665807,0.00020296447],"domain_scores_gemma":[0.9961709,0.000641053,0.00016581474,0.0028483719,0.000102272345,0.00007163606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006052593,0.00011986418,0.00016078478,0.00016125446,0.00036480225,0.00004155533,0.0026706962,0.000055620123,0.000057315374],"category_scores_gemma":[0.00009720653,0.0001236868,0.00013033357,0.0005913623,0.00018377342,0.00008105794,0.0004870754,0.00018996534,0.000027898104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043448184,0.000994545,0.0053402768,0.000028373583,0.00004287071,0.0000022305912,0.004833816,0.0025869126,0.0020475765,0.9236624,0.00023011661,0.060187396],"study_design_scores_gemma":[0.0005812001,0.000322871,0.0055882484,0.00030922628,0.000037822487,0.0000051525158,0.00040675895,0.9578202,0.0083282245,0.024603326,0.0015580382,0.00043896044],"about_ca_topic_score_codex":0.00004929656,"about_ca_topic_score_gemma":0.00007106793,"teacher_disagreement_score":0.9552333,"about_ca_system_score_codex":0.000024035344,"about_ca_system_score_gemma":0.0000492263,"threshold_uncertainty_score":0.5043801},"labels":[],"label_agreement":null},{"id":"W2790464680","doi":"10.4213/mvk117","title":"Описание скрученных линейных рекуррент максимального периода в терминах мультипликаторов","year":2014,"lang":"ru","type":"article","venue":"Математические вопросы криптографии","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Psychology","score_opus":0.009770268943029212,"score_gpt":0.21146467684759654,"score_spread":0.20169440790456733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790464680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13274698,0.008042961,0.49522218,0.01616899,0.026563648,0.0035512466,0.00026849261,0.0055430005,0.3118925],"genre_scores_gemma":[0.9654076,0.0005199597,0.011315322,0.006141635,0.00435446,0.00017773703,0.000085123254,0.00037852323,0.011619619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98373437,0.0022295502,0.0026634852,0.004318477,0.002760685,0.0042934595],"domain_scores_gemma":[0.98726207,0.0017775882,0.001331352,0.006798141,0.00081516145,0.0020157031],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0052007823,0.0025705711,0.0024439415,0.0016620726,0.0022628584,0.002552436,0.007782589,0.0014490132,0.0032973536],"category_scores_gemma":[0.00093018997,0.0026894517,0.0019515996,0.0045108884,0.0015221654,0.002385727,0.00291288,0.0027118584,0.00852483],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043242192,0.0018246553,0.00520276,0.0006325912,0.00076657126,0.0002721294,0.005578967,0.00046815566,0.0035723597,0.6212722,0.054833777,0.30514342],"study_design_scores_gemma":[0.0056488332,0.0029477004,0.0137243485,0.0013762211,0.00068848167,0.00044472163,0.00065571594,0.040232487,0.0059810905,0.14363146,0.77841645,0.006252477],"about_ca_topic_score_codex":0.0003339853,"about_ca_topic_score_gemma":0.00026136346,"teacher_disagreement_score":0.8326606,"about_ca_system_score_codex":0.00037532562,"about_ca_system_score_gemma":0.00073689816,"threshold_uncertainty_score":0.9998473},"labels":[],"label_agreement":null},{"id":"W2791716769","doi":"10.3934/amc.2019006","title":"Maximum weight spectrum codes","year":2018,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Cardinality (data modeling); Combinatorics; Conjecture; Finite field; Hamming distance; Discrete mathematics; Prime power; Bounded function; Integer (computer science); Hamming code; Prime (order theory); Upper and lower bounds; Spectrum (functional analysis); Linear code; Block code; Algorithm","score_opus":0.018168014798504373,"score_gpt":0.3000045371685736,"score_spread":0.28183652237006923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791716769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043334407,0.0032734205,0.8606154,0.001710731,0.0001478049,0.0001702561,0.0000047597077,0.00011663645,0.12962757],"genre_scores_gemma":[0.5974721,0.001027953,0.40141672,0.000030292746,0.000011040082,0.000012269021,0.0000010952587,0.00000409391,0.000024492143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992712,0.000066553774,0.00029396074,0.000113254006,0.000119775825,0.00013525157],"domain_scores_gemma":[0.9970444,0.0004732713,0.00014955008,0.0022451633,0.00006176314,0.000025869822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003913759,0.00007863746,0.00015119505,0.00014774177,0.00011801767,0.00002388429,0.002684836,0.000025892425,0.000023162547],"category_scores_gemma":[0.00006397811,0.0000743328,0.00004828766,0.0005829535,0.00042343198,0.00046093206,0.00053989317,0.00009881599,0.00002649237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011855325,0.0001592907,0.0002490652,0.000018987805,0.000005004993,1.5006428e-7,0.0011499845,0.000004910062,0.0001185161,0.99217635,0.000022066535,0.0060944622],"study_design_scores_gemma":[0.00009520363,0.00005058671,0.00010895456,0.00008058151,0.0000034983977,0.000003114797,0.000087349516,0.006991395,0.002059553,0.97554374,0.014891854,0.00008419505],"about_ca_topic_score_codex":0.0000023605178,"about_ca_topic_score_gemma":0.0000994207,"teacher_disagreement_score":0.59313864,"about_ca_system_score_codex":0.0000102236645,"about_ca_system_score_gemma":0.000017913373,"threshold_uncertainty_score":0.4989138},"labels":[],"label_agreement":null},{"id":"W2791996780","doi":"10.1007/s12095-018-0292-7","title":"Compositional inverses of permutation polynomials of the form xrh(xs) over finite fields","year":2018,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; Program for New Century Excellent Talents in University","keywords":"Permutation (music); Finite field; Mathematics; Combinatorics; Polynomial; Inverse; Discrete mathematics; Cyclic permutation; Field (mathematics); Permutation matrix; Pure mathematics; Symmetric group; Physics","score_opus":0.019065109459526768,"score_gpt":0.2589763174456607,"score_spread":0.2399112079861339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791996780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7702626,0.0008902376,0.21342143,0.0024745802,0.00024775128,0.0002994135,0.000064459346,0.000069945316,0.012269577],"genre_scores_gemma":[0.98823655,0.00012729666,0.011312975,0.00028046622,0.00001716945,0.000012503726,0.0000062759073,0.0000029580183,0.0000038379217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992961,0.00013367325,0.00023501832,0.00011643791,0.0001247442,0.00009399411],"domain_scores_gemma":[0.998127,0.00039161154,0.00017302096,0.0011305381,0.00014552384,0.00003230246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002069628,0.000078608435,0.00011519306,0.00015487104,0.00038807053,0.00003104827,0.0011517182,0.00005143589,0.000026180061],"category_scores_gemma":[0.000025872663,0.00006335338,0.00014890461,0.0007085735,0.0007569667,0.00021689452,0.00044273605,0.00009931812,9.62409e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013180327,0.00011001068,0.009207386,0.000013891728,0.00004688478,2.88907e-8,0.0027169888,0.0000032635676,0.002911336,0.97861606,0.00021167076,0.006149272],"study_design_scores_gemma":[0.00089874136,0.0004308589,0.19408792,0.00021523255,0.00009458161,0.000008665864,0.0006117236,0.005272035,0.027247796,0.7615936,0.00918753,0.00035134683],"about_ca_topic_score_codex":0.000032383443,"about_ca_topic_score_gemma":0.00004486197,"teacher_disagreement_score":0.21797392,"about_ca_system_score_codex":0.0000030166884,"about_ca_system_score_gemma":0.000030510708,"threshold_uncertainty_score":0.2984764},"labels":[],"label_agreement":null},{"id":"W2794440484","doi":"10.5539/jmr.v10n3p35","title":"Applications of Pell Polynomials in Rings","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ring (chemistry); Modulo; Generator (circuit theory); Combinatorics; Polynomial ring; Polynomial; Order (exchange); Type (biology); Discrete mathematics; Mathematical analysis; Power (physics)","score_opus":0.0726336278362588,"score_gpt":0.39747629711266697,"score_spread":0.32484266927640815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794440484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37502137,0.00020026596,0.6105776,0.00069898245,0.00008378438,0.0002176788,8.693814e-7,0.000010002549,0.013189476],"genre_scores_gemma":[0.92756236,0.0000298786,0.072190985,0.000009757334,0.000100512145,0.0000034347888,2.2905017e-8,0.000004237576,0.0000988159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986556,0.000120529716,0.00043613237,0.000076775585,0.0005344186,0.00017653532],"domain_scores_gemma":[0.99827635,0.0005897253,0.00020946158,0.00033485668,0.0005257601,0.00006385989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052330536,0.000044935994,0.0001662788,0.00069807266,0.000055487435,0.000051223913,0.0010976895,0.000033572145,0.000035886973],"category_scores_gemma":[0.0002138976,0.00003612717,0.00006917687,0.000917125,0.00017296746,0.00016471081,0.00019164411,0.00024300635,0.0000283851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030629435,0.0009781036,0.0009996338,0.00022058444,0.00004116389,0.000013032106,0.009291613,0.0000071197032,0.0238507,0.9291934,0.0019208228,0.033453234],"study_design_scores_gemma":[0.0005263491,0.000661135,0.00086485123,0.0003001987,0.000005400331,0.0000912933,0.000856013,0.0030834798,0.040196046,0.9457267,0.007575741,0.00011278637],"about_ca_topic_score_codex":0.0000039744837,"about_ca_topic_score_gemma":0.0000037306006,"teacher_disagreement_score":0.552541,"about_ca_system_score_codex":0.000023665503,"about_ca_system_score_gemma":0.00009815493,"threshold_uncertainty_score":0.20397985},"labels":[],"label_agreement":null},{"id":"W2796148655","doi":"10.22215/etd/2018-12651","title":"A Character Formula for the Sidelnikov-Lempel-Cohn-Eastman Sequences","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Manitoba","funders":"","keywords":"Mathematics; Character (mathematics); Multiplier (economics); Randomness; Modulo; Algebraic number; Prime (order theory); Discrete mathematics; Number theory; Sequence (biology); Combinatorics; Statistics; Mathematical analysis","score_opus":0.017876006387989408,"score_gpt":0.2760142367189429,"score_spread":0.25813823033095346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796148655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13388698,0.0014602523,0.6941824,0.004675431,0.016608696,0.0047966754,0.000083236715,0.0014266942,0.14287965],"genre_scores_gemma":[0.870699,0.00019135355,0.04885098,0.0041119065,0.002816778,0.0013668357,0.00045017985,0.00012273704,0.07139025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984294,0.000042578587,0.0003086616,0.00054413424,0.0002950801,0.00038011276],"domain_scores_gemma":[0.99824,0.00037058326,0.00022640759,0.0008395834,0.00025446783,0.00006897854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058942515,0.00030222567,0.00024464747,0.00016441224,0.00048839377,0.00044465758,0.0019448419,0.00019252587,0.00015920821],"category_scores_gemma":[0.000049437465,0.00018708406,0.00036346295,0.00034812588,0.00006337955,0.00031842303,0.00008061739,0.00018809266,0.000096483294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010309255,0.00004680516,0.000023978631,0.00011016195,0.00017432413,0.0000025399152,0.003618839,9.1847e-7,0.00097509136,0.86112744,0.008465427,0.12535137],"study_design_scores_gemma":[0.0007712045,0.00076442526,0.0030234405,0.000357863,0.00023341036,0.000026237945,0.0016020593,0.010964171,0.016241502,0.46301612,0.5013679,0.0016316188],"about_ca_topic_score_codex":0.000028673203,"about_ca_topic_score_gemma":0.00029996742,"teacher_disagreement_score":0.736812,"about_ca_system_score_codex":0.000017322274,"about_ca_system_score_gemma":0.00011559802,"threshold_uncertainty_score":0.7629067},"labels":[],"label_agreement":null},{"id":"W2799851485","doi":"10.1016/j.ejc.2018.03.006","title":"Constructing de Bruijn sequences with co-lexicographic order: The<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml23\" display=\"inline\" overflow=\"scroll\" altimg=\"si23.gif\"><mml:mi>k</mml:mi></mml:math>-ary Grandmama sequence","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Lexicographical order; Substring; Mathematics; String (physics); Combinatorics; Sequence (biology); Order (exchange); De Bruijn graph; Aperiodic graph; Discrete mathematics; Data structure; Computer science","score_opus":0.017720056711356687,"score_gpt":0.23768122403048136,"score_spread":0.21996116731912468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799851485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9687083,0.00043047074,0.024576366,0.00040070518,0.0011730208,0.000043448938,0.000011135775,0.000114716866,0.0045418795],"genre_scores_gemma":[0.9932058,0.00023895425,0.005440984,0.00061124377,0.00041233358,0.0000056762633,0.0000049873674,0.00006576368,0.000014261924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681294,0.00059059524,0.0007020762,0.00042441912,0.0008526561,0.00061733066],"domain_scores_gemma":[0.9970446,0.0005136065,0.0010533666,0.000756565,0.000299179,0.00033263804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002831026,0.00033072292,0.00025048666,0.00022354005,0.00094204413,0.0006487036,0.001902158,0.00011961423,0.000013901328],"category_scores_gemma":[0.00028014544,0.00029186756,0.00032639108,0.0010990979,0.0010410708,0.0008139868,0.0003223103,0.0008644321,0.00008680096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017185109,0.0000885182,0.0004962789,0.000052478845,0.00017560404,0.00085082446,0.0012111194,0.00009348263,0.00048190166,0.99299914,0.00024278158,0.0031360087],"study_design_scores_gemma":[0.009030211,0.015393582,0.002644576,0.0038189578,0.0011347013,0.029720757,0.00501437,0.76796365,0.022533763,0.11176326,0.027662048,0.0033200984],"about_ca_topic_score_codex":0.000016099582,"about_ca_topic_score_gemma":0.000010290585,"teacher_disagreement_score":0.8812359,"about_ca_system_score_codex":0.000020546946,"about_ca_system_score_gemma":0.0004729284,"threshold_uncertainty_score":0.9999533},"labels":[],"label_agreement":null},{"id":"W2803286074","doi":"10.1080/10236198.2018.1471471","title":"On the solution space of the Golomb recursion","year":2018,"lang":"en","type":"article","venue":"The Journal of Difference Equations and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Golomb coding; Mathematics; Recursion (computer science); Conjecture; Sequence (biology); Equivalence (formal languages); Equivalence relation; Combinatorics; Space (punctuation); Solution set; Pure mathematics; Set (abstract data type); Discrete mathematics; Algorithm; Computer science","score_opus":0.021594852961432407,"score_gpt":0.24417285455141852,"score_spread":0.2225780015899861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803286074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17330766,0.00008141397,0.8142566,0.011534512,0.00006967105,0.00014969669,0.0000020291543,0.000006275447,0.0005921628],"genre_scores_gemma":[0.99905366,0.000048434707,0.0005980464,0.0001421773,0.00006676768,0.000008852442,1.0518196e-7,0.0000018009952,0.0000801612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936295,0.00015939648,0.00017358294,0.00006084535,0.00016930392,0.0000739077],"domain_scores_gemma":[0.998332,0.00077805563,0.00027755724,0.0004269731,0.00016182306,0.000023561719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065280404,0.000053562522,0.00006302888,0.00004328876,0.0005983708,0.000034761317,0.00075693807,0.000019767127,0.000009628469],"category_scores_gemma":[0.0000842051,0.000022639719,0.00005214372,0.00043873477,0.00028402466,0.00006724272,0.00009344569,0.00013405835,0.0000040410523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058112487,0.00004197126,0.000047768783,0.0000012449044,0.00000770031,7.825745e-9,0.0006809837,0.000011261667,0.0051236534,0.9793166,0.00024788786,0.01451509],"study_design_scores_gemma":[0.00015123507,0.00029345107,0.012909413,0.00007735023,0.000044775803,0.00001312462,0.0002776357,0.0063042017,0.0066809105,0.97110826,0.002063735,0.000075919306],"about_ca_topic_score_codex":0.0000040669793,"about_ca_topic_score_gemma":0.0000052001305,"teacher_disagreement_score":0.825746,"about_ca_system_score_codex":0.000008235857,"about_ca_system_score_gemma":0.000033399312,"threshold_uncertainty_score":0.46022448},"labels":[],"label_agreement":null},{"id":"W2806148690","doi":"10.51611/iars.irj.v8i1.2018.84","title":"Cryptanalysis of Mono-Alphabetic Substitution Ciphers using Genetic Algorithms and Simulated Annealing","year":2018,"lang":"en","type":"article","venue":"IARS International Research Journal","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cryptanalysis; Ciphertext; Plaintext; Simulated annealing; Computer science; Cipher; Algorithm; Genetic algorithm; Substitution (logic); Theoretical computer science; Cryptography; Encryption; Machine learning; Computer security; Programming language","score_opus":0.08168138884846182,"score_gpt":0.3965612098387054,"score_spread":0.3148798209902436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806148690","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61315,0.00024457695,0.38568515,0.00018317162,0.00029425192,0.00004151559,0.0000016405937,0.000012307486,0.00038738546],"genre_scores_gemma":[0.95755965,0.00013127006,0.041998975,0.000024179568,0.00026065423,6.6152353e-7,5.572181e-7,0.000006054562,0.000018026589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783945,0.00028578026,0.00034172196,0.00024290838,0.0009877224,0.00030242957],"domain_scores_gemma":[0.99797827,0.00023733152,0.0001412827,0.0002063079,0.001278307,0.00015851173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021294737,0.00009205341,0.00013052857,0.0008498434,0.0004023901,0.00032995548,0.000856005,0.000053163378,0.00009454949],"category_scores_gemma":[0.00035905882,0.00008546262,0.000095208605,0.0008473005,0.0004346401,0.00044971736,0.00024131332,0.00033972834,0.0000058969463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063769176,0.0005672898,0.057300437,0.0000618427,0.0023060373,0.0005404207,0.0066521917,0.07334703,0.115846895,0.28363556,0.00045740677,0.45864722],"study_design_scores_gemma":[0.00048626645,0.00021370918,0.006889947,0.00012160279,0.00001862805,0.00022399292,0.00013697456,0.93553126,0.0044831554,0.051150143,0.00061069656,0.00013364336],"about_ca_topic_score_codex":0.000039639446,"about_ca_topic_score_gemma":0.0000034591978,"teacher_disagreement_score":0.8621842,"about_ca_system_score_codex":0.000080241996,"about_ca_system_score_gemma":0.00012965371,"threshold_uncertainty_score":0.34850642},"labels":[],"label_agreement":null},{"id":"W2809380199","doi":"10.17781/p002436","title":"Power Efficient Gurumukhi Unicode Reader Design and Implementation on FPGA","year":2018,"lang":"en","type":"article","venue":"International Journal of New Computer Architectures and their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Unicode; Computer science; Field-programmable gate array; Power (physics); Embedded system; Wireless; Computer architecture; Computer hardware; Telecommunications; Artificial intelligence","score_opus":0.015370822721551007,"score_gpt":0.28910042617121945,"score_spread":0.27372960344966846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809380199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04553801,0.00011487,0.9510218,0.0027732383,0.00022567192,0.00014836926,0.0000036343497,0.000024203595,0.00015022048],"genre_scores_gemma":[0.9151856,0.000015262913,0.08341604,0.0008961525,0.00046655338,0.0000057716725,0.0000010565977,0.0000062790527,0.0000072916923],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917495,0.000064650114,0.00024794298,0.00019639172,0.00019819371,0.00011786954],"domain_scores_gemma":[0.9991529,0.0002011675,0.00017545669,0.00018328005,0.00017411879,0.00011305645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026232895,0.00011918148,0.000108640226,0.00027071554,0.00012714879,0.00018088846,0.00060492306,0.000025732461,0.000014802035],"category_scores_gemma":[0.0000037016264,0.00008712022,0.000062776984,0.0001372497,0.000085963155,0.00006118352,0.00017215993,0.0001252305,0.000002861047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001023816,0.00011115877,0.00007515908,0.000002470041,0.00020557472,0.000003879142,0.0050667357,0.0027163883,0.0009259189,0.18767521,0.0011225767,0.80199254],"study_design_scores_gemma":[0.003597155,0.0031431937,0.019691046,0.00019590752,0.000045208017,0.0017909582,0.00027258086,0.07700542,0.015045045,0.7530959,0.12537746,0.00074011274],"about_ca_topic_score_codex":0.0000039334823,"about_ca_topic_score_gemma":0.00000165274,"teacher_disagreement_score":0.86964756,"about_ca_system_score_codex":0.000015554924,"about_ca_system_score_gemma":0.00004203012,"threshold_uncertainty_score":0.35526595},"labels":[],"label_agreement":null},{"id":"W2810042661","doi":"10.37236/8040","title":"$2$-Neighbour-Transitive Codes with Small Blocks of Imprimitivity","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Transitive relation; Combinatorics; Mathematics; Hamming graph; Corollary; Transitive closure; Partition (number theory); Alphabet; Affine transformation; Discrete mathematics; Hamming distance; Hamming code; Block code; Algorithm; Pure mathematics; Decoding methods","score_opus":0.015017993378834263,"score_gpt":0.21669026466686267,"score_spread":0.2016722712880284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810042661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17307399,0.0027461164,0.8205726,0.002107716,0.00047622548,0.00021823005,0.000005248524,0.00004502566,0.0007548292],"genre_scores_gemma":[0.9985619,0.00068819325,0.00050562544,0.00010539167,0.00009824081,0.000003936916,9.2751304e-7,0.000021335638,0.0000144434225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974104,0.0004896187,0.0005972463,0.0003103814,0.0006295542,0.000562781],"domain_scores_gemma":[0.99668485,0.0005453184,0.0012932332,0.00071640924,0.0006274885,0.00013272396],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001904138,0.00035195556,0.0007676881,0.00019680902,0.00013487316,0.000107380074,0.0028821293,0.00016952454,0.0000042661627],"category_scores_gemma":[0.000065576,0.00023148599,0.00044653984,0.00069050386,0.00020643733,0.00013770255,0.00056521175,0.0027390232,8.151417e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024894808,0.00021978992,0.00012652879,0.00007378012,0.0006115952,0.00003829651,0.00155717,0.00030650134,0.0006363233,0.9939612,0.000044158773,0.0021757036],"study_design_scores_gemma":[0.0007859913,0.0020316385,0.00036803744,0.00022700457,0.00026112865,0.00021321607,0.00008466894,0.0007178666,0.009417141,0.98525524,0.0003472655,0.00029078338],"about_ca_topic_score_codex":0.000011361602,"about_ca_topic_score_gemma":0.000009161955,"teacher_disagreement_score":0.8254879,"about_ca_system_score_codex":0.00016824444,"about_ca_system_score_gemma":0.0015580184,"threshold_uncertainty_score":0.9995617},"labels":[],"label_agreement":null},{"id":"W2810174119","doi":"10.4230/lipics.approx-random.2018.46","title":"Satisfiability and Derandomization for Small Polynomial Threshold Circuits","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Satisfiability; Mathematics; Polynomial; Computer science; Algorithm; Discrete mathematics; Combinatorics","score_opus":0.017630096420032347,"score_gpt":0.24257035753034417,"score_spread":0.22494026111031182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810174119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29698578,0.000030994695,0.698628,0.00023404525,0.00084693695,0.0013742455,0.00013296759,0.00019759577,0.0015694038],"genre_scores_gemma":[0.9673737,0.0000108645045,0.031013569,0.00097307,0.00029986858,0.00016966062,0.000088152614,0.00002313823,0.000047973837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980929,0.00004076844,0.0007429793,0.0003420656,0.00020992511,0.00057138124],"domain_scores_gemma":[0.9982163,0.00032092983,0.00027896566,0.0006788391,0.00032381798,0.000181164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011107419,0.00029871686,0.00037146802,0.00021661933,0.00060608995,0.0005320938,0.0007609683,0.00017733351,0.000011917179],"category_scores_gemma":[0.0001643732,0.00027320124,0.00021846316,0.00028950794,0.00024855233,0.0011720746,0.00028850854,0.0001596434,0.000015198508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002295843,0.00087742944,0.04477056,0.0018912163,0.0006328666,0.0000024751237,0.042638212,0.00008866378,0.0008917892,0.49876627,0.011998254,0.39514643],"study_design_scores_gemma":[0.05979907,0.004598329,0.014518382,0.00052264496,0.00031852257,0.00019332844,0.0012455299,0.5740916,0.0131580625,0.1520152,0.17583714,0.0037022138],"about_ca_topic_score_codex":0.000006187348,"about_ca_topic_score_gemma":0.000033496366,"teacher_disagreement_score":0.6703879,"about_ca_system_score_codex":0.00004485928,"about_ca_system_score_gemma":0.00005604315,"threshold_uncertainty_score":0.99997205},"labels":[],"label_agreement":null},{"id":"W2858801556","doi":"10.1109/tc.2018.2854757","title":"Hardware Optimizations and Analysis for the WG-16 Cipher with Tower Field Arithmetic","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Datapath; Computer science; Parallel computing; Arithmetic; Field-programmable gate array; Cipher; Clock rate; Computer hardware; Mathematics; Encryption; Chip","score_opus":0.01361540963635866,"score_gpt":0.2300953382651075,"score_spread":0.21647992862874885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2858801556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080705597,0.000019091798,0.9963891,0.0017796536,0.0004689142,0.0001975456,0.0000076245424,0.000120056175,0.00021096901],"genre_scores_gemma":[0.8908658,0.000011477033,0.10755291,0.0012998168,0.00004572084,0.000048942282,8.28047e-7,0.0000076256665,0.00016688157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925584,0.000035751833,0.00011364788,0.0003052669,0.000119193544,0.00017027566],"domain_scores_gemma":[0.998801,0.0005447087,0.0000368028,0.0004577862,0.00009736085,0.00006236131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012764109,0.00012264164,0.00012583642,0.0002146026,0.00055755425,0.00019210578,0.00038711334,0.000038753824,0.00005328277],"category_scores_gemma":[0.0000020477353,0.00008463482,0.00013780958,0.0009963942,0.00011934474,0.00016467902,0.000003964008,0.000096847005,0.000002835507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025149807,0.000453365,0.0003837568,0.000023117824,0.0036684717,0.0000057986813,0.0040361295,0.45269707,0.000038776576,0.018831454,0.0044474183,0.5151631],"study_design_scores_gemma":[0.0007467184,0.001110606,0.00043234855,0.00003623669,0.0006171572,0.0000152379935,0.00008462682,0.9879832,0.0018143011,0.001220955,0.005584297,0.00035426996],"about_ca_topic_score_codex":0.000014728901,"about_ca_topic_score_gemma":0.00006757835,"teacher_disagreement_score":0.89005876,"about_ca_system_score_codex":0.000012796989,"about_ca_system_score_gemma":0.00001865295,"threshold_uncertainty_score":0.42883128},"labels":[],"label_agreement":null},{"id":"W2883399088","doi":"10.1016/j.jcta.2019.105173","title":"Minimal binary 2-neighbour-transitive codes","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Australian Research Council","keywords":"Transitive relation; Mathematics; Combinatorics; Alphabet; Permutation (music); Mathematical proof; Discrete mathematics; Transitive closure; Binary number; Permutation group; Class (philosophy); Cyclic permutation; Symmetric group; Computer science; Arithmetic","score_opus":0.01077805819466981,"score_gpt":0.2373821752603489,"score_spread":0.2266041170656791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883399088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5618155,0.0062005967,0.2781393,0.003311764,0.1282464,0.0012732137,0.00011200434,0.00045821595,0.020442994],"genre_scores_gemma":[0.9934071,0.0002731556,0.004443195,0.00015923053,0.0014673643,0.000007371358,0.0000039821584,0.000039011236,0.00019959999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960877,0.001182788,0.0010079822,0.00048424024,0.0007804301,0.00045688337],"domain_scores_gemma":[0.9957982,0.00085431914,0.0013857331,0.0009997074,0.0007329136,0.00022914883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032228664,0.00052712014,0.0011249833,0.00053682324,0.00019370086,0.000492111,0.003015773,0.00046403223,0.000098929595],"category_scores_gemma":[0.00021649121,0.00046447432,0.0009639415,0.0004125288,0.00030853122,0.0010270427,0.0012807959,0.001654618,0.000019119121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022103933,0.00025613562,0.00007108009,0.00012486747,0.00045569593,0.0002406461,0.0022784157,0.0002651607,0.00074328994,0.9907416,0.00081129785,0.0018014158],"study_design_scores_gemma":[0.0012383374,0.0019553674,0.0002700052,0.00052871346,0.0001313125,0.00024108379,0.00035200545,0.00012335874,0.0022843238,0.98385304,0.00848046,0.00054196257],"about_ca_topic_score_codex":0.000002179602,"about_ca_topic_score_gemma":2.8938538e-7,"teacher_disagreement_score":0.43159157,"about_ca_system_score_codex":0.00010069068,"about_ca_system_score_gemma":0.0006737065,"threshold_uncertainty_score":0.9997807},"labels":[],"label_agreement":null},{"id":"W2883518022","doi":"","title":"Skew cyclic codes over &#x1d53d;p + u&#x1d53d;p","year":2018,"lang":"en","type":"article","venue":"International Journal of Information and Coding Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Skew; Mathematics; Combinatorics; Code (set theory); Cyclic code; Generator matrix; Prime (order theory); Ring (chemistry); Discrete mathematics; Ternary operation; Linear code; Block code; Algorithm; Computer science; Decoding methods; Telecommunications","score_opus":0.007443628613926179,"score_gpt":0.25292789128001436,"score_spread":0.2454842626660882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883518022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14164089,0.00012291606,0.8367282,0.0011904965,0.002365513,0.000057071375,0.0000056006,0.00007012896,0.017819146],"genre_scores_gemma":[0.9922428,0.00014465608,0.0052648946,0.0019550056,0.00033803008,0.0000011557611,0.0000017978431,0.000003536169,0.000048099424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987869,0.000089838664,0.0004917345,0.000075963304,0.0004227248,0.00013281051],"domain_scores_gemma":[0.99857396,0.00020377005,0.0004539336,0.00014640027,0.0005311009,0.000090849746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013174588,0.0001084768,0.0001310826,0.0004733539,0.00013049012,0.00040547014,0.00088468764,0.000048869424,0.000117789445],"category_scores_gemma":[0.00018314156,0.0000902574,0.0001048693,0.00018005571,0.00016046531,0.0025870586,0.00017617879,0.00015423936,0.000042620974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011867,0.000019359852,0.00031796066,0.0000046050277,0.00006686655,0.000004361393,0.0018233338,0.000004144383,0.00033886504,0.8892318,0.0008471098,0.107222944],"study_design_scores_gemma":[0.0021296728,0.0005269244,0.008053496,0.00032724423,0.000032750762,0.0009725772,0.0005748485,0.004824291,0.006363942,0.8580924,0.11767091,0.00043092438],"about_ca_topic_score_codex":0.0000018727284,"about_ca_topic_score_gemma":8.553986e-7,"teacher_disagreement_score":0.8506019,"about_ca_system_score_codex":0.000034592453,"about_ca_system_score_gemma":0.000054823482,"threshold_uncertainty_score":0.3909958},"labels":[],"label_agreement":null},{"id":"W2884285234","doi":"10.1109/itw.1998.706467","title":"Relationships between different error-correcting capabilities of a code","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"University of Lethbridge","keywords":"Hamming distance; Error detection and correction; Hamming code; Computer science; Algorithm; Levenshtein distance; Channel (broadcasting); Code (set theory); Type (biology); Mathematics; Topology (electrical circuits); Combinatorics; Block code; Decoding methods; Telecommunications","score_opus":0.08557244224298977,"score_gpt":0.2492534551778942,"score_spread":0.16368101293490445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884285234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75266856,0.000047920894,0.23368476,0.00029888604,0.00011624789,0.000056801953,0.0000016468871,0.00015797078,0.012967216],"genre_scores_gemma":[0.9950334,0.000001413781,0.0044181407,0.000016759592,0.000026850017,0.000004358009,3.8802813e-7,0.0000033061406,0.00049541256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999234,0.00013740157,0.00019360843,0.00017024194,0.0001283243,0.00013638499],"domain_scores_gemma":[0.99891084,0.0006015637,0.000059662874,0.00034660994,0.000032403197,0.000048939757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028283586,0.00007606313,0.00012458235,0.00010103376,0.00013109864,0.00003106911,0.00036026488,0.000037869722,0.0001223591],"category_scores_gemma":[0.00009754468,0.0000626078,0.00007895039,0.00026774826,0.00005411013,0.00016737486,0.000093875,0.0001374709,0.000016056236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022245345,0.000094502946,0.3446489,0.000030271312,0.000033068693,7.954153e-7,0.010777045,0.000036093406,0.00014188583,0.6089767,0.0005613448,0.034697168],"study_design_scores_gemma":[0.0009750136,0.0005437828,0.36352062,0.00019201353,0.00006729877,0.000024722965,0.0042422945,0.06099318,0.021135347,0.5452309,0.0020333822,0.0010413895],"about_ca_topic_score_codex":0.000010918954,"about_ca_topic_score_gemma":0.000018457566,"teacher_disagreement_score":0.24236482,"about_ca_system_score_codex":0.00000994473,"about_ca_system_score_gemma":0.0000030707474,"threshold_uncertainty_score":0.2553072},"labels":[],"label_agreement":null},{"id":"W2885945836","doi":"10.1016/j.disc.2018.07.010","title":"A framework for constructing de Bruijn sequences via simple successor rules","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Successor cardinal; Disjoint sets; Simple (philosophy); Mathematics; Correctness; De Bruijn graph; Discrete mathematics; Shift register; Combinatorics; Algorithm; Computer science","score_opus":0.028255695515363267,"score_gpt":0.3082963769190016,"score_spread":0.2800406814036383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885945836","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110793464,0.000025668576,0.88689166,0.0002672152,0.00015682324,0.00017680837,0.000011355819,0.00019104815,0.001485957],"genre_scores_gemma":[0.42895788,0.000001940703,0.5707549,0.0001218533,0.00012213108,0.000021560158,0.0000014998744,0.000009252467,0.000008966754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890673,0.000042228166,0.0002557452,0.00026043036,0.0001615011,0.00037335875],"domain_scores_gemma":[0.9984411,0.00072525104,0.00016765526,0.00048685324,0.00009197751,0.00008713463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056885777,0.00015220449,0.00019921259,0.000074554235,0.000305054,0.0002635803,0.0008453487,0.000081375496,0.00003574035],"category_scores_gemma":[0.0003092305,0.00012992506,0.00012547582,0.00026642554,0.00025585157,0.00024440946,0.00016230086,0.00009990376,0.000025185942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042614884,0.000018436329,0.00019666688,0.000080315054,0.00002392778,0.0000017522464,0.0032834413,0.0000015652276,0.0005743551,0.98985225,0.00006450278,0.005898538],"study_design_scores_gemma":[0.00009956866,0.00009698863,0.000017202789,0.000092731476,0.000016205267,0.00003604227,0.00051623554,0.025437703,0.006955871,0.9659761,0.00056774187,0.00018759971],"about_ca_topic_score_codex":0.0000056544413,"about_ca_topic_score_gemma":0.0000053106314,"teacher_disagreement_score":0.31816444,"about_ca_system_score_codex":0.000016040665,"about_ca_system_score_gemma":0.000041409487,"threshold_uncertainty_score":0.529819},"labels":[],"label_agreement":null},{"id":"W2890991810","doi":"10.1007/s12095-019-00384-4","title":"Unicyclic strong permutations","year":2019,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.01529905154711339,"score_gpt":0.24889155304962726,"score_spread":0.23359250150251387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890991810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22038077,0.0057080323,0.6360528,0.008032753,0.0003401436,0.0006552441,0.000020464706,0.00084961124,0.12796022],"genre_scores_gemma":[0.9692541,0.0004126181,0.029963307,0.00026256486,0.0000086983555,0.000039082814,0.000012629756,0.0000067707188,0.000040277333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914557,0.0001392868,0.00017097451,0.00024572134,0.00010618118,0.0001922806],"domain_scores_gemma":[0.9973059,0.00025329585,0.00006337276,0.0022271997,0.000058760474,0.000091432645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020256688,0.000116411,0.00012277384,0.00027086807,0.00045514066,0.00017620937,0.0016355246,0.000048809765,0.00004291243],"category_scores_gemma":[0.000009785009,0.000117641815,0.000118247626,0.0009753162,0.00020285521,0.00044934658,0.0005485757,0.00019801385,0.000055155866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014031672,0.000054102835,0.0068880743,0.0000047501508,0.0000242472,1.5127505e-7,0.0006285597,0.0000044682583,0.00020289549,0.97713923,0.0000585827,0.014993552],"study_design_scores_gemma":[0.0009569242,0.00024699193,0.06427123,0.00008093831,0.0000543535,0.00003187956,0.0015581824,0.010642365,0.00019669767,0.7796491,0.14155506,0.0007562743],"about_ca_topic_score_codex":0.000009763351,"about_ca_topic_score_gemma":0.000011419984,"teacher_disagreement_score":0.7488733,"about_ca_system_score_codex":0.000005140659,"about_ca_system_score_gemma":0.000023199083,"threshold_uncertainty_score":0.4797294},"labels":[],"label_agreement":null},{"id":"W2891373351","doi":"10.1007/s10623-019-00697-8","title":"Shift-inequivalent decimations of the Sidelnikov–Lempel–Cohn–Eastman sequences","year":2019,"lang":"en","type":"preprint","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Difference set; Multiplier (economics); Euler's totient function; Combinatorics; Autocorrelation; Prime (order theory); Discrete mathematics; Euler's formula; Mathematical analysis; Statistics","score_opus":0.032949615237760764,"score_gpt":0.256263933144129,"score_spread":0.22331431790636821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891373351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25465536,0.0032986158,0.73409224,0.0012420567,0.0014802468,0.0011845742,0.0001365722,0.00023273748,0.0036775812],"genre_scores_gemma":[0.9749823,0.0004528743,0.02407179,0.0002787199,0.00007439699,0.000085940905,0.00001082125,0.000026130203,0.000016978514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671596,0.0004653455,0.0007061024,0.0009590233,0.0006542474,0.00049929286],"domain_scores_gemma":[0.9965922,0.0004269355,0.00061501097,0.0020161618,0.00019076827,0.00015890595],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009096406,0.00054055435,0.0006556904,0.0005907516,0.00038000132,0.00044498965,0.0027259346,0.00030113762,0.000033013228],"category_scores_gemma":[0.00004242384,0.0004000806,0.00085470174,0.0012277911,0.00055125606,0.00021765352,0.0018819654,0.00063602714,0.00000713135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026631633,0.00016160637,0.014387312,0.00038949968,0.00032743983,0.000004711936,0.001855425,0.0013554851,0.0012533115,0.97255445,0.00052012724,0.0071640285],"study_design_scores_gemma":[0.00057713914,0.00031372014,0.037773643,0.0010403728,0.00027112194,0.00002452548,0.00026609038,0.006738906,0.0029191591,0.9455391,0.003356176,0.0011800505],"about_ca_topic_score_codex":0.0000887959,"about_ca_topic_score_gemma":0.000036197114,"teacher_disagreement_score":0.720327,"about_ca_system_score_codex":0.000020190977,"about_ca_system_score_gemma":0.00020921488,"threshold_uncertainty_score":0.9998451},"labels":[],"label_agreement":null},{"id":"W2893614166","doi":"10.3934/amc.2018044","title":"Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields","year":2018,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Finite field; Mathematics; Logarithm; Computation; Field (mathematics); Discrete mathematics; Polynomial; Pure mathematics; Algorithm; Mathematical analysis; Computer science; Public-key cryptography","score_opus":0.025838952826023737,"score_gpt":0.316651990292815,"score_spread":0.29081303746679127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893614166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032200582,0.0004728745,0.95845973,0.0005120028,0.000096901946,0.00015886672,0.0000030981948,0.00006691082,0.008029025],"genre_scores_gemma":[0.6632796,0.00016696814,0.3364844,0.000038371996,0.000011944784,0.000009147286,0.0000021779051,0.000005319042,0.0000020750058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987228,0.000111277644,0.00060874067,0.00019301043,0.00014252026,0.0002216445],"domain_scores_gemma":[0.9960174,0.0018412246,0.0002790414,0.001720113,0.00010550241,0.000036720572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007416293,0.00012666195,0.00025539086,0.00031728085,0.00013372116,0.000050127095,0.0025141127,0.00005897261,0.000008908163],"category_scores_gemma":[0.0004421766,0.00012665606,0.00006989317,0.00094288785,0.00043596353,0.0004354247,0.0009318578,0.00029110594,0.0000055439336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005669015,0.00024446417,0.008634868,0.00007651156,0.00000911546,0.000001536917,0.0032879552,0.00014068851,0.00010926448,0.96026814,0.0000022933782,0.027219515],"study_design_scores_gemma":[0.0002312653,0.000097045224,0.004336077,0.00064380444,0.000004872166,0.00000384602,0.00015257561,0.27515277,0.000117249576,0.7185871,0.000499104,0.0001742797],"about_ca_topic_score_codex":0.000013896068,"about_ca_topic_score_gemma":0.00073033036,"teacher_disagreement_score":0.631079,"about_ca_system_score_codex":0.00001219717,"about_ca_system_score_gemma":0.000019411525,"threshold_uncertainty_score":0.51648843},"labels":[],"label_agreement":null},{"id":"W2899859986","doi":"10.22215/etd/2018-13355","title":"Problems on Permutation and Irreducible Polynomials Over Finite Fields","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Permutation (music); Finite field; TRACE (psycholinguistics); Mathematics; Discrete orthogonal polynomials; Difference polynomials; Field (mathematics); Pure mathematics; Classical orthogonal polynomials; Algebra over a field; Orthogonal polynomials; Combinatorics; Physics; Linguistics","score_opus":0.014267063163323955,"score_gpt":0.26011461515041245,"score_spread":0.2458475519870885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899859986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67203724,0.00048597698,0.04620921,0.00067994505,0.0044067036,0.00087175926,0.000012645826,0.0006306049,0.2746659],"genre_scores_gemma":[0.97674733,0.000072592666,0.0033353183,0.0005744377,0.00024219771,0.00004626282,0.0001116145,0.00002099037,0.018849242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989123,0.000046266054,0.00019589067,0.00048545474,0.00018276654,0.00017735396],"domain_scores_gemma":[0.99921554,0.00014016005,0.000120029676,0.0004018989,0.00006113394,0.00006126347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023374037,0.00019532385,0.0001731707,0.0002536217,0.00014842168,0.00025859667,0.00035239515,0.00021443979,0.00020240704],"category_scores_gemma":[0.000036984362,0.00017216927,0.00007918868,0.00023962131,0.000024398798,0.0002367608,0.000038977363,0.00015737662,0.000057722224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025122068,0.00028507822,0.00023875406,0.00048659593,0.00018671075,0.000010610825,0.01959703,0.00009005749,0.0016575868,0.7146276,0.03904296,0.22352576],"study_design_scores_gemma":[0.0030379335,0.005111234,0.032973997,0.0022153466,0.0002375167,0.000026858539,0.0014107762,0.027557507,0.03816616,0.7685888,0.116109975,0.0045638885],"about_ca_topic_score_codex":0.000030058032,"about_ca_topic_score_gemma":0.00008410086,"teacher_disagreement_score":0.3047101,"about_ca_system_score_codex":0.0000099696945,"about_ca_system_score_gemma":0.000047097732,"threshold_uncertainty_score":0.7020859},"labels":[],"label_agreement":null},{"id":"W2902857717","doi":"10.1109/iscisc.2018.8546855","title":"Modular Construction a Lattices from Cyclotomic Fields and their Applications in Information Security","year":2018,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Modular arithmetic; Secrecy; Modular design; Lattice (music); Algebraic number; Discrete mathematics; Cryptography; Mathematics; Prime (order theory); Computer science; Combinatorics; Theoretical computer science; Algorithm; Physics","score_opus":0.004887033359057656,"score_gpt":0.20134492010896896,"score_spread":0.1964578867499113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902857717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5201547,0.000012113295,0.47728685,0.00013823787,0.000038111073,0.00006821892,0.0000018021966,0.000054383898,0.0022456155],"genre_scores_gemma":[0.99183893,0.000006180052,0.007955416,0.0001547957,0.000026032138,0.000013577114,0.0000029814967,7.7622036e-7,0.0000012896966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996844,0.000021871077,0.00009492784,0.00009846965,0.00003518385,0.00006512997],"domain_scores_gemma":[0.9996823,0.000054902812,0.000031714226,0.00018428115,0.000024272886,0.000022504537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000095978074,0.000048197297,0.000049815582,0.00008002984,0.000072352384,0.00008751883,0.00015911691,0.000038171594,0.000016661374],"category_scores_gemma":[0.000004946054,0.000038929145,0.0000141954915,0.00019627341,0.00006568654,0.00068416214,0.000067611,0.000048962513,0.0000097814345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057089,0.000017635799,0.0060525886,0.0000052926503,0.000008060729,5.696996e-8,0.005992728,0.000003781241,0.00027119927,0.9251949,0.000025885274,0.062422123],"study_design_scores_gemma":[0.00021170518,0.0000373957,0.019704796,0.000008579296,0.000002170112,0.0000023124387,0.00053819077,0.066318356,0.0028783306,0.90644264,0.0037395568,0.000115937095],"about_ca_topic_score_codex":0.00010861127,"about_ca_topic_score_gemma":0.00009237834,"teacher_disagreement_score":0.47168428,"about_ca_system_score_codex":0.0000045874335,"about_ca_system_score_gemma":0.000007294922,"threshold_uncertainty_score":0.15874845},"labels":[],"label_agreement":null},{"id":"W2902893142","doi":"10.1007/s12095-019-00386-2","title":"New constructions of involutions over finite fields","year":2019,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Finite field; Mathematics; Combinatorics; Permutation (music); Coding theory; Multiplicative function; Discrete mathematics; Field (mathematics); Inverse; Pure mathematics; Physics; Mathematical analysis; Geometry","score_opus":0.012569949773552767,"score_gpt":0.23385835745186695,"score_spread":0.22128840767831418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902893142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057720862,0.0024861547,0.9101858,0.0015278022,0.0002667452,0.00024395762,0.000018521716,0.0001831064,0.027367057],"genre_scores_gemma":[0.9064962,0.000482419,0.09279461,0.00015057981,0.000010205811,0.000011404216,0.000006222414,0.0000040493965,0.00004429117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992807,0.00008752784,0.00021552753,0.00018262924,0.00009537184,0.0001382337],"domain_scores_gemma":[0.997526,0.00039161972,0.000094893374,0.0018310312,0.00006491205,0.000091557005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013051459,0.00009854831,0.00013927872,0.0002924669,0.00025426064,0.00005716818,0.0011216145,0.000069054855,0.0001024463],"category_scores_gemma":[0.000017118575,0.00010144072,0.00014387444,0.0010646753,0.0002438886,0.00030457348,0.00044717223,0.000185717,0.000010533081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002514931,0.000041043633,0.014193775,0.000007038067,0.000035303183,5.2920655e-8,0.0005649948,0.0000105874315,0.00020995083,0.9706504,0.00035475646,0.013929599],"study_design_scores_gemma":[0.0007970422,0.00019284993,0.036466435,0.000093959294,0.000051149946,0.000013960749,0.00047824052,0.0035428198,0.00039478985,0.9075544,0.050032623,0.00038175684],"about_ca_topic_score_codex":0.000060965718,"about_ca_topic_score_gemma":0.00003730853,"teacher_disagreement_score":0.8487753,"about_ca_system_score_codex":0.000003240563,"about_ca_system_score_gemma":0.000054571323,"threshold_uncertainty_score":0.41366324},"labels":[],"label_agreement":null},{"id":"W2909715706","doi":"10.2478/ausi-2018-0010","title":"Sampling k-partite graphs with a given degree sequence","year":2018,"lang":"en","type":"article","venue":"Acta Universitatis Sapientiae Informatica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Bipartite graph; Combinatorics; Degree (music); Mathematics; Simple (philosophy); Simple graph; Graph; Sequence (biology); Complete bipartite graph; Discrete mathematics; Physics","score_opus":0.031590578671340415,"score_gpt":0.23983180174683097,"score_spread":0.20824122307549056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909715706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2214323,0.000018245568,0.73273784,0.0006931033,0.00025306703,0.00024664283,0.000014460244,0.00041873098,0.044185612],"genre_scores_gemma":[0.86837274,0.000006901805,0.13122633,0.0002978251,0.000015402084,0.0000025584898,0.0000059474396,0.0000064350247,0.000065886925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987724,0.000045404453,0.0002124392,0.00024253335,0.0003199769,0.0004072645],"domain_scores_gemma":[0.99867624,0.00014933365,0.00015758809,0.00064400636,0.0002099339,0.00016287816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022266162,0.00018124646,0.00015870592,0.00036177583,0.0004911207,0.00023930604,0.0011499551,0.00005120944,0.00014298901],"category_scores_gemma":[0.000026758442,0.00016156088,0.000079484664,0.001125324,0.00036263306,0.0028111935,0.00031589295,0.00013762513,0.000206671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012926498,0.000080435464,0.001598508,0.000070231305,0.00026175583,0.00004512933,0.029452575,0.000025795458,0.0010769734,0.8973248,0.0046689324,0.06526557],"study_design_scores_gemma":[0.010668652,0.010255246,0.03673896,0.0021812317,0.0007127472,0.0010961253,0.021094043,0.096451156,0.010126937,0.35723165,0.4467082,0.0067350464],"about_ca_topic_score_codex":0.000013908851,"about_ca_topic_score_gemma":0.00002575502,"teacher_disagreement_score":0.6469404,"about_ca_system_score_codex":0.00003444731,"about_ca_system_score_gemma":0.000070682094,"threshold_uncertainty_score":0.6588262},"labels":[],"label_agreement":null},{"id":"W2911106712","doi":"10.1016/j.disc.2018.12.024","title":"Modified Erdös–Ginzburg–Ziv constants for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e22\" altimg=\"si12.gif\"><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mo>∕</mml:mo><mml:mi>n</mml:mi><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:math> and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e33\" altimg=\"si13.gif\"><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mo>∕</mml:mo><mml:mi>n</mml:mi><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math>","year":2019,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Sanitarium Association; University of Minnesota Duluth","keywords":"Scroll; Mathematics; Combinatorics; Discrete mathematics; Computer graphics (images); Computer science; Theology; Philosophy","score_opus":0.021009833591813968,"score_gpt":0.24561769744811865,"score_spread":0.22460786385630468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911106712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66215795,0.0032055692,0.011219598,0.0019600077,0.010985509,0.00048427083,0.004418994,0.0017908445,0.30377725],"genre_scores_gemma":[0.9514789,0.0036566455,0.017727101,0.0038227944,0.0061381287,0.006047235,0.0059975013,0.004320518,0.0008111545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.96000075,0.0018063731,0.008926787,0.008557546,0.0101497695,0.010558752],"domain_scores_gemma":[0.96663225,0.0067289416,0.010288367,0.009852965,0.001109624,0.005387873],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.0091534415,0.005124635,0.0022203075,0.00290985,0.0078132395,0.01058932,0.011930383,0.010318012,0.17284702],"category_scores_gemma":[0.0041010818,0.009315808,0.008261767,0.005545547,0.007467298,0.007836464,0.010978781,0.0077358196,0.006739556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010430943,0.0015726866,0.000030617895,0.006300164,0.007585702,0.00510713,0.00667691,0.00576931,0.0043759593,0.8036022,0.14576043,0.0027878932],"study_design_scores_gemma":[0.012977322,0.0053292313,0.000078829806,0.0059558866,0.007667469,0.010966219,0.0065309526,0.30430457,0.6247399,0.0062312884,0.0070673805,0.008150929],"about_ca_topic_score_codex":0.0049033463,"about_ca_topic_score_gemma":0.002750499,"teacher_disagreement_score":0.797371,"about_ca_system_score_codex":0.00012936964,"about_ca_system_score_gemma":0.0066630826,"threshold_uncertainty_score":0.99896824},"labels":[],"label_agreement":null},{"id":"W2911380990","doi":"10.3934/amc.2019019","title":"Some new constructions of isodual and LCD codes over finite fields","year":2019,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Finite field; Liquid-crystal display; Dual (grammatical number); Generator (circuit theory); Root (linguistics); Simple (philosophy); Discrete mathematics; Pure mathematics; Computer science; Physics; Linguistics; Power (physics)","score_opus":0.015160570346571891,"score_gpt":0.2879144393704459,"score_spread":0.27275386902387405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911380990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36233342,0.021399066,0.58180386,0.0024668844,0.00040002048,0.0007245312,0.00004143732,0.00013209668,0.03069871],"genre_scores_gemma":[0.7351242,0.0021769707,0.26261812,0.0000270868,0.000004101269,0.000004090878,0.0000012433521,0.000002686862,0.000041520878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994375,0.00003818884,0.00027748343,0.00008672442,0.000086843946,0.00007326831],"domain_scores_gemma":[0.99758184,0.0009847848,0.0001656594,0.001207264,0.000037224538,0.000023235045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018483373,0.00006096507,0.00016887275,0.00011824185,0.000039627044,0.000013102159,0.00088625256,0.00003142214,0.000014195653],"category_scores_gemma":[0.00007021788,0.00006004187,0.000038077476,0.0002626294,0.00019946149,0.00047974245,0.00034998482,0.000098841134,0.0000022093107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013012751,0.00006814613,0.0011890193,0.00005223409,0.000007894615,3.2118816e-8,0.0012861659,0.00017321973,0.00017079992,0.99321,0.000010571839,0.0038306015],"study_design_scores_gemma":[0.00021874301,0.000045202432,0.00033217916,0.00013396198,0.000006656755,0.0000025276074,0.0002458926,0.011128932,0.00050380395,0.9856814,0.0016266513,0.000074026684],"about_ca_topic_score_codex":0.000006443326,"about_ca_topic_score_gemma":0.000028815006,"teacher_disagreement_score":0.37279075,"about_ca_system_score_codex":0.0000034235447,"about_ca_system_score_gemma":0.000026638207,"threshold_uncertainty_score":0.24484365},"labels":[],"label_agreement":null},{"id":"W2911871489","doi":"10.1016/j.jsc.2012.05.010","title":"Generating subfields","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Mathematics; Extension (predicate logic); Factorization; Lattice (music); Set (abstract data type); Unique factorization domain; Implementation; Lattice reduction; Algebra over a field; Degree (music); Discrete mathematics; Combinatorics; Algorithm; Pure mathematics; Computer science","score_opus":0.016794418969717118,"score_gpt":0.2626005843204643,"score_spread":0.24580616535074717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911871489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39465988,0.0002315422,0.6038312,0.00020213731,0.0006035636,0.00001551856,4.6354717e-8,0.000016329812,0.00043978213],"genre_scores_gemma":[0.94561166,0.000006486068,0.053645775,0.00021077767,0.00051432085,3.6363488e-7,1.7620222e-7,0.0000030087813,0.000007441579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927723,0.00007768927,0.0002610704,0.00005202376,0.00018884092,0.00014314594],"domain_scores_gemma":[0.99938506,0.00009762919,0.0002312752,0.00008341338,0.00011569901,0.00008689653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068651966,0.000059019752,0.00010742338,0.00015942041,0.000076935874,0.00007267253,0.00023799702,0.000030186824,0.000007327517],"category_scores_gemma":[0.000030594598,0.000050844013,0.00008808521,0.0002653104,0.0000113631595,0.0006880828,0.00004277714,0.000121378114,0.0000073310675],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001938623,0.0002593335,0.014189698,0.000023555252,0.000085803746,0.000009818832,0.0106195025,0.010756806,0.008499434,0.25815898,0.0024783132,0.6948994],"study_design_scores_gemma":[0.0039312285,0.0018397488,0.16622245,0.00038641138,0.00016707601,0.003812251,0.0014054195,0.53565013,0.01598231,0.25246873,0.016548134,0.001586087],"about_ca_topic_score_codex":9.711833e-7,"about_ca_topic_score_gemma":1.4062712e-7,"teacher_disagreement_score":0.69331324,"about_ca_system_score_codex":0.000014459265,"about_ca_system_score_gemma":0.000024747293,"threshold_uncertainty_score":0.20733587},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science","score_opus":0.01856317441616658,"score_gpt":0.22612052957622872,"score_spread":0.20755735516006213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915023553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18862236,0.00095557346,0.79136795,0.00027614657,0.00017787739,0.00015771076,0.0000042493407,0.00052480854,0.017913317],"genre_scores_gemma":[0.97658664,0.00031201428,0.02247962,0.00046669669,0.000055053828,0.000019455925,0.0000016584135,0.000011661593,0.00006718997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878967,0.00007898933,0.000184145,0.00042326056,0.00017675679,0.00034720337],"domain_scores_gemma":[0.9992222,0.00010820969,0.000035369514,0.00044404352,0.00003214618,0.0001580298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026008717,0.00020019138,0.00018400571,0.00024693352,0.00026789322,0.00029922085,0.0005258409,0.00006947076,0.000281616],"category_scores_gemma":[0.000005063924,0.00017662247,0.0001650293,0.0008031546,0.00012231848,0.00041497473,0.000067013316,0.0001498573,0.000033266908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027706947,0.00007416924,0.0034829215,0.000013806641,0.000060360024,0.000016408934,0.0013892815,0.000015928288,0.0013881897,0.6202825,0.00040247457,0.37284628],"study_design_scores_gemma":[0.001694777,0.0010639963,0.026349006,0.00019132343,0.00008304267,0.00016797366,0.00032660927,0.006484258,0.006831164,0.5462583,0.40836272,0.0021868753],"about_ca_topic_score_codex":0.00001332111,"about_ca_topic_score_gemma":0.0000017823979,"teacher_disagreement_score":0.7879643,"about_ca_system_score_codex":0.000004495915,"about_ca_system_score_gemma":0.000010774307,"threshold_uncertainty_score":0.72024554},"labels":[],"label_agreement":null},{"id":"W2921327408","doi":"10.1109/access.2019.2903304","title":"Exploring Various Levels of Parallelism in High-Performance CRC Algorithms","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Higher Education Discipline Innovation Project","keywords":"Computer science; Parallel computing; Task parallelism; Thread (computing); Data parallelism; Instruction-level parallelism; Slicing; Speedup; Parallelism (grammar); Implicit parallelism; Algorithm; Computation","score_opus":0.09974725890309234,"score_gpt":0.2800559948137624,"score_spread":0.1803087359106701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921327408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9448819,0.00003446402,0.05295182,0.000059368354,0.0011419721,0.00011135031,0.0000014576423,0.00006790792,0.0007497429],"genre_scores_gemma":[0.9966986,0.000041722797,0.0030553348,0.000090667134,0.00004716679,0.000022170587,2.5285433e-7,0.0000069425546,0.000037125155],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99899656,0.00004401439,0.00022992768,0.00028358,0.00020263097,0.00024329983],"domain_scores_gemma":[0.99921924,0.00008415412,0.00008560818,0.0005318463,0.000040769773,0.0000383913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003293944,0.00011004163,0.00018890598,0.00021759879,0.000035552835,0.00008921372,0.0014670579,0.000036835154,0.000026040456],"category_scores_gemma":[0.0000057279995,0.00010448707,0.00004298025,0.00067736674,0.000026953021,0.0019328013,0.0002076062,0.00013197362,0.00003620974],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096746146,0.0004381414,0.115488835,0.0003523376,0.000088149565,0.00005901699,0.006163681,0.026938954,0.010424028,0.17690958,0.00011604736,0.66292447],"study_design_scores_gemma":[0.0021572048,0.00035573976,0.7742359,0.00035619203,0.000010735125,0.00001573559,0.00004629815,0.048015025,0.12882136,0.04433436,0.00078571774,0.0008657237],"about_ca_topic_score_codex":0.000082164675,"about_ca_topic_score_gemma":0.000005679802,"teacher_disagreement_score":0.6620588,"about_ca_system_score_codex":0.000014913267,"about_ca_system_score_gemma":0.000026371128,"threshold_uncertainty_score":0.42608592},"labels":[],"label_agreement":null},{"id":"W2922170409","doi":"10.1007/s00493-018-3779-0","title":"The Two-Point Fano and Ideal Binary Clutters","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fano plane; Ideal (ethics); Combinatorics; Binary number; Mathematics; Clutter; Discrete mathematics; Physics; Pure mathematics; Arithmetic; Computer science; Telecommunications","score_opus":0.0053238846182333665,"score_gpt":0.21095649114792916,"score_spread":0.2056326065296958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922170409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93649036,0.0025635143,0.014972218,0.010126563,0.004201213,0.00048324405,0.0000010141945,0.0005163838,0.03064547],"genre_scores_gemma":[0.998872,0.000058571455,0.00037938863,0.0004517968,0.00001699096,0.000008346895,2.4179977e-7,0.0000059962467,0.00020666294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991357,0.00008983214,0.00011750464,0.0002628384,0.00015283882,0.00024132861],"domain_scores_gemma":[0.99897563,0.00027796792,0.000048044036,0.00059237523,0.000028321661,0.000077666606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038086652,0.00010267797,0.00010213108,0.00005509676,0.0002797426,0.00017690306,0.0007330093,0.000027320626,0.000007732731],"category_scores_gemma":[0.000015119977,0.00007302362,0.000058175898,0.0003493225,0.00007058764,0.0001984415,0.0004151304,0.00013367395,0.00009032083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083130935,0.000023894014,0.0018668837,0.000004692825,0.000010472288,0.0000050286394,0.00021248675,0.0000019137715,0.0003578685,0.98118615,0.0019001795,0.014422119],"study_design_scores_gemma":[0.0012152784,0.0005036875,0.014141983,0.000028605638,0.00000949548,0.000033463195,0.0001043355,0.0047575296,0.0005979453,0.88606983,0.09214587,0.0003919734],"about_ca_topic_score_codex":0.00000532016,"about_ca_topic_score_gemma":3.4464534e-7,"teacher_disagreement_score":0.09511632,"about_ca_system_score_codex":0.000018118513,"about_ca_system_score_gemma":0.000018570736,"threshold_uncertainty_score":0.2977817},"labels":[],"label_agreement":null},{"id":"W2943388400","doi":"10.1109/tit.2020.3016510","title":"New Infinite Families of Perfect Quaternion Sequences and Williamson Sequences","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Windsor; University of Waterloo","funders":"","keywords":"Quaternion; Conjecture; Perfect power; Sequence (biology); Connection (principal bundle); Power of two","score_opus":0.01412715130810025,"score_gpt":0.21804413429190164,"score_spread":0.2039169829838014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943388400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049555197,0.00003918124,0.94815826,0.00046525415,0.00022144214,0.00011280294,0.000010994819,0.00016109267,0.001275758],"genre_scores_gemma":[0.99490035,0.00014277089,0.0042789527,0.00063119916,0.000016516738,0.000008078384,0.0000014123439,0.0000031997506,0.000017502836],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991148,0.00012253919,0.00030056734,0.00013114342,0.00020622065,0.00012468985],"domain_scores_gemma":[0.999326,0.00020485261,0.00013213923,0.00018140217,0.000052518197,0.00010312587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003419304,0.00012844737,0.00013972967,0.00021685206,0.00015407377,0.00010957968,0.00031941585,0.00005690708,0.000051631523],"category_scores_gemma":[0.000011939278,0.000112181595,0.000079915124,0.0004730064,0.00010857227,0.0021472487,0.0000037892794,0.00014029103,0.000040587627],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019617325,0.000022353366,0.00006519836,0.00012495396,0.00006133254,7.8469793e-7,0.035900746,0.0082448665,0.0019394311,0.22749403,0.00007412297,0.725876],"study_design_scores_gemma":[0.0038468342,0.0052336166,0.0013727464,0.00064004736,0.00019273652,0.00007829247,0.015998248,0.10031321,0.51224107,0.34119275,0.01672646,0.0021640265],"about_ca_topic_score_codex":0.000028912225,"about_ca_topic_score_gemma":0.000002776019,"teacher_disagreement_score":0.94534516,"about_ca_system_score_codex":0.0000100864345,"about_ca_system_score_gemma":0.00005915403,"threshold_uncertainty_score":0.45746326},"labels":[],"label_agreement":null},{"id":"W2943969851","doi":"10.5539/jmr.v11n3p14","title":"On Liouvillian Solutions of Third Order Homogeneous Linear Differential Equations","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Homogeneous; Exponent; Invariant (physics); Combinatorics; Logarithm; Exponential function; Differential equation; Constant (computer programming); Mathematical physics; Pure mathematics; Mathematical analysis","score_opus":0.09084313278958654,"score_gpt":0.3563194632935208,"score_spread":0.26547633050393427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943969851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27121127,0.00008651823,0.72483116,0.0004562245,0.00027979005,0.00015692324,0.0000030427052,0.000013816081,0.0029612363],"genre_scores_gemma":[0.9707881,0.000030015068,0.028660823,0.000013412228,0.000072174975,0.0000021023707,3.1485817e-7,0.00000885252,0.00042421065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978551,0.00021368095,0.00045821717,0.000115472976,0.0010742361,0.00028328726],"domain_scores_gemma":[0.99676114,0.0015097966,0.00024075973,0.000511196,0.0008738713,0.0001032458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021718824,0.00008407587,0.00023266498,0.00066422793,0.00015063041,0.00007869802,0.0010608631,0.000060847142,0.00015878766],"category_scores_gemma":[0.0005981733,0.000063572676,0.00017080325,0.00085196766,0.00009023341,0.00015198588,0.0002320236,0.0004767964,0.00011019601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026066033,0.00093770726,0.000032387816,0.00010603076,0.00009077436,0.000011845435,0.0018280195,0.0009580677,0.0084337415,0.9849858,0.0009693666,0.0016201498],"study_design_scores_gemma":[0.0012820568,0.0027929537,0.00020594915,0.0007067871,0.000035393758,0.0001289338,0.0006913288,0.20580547,0.008015427,0.77918506,0.0008625826,0.00028805024],"about_ca_topic_score_codex":0.0000021717935,"about_ca_topic_score_gemma":0.0000021084122,"teacher_disagreement_score":0.6995768,"about_ca_system_score_codex":0.000030455414,"about_ca_system_score_gemma":0.00017145631,"threshold_uncertainty_score":0.25924185},"labels":[],"label_agreement":null},{"id":"W2945676371","doi":"10.1049/pbse001e_ch11","title":"Recent trends in the cryptanalysis of block ciphers","year":2018,"lang":"en","type":"book-chapter","venue":"Institution of Engineering and Technology eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Block cipher; Cryptographic primitive; Linear cryptanalysis; Computer science; Cryptanalysis; Cryptography; Boomerang attack; Differential cryptanalysis; Focus (optics); Block (permutation group theory); Theoretical computer science; Computer security; Mathematics; Cryptographic protocol; Combinatorics; Physics","score_opus":0.01177854641691063,"score_gpt":0.2070096056228307,"score_spread":0.19523105920592007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945676371","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029682191,0.0058286604,0.043847114,0.0010960419,0.00088081934,0.0003813619,0.000020114312,0.00075965567,0.9175041],"genre_scores_gemma":[0.99436706,0.00026162146,0.0027952187,0.000016434742,0.000028204937,0.000010036317,0.0000017995264,0.000010169201,0.002509476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929374,0.000006941195,0.0002654284,0.00020774381,0.000115745745,0.00011038614],"domain_scores_gemma":[0.9992882,0.000028708695,0.0001286122,0.0004734155,0.00006555835,0.000015490286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022519488,0.00014946777,0.00025181126,0.0012805295,0.000034298133,0.000008928527,0.0005163284,0.00027173915,0.000009181274],"category_scores_gemma":[0.000015231779,0.00012270584,0.000075342396,0.00023012566,0.00034477765,0.000026497317,0.00010430532,0.00024228472,7.9596776e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024741707,0.0000061174223,0.000006619669,0.000014218076,0.000052105348,0.0000052324704,0.00011553095,0.00008016661,0.00019146032,0.8903105,0.000018799039,0.10919677],"study_design_scores_gemma":[0.0009030931,0.00076726446,0.00009961748,0.0010210351,0.00026292918,0.00014707333,0.00008419931,0.0051834187,0.0069180666,0.2381554,0.7455657,0.00089219585],"about_ca_topic_score_codex":0.0000022804636,"about_ca_topic_score_gemma":0.000009139122,"teacher_disagreement_score":0.96468484,"about_ca_system_score_codex":0.000015520842,"about_ca_system_score_gemma":0.000021246798,"threshold_uncertainty_score":0.50037986},"labels":[],"label_agreement":null},{"id":"W2945969795","doi":"10.48550/arxiv.1905.07798","title":"Construction of irreducible polynomials through rational transformations","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Degree (music); Finite field; Combinatorics; Irreducible polynomial; Mathematics; Prime power; Prime (order theory); Field (mathematics); Divisor (algebraic geometry); Polynomial; Sequence (biology); Discrete mathematics; Physics; Pure mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.06413194052311819,"score_gpt":0.1908568574993896,"score_spread":0.12672491697627142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945969795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17232028,0.000037259364,0.81615293,0.00011228894,0.00078363327,0.00020587818,0.000037066202,0.000097078955,0.01025359],"genre_scores_gemma":[0.9921049,0.00009935432,0.007516146,0.00003502688,0.00003745746,6.81476e-7,0.000021676922,0.000005627116,0.00017916266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989636,0.0001087409,0.00021904442,0.00047506343,0.00007564423,0.00015790299],"domain_scores_gemma":[0.9987567,0.00009874761,0.00024112215,0.0007273957,0.00013106262,0.000044940058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019618809,0.00016427404,0.00023973359,0.00022971316,0.0001118074,0.000054201333,0.00087398326,0.00016896083,0.00006682263],"category_scores_gemma":[0.000009891633,0.00019544952,0.0002498686,0.00051793875,0.00014963384,0.00067580934,0.00030747565,0.0002434586,0.000035492954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001994896,0.000044341894,0.00042515414,0.000054961358,0.00006317363,0.0000023399584,0.00045335272,0.06549212,0.00012206353,0.93277436,0.00014636971,0.0004017881],"study_design_scores_gemma":[0.000681213,0.00008254984,0.0007420086,0.000132373,0.000096665695,0.000011042211,0.00023414814,0.093263276,0.0035411154,0.8992706,0.0014746625,0.00047038172],"about_ca_topic_score_codex":0.000034253677,"about_ca_topic_score_gemma":0.00000426146,"teacher_disagreement_score":0.8197846,"about_ca_system_score_codex":0.000047875947,"about_ca_system_score_gemma":0.00023640381,"threshold_uncertainty_score":0.7970201},"labels":[],"label_agreement":null},{"id":"W2947382456","doi":"10.1145/3338637.3338639","title":"Computing isomorphisms and embeddings of finite fields","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Embedding; Automorphism; Prime (order theory); Prime power; Field (mathematics); Mathematics; Combinatorics; Discrete mathematics; Physics; Pure mathematics; Computer science","score_opus":0.021110576094278227,"score_gpt":0.2708240089321153,"score_spread":0.24971343283783706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947382456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40069586,0.0004611385,0.5955555,0.0017953055,0.00021902409,0.0001914299,0.0000013840655,0.000113709546,0.00096665893],"genre_scores_gemma":[0.71649194,0.000071120696,0.283031,0.00037624183,0.000011441984,0.0000031345014,0.0000026851335,0.000005133965,0.0000073311353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988952,0.00017424361,0.0003476915,0.00027528653,0.0001217902,0.00018577464],"domain_scores_gemma":[0.9950108,0.0015299058,0.00013524976,0.0032167602,0.00006408869,0.00004319164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005150763,0.00012435766,0.00022510708,0.00025781165,0.000101382626,0.00008078154,0.0035490203,0.000070386435,0.0000112498365],"category_scores_gemma":[0.000045293404,0.00013237962,0.00006334617,0.00064230006,0.00013374459,0.0002941428,0.0038373847,0.00026850827,0.000017199078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007541617,0.0002148934,0.038381815,0.000049615337,0.000040078306,0.000002044232,0.0053019105,0.0007449949,0.00020299265,0.78277177,0.00020614706,0.1720762],"study_design_scores_gemma":[0.0008647101,0.00023438441,0.029612673,0.00026339432,0.00000890247,0.000023520812,0.00006401651,0.7539279,0.0002782043,0.2121878,0.002142759,0.000391782],"about_ca_topic_score_codex":0.00002503944,"about_ca_topic_score_gemma":0.000008009522,"teacher_disagreement_score":0.7531829,"about_ca_system_score_codex":0.000011196707,"about_ca_system_score_gemma":0.000023354287,"threshold_uncertainty_score":0.65950215},"labels":[],"label_agreement":null},{"id":"W2949157299","doi":"10.48550/arxiv.1410.2903","title":"Quadratic Zero-Difference Balanced Functions, APN Functions and Strongly Regular Graphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zero (linguistics); Mathematics; Combinatorics; Zero set; Integer (computer science); Quadratic equation; Function (biology); Discrete mathematics; Square (algebra); Planar; Geometry","score_opus":0.03459704331227223,"score_gpt":0.1670907178183848,"score_spread":0.13249367450611257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949157299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34934634,0.000098030665,0.64773875,0.00006573104,0.0006432644,0.00018256724,0.00001289085,0.00032707938,0.0015853236],"genre_scores_gemma":[0.9966453,0.00007900727,0.00091487094,0.00006298363,0.000050712522,0.0000037036812,0.000022106204,0.00001638124,0.0022049586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976734,0.00028778092,0.00022414108,0.0013024202,0.000116776406,0.00039549478],"domain_scores_gemma":[0.9976005,0.00016893641,0.00023836271,0.0016191308,0.00013627674,0.00023677053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032955472,0.00039742657,0.0003931513,0.00046494007,0.00046528038,0.00023612469,0.0012340323,0.0002755327,0.000027410646],"category_scores_gemma":[0.000031163483,0.00044551207,0.00026735725,0.00078457146,0.0002714924,0.0002924914,0.0011856672,0.00063149416,0.00005503932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058196398,0.00011873227,0.00806609,0.000112017144,0.00018899381,0.00004055836,0.0001643214,0.021274643,0.0001622017,0.965323,0.0005471009,0.0039441613],"study_design_scores_gemma":[0.0009666436,0.0002959811,0.018485459,0.0002216134,0.0002846148,0.000016716773,0.00020642437,0.22990742,0.000054497537,0.7470926,0.0013338506,0.0011341623],"about_ca_topic_score_codex":0.000036409685,"about_ca_topic_score_gemma":0.000025297139,"teacher_disagreement_score":0.64729893,"about_ca_system_score_codex":0.000058350306,"about_ca_system_score_gemma":0.000096756135,"threshold_uncertainty_score":0.99979967},"labels":[],"label_agreement":null},{"id":"W2949277723","doi":"","title":"On Isogeny Graphs of Supersingular Elliptic Curves over Finite Fields.","year":2018,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Supersingular elliptic curve; Finite field; Mathematics; Elliptic curve; Pure mathematics; Discrete mathematics","score_opus":0.015041918843179607,"score_gpt":0.2532680040649097,"score_spread":0.23822608522173008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949277723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21724625,0.0006944473,0.7737211,0.0006463654,0.0015799478,0.0004189814,0.000040284784,0.00018818729,0.0054644686],"genre_scores_gemma":[0.8028279,0.0010053305,0.1937261,0.0020611319,0.00017941325,0.000092411385,0.000052961776,0.00004916735,0.000005595975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650985,0.0006157945,0.0006467407,0.0012390176,0.00038820773,0.0006003904],"domain_scores_gemma":[0.99552953,0.0014284488,0.00041514818,0.0023156006,0.00013993778,0.00017131785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006175069,0.0005324048,0.0008139601,0.0006891591,0.00016382478,0.000057798286,0.0025992529,0.00041162453,0.00028451878],"category_scores_gemma":[0.00029810332,0.0005245445,0.000726849,0.0003448043,0.0009106702,0.000096317606,0.0026788271,0.0011690281,0.00012013063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009937519,0.00020334897,0.0016683255,0.00031741697,0.00026326813,0.000044356366,0.0021403073,0.00036070918,0.00022097491,0.99119574,0.0019047235,0.0015814473],"study_design_scores_gemma":[0.00030128096,0.0004237042,0.0032275908,0.0008587022,0.00006548587,0.000016467891,0.000018086124,0.002706866,0.0017734437,0.9895092,0.0006047019,0.00049446494],"about_ca_topic_score_codex":0.00003004943,"about_ca_topic_score_gemma":0.000020551724,"teacher_disagreement_score":0.58558166,"about_ca_system_score_codex":0.000023667399,"about_ca_system_score_gemma":0.00015781887,"threshold_uncertainty_score":0.99972063},"labels":[],"label_agreement":null},{"id":"W2949436340","doi":"10.48550/arxiv.1101.3682","title":"Diversification improves interpolation","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interpolation (computer graphics); Polynomial; Mathematical optimization; Subroutine; Mathematics; Algorithm; Computer science; Applied mathematics; Artificial intelligence","score_opus":0.07856686972037918,"score_gpt":0.17446414768115845,"score_spread":0.09589727796077926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949436340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15874113,0.00003169101,0.8305431,0.000034548666,0.0007122968,0.00016413482,0.000004218868,0.00033891492,0.009429959],"genre_scores_gemma":[0.99746025,0.000053077667,0.001939711,0.000048243735,0.000044565717,6.6770605e-7,0.0000115658295,0.00000821488,0.0004337081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871224,0.00011475138,0.00012918033,0.00079270726,0.00005114931,0.00019997626],"domain_scores_gemma":[0.99844646,0.000048284794,0.00022014178,0.0010869567,0.00010429101,0.000093861134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021471144,0.00020308446,0.00016309992,0.00030561106,0.00014791907,0.00009842372,0.0016925344,0.00019981053,0.000039912138],"category_scores_gemma":[0.000015020104,0.0002407381,0.00020734055,0.0004231415,0.00008760185,0.0004816697,0.0015955421,0.00033791768,0.00010240041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003170816,0.00006301408,0.001158767,0.000028748369,0.000058132115,0.000020106554,0.0006596759,0.0005956698,0.00028902298,0.9937478,0.00014964493,0.0031977275],"study_design_scores_gemma":[0.00026675392,0.000082367,0.0052289786,0.00006916128,0.00007378154,0.0000019238162,0.00010459157,0.2091912,0.00042327802,0.78356117,0.00049273943,0.00050402514],"about_ca_topic_score_codex":0.00007098308,"about_ca_topic_score_gemma":0.000009137148,"teacher_disagreement_score":0.8387191,"about_ca_system_score_codex":0.000060691098,"about_ca_system_score_gemma":0.000057001376,"threshold_uncertainty_score":0.98170143},"labels":[],"label_agreement":null},{"id":"W2949439822","doi":"","title":"Cryptographic hash functions from expander graphs.","year":2006,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hash function; Collision resistance; Expander graph; Ramanujan's sum; Rolling hash; Double hashing; Cryptographic hash function; Discrete mathematics; SWIFFT; Mathematics; SHA-2; Computer science; Graph; Combinatorics","score_opus":0.015068098000872231,"score_gpt":0.23397112799222256,"score_spread":0.21890302999135033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949439822","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15098715,0.00059416046,0.8308852,0.0010177615,0.0033613064,0.00056550885,0.00020978996,0.0011192769,0.011259895],"genre_scores_gemma":[0.41033918,0.00017374904,0.5868588,0.0008231766,0.0005565641,0.0006129207,0.0005240298,0.00009835151,0.000013212782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99418473,0.00074438896,0.00096930977,0.0024737194,0.00052902516,0.0010987959],"domain_scores_gemma":[0.9945466,0.000985164,0.00059061404,0.0033537555,0.00017614258,0.00034772087],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005116249,0.0009794469,0.0010791596,0.0014118091,0.00059288996,0.0004188957,0.0036202425,0.0007702746,0.00026524204],"category_scores_gemma":[0.00007395791,0.0010156994,0.0012754737,0.0008127254,0.001009141,0.00026046712,0.0049985517,0.0024683971,0.0003768132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059806738,0.00032830014,0.016312554,0.000036492078,0.0004962057,0.00007765178,0.001017602,0.0007641549,0.0005259451,0.9649897,0.0051251496,0.010266438],"study_design_scores_gemma":[0.0005720832,0.00009094008,0.0652702,0.00011569951,0.00012036895,0.000029565823,0.000051955438,0.0010664376,0.00018419171,0.92659837,0.0049489555,0.00095125334],"about_ca_topic_score_codex":0.0005573297,"about_ca_topic_score_gemma":0.00056447624,"teacher_disagreement_score":0.25935203,"about_ca_system_score_codex":0.000053011154,"about_ca_system_score_gemma":0.00026189917,"threshold_uncertainty_score":0.9998329},"labels":[],"label_agreement":null},{"id":"W2949606720","doi":"10.48550/arxiv.1205.5282","title":"Spectral Norm of Symmetric Functions","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Logarithm; Boolean function; Mathematics; Combinatorics; Norm (philosophy); Communication complexity; Discrete mathematics; Fourier transform; Parity (physics); Function (biology); Upper and lower bounds; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.062424345662946086,"score_gpt":0.17253730175960888,"score_spread":0.1101129560966628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949606720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37091726,0.00014986961,0.6036925,0.000037667123,0.0012060946,0.00014246466,0.000014949958,0.00021786516,0.023621343],"genre_scores_gemma":[0.9981638,0.000054717402,0.0010013992,0.000017621795,0.00009103679,3.9382388e-7,0.0000054547104,0.000008561701,0.00065697916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988117,0.00009648471,0.00015638623,0.00055205374,0.00007692053,0.00030645207],"domain_scores_gemma":[0.9983315,0.0001139973,0.0002064405,0.0011045701,0.000099602934,0.00014387451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021974104,0.0002060137,0.00025124784,0.00068042666,0.00011064979,0.000040132905,0.001444553,0.00017800301,0.00007605764],"category_scores_gemma":[0.000018164406,0.0002371121,0.00034712846,0.0017054797,0.000110310735,0.00030031012,0.001240066,0.0004125373,0.000088901805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016313888,0.000141768,0.0059578004,0.00003911281,0.00009021528,0.000026751537,0.0001247609,0.0050208624,0.000037529633,0.98706627,0.00014342161,0.0013351801],"study_design_scores_gemma":[0.001327695,0.00034502245,0.03487284,0.00025746087,0.00063404936,0.00003370657,0.00023872852,0.09409553,0.0015680817,0.860729,0.0039174627,0.001980477],"about_ca_topic_score_codex":0.000053886317,"about_ca_topic_score_gemma":0.000010617686,"teacher_disagreement_score":0.62724656,"about_ca_system_score_codex":0.000068856076,"about_ca_system_score_gemma":0.00008378333,"threshold_uncertainty_score":0.9669151},"labels":[],"label_agreement":null},{"id":"W2949970207","doi":"","title":"Some New Results on Binary Polynomial Multiplication.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplication (music); Finite field; Binary number; Mathematics; Multiplication algorithm; Polynomial; Logarithm; Field (mathematics); Binary operation; Arithmetic; Time complexity; Algorithm; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.03608209612606198,"score_gpt":0.2823102171917265,"score_spread":0.24622812106566452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949970207","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03293107,0.00041563887,0.93296164,0.01575066,0.0043770196,0.0010070836,0.00019359587,0.0010704831,0.011292834],"genre_scores_gemma":[0.15366942,0.0002368204,0.83958244,0.0028027652,0.0029728778,0.0002784709,0.00030048814,0.00009440468,0.00006232487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956359,0.0006355676,0.0007449029,0.001892093,0.00039035323,0.0007011547],"domain_scores_gemma":[0.9948861,0.0008130796,0.0005382675,0.0031254762,0.00011813279,0.0005189189],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008382808,0.0006132526,0.00068429764,0.000712297,0.00021767076,0.00016991624,0.0035349042,0.00048851175,0.000014266069],"category_scores_gemma":[0.00038299634,0.0006133022,0.0004308988,0.00027261305,0.00048317687,0.00019814023,0.0050926544,0.0016847253,0.00079357746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058331474,0.0002033893,0.00010417473,0.000018963809,0.00012024629,0.000064237975,0.0024872948,0.002060907,0.00038826378,0.9329702,0.047590997,0.013408015],"study_design_scores_gemma":[0.0012443599,0.00032639125,0.0020725552,0.00008550969,0.000025270154,0.000030609233,0.000021888967,0.0037156336,0.0005055906,0.96590203,0.025445912,0.0006242235],"about_ca_topic_score_codex":0.0000713807,"about_ca_topic_score_gemma":0.000016702445,"teacher_disagreement_score":0.12073835,"about_ca_system_score_codex":0.000115635616,"about_ca_system_score_gemma":0.00074144115,"threshold_uncertainty_score":0.99998444},"labels":[],"label_agreement":null},{"id":"W2949987681","doi":"","title":"Generalized mix functions and orthogonal equitable rectangles.","year":2007,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Generalization; Block cipher; Simple (philosophy); Mathematics; Computer science; Context (archaeology); Cryptography; Symmetric-key algorithm; Block (permutation group theory); Construct (python library); Discrete mathematics; Combinatorics; Encryption; Algorithm; Public-key cryptography","score_opus":0.0233944121876038,"score_gpt":0.2677684308100168,"score_spread":0.24437401862241298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949987681","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14542043,0.0009104319,0.8379332,0.0008092592,0.0017338918,0.0003731225,0.00004764609,0.00041981132,0.012352228],"genre_scores_gemma":[0.13395734,0.00040026382,0.86396945,0.0008153598,0.00044431677,0.00020622883,0.00010799842,0.00005444994,0.0000445934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962441,0.0005029853,0.0005763091,0.0014410507,0.000291678,0.0009439333],"domain_scores_gemma":[0.99717456,0.0006738218,0.00030613257,0.0014267417,0.00011479975,0.0003039494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011648785,0.00052489166,0.000668,0.00069582515,0.00044829023,0.00020212568,0.001415628,0.00043464673,0.00008376777],"category_scores_gemma":[0.000094896975,0.0005342039,0.00036563448,0.00035445625,0.00060751685,0.00015217689,0.0057638353,0.0014015685,0.00008413891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009347681,0.00009569169,0.003090729,0.00004861399,0.0001996771,0.00009394412,0.00091374514,0.00017614516,0.0006764529,0.9701011,0.0010827989,0.023427619],"study_design_scores_gemma":[0.00048592765,0.000105247585,0.0053968676,0.00007145016,0.00005841765,0.00019144903,0.000058089896,0.0021591536,0.0002443094,0.9826887,0.007965993,0.00057435007],"about_ca_topic_score_codex":0.00004124572,"about_ca_topic_score_gemma":0.00016043334,"teacher_disagreement_score":0.026036277,"about_ca_system_score_codex":0.0000569784,"about_ca_system_score_gemma":0.00024271436,"threshold_uncertainty_score":0.999711},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06883026968149751,"score_gpt":0.16990992274561864,"score_spread":0.10107965306412113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950091396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31076208,0.000038819,0.6730104,0.000032580203,0.0006830385,0.00014638697,0.000026546202,0.00018093076,0.01511919],"genre_scores_gemma":[0.99491143,0.00005344111,0.004608714,0.000067896355,0.000019818624,4.5507386e-7,0.0000052790447,0.000008135575,0.00032481467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986554,0.00020584709,0.00018486648,0.000667662,0.00006957672,0.00021667492],"domain_scores_gemma":[0.9981773,0.00016714902,0.0002419072,0.001139398,0.00016233794,0.000111926005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021069174,0.00021436521,0.00027872532,0.0003483535,0.00012523115,0.000046783356,0.0012616229,0.00017187564,0.000093158356],"category_scores_gemma":[0.000039804512,0.0002589008,0.0003012189,0.00081542955,0.0002784957,0.00018986622,0.00069069775,0.00032461536,0.000018078412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014730426,0.000085585045,0.0016078503,0.000042893393,0.00008547351,0.0000595618,0.000103142695,0.012699818,0.00007759969,0.9842337,0.0002088655,0.00078077795],"study_design_scores_gemma":[0.0011889592,0.00020329459,0.0017859819,0.00029516086,0.00025631927,0.00003223744,0.00036141803,0.06442626,0.0021054603,0.92437494,0.0038180773,0.00115188],"about_ca_topic_score_codex":0.00003467332,"about_ca_topic_score_gemma":0.00001226975,"teacher_disagreement_score":0.6841494,"about_ca_system_score_codex":0.00004147576,"about_ca_system_score_gemma":0.00021151372,"threshold_uncertainty_score":0.99998635},"labels":[],"label_agreement":null},{"id":"W2950506350","doi":"10.48550/arxiv.1808.02468","title":"Theory of supports for linear codes endowed with the sum-rank metric","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Rank (graph theory); Combinatorics; Discrete mathematics; Block code; Linear code; Hamming code; Coding theory; Metric (unit); Hamming distance; Algorithm; Decoding methods","score_opus":0.050092583081987746,"score_gpt":0.1899559556125362,"score_spread":0.13986337253054845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950506350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18324375,0.00006947283,0.81420416,0.00006474261,0.000255982,0.00042242307,0.000032523458,0.00012039198,0.0015865485],"genre_scores_gemma":[0.9960782,0.000046248755,0.0031634,0.000076228556,0.00007445102,0.0000031923178,0.000009594229,0.000016019347,0.0005326538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984047,0.00026929108,0.00016716344,0.0007460188,0.0001057401,0.00030712358],"domain_scores_gemma":[0.99701476,0.0008380295,0.00033801334,0.0014198478,0.00030183303,0.000087542365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001074322,0.0002694213,0.00034480885,0.000412438,0.00021444715,0.00005502735,0.0022276246,0.00016005282,0.000037629787],"category_scores_gemma":[0.000054868782,0.000201646,0.0003229751,0.0011375932,0.0004569449,0.0001704519,0.00094833807,0.00028091535,0.0000080603895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003809862,0.00011642801,0.0018934071,0.00012651853,0.0003402081,0.000042164775,0.00051616057,0.005881031,0.000034114226,0.98921365,0.0003982822,0.001057062],"study_design_scores_gemma":[0.002000309,0.00089493004,0.0027347582,0.00026291108,0.00073365064,0.000016669306,0.00047975793,0.070036866,0.0044390615,0.91278636,0.0044680866,0.0011466056],"about_ca_topic_score_codex":0.000017321949,"about_ca_topic_score_gemma":0.000013139229,"teacher_disagreement_score":0.81283444,"about_ca_system_score_codex":0.00003101538,"about_ca_system_score_gemma":0.00015999466,"threshold_uncertainty_score":0.8222885},"labels":[],"label_agreement":null},{"id":"W2950683093","doi":"","title":"On the Complexity of the Herding Attack and Some Related Attacks on Hash Functions.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Herding; Computer science; Theoretical computer science; Computational complexity theory; Iterated function; Mathematics; Algorithm; Computer security","score_opus":0.04691549099858613,"score_gpt":0.26865511557032656,"score_spread":0.22173962457174043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950683093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8027415,0.000058560327,0.17148872,0.013486257,0.0026784732,0.0007563263,0.000045637902,0.00017873135,0.00856574],"genre_scores_gemma":[0.98511285,0.000028016817,0.013766042,0.0008963028,0.000083223174,0.00007286981,0.000007579516,0.00002325714,0.000009867856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681133,0.0010183568,0.0005001861,0.0009474954,0.00030991557,0.0004127193],"domain_scores_gemma":[0.99502784,0.001913656,0.0005126518,0.0023757815,0.000072145536,0.000097914046],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00092477474,0.0004179702,0.00051310495,0.00023414598,0.0006341224,0.00010395847,0.0023390462,0.00037066612,0.00007993894],"category_scores_gemma":[0.00029051324,0.00026366214,0.0004161028,0.00025075205,0.0027488125,0.0000725721,0.0041018636,0.0031693191,0.000068572066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006542916,0.000109184235,0.0010448437,0.000029227767,0.0001502967,0.0000049961395,0.0014164964,0.00054117676,0.0004753144,0.9932536,0.00065935816,0.002250109],"study_design_scores_gemma":[0.00025701209,0.00012309659,0.023336107,0.0001824316,0.000033744556,0.000029424551,0.00005133828,0.0036575284,0.0006318799,0.9707304,0.0007056626,0.00026133753],"about_ca_topic_score_codex":0.000017939601,"about_ca_topic_score_gemma":0.000045283155,"teacher_disagreement_score":0.18237129,"about_ca_system_score_codex":0.000027333848,"about_ca_system_score_gemma":0.000102062666,"threshold_uncertainty_score":0.9999816},"labels":[],"label_agreement":null},{"id":"W2950758769","doi":"","title":"Resilience to Distinguishing Attacks on WG-7 Cipher and Their Generalizations.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stream cipher; Stream cipher attack; Computer science; Cipher; Correlation attack; Transposition cipher; Resilience (materials science); Cryptography; Computer security; Block cipher mode of operation; Arithmetic; Theoretical computer science; Running key cipher; Mathematics; Encryption","score_opus":0.022609844201641523,"score_gpt":0.2711592093576486,"score_spread":0.24854936515600706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950758769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1467275,0.0001830636,0.8421589,0.0015306385,0.0011606385,0.0004126635,0.00002811178,0.00027218502,0.0075262995],"genre_scores_gemma":[0.6820853,0.000049734004,0.3159302,0.001381891,0.00034295718,0.00015039193,0.000019810332,0.000033321,0.0000064449946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682856,0.0005672383,0.00042857803,0.0012772958,0.00020484113,0.0006934906],"domain_scores_gemma":[0.9969614,0.0007611294,0.00024164128,0.0015905981,0.000090224785,0.00035497342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068551826,0.000503304,0.0005171011,0.0003881532,0.00038383316,0.00024926863,0.0018713542,0.00024493563,0.000035957186],"category_scores_gemma":[0.00038163498,0.0004487255,0.00018651628,0.00029673253,0.00033237177,0.00013005534,0.0048812903,0.0009355928,0.000075696546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031704632,0.00007611016,0.0064675948,0.000036428897,0.00005692978,0.000012416132,0.0074563725,0.001651618,0.00040020762,0.96468204,0.0005551194,0.018573444],"study_design_scores_gemma":[0.00016594821,0.00009566424,0.01988716,0.00020018437,0.000018096653,0.000036843834,0.00009222909,0.0035606655,0.0007525027,0.9684643,0.0060806354,0.0006457697],"about_ca_topic_score_codex":0.00002891307,"about_ca_topic_score_gemma":0.000049589868,"teacher_disagreement_score":0.5353578,"about_ca_system_score_codex":0.000042994143,"about_ca_system_score_gemma":0.000083347026,"threshold_uncertainty_score":0.99979645},"labels":[],"label_agreement":null},{"id":"W2950808142","doi":"","title":"A General Construction for 1-round δ-RMT and (0, δ)-SMT.","year":2012,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Communication source; Message authentication code; Reliability (semiconductor); Disjoint sets; Node (physics); Computer network; Transmission (telecommunications); Adversary; Theoretical computer science; Authentication (law); Protocol (science); Relation (database); Power (physics); Cryptography; Algorithm; Computer security; Mathematics; Discrete mathematics; Telecommunications","score_opus":0.021138895533528768,"score_gpt":0.2656808496929594,"score_spread":0.24454195415943064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950808142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14848354,0.0004108026,0.8459316,0.00070127274,0.0020924571,0.000616474,0.000044846118,0.00023219547,0.0014868028],"genre_scores_gemma":[0.08378498,0.00013152529,0.91500056,0.00024935053,0.0004573171,0.0003113157,0.000036410904,0.000025642641,0.000002918467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974665,0.00031511183,0.0004138509,0.0010165087,0.00014761463,0.0006404376],"domain_scores_gemma":[0.99785113,0.0005513126,0.00030516298,0.0009807695,0.000088413304,0.00022322198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056022994,0.0004196301,0.0005504385,0.00033732172,0.0002855961,0.00017161616,0.000983754,0.00034939463,0.00002339541],"category_scores_gemma":[0.000079081954,0.00042809796,0.00030386393,0.000116127674,0.00065632473,0.00017839097,0.0024702398,0.00071156566,0.00002213487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000652919,0.00005294446,0.00324007,0.00008937257,0.00015001987,0.0000059269823,0.0013150973,0.000032751865,0.0006129129,0.95507413,0.00017943459,0.03918207],"study_design_scores_gemma":[0.00044612229,0.000071930066,0.004997105,0.00004472724,0.000063999265,0.0002131175,0.00003824725,0.0030351288,0.00044324456,0.9844086,0.005782887,0.0004548958],"about_ca_topic_score_codex":0.000019282801,"about_ca_topic_score_gemma":0.000024745674,"teacher_disagreement_score":0.06906894,"about_ca_system_score_codex":0.00003546769,"about_ca_system_score_gemma":0.00012395695,"threshold_uncertainty_score":0.9998171},"labels":[],"label_agreement":null},{"id":"W2950970010","doi":"10.48550/arxiv.cs/0611162","title":"Quaternary Constant-Amplitude Codes for Multicode CDMA","year":2006,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constant (computer programming); Amplitude; Mathematics; Binary number; Linear code; Integer (computer science); Code (set theory); Binary code; Discrete mathematics; Physics; Algorithm; Block code; Computer science; Arithmetic; Optics","score_opus":0.0681218899085884,"score_gpt":0.20243852884784844,"score_spread":0.13431663893926005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950970010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17794135,0.000078134144,0.81785965,0.00007507505,0.00060172187,0.00040002438,0.00008229009,0.0003990694,0.0025626658],"genre_scores_gemma":[0.98626876,0.000040918854,0.012669374,0.0001114119,0.00009082347,0.0000041820963,0.000034202818,0.000020957417,0.0007593918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787563,0.00014404966,0.00024236561,0.0011885156,0.000086006265,0.00046341665],"domain_scores_gemma":[0.9978174,0.0003584215,0.00024884872,0.0012727826,0.00015725858,0.00014529521],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003499329,0.00037099133,0.00039848645,0.00030656176,0.0002528745,0.00020629104,0.0021646218,0.00027540117,0.000013573709],"category_scores_gemma":[0.000024476383,0.00043026498,0.00045195737,0.0003566234,0.00021445558,0.00026045702,0.0013899959,0.0003639236,0.000030177376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009663572,0.0001830886,0.005559749,0.00013124906,0.00014211837,0.0001728788,0.0001588821,0.031154858,0.000102365164,0.9602999,0.0007564389,0.0012418547],"study_design_scores_gemma":[0.0009612163,0.000098535915,0.00084640476,0.00014503986,0.000107185166,0.0000068750605,0.000037145073,0.40738502,0.0002864995,0.58669704,0.0026552868,0.0007737236],"about_ca_topic_score_codex":0.00017724883,"about_ca_topic_score_gemma":0.000059463804,"teacher_disagreement_score":0.8083274,"about_ca_system_score_codex":0.000099626726,"about_ca_system_score_gemma":0.00012650872,"threshold_uncertainty_score":0.9998149},"labels":[],"label_agreement":null},{"id":"W2951330406","doi":"10.48550/arxiv.1408.5169","title":"Constructions of complex equiangular lines from mutually unbiased bases","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Equiangular polygon; Combinatorics; Conjecture; Mutually unbiased bases; Mathematics; Hermitian matrix; Set (abstract data type); Discrete mathematics; Geometry; Computer science; Pure mathematics; Hilbert space","score_opus":0.09353905603015882,"score_gpt":0.18995181469569855,"score_spread":0.09641275866553974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951330406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41177633,0.00002840231,0.58560365,0.000048966656,0.0004427192,0.00011255511,0.00008565147,0.00019065637,0.0017110833],"genre_scores_gemma":[0.98975617,0.000030624582,0.009838576,0.00010823067,0.000102984275,5.520483e-7,0.000054734428,0.000011972273,0.000096141775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983199,0.00025397018,0.00025591266,0.0008314038,0.00009672311,0.00024206763],"domain_scores_gemma":[0.99749416,0.00037063492,0.00034566777,0.0014373843,0.00021503874,0.00013714038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017870477,0.00027931808,0.00042752843,0.0003467063,0.00015066071,0.000071859395,0.0018380766,0.0002055481,0.00016043615],"category_scores_gemma":[0.000052368974,0.00032821947,0.0003664033,0.0005751546,0.00038076952,0.00017724477,0.0013962995,0.0003171088,0.000027540817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061787876,0.00016806861,0.0039408933,0.00008655073,0.00030487598,0.00009567845,0.00034785163,0.052468143,0.0010319543,0.93798447,0.00053650903,0.0029732063],"study_design_scores_gemma":[0.0010030434,0.00013818995,0.0036256032,0.0002874311,0.00025512482,0.0000060089205,0.00020289727,0.4487334,0.0012883174,0.53899515,0.004610146,0.00085472164],"about_ca_topic_score_codex":0.0002703515,"about_ca_topic_score_gemma":0.00005161779,"teacher_disagreement_score":0.57797986,"about_ca_system_score_codex":0.000034833374,"about_ca_system_score_gemma":0.00011646977,"threshold_uncertainty_score":0.999917},"labels":[],"label_agreement":null},{"id":"W2951468398","doi":"10.48550/arxiv.1708.01593","title":"On invariant fields of vectors and covectors","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Fundamental Research Funds for the Central Universities; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; Queen's University; National Natural Science Foundation of China","keywords":"Combinatorics; Invariant (physics); Physics; Order (exchange); Finite field; Field (mathematics); Mathematics; Mathematical physics; Pure mathematics","score_opus":0.059501435884615345,"score_gpt":0.18209707624477522,"score_spread":0.12259564036015988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951468398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81126493,0.00003685652,0.18168843,0.00006441662,0.0005247703,0.00011967563,0.000008249127,0.00007836432,0.0062143174],"genre_scores_gemma":[0.99942744,0.000085745734,0.00020273917,0.000048033544,0.000022827755,2.6891257e-7,0.0000016948951,0.0000061377723,0.00020513668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896175,0.00009522365,0.00010923464,0.0006091009,0.000058900798,0.0001657823],"domain_scores_gemma":[0.99817425,0.00019096579,0.00023638493,0.0012513226,0.00005265669,0.000094396004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022920399,0.00018719528,0.00025477947,0.00023076816,0.0001536352,0.000085112224,0.0013937919,0.00020934439,0.00001699469],"category_scores_gemma":[0.000058373666,0.00020030115,0.00014895592,0.00015354379,0.00016085831,0.00015531511,0.0013212679,0.00035686907,0.0000066165458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038060414,0.00004979135,0.0021228704,0.000053222615,0.000065236745,0.00008130607,0.00026724083,0.0046519623,0.00002127883,0.99187756,0.00012886945,0.0006425844],"study_design_scores_gemma":[0.00052074424,0.0002925609,0.008402266,0.00028043953,0.00007078196,0.0000037089633,0.000027145257,0.03859851,0.0006828309,0.95036644,0.00024623412,0.00050834724],"about_ca_topic_score_codex":0.000107949694,"about_ca_topic_score_gemma":0.00002427096,"teacher_disagreement_score":0.18816249,"about_ca_system_score_codex":0.000023053284,"about_ca_system_score_gemma":0.0000705179,"threshold_uncertainty_score":0.81680435},"labels":[],"label_agreement":null},{"id":"W2951648961","doi":"10.1016/j.jsc.2011.12.008","title":"Fast arithmetics in Artin–Schreier towers over finite fields","year":2011,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Finite field; Tower; Algebraic number field; Arithmetic; Elliptic curve; Torsion (gastropod); Discrete mathematics; Pure mathematics","score_opus":0.023157195573169496,"score_gpt":0.2446057168958486,"score_spread":0.2214485213226791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951648961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36250833,0.000079174155,0.635183,0.00013989425,0.00041684878,0.00003653717,2.3761325e-7,0.000015442694,0.0016205381],"genre_scores_gemma":[0.973503,0.000018325043,0.026144354,0.00023744752,0.000076726035,7.3939924e-7,2.4251628e-7,0.000004513278,0.000014666181],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901587,0.000081120575,0.00041308827,0.00011409631,0.00022196965,0.00015384554],"domain_scores_gemma":[0.99927276,0.00013451389,0.00027096923,0.00013039372,0.000119386605,0.00007198904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052247033,0.00009096863,0.00016661694,0.00040115643,0.000040813655,0.000060584756,0.0003534394,0.000056667453,0.000043812743],"category_scores_gemma":[0.00004785732,0.00008325324,0.00010880191,0.00049952866,0.000028249186,0.0004197564,0.0000653789,0.00023451034,0.000008834635],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019626389,0.00074587873,0.02527997,0.00004363361,0.00012551175,0.00030389748,0.038349837,0.024648093,0.00055935583,0.13054475,0.0010559619,0.77814686],"study_design_scores_gemma":[0.0029288486,0.0014125017,0.2727521,0.00034062847,0.00005231077,0.00029276434,0.00065545656,0.21005288,0.0021326907,0.5069827,0.0017253294,0.00067179604],"about_ca_topic_score_codex":0.000008470486,"about_ca_topic_score_gemma":0.000003927406,"teacher_disagreement_score":0.77747506,"about_ca_system_score_codex":0.000020977248,"about_ca_system_score_gemma":0.000046406258,"threshold_uncertainty_score":0.33949685},"labels":[],"label_agreement":null},{"id":"W2951688843","doi":"10.48550/arxiv.0909.3321","title":"Asymptotic enumeration of correlation-immune boolean functions","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Division of Mathematical Sciences","keywords":"Boolean function; Mathematics; Parity function; Combinatorics; Function (biology); Discrete mathematics; Order (exchange); Maximum satisfiability problem; Enumeration; Boolean expression","score_opus":0.023533060566468787,"score_gpt":0.23567684776227488,"score_spread":0.2121437871958061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951688843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41617092,0.00042122602,0.5781404,0.00034921168,0.0015287567,0.00021011685,0.0000059943104,0.00019723746,0.0029761938],"genre_scores_gemma":[0.99636054,0.000034783014,0.002890733,0.00011537465,0.00013052355,0.000016918098,0.00005310753,0.000010887896,0.00038713953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985174,0.00013640865,0.00044964472,0.00047155505,0.00022720832,0.0001978082],"domain_scores_gemma":[0.99824244,0.00010231756,0.00033897633,0.0011065331,0.00014887529,0.000060846258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040314006,0.00021837425,0.0002772757,0.0002476469,0.0001769682,0.000080639205,0.00077799574,0.00020006941,0.00005402739],"category_scores_gemma":[0.00006352449,0.00023124681,0.00025979098,0.00039913302,0.00006145725,0.0002518171,0.0004050291,0.00047016074,0.00013229901],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010183404,0.00091898034,0.35610855,0.00032325316,0.0006068126,0.000022964225,0.0048251464,0.08542144,0.0066148886,0.43104735,0.0026028848,0.11140589],"study_design_scores_gemma":[0.00062244234,0.00036819308,0.8380743,0.00048979855,0.00017109125,0.000014503952,0.000054381842,0.04459418,0.0027366173,0.10872559,0.0032306626,0.0009182313],"about_ca_topic_score_codex":0.000024769015,"about_ca_topic_score_gemma":0.0000051178067,"teacher_disagreement_score":0.58018965,"about_ca_system_score_codex":0.00004508412,"about_ca_system_score_gemma":0.00012604726,"threshold_uncertainty_score":0.94299716},"labels":[],"label_agreement":null},{"id":"W2951766187","doi":"10.48550/arxiv.1205.0626","title":"Advances in the merit factor problem for binary sequences","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Skew; Binary number; Mathematics; Conjecture; Figure of merit; Binary Golay code; Aperiodic graph; Complementary sequences; Pseudorandom binary sequence; Combinatorics; Autocorrelation; Discrete mathematics; Algorithm; Statistics; Computer science","score_opus":0.08007383609668346,"score_gpt":0.20832597944222828,"score_spread":0.1282521433455448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951766187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21714075,0.001725091,0.7707795,0.00043775348,0.0010575596,0.0012482033,0.00004422976,0.00028146536,0.007285462],"genre_scores_gemma":[0.9965229,0.0005017719,0.0027045307,0.00009205901,0.00007641917,0.000008696169,0.000006047869,0.000007650917,0.00007990311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856496,0.00021393113,0.00014615161,0.0006370502,0.00007621987,0.00036167787],"domain_scores_gemma":[0.9986382,0.00030443066,0.00016894686,0.00076690316,0.000055686654,0.00006581948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004612136,0.00023190836,0.0002172626,0.00021792218,0.00017223354,0.00010386116,0.002537478,0.00014579335,0.000013763858],"category_scores_gemma":[0.000013866947,0.00019254933,0.00021824877,0.000622823,0.0001352639,0.0007658442,0.00066653755,0.0003553621,0.000011348427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040621257,0.00012055836,0.003386226,0.000148882,0.000024895668,0.000038158898,0.001583648,0.008829966,0.000038924118,0.9795766,0.000059923455,0.006151634],"study_design_scores_gemma":[0.00042318986,0.00015790165,0.0016603515,0.00017437822,0.000048774466,0.0000056385225,0.0004417874,0.023263615,0.00009380041,0.9572033,0.015866552,0.0006606682],"about_ca_topic_score_codex":0.000022789585,"about_ca_topic_score_gemma":0.000035049543,"teacher_disagreement_score":0.77938217,"about_ca_system_score_codex":0.000047533442,"about_ca_system_score_gemma":0.00007703769,"threshold_uncertainty_score":0.7851934},"labels":[],"label_agreement":null},{"id":"W2952097853","doi":"10.48550/arxiv.1407.5884","title":"A probabilistic approach to value sets of polynomials over finite fields","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Infinity; Distribution (mathematics); Finite field; Order (exchange); Expected value; Polynomial; Value (mathematics); Combinatorics; Discrete mathematics; Degree (music); Random variable; Probabilistic logic; Set (abstract data type); Finite set; Field (mathematics); Random field; Pure mathematics; Statistics; Mathematical analysis; Physics; Computer science","score_opus":0.056120039602601576,"score_gpt":0.191049739230665,"score_spread":0.13492969962806345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952097853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28332728,0.00001371653,0.70762473,0.000038658218,0.0003190144,0.00032499075,0.000013244617,0.000120207485,0.008218144],"genre_scores_gemma":[0.99458927,0.000008447836,0.0048387726,0.00021313003,0.00005044295,0.0000023574198,0.0000060589005,0.00001247399,0.0002790286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808,0.0002715963,0.00024275921,0.0009918219,0.00010505165,0.00030873154],"domain_scores_gemma":[0.9975805,0.00031798036,0.00023499841,0.001580983,0.000102807906,0.00018267502],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005217709,0.00028581932,0.00043444702,0.00038102828,0.00008821837,0.000073333096,0.0021322544,0.000289407,0.000017242606],"category_scores_gemma":[0.000109520326,0.00031718626,0.00031882952,0.0006880643,0.000104651175,0.00013480528,0.002039154,0.0003814975,0.000023783015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004194483,0.00013051995,0.00033567962,0.0001583837,0.00006357113,0.000010622056,0.00042268628,0.37230697,0.000014792899,0.6258045,0.0003036416,0.00040669265],"study_design_scores_gemma":[0.00044693224,0.0001746496,0.001490803,0.00017086345,0.000099359815,0.0000025216777,0.000023210257,0.5934558,0.00014008986,0.40269518,0.0006672648,0.0006333579],"about_ca_topic_score_codex":0.000081092665,"about_ca_topic_score_gemma":0.0000059376903,"teacher_disagreement_score":0.711262,"about_ca_system_score_codex":0.000053968684,"about_ca_system_score_gemma":0.00011940226,"threshold_uncertainty_score":0.999928},"labels":[],"label_agreement":null},{"id":"W2952358871","doi":"10.48550/arxiv.1212.0048","title":"Strictly chained (p,q)-ary partitions","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.085180390743753,"score_gpt":0.17646769825399794,"score_spread":0.09128730751024494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952358871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112417296,0.00016477639,0.86765295,0.00021426003,0.0012027508,0.00023554004,0.000026509364,0.0006707824,0.017415104],"genre_scores_gemma":[0.99772036,0.000094558854,0.0011275549,0.00020637456,0.00014862129,0.0000017491002,0.000017370603,0.000012558942,0.00067082595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983985,0.00018533494,0.00015586067,0.0007507645,0.00007813285,0.00043143844],"domain_scores_gemma":[0.99794674,0.0001181555,0.00016825605,0.0013711958,0.00008878262,0.00030689337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029750136,0.0002720076,0.0002417528,0.00033056719,0.00025229805,0.000108048895,0.0017888764,0.0002389091,0.00014096416],"category_scores_gemma":[0.000025282941,0.0003209926,0.00030962584,0.00085871894,0.00011176837,0.00044540208,0.001843366,0.00053018087,0.00018256009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000134553775,0.00013997851,0.0014134933,0.0000301439,0.00007716015,0.00008168593,0.00022614012,0.009269977,0.000020882393,0.9873624,0.00069497665,0.00066972186],"study_design_scores_gemma":[0.00061308284,0.000087303124,0.003837255,0.00012373616,0.00019016655,0.00001101696,0.00008934412,0.0735868,0.00018627215,0.9107267,0.009402631,0.0011456873],"about_ca_topic_score_codex":0.00002712467,"about_ca_topic_score_gemma":0.000009891854,"teacher_disagreement_score":0.8853031,"about_ca_system_score_codex":0.00007372368,"about_ca_system_score_gemma":0.00012548294,"threshold_uncertainty_score":0.99992424},"labels":[],"label_agreement":null},{"id":"W2952398546","doi":"10.48550/arxiv.0802.0855","title":"A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mutually unbiased bases; Orthonormal basis; Homogeneous; Set (abstract data type); Mathematics; Computer science; Combinatorics; Physics","score_opus":0.06864132746274425,"score_gpt":0.29352718407274825,"score_spread":0.224885856610004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952398546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117325895,0.00014869065,0.8782727,0.001706414,0.00023741207,0.0016626449,0.000044486944,0.00026504966,0.0003366722],"genre_scores_gemma":[0.9491626,0.000047628742,0.044418495,0.0011668378,0.0003871106,0.004556608,0.000076074066,0.00003731627,0.0001473296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983503,0.00007633106,0.00028403226,0.0007424073,0.00018020956,0.0003667021],"domain_scores_gemma":[0.99733055,0.0007893455,0.00023334914,0.0013208786,0.00024816624,0.0000777319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050464243,0.0002869658,0.00027145343,0.00013309697,0.0008347383,0.00024741172,0.0015439147,0.00013140986,0.000004242507],"category_scores_gemma":[0.00006494529,0.00021123576,0.0002756558,0.00033010403,0.00018030305,0.00015458335,0.00046205052,0.00027382784,0.0000063950065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013645627,0.0013515058,0.07403555,0.0019113367,0.0013581414,0.000030226682,0.018995546,0.0039612507,0.0023265968,0.703256,0.015890533,0.17551875],"study_design_scores_gemma":[0.004255255,0.002219109,0.038496275,0.0011121838,0.0005304155,0.00012403731,0.0008945806,0.06314053,0.003702477,0.14123504,0.74098843,0.0033016426],"about_ca_topic_score_codex":0.000014514708,"about_ca_topic_score_gemma":0.000019260415,"teacher_disagreement_score":0.83385426,"about_ca_system_score_codex":0.00003544293,"about_ca_system_score_gemma":0.00022989846,"threshold_uncertainty_score":0.8613944},"labels":[],"label_agreement":null},{"id":"W2952438738","doi":"10.48550/arxiv.1501.05296","title":"Output-sensitive algorithms for sumset and sparse polynomial multiplication","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Integer (computer science); Multiplication (music); Univariate; Polynomial; Interpolation (computer graphics); Algorithm; Set (abstract data type); Discrete mathematics; Computer science; Combinatorics; Multivariate statistics","score_opus":0.11802119843768791,"score_gpt":0.21397372353932664,"score_spread":0.09595252510163874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952438738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20917946,0.000046106506,0.7888266,0.00013247058,0.0005175731,0.00048120224,0.00008449951,0.00020265994,0.00052942196],"genre_scores_gemma":[0.991692,0.000043907003,0.0076067736,0.00007943776,0.00013846463,0.000003051367,0.000038936796,0.0000136671815,0.0003837526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842095,0.000113241695,0.00014101219,0.0009924776,0.000060230308,0.00027210487],"domain_scores_gemma":[0.99840033,0.0001739928,0.00018754939,0.0007915848,0.00025157552,0.00019496829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004310862,0.000255594,0.00026994827,0.00024888362,0.00016262777,0.00012368833,0.00076058425,0.00023573157,0.0000012688549],"category_scores_gemma":[0.00004404636,0.00030170966,0.00016689679,0.0002802324,0.00014531991,0.00026688556,0.0011752256,0.00026305974,0.000013393079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085435057,0.0004906229,0.0031499127,0.00025195835,0.0006042156,0.00024080962,0.0044255676,0.043985963,0.00026593168,0.88113487,0.009611843,0.05498398],"study_design_scores_gemma":[0.001442275,0.00016414789,0.0015714066,0.000065714026,0.00012152101,0.000010052725,0.00015577156,0.85338885,0.00032379915,0.13782689,0.004210056,0.0007195145],"about_ca_topic_score_codex":0.000060893894,"about_ca_topic_score_gemma":0.00001777289,"teacher_disagreement_score":0.8094029,"about_ca_system_score_codex":0.00008956117,"about_ca_system_score_gemma":0.000120762445,"threshold_uncertainty_score":0.9999435},"labels":[],"label_agreement":null},{"id":"W2952684653","doi":"10.48550/arxiv.0707.1102","title":"Nonexistence of permutation binomials of certain shapes","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Permutation (music); Prime (order theory); Mathematics; Discrete mathematics; Physics","score_opus":0.06256228778151406,"score_gpt":0.29486276568508935,"score_spread":0.23230047790357528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952684653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87652963,0.00026656425,0.12015314,0.00010342989,0.00035905512,0.00017595263,0.0000091232505,0.00007273901,0.0023303705],"genre_scores_gemma":[0.9922488,0.00004822695,0.007484929,0.000072134724,0.00006599011,0.000010376319,0.0000061286205,0.0000102224785,0.000053194923],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99835795,0.00012313982,0.00054974447,0.00047794954,0.00027364978,0.00021755666],"domain_scores_gemma":[0.9982322,0.0002633685,0.00054420735,0.0007107795,0.00018904015,0.0000604003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008909063,0.00020249875,0.0003941885,0.00032885373,0.000050558312,0.000027334014,0.0013021964,0.00019270484,0.000029262199],"category_scores_gemma":[0.000100370664,0.00020093287,0.00025782766,0.0004004815,0.00016005141,0.00012649246,0.0007689431,0.00025985166,0.000015901938],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021563588,0.0007374318,0.4740384,0.001818528,0.00042106773,0.000050697203,0.013747989,0.0036763144,0.08852689,0.34909862,0.00017753319,0.06749089],"study_design_scores_gemma":[0.00077505334,0.00044818624,0.74298286,0.0011421076,0.0001298529,0.000014893658,0.00035468614,0.007851526,0.13728094,0.10710058,0.0007742268,0.0011450634],"about_ca_topic_score_codex":0.00007935306,"about_ca_topic_score_gemma":0.000008503357,"teacher_disagreement_score":0.26894447,"about_ca_system_score_codex":0.000021990016,"about_ca_system_score_gemma":0.00010703832,"threshold_uncertainty_score":0.8193805},"labels":[],"label_agreement":null},{"id":"W2952761579","doi":"10.1109/isit.2012.6284696","title":"An algorithm for list decoding number field codes","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Decoding methods; Field (mathematics); Algebraic number; Algorithm; Gröbner basis; List decoding; Computer science; Discrete mathematics; Mathematics; Combinatorics; Block code; Pure mathematics; Concatenated error correction code; Computation","score_opus":0.027561398868023414,"score_gpt":0.3110633547250667,"score_spread":0.2835019558570433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952761579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015557383,0.00007569377,0.98340416,0.00026839695,0.0017291965,0.00026226862,0.000014798202,0.00043776806,0.012252002],"genre_scores_gemma":[0.24798852,0.000017304901,0.75015575,0.0008076382,0.0005700836,0.0001023396,0.000019692794,0.000016545286,0.00032210216],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861693,0.00007323232,0.0002266795,0.00054906757,0.00015348189,0.00038062752],"domain_scores_gemma":[0.9982329,0.00035727327,0.00010599861,0.0010491307,0.000089860245,0.0001648128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064797583,0.00023955926,0.00025502875,0.00008510615,0.00018017717,0.00045590944,0.0015713215,0.00025100735,0.00025466442],"category_scores_gemma":[0.000023269657,0.00022182877,0.00025227937,0.00012188738,0.000029472316,0.00035594442,0.0007922672,0.00029710683,0.000028411045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004839753,0.00009896557,0.0005913919,0.00004421353,0.00004358943,0.0000015639524,0.0004278018,0.00000943022,0.000041789688,0.40888032,0.002883475,0.5869726],"study_design_scores_gemma":[0.0004296941,0.00016343154,0.0002227852,0.0001495848,0.0000738753,0.00002719295,0.00008271352,0.32054198,0.0091172485,0.63707715,0.030731592,0.0013827259],"about_ca_topic_score_codex":0.00005728827,"about_ca_topic_score_gemma":0.000018757752,"teacher_disagreement_score":0.5855899,"about_ca_system_score_codex":0.000017819168,"about_ca_system_score_gemma":0.0000440876,"threshold_uncertainty_score":0.9045915},"labels":[],"label_agreement":null},{"id":"W2953313566","doi":"10.48550/arxiv.1208.2361","title":"Lexicodes over Rings","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multiplicative function; Greedy algorithm; Combinatorics; Constraint (computer-aided design); Mathematics; Selection (genetic algorithm); Property (philosophy); Binary number; Discrete mathematics; Construct (python library); Dual (grammatical number); Chain (unit); Algorithm; Computer science; Physics; Arithmetic","score_opus":0.07209345690978462,"score_gpt":0.18186137546924006,"score_spread":0.10976791855945543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953313566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40672296,0.00013388618,0.5794373,0.000043046,0.0008726102,0.00012845367,0.000006292791,0.00045389723,0.012201558],"genre_scores_gemma":[0.99739295,0.00006755631,0.0013157681,0.00013279812,0.00012698631,6.1715815e-7,0.0000040048762,0.0000145545,0.0009447566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840933,0.00012506124,0.00013364825,0.00082582247,0.00008230318,0.00042382782],"domain_scores_gemma":[0.99812144,0.00009259837,0.0001671964,0.0013586538,0.00006239416,0.00019773308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032071397,0.00029125984,0.00025213897,0.0002786633,0.0001692109,0.00014639396,0.0021478795,0.00025012268,0.0001123827],"category_scores_gemma":[0.000013183332,0.0003356086,0.00031360952,0.0005375761,0.0001243634,0.0005349896,0.0026991633,0.00053376536,0.00016134795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015734759,0.000079006895,0.006842833,0.000039815997,0.00006860923,0.000059648148,0.00027554756,0.003848664,0.000044565826,0.9874275,0.00030818197,0.000989919],"study_design_scores_gemma":[0.00060437294,0.00005845479,0.014104911,0.00016477774,0.0001388241,0.000009754398,0.000048014146,0.07297614,0.00050740066,0.9002563,0.009841415,0.0012896627],"about_ca_topic_score_codex":0.00005017963,"about_ca_topic_score_gemma":0.000008089651,"teacher_disagreement_score":0.59067,"about_ca_system_score_codex":0.00007894083,"about_ca_system_score_gemma":0.00006494817,"threshold_uncertainty_score":0.9999096},"labels":[],"label_agreement":null},{"id":"W2953369668","doi":"10.48550/arxiv.1504.05086","title":"A Modified KZ Reduction Algorithm","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reduction (mathematics); Zhàng; Matrix (chemical analysis); Algorithm; Computer science; Basis (linear algebra); Cryptography; Mathematics; Materials science; Political science; Law; China","score_opus":0.09205719074556395,"score_gpt":0.18919996683841947,"score_spread":0.09714277609285552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953369668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074915044,0.00007293123,0.9154307,0.000079624144,0.0014632678,0.00019118801,0.000010057494,0.0005181149,0.0073190313],"genre_scores_gemma":[0.991749,0.000059150178,0.0066812253,0.000033589436,0.00016295059,0.0000011151607,0.0000124755215,0.000013491036,0.0012870135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982377,0.00019080618,0.00014934668,0.0010177596,0.00010145694,0.000302929],"domain_scores_gemma":[0.9980333,0.000031743646,0.00018090422,0.001339889,0.00020697142,0.00020723022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044125738,0.0002706535,0.00025884353,0.00036178256,0.00014808212,0.00014262597,0.0017649165,0.00027375497,0.000014268603],"category_scores_gemma":[0.000015184599,0.00032253447,0.00024214319,0.000779308,0.000115690134,0.0003851668,0.0016616634,0.0005334689,0.00008022522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004065019,0.0001423385,0.000039306247,0.000032935077,0.0001220597,0.00020075381,0.0005925757,0.1119381,0.00003266263,0.8663932,0.0016695416,0.018795885],"study_design_scores_gemma":[0.00030000205,0.000051247913,0.000036315818,0.000038654158,0.00004178357,0.000012886127,0.00005882505,0.44445798,0.00006725457,0.55367684,0.0008986104,0.00035962556],"about_ca_topic_score_codex":0.00006242465,"about_ca_topic_score_gemma":0.0000028518311,"teacher_disagreement_score":0.91683394,"about_ca_system_score_codex":0.00014832075,"about_ca_system_score_gemma":0.00019175216,"threshold_uncertainty_score":0.9999227},"labels":[],"label_agreement":null},{"id":"W2953439278","doi":"10.1109/tcsii.2019.2924455","title":"High-Throughput Low-Latency Encoder and Decoder for a Class of Generalized Reed–Solomon Codes for Short-Reach Optical Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Encoder; Computer science; Latency (audio); Throughput; CMOS; Computer hardware; Power consumption; Error detection and correction; Low latency (capital markets); Forward error correction; Decoding methods; Embedded system; Power (physics); Electronic engineering; Computer network; Telecommunications; Algorithm; Engineering; Wireless; Operating system","score_opus":0.0281348514875513,"score_gpt":0.26723044420526443,"score_spread":0.23909559271771313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953439278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082311995,0.00039213002,0.913654,0.00024184256,0.0010036736,0.0017726945,0.00022389376,0.00018454685,0.00021517854],"genre_scores_gemma":[0.98099834,0.00009264518,0.01757286,0.00009263957,0.000052331234,0.00090336846,0.000015528498,0.00004074861,0.00023156939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759805,0.00021137434,0.0007284433,0.0007078683,0.00030389155,0.0004503805],"domain_scores_gemma":[0.99659884,0.0009616449,0.00018187382,0.0017886235,0.00031460964,0.00015440585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066270586,0.00030854793,0.00063896127,0.0002446311,0.0005413908,0.00014917177,0.0011797003,0.00023941297,0.0000062585855],"category_scores_gemma":[0.000013496894,0.00031348004,0.00030048547,0.0003382073,0.00027679116,0.0005132473,0.00002301309,0.00022785136,0.0000037022885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003533412,0.0018744151,0.00012432088,0.0013572727,0.00082370575,0.0000024793621,0.0074480004,0.020510064,0.18692267,0.73619366,0.0005869383,0.043803167],"study_design_scores_gemma":[0.019688915,0.006516008,0.0005363013,0.0035288003,0.0012333014,0.00031700576,0.0022916093,0.6212891,0.2833003,0.033947345,0.022461006,0.0048903204],"about_ca_topic_score_codex":0.00018888507,"about_ca_topic_score_gemma":0.00006347035,"teacher_disagreement_score":0.8986863,"about_ca_system_score_codex":0.00004843119,"about_ca_system_score_gemma":0.000089609646,"threshold_uncertainty_score":0.99993175},"labels":[],"label_agreement":null},{"id":"W2955456460","doi":"10.1142/s0219498820501509","title":"Additive decompositions of polynomials over unique factorization domains","year":2019,"lang":"en","type":"article","venue":"Journal of Algebra and Its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Factorization; Factorization of polynomials; Decomposition; Pure mathematics; Finite field; Unique factorization domain; Algebra over a field; Discrete mathematics; Combinatorics; Polynomial; Mathematical analysis; Algorithm; Matrix polynomial","score_opus":0.004977955045630473,"score_gpt":0.23256817190012807,"score_spread":0.2275902168544976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955456460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42270952,0.00020203354,0.5753292,0.0003438953,0.00008237084,0.00019401402,0.000016990589,0.000013965137,0.0011080076],"genre_scores_gemma":[0.99540585,0.00014141944,0.00427545,0.0000850135,0.000054827455,0.0000065282384,0.0000026181103,0.000003642161,0.00002462093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999405,0.00004261564,0.00026663826,0.00009605332,0.00011453151,0.000075129225],"domain_scores_gemma":[0.999105,0.00018637914,0.0003104386,0.00015706841,0.00017587264,0.00006525452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016795323,0.00006300087,0.00013649603,0.00016467314,0.000074917065,0.000036939357,0.00026017058,0.000037957016,0.000046340865],"category_scores_gemma":[0.000010608516,0.00005467733,0.00007467738,0.00032488073,0.000024289702,0.0003955551,0.00004614924,0.00008433691,0.000005385214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007993235,0.00007433816,0.0005041966,0.0000068189934,0.000035465444,2.714055e-7,0.0002949617,0.000011557646,0.035533205,0.95945656,0.0001562302,0.0039184033],"study_design_scores_gemma":[0.0025789964,0.001395471,0.11371375,0.0002782157,0.00018314633,0.00021935439,0.00039758527,0.0022064461,0.15696336,0.65620685,0.06512569,0.00073116116],"about_ca_topic_score_codex":8.94055e-7,"about_ca_topic_score_gemma":5.9555987e-7,"teacher_disagreement_score":0.5726963,"about_ca_system_score_codex":0.000011789428,"about_ca_system_score_gemma":0.000052162573,"threshold_uncertainty_score":0.22296768},"labels":[],"label_agreement":null},{"id":"W2960394841","doi":"10.1145/3326229.3326263","title":"Deterministic Reduction of Integer Nonsingular Linear System Solving to Matrix Multiplication","year":2019,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Invertible matrix; Integer (computer science); Combinatorics; Mathematics; Multiplication (music); Matrix (chemical analysis); Reduction (mathematics); Integer matrix; Matrix multiplication; Prime (order theory); Discrete mathematics; Permutation (music); Triangular matrix; Diagonal; Symmetric matrix; Pure mathematics; Computer science; Physics","score_opus":0.009066095495544341,"score_gpt":0.25127952253054475,"score_spread":0.2422134270350004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960394841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29541785,0.000009601693,0.7023487,0.00006310665,0.0003587006,0.00017129324,3.607861e-7,0.00014328546,0.0014870655],"genre_scores_gemma":[0.92107046,3.382212e-7,0.07867578,0.000017391261,0.000035401008,0.000005454441,5.0100607e-7,0.0000047064,0.00018995658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999294,0.000041784868,0.00019408937,0.00023746048,0.00011897291,0.00011368098],"domain_scores_gemma":[0.9992225,0.000051573465,0.000072684175,0.0005149775,0.000092538205,0.000045721186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002962048,0.00007129382,0.00011225925,0.00015974396,0.000042861393,0.000034920085,0.000332369,0.000034881974,0.000010604054],"category_scores_gemma":[0.000023414193,0.000064770655,0.000058876256,0.0003678564,0.000013393187,0.0001545108,0.00010959007,0.000046708665,0.00015549363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003887679,0.00006899635,0.0006840565,0.00020408892,0.00002284596,0.0000018992126,0.0017562603,0.0011572316,0.25286236,0.7180613,0.00009102412,0.025051018],"study_design_scores_gemma":[0.00059520407,0.00057278445,0.0017714618,0.0005642733,0.000031625892,0.00013271776,0.0010314967,0.8399539,0.14904402,0.0038699475,0.0018419356,0.0005906092],"about_ca_topic_score_codex":0.00001092536,"about_ca_topic_score_gemma":5.6922266e-7,"teacher_disagreement_score":0.8387967,"about_ca_system_score_codex":0.000023029434,"about_ca_system_score_gemma":0.00001750851,"threshold_uncertainty_score":0.26412708},"labels":[],"label_agreement":null},{"id":"W2960877448","doi":"10.1017/s0004972719000728","title":"A NEW PROOF OF THE CARLITZ–LUTZ THEOREM","year":2019,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Brock University","funders":"","keywords":"Mathematics; Finite field; Hermite polynomials; Permutation (music); Combinatorics; Polynomial; Field (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.012929760564801487,"score_gpt":0.2245219212870269,"score_spread":0.2115921607222254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960877448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6580528,0.00011451969,0.159453,0.121474065,0.0015027404,0.0037133421,0.000027595435,0.00028893788,0.055372998],"genre_scores_gemma":[0.95375675,9.838485e-7,0.032382138,0.00040552515,0.00003720037,0.0000063965426,1.17895716e-7,0.000011665745,0.013399246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859434,0.00014262226,0.0003455206,0.0002272568,0.00043720586,0.00025307236],"domain_scores_gemma":[0.9980954,0.00025160052,0.00023853102,0.0012941667,0.000053871157,0.00006641888],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007200285,0.00014918273,0.00026321923,0.000009783567,0.000084102256,0.00003583645,0.0022891313,0.000097460485,0.00096214114],"category_scores_gemma":[0.00008137771,0.00007782932,0.0007812136,0.00034731402,0.00024797133,0.000029974475,0.0006201514,0.00022145925,0.00005952865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006249737,0.00010960592,0.00069047033,0.00023099374,0.000073279814,8.847746e-8,0.0021116624,0.000028960338,0.0013452169,0.9358679,0.058451727,0.0010838683],"study_design_scores_gemma":[0.0006223127,0.000116569616,0.0026141729,0.0005235294,0.00007059404,0.00001627022,0.0004455848,0.00049755676,0.062130425,0.9001444,0.03252388,0.00029470673],"about_ca_topic_score_codex":0.000013784207,"about_ca_topic_score_gemma":2.852816e-7,"teacher_disagreement_score":0.29570392,"about_ca_system_score_codex":0.000015671589,"about_ca_system_score_gemma":0.00005623045,"threshold_uncertainty_score":0.9999511},"labels":[],"label_agreement":null},{"id":"W2961053155","doi":"10.5539/jmr.v11n4p26","title":"Design ”Strong Diffie-Hellman-Exponential-Schnnor Key Exchange” Over Elliptic Curves (SDH-XS-KE Over EC)","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Key exchange; Diffie–Hellman key exchange; Key (lock); Elliptic curve; Exponential function; Prime (order theory); Protocol (science); Discrete mathematics; Combinatorics; Public-key cryptography; Computer network; Pure mathematics; Computer science; Mathematical analysis; Computer security; Encryption","score_opus":0.08870657533090492,"score_gpt":0.35289147446467806,"score_spread":0.26418489913377313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961053155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32087237,0.0035144733,0.6689372,0.0008481168,0.0008438963,0.00073160697,0.0000028136978,0.00006799705,0.004181558],"genre_scores_gemma":[0.85872674,0.0035686637,0.13072667,0.0002988369,0.00078168465,0.000030443216,0.0000016415298,0.00011316689,0.0057521323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995316,0.0006826443,0.00076348206,0.0003176248,0.0021958712,0.00072433724],"domain_scores_gemma":[0.99611837,0.0016718996,0.00045237914,0.0009540242,0.000530831,0.00027249346],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008089517,0.00023725248,0.000503652,0.0008412846,0.00019989842,0.00041345926,0.002216331,0.00012321824,0.001011215],"category_scores_gemma":[0.00029465108,0.00018720674,0.0003156959,0.0009187535,0.00013840967,0.0007736024,0.0006001211,0.0009826956,0.0003095605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084599224,0.007762892,0.0038225173,0.011114414,0.001962899,0.0011225198,0.025635224,0.0019408742,0.14449076,0.58502436,0.19029507,0.025982477],"study_design_scores_gemma":[0.009800369,0.007997598,0.0062095653,0.013102121,0.00032580976,0.0013347367,0.0021502543,0.27473027,0.039688367,0.59286433,0.048753772,0.003042782],"about_ca_topic_score_codex":0.0000037011882,"about_ca_topic_score_gemma":0.0000014464486,"teacher_disagreement_score":0.5382105,"about_ca_system_score_codex":0.00009256245,"about_ca_system_score_gemma":0.00018732576,"threshold_uncertainty_score":0.999902},"labels":[],"label_agreement":null},{"id":"W2961176507","doi":"10.1109/tit.2019.2928292","title":"A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Notation; Mathematics; Bounded function; Discrete mathematics; Successor cardinal; Disjoint sets; Conjecture; Correctness; Sequence (biology); Combinatorics; Computer science; Algebra over a field; Algorithm; Pure mathematics; Arithmetic","score_opus":0.007995481466533831,"score_gpt":0.23025340793767662,"score_spread":0.22225792647114279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961176507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12678184,0.000011804315,0.8712355,0.00017792181,0.000443799,0.00017693228,0.000020535736,0.00012167508,0.0010300289],"genre_scores_gemma":[0.9592357,0.000011359267,0.04014334,0.00054932927,0.000012659462,0.000018251743,0.000001234789,0.0000038029732,0.00002427559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993438,0.0000712243,0.00017763066,0.00011635191,0.000116442185,0.00017454935],"domain_scores_gemma":[0.99882,0.0007639328,0.000096531345,0.00019939156,0.00005140491,0.000068714995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042715267,0.00010121194,0.00009946006,0.00015716751,0.00023694709,0.00014314352,0.00027136042,0.00006972097,0.00005160602],"category_scores_gemma":[0.00001679784,0.00009909921,0.00005950943,0.00020771287,0.0000755198,0.0015558365,0.0000030620215,0.00015585031,0.000014753747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000906617,0.00001234332,0.00006672184,0.000047853406,0.0000295938,2.844772e-7,0.0020895577,0.001885778,0.00011976779,0.8998489,0.000010603394,0.09579793],"study_design_scores_gemma":[0.0010512327,0.00023393337,0.00024415698,0.00018716235,0.00003564718,0.000064959386,0.006761147,0.02040404,0.028870393,0.93992454,0.0017373916,0.00048541412],"about_ca_topic_score_codex":0.00010995333,"about_ca_topic_score_gemma":0.00003670809,"teacher_disagreement_score":0.8324539,"about_ca_system_score_codex":0.00003964621,"about_ca_system_score_gemma":0.00014867439,"threshold_uncertainty_score":0.40411484},"labels":[],"label_agreement":null},{"id":"W2962788513","doi":"10.4171/jncg/65","title":"Codes and noncommutative stochastic matrices","year":2010,"lang":"en","type":"article","venue":"Journal of Noncommutative Geometry","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Noncommutative geometry; Mathematics; Skew; Matrix (chemical analysis); Field (mathematics); Column (typography); Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Geometry","score_opus":0.008211970431845749,"score_gpt":0.2628949219386728,"score_spread":0.25468295150682707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962788513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5837042,0.0005660812,0.41353554,0.0005617241,0.000534652,0.00006365486,0.000006108088,0.000030573363,0.0009974965],"genre_scores_gemma":[0.9349415,0.000031063948,0.0647055,0.00016573363,0.00012668032,0.0000020373611,4.831279e-7,0.000009609263,0.000017442713],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985093,0.00022508418,0.00046093334,0.00017877897,0.0003762546,0.00024967722],"domain_scores_gemma":[0.9965761,0.0018809064,0.0006319872,0.0003193386,0.00038787074,0.00020381254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016057395,0.00019456475,0.00038947092,0.00081118976,0.00023431421,0.00021554997,0.0010735525,0.00008138986,0.00003592807],"category_scores_gemma":[0.00036325055,0.00015470521,0.00015727464,0.0011089037,0.00029236535,0.00093114283,0.00032145402,0.00093956594,0.000009612285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065336603,0.0014683509,0.015449067,0.00017192632,0.0014282241,0.0006484977,0.043998584,0.0009611916,0.032526713,0.3693625,0.002379981,0.5309516],"study_design_scores_gemma":[0.007685372,0.007042832,0.120890446,0.00062212703,0.00039996233,0.0068134074,0.010075934,0.013962229,0.010525746,0.8136809,0.0060624606,0.0022386035],"about_ca_topic_score_codex":0.0000059806252,"about_ca_topic_score_gemma":0.000007687192,"teacher_disagreement_score":0.528713,"about_ca_system_score_codex":0.000019729769,"about_ca_system_score_gemma":0.0000878945,"threshold_uncertainty_score":0.6308695},"labels":[],"label_agreement":null},{"id":"W2962898640","doi":"10.1016/j.ffa.2019.01.003","title":"Further results on complete permutation monomials over finite fields","year":2019,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Monomial; Conjecture; Counterexample; Finite field; Modulo; Combinatorics; Prime (order theory); Permutation (music); Multiplicative function; Prime power; Multiplicative group; Discrete mathematics; Class (philosophy)","score_opus":0.018511220055682745,"score_gpt":0.23542736778320295,"score_spread":0.21691614772752021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962898640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069922246,0.00008793593,0.89575183,0.003585964,0.00018775501,0.00062166096,0.0001238174,0.00018449976,0.029534299],"genre_scores_gemma":[0.99696594,0.000031523527,0.0010048448,0.0013735846,0.00008298902,0.00010155562,0.00003257564,0.0000075512858,0.00039943273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913436,0.000048906186,0.00020694527,0.00036686714,0.00007802134,0.00016489503],"domain_scores_gemma":[0.99831814,0.00084335526,0.00008965115,0.0006516109,0.000036476173,0.000060787243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020071704,0.00013670026,0.00014018155,0.00010335293,0.00015672743,0.00011743521,0.00036362352,0.000110645866,0.00007938352],"category_scores_gemma":[0.00001794078,0.000113504255,0.000078743265,0.00024812628,0.000030435755,0.0001383695,0.000098786615,0.00017043196,0.00017092274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009470054,0.0001437116,0.00043863006,0.000027321707,0.000055978155,8.781657e-7,0.005225862,0.0015333837,0.00045531077,0.9002365,0.0011327683,0.090654984],"study_design_scores_gemma":[0.0021626495,0.00084682176,0.010873586,0.000097479984,0.0000223297,0.000006469046,0.00035381792,0.10588157,0.0010862179,0.524185,0.35356706,0.0009170002],"about_ca_topic_score_codex":0.000013669605,"about_ca_topic_score_gemma":0.00000862883,"teacher_disagreement_score":0.9270437,"about_ca_system_score_codex":0.0000059310846,"about_ca_system_score_gemma":0.000014038352,"threshold_uncertainty_score":0.46285692},"labels":[],"label_agreement":null},{"id":"W2962947731","doi":"10.1142/s1793830909000312","title":"CLASSIFICATION OF NEAR-NORMAL SEQUENCES","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Geology","score_opus":0.01773718719294016,"score_gpt":0.2653631227996698,"score_spread":0.24762593560672963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962947731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008582922,0.00011772932,0.9851011,0.00062330643,0.000012637597,0.00020039949,0.0000071431887,0.00007267341,0.0052820593],"genre_scores_gemma":[0.7374892,0.000035618847,0.2623036,0.00005156055,0.000026388137,0.000048932765,0.000005402749,0.0000033793895,0.000035901616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993575,0.000012412985,0.00021605921,0.00017696491,0.00012746523,0.00010960418],"domain_scores_gemma":[0.9993395,0.000057220215,0.0001245587,0.00037194716,0.00005331744,0.00005341856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019399494,0.000082341845,0.00011444531,0.000049180842,0.0001672644,0.000107267355,0.00034663835,0.000032853182,0.000004941259],"category_scores_gemma":[0.0000067454343,0.000070625065,0.000046689056,0.00034270887,0.00009814138,0.00017330021,0.000041239564,0.00005239112,0.000004635567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.7927288e-7,0.000049978156,0.00002399365,0.000012917138,0.000004825302,1.06570226e-7,0.00042660703,0.000006480222,0.0010145012,0.9191464,0.00001317878,0.07930063],"study_design_scores_gemma":[0.00013894544,0.000097858574,0.004246665,0.00002762387,0.000018374581,0.000012461782,0.0002560708,0.15416808,0.0011010334,0.8368132,0.002928957,0.00019071596],"about_ca_topic_score_codex":0.0000018095269,"about_ca_topic_score_gemma":3.2090432e-7,"teacher_disagreement_score":0.72890633,"about_ca_system_score_codex":0.000003873655,"about_ca_system_score_gemma":0.000017794166,"threshold_uncertainty_score":0.28800064},"labels":[],"label_agreement":null},{"id":"W2963159955","doi":"10.1093/imrn/rnv392","title":"The Asymptotic Formula for Waring's Problem in Function Fields","year":2016,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Asymptotic formula; Integer (computer science); Combinatorics; Exponential function; Finite field; Function (biology); Field (mathematics); Function field; Ring (chemistry); Minor (academic); Quadratic equation; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.0694521847039834,"score_gpt":0.3662492453983421,"score_spread":0.2967970606943587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963159955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026618768,0.000052820313,0.94968885,0.011083019,0.00051185634,0.00049348513,0.000002916748,0.00006837895,0.011479889],"genre_scores_gemma":[0.97768027,0.000025652396,0.020846505,0.000037302685,0.0000898194,0.0001757254,5.285335e-7,0.0000070625333,0.0011371636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998647,0.00007054684,0.0002363949,0.00020220724,0.0005467676,0.00029713477],"domain_scores_gemma":[0.99548024,0.0038185976,0.00006585876,0.0003105486,0.00028431555,0.000040467006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026716245,0.00007202713,0.00007278527,0.00022714531,0.00021121233,0.00033069815,0.001321027,0.00004319982,0.000016305601],"category_scores_gemma":[0.0007159951,0.00003913709,0.00006289739,0.00022977953,0.00008465497,0.00044280256,0.00027693127,0.00012218657,0.000038554892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027156419,0.000070545146,0.00015256193,0.000025770323,0.000023781513,9.937959e-7,0.0003724237,0.000028106513,0.0002790574,0.9561499,0.00033507793,0.04253465],"study_design_scores_gemma":[0.00032533822,0.00013035227,0.0003709871,0.00013901285,0.0000017698192,0.0000018881849,0.00007707706,0.03219183,0.00057357526,0.95623887,0.009876515,0.00007279296],"about_ca_topic_score_codex":0.000006197133,"about_ca_topic_score_gemma":0.00006347031,"teacher_disagreement_score":0.9510615,"about_ca_system_score_codex":0.00005609289,"about_ca_system_score_gemma":0.0000396944,"threshold_uncertainty_score":0.318893},"labels":[],"label_agreement":null},{"id":"W2963225323","doi":"","title":"Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Univariate; Algorithm; Polynomial; Bivariate analysis; Gröbner basis; Decoding methods; Mathematics; Computer science; Polynomial matrix; Algebra over a field; Matrix polynomial; Multivariate statistics","score_opus":0.010147098928548724,"score_gpt":0.25593090733220786,"score_spread":0.24578380840365913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963225323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060124543,0.0001946374,0.9311076,0.0041577104,0.00026850792,0.00080502854,0.00015244672,0.00017469305,0.003014841],"genre_scores_gemma":[0.8363171,0.000079559766,0.1628921,0.00005739222,0.00001746917,0.000070571376,0.00012041799,0.000023403703,0.00042193927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954938,0.0022058696,0.0006376694,0.00093832915,0.000393043,0.00033125453],"domain_scores_gemma":[0.9945923,0.0010142085,0.0005869737,0.0024530173,0.0011621007,0.00019140144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004686772,0.00028242395,0.00037057468,0.00045458588,0.00027165844,0.00034865053,0.0018503354,0.00017518422,0.000013867482],"category_scores_gemma":[0.00034346644,0.00032057098,0.00014833787,0.0008859259,0.00012227673,0.00011854756,0.0027603672,0.00033076666,0.000024487232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003878179,0.00048644943,0.0006441348,0.00018205498,0.0001251186,0.0000015484054,0.015329146,0.004097012,0.01149414,0.86118543,0.0003325068,0.10608369],"study_design_scores_gemma":[0.0028999767,0.000007751789,0.023857044,0.0022060352,0.00018908455,0.00002030123,0.00036563736,0.83473766,0.0721592,0.049486957,0.0122653525,0.0018049697],"about_ca_topic_score_codex":0.0008634645,"about_ca_topic_score_gemma":0.00014441785,"teacher_disagreement_score":0.8306407,"about_ca_system_score_codex":0.00006890993,"about_ca_system_score_gemma":0.00023939331,"threshold_uncertainty_score":0.99992466},"labels":[],"label_agreement":null},{"id":"W2963245222","doi":"10.1016/j.jnt.2011.02.006","title":"La suite de Thue--Morse le long des multiples d'entiers","year":2011,"lang":"fr","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Integer (computer science); Hamming weight; Subsequence; Morse code; Base (topology); Sequence (biology); Discrete mathematics; Multiple; Square-free integer; Hamming code; Binary number; Arithmetic; Statistics; Mathematical analysis; Decoding methods","score_opus":0.02978019369975616,"score_gpt":0.22106855905822567,"score_spread":0.19128836535846952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963245222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21803537,0.005418431,0.6787839,0.0027315577,0.00042491884,0.00022650654,0.000016768941,0.0003266523,0.09403591],"genre_scores_gemma":[0.84654814,0.00088721095,0.13925645,0.00012821156,0.000024053981,0.000026069743,0.000017998243,0.00004022181,0.013071668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98810744,0.009589653,0.0004619722,0.0007419454,0.00033131454,0.00076769915],"domain_scores_gemma":[0.9945399,0.0017142404,0.00030957637,0.001946946,0.001090558,0.00039874928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009198628,0.00034769392,0.0002951979,0.00026230895,0.000908271,0.0006778046,0.0022281143,0.0002464248,0.00024832084],"category_scores_gemma":[0.0010900724,0.00040172957,0.000337846,0.0011202077,0.0015318122,0.0008971445,0.0009199052,0.00048966374,0.00010322075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018607025,0.00088454975,0.02204417,0.00010410442,0.000074338524,0.000038688828,0.058730893,0.000010029145,0.0009924734,0.7315785,0.00046166225,0.18506196],"study_design_scores_gemma":[0.003939648,0.000009186572,0.2419564,0.007396166,0.00029615953,0.0007394395,0.004016943,0.07262254,0.23172818,0.28857124,0.14580306,0.002921056],"about_ca_topic_score_codex":0.0031019358,"about_ca_topic_score_gemma":0.0030645975,"teacher_disagreement_score":0.62851274,"about_ca_system_score_codex":0.000091228336,"about_ca_system_score_gemma":0.00034684228,"threshold_uncertainty_score":0.9998435},"labels":[],"label_agreement":null},{"id":"W2963336182","doi":"10.1109/isit.2016.7541434","title":"On deep holes of projective Reed-Solomon codes","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre de Recherches Mathématiques; National Science Foundation","keywords":"Reed–Solomon error correction; Projective test; Reed–Muller code; Computer science; RADIUS; Mathematics; Decoding methods; Algorithm; Concatenated error correction code; Block code; Pure mathematics; Computer security","score_opus":0.01100211429692679,"score_gpt":0.2298730084517459,"score_spread":0.2188708941548191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963336182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13529153,0.00001692539,0.8306586,0.00031891715,0.0000915635,0.000081800405,0.0000012227539,0.00013250546,0.033406936],"genre_scores_gemma":[0.99379784,0.0000048629545,0.005912857,0.00009810364,0.000010819589,0.000005263737,6.739673e-8,0.0000024508613,0.00016771219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994575,0.000051416024,0.000087071116,0.00018368925,0.00010944713,0.00011091516],"domain_scores_gemma":[0.99935466,0.00022440207,0.000041492654,0.00031032652,0.000042826185,0.000026311222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001818461,0.00005907166,0.00008192565,0.00009182227,0.00003549773,0.00001460169,0.0003820161,0.000025754447,0.000022648097],"category_scores_gemma":[0.000038337017,0.00003467406,0.000053375188,0.00020094331,0.00009781113,0.00014670794,0.00008378531,0.000026663429,0.000026557182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019573192,0.000042338906,0.00042059732,0.0000022711113,0.000008564453,9.637125e-7,0.00025232878,9.2452217e-7,0.005020725,0.91413784,0.00009716577,0.0799967],"study_design_scores_gemma":[0.0004604345,0.0007996654,0.004495281,0.00009029212,0.0000047873777,0.0000042572974,0.00007226177,0.0004040062,0.1805905,0.8125377,0.00034161008,0.0001991679],"about_ca_topic_score_codex":0.000005892093,"about_ca_topic_score_gemma":0.000009830292,"teacher_disagreement_score":0.8585063,"about_ca_system_score_codex":0.000007059677,"about_ca_system_score_gemma":0.000011207831,"threshold_uncertainty_score":0.14139672},"labels":[],"label_agreement":null},{"id":"W2963410748","doi":"10.4153/cjm-2016-004-8","title":"Number of Right Ideals and a <i>q</i>-analogue of Indecomposable Permutations","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Indecomposable module; Codimension; Noncommutative geometry; Combinatorics; Field (mathematics); Pure mathematics; Laurent polynomial; Discrete mathematics; Algebra over a field","score_opus":0.012424748791594819,"score_gpt":0.23566398146780285,"score_spread":0.22323923267620802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963410748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6749265,0.00013601054,0.32156524,0.0009065646,0.000114969334,0.00005377864,0.000020127802,0.000004137572,0.002272684],"genre_scores_gemma":[0.9584426,0.0000124490625,0.041458577,0.000036128964,0.000012980961,3.5499227e-7,8.77011e-8,0.0000038923545,0.000032926095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992735,0.00003900467,0.0003902053,0.000056577555,0.00011872684,0.00012201922],"domain_scores_gemma":[0.9987744,0.00026830542,0.00035427982,0.00018918663,0.00020069841,0.00021309916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004954101,0.00006202702,0.00021357501,0.00019125779,0.000045181492,0.000022315558,0.0003584681,0.000032392392,0.00007456458],"category_scores_gemma":[0.000120847726,0.000041401323,0.00008204519,0.00020024703,0.00012506593,0.00018863205,0.000017446244,0.000050821025,0.0000029208463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017209666,0.000036876787,0.005321235,0.00007592594,0.00007909969,0.00002615272,0.002326916,0.000008784688,0.0009549564,0.98855287,0.0007642805,0.0018511928],"study_design_scores_gemma":[0.000530851,0.00013011551,0.002228793,0.0005666671,0.000058216574,0.0007196335,0.0002501604,0.00034539003,0.0043050577,0.9892425,0.0014727779,0.0001498461],"about_ca_topic_score_codex":0.00008721194,"about_ca_topic_score_gemma":0.0006893604,"teacher_disagreement_score":0.2835161,"about_ca_system_score_codex":0.000015068437,"about_ca_system_score_gemma":0.00028908503,"threshold_uncertainty_score":0.1688297},"labels":[],"label_agreement":null},{"id":"W2963680237","doi":"10.4064/aa8252-3-2016","title":"On a problem of Sidon for polynomials over finite fields","year":2016,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Omega; Integer (computer science); Sequence (biology); Combinatorics; Discrete mathematics; Physics","score_opus":0.012347681773915865,"score_gpt":0.2410096026789031,"score_spread":0.22866192090498721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963680237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07603222,0.000027232203,0.9082705,0.0064770463,0.0002589411,0.00038855954,0.000024272967,0.00012392891,0.008397319],"genre_scores_gemma":[0.97459704,0.000006740116,0.024681987,0.00041216827,0.000038232218,0.000027549244,3.6207564e-7,0.0000061494898,0.00022976245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992329,0.00004041673,0.0001720205,0.00023608841,0.00012267324,0.00019593615],"domain_scores_gemma":[0.99798936,0.0014122484,0.00007542401,0.00042923962,0.00004256282,0.00005115492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002764195,0.00009270782,0.00014212678,0.00011253625,0.000050486837,0.000030377156,0.00048535393,0.00006286432,0.00006224284],"category_scores_gemma":[0.00014208475,0.00006138099,0.000117931064,0.00016635853,0.00005455281,0.00014042371,0.00010074394,0.00004295355,0.0000090776075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008166625,0.00013499414,0.00007646679,0.000019892606,0.000030288422,0.0000010565551,0.00017658694,0.0000021944168,0.009834569,0.8960552,0.0035038083,0.09008325],"study_design_scores_gemma":[0.0015392139,0.0018203377,0.0008565781,0.00020034303,0.00002481144,0.0000030560416,0.000005265835,0.0010458791,0.05709127,0.89483637,0.042236023,0.00034085623],"about_ca_topic_score_codex":0.0000035304333,"about_ca_topic_score_gemma":0.0000019224115,"teacher_disagreement_score":0.8985648,"about_ca_system_score_codex":0.000007423517,"about_ca_system_score_gemma":0.000024993928,"threshold_uncertainty_score":0.2503044},"labels":[],"label_agreement":null},{"id":"W2963692803","doi":"10.1016/j.ffa.2012.02.004","title":"On a conjecture of polynomials with prescribed range","year":2012,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Multiset; Finite field; Conjecture; Multiplicity (mathematics); Combinatorics; Integer (computer science); Discrete mathematics; Polynomial; Field (mathematics); Degree (music); Range (aeronautics); Pure mathematics; Mathematical analysis; Physics","score_opus":0.010380977272338545,"score_gpt":0.20909048490546786,"score_spread":0.1987095076331293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963692803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032982618,0.00039542813,0.9582075,0.0005412353,0.000029267623,0.00024911648,0.00002029934,0.000055217504,0.0075193136],"genre_scores_gemma":[0.9977571,0.0000103901875,0.0017979777,0.00026691548,0.000039910672,0.000086600434,0.0000022036322,0.0000031261768,0.000035811987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964654,0.000021890304,0.000076281525,0.00010776278,0.00004021367,0.00010728289],"domain_scores_gemma":[0.99929994,0.00027620766,0.0000443814,0.00031287593,0.000016876362,0.00004971757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010018914,0.000068681664,0.00008775431,0.000049291575,0.0000744072,0.000018578363,0.00018473236,0.000043839023,0.000017741118],"category_scores_gemma":[0.000005130311,0.000045162073,0.000029526602,0.00017516199,0.000039114093,0.000077016855,0.000040086503,0.000069819456,0.0000039016354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014677796,0.00006929526,0.00047971145,0.000009044715,0.000016612797,5.291411e-8,0.0014520282,0.000005308172,0.00013301293,0.98423535,0.00014611265,0.013438814],"study_design_scores_gemma":[0.0026718322,0.0018313687,0.019327931,0.00018881085,0.00008021,0.000039513772,0.00040708703,0.0020356376,0.022157935,0.71864825,0.2314684,0.001143032],"about_ca_topic_score_codex":0.000004596464,"about_ca_topic_score_gemma":0.000001958774,"teacher_disagreement_score":0.9647744,"about_ca_system_score_codex":0.0000013727125,"about_ca_system_score_gemma":0.0000072952457,"threshold_uncertainty_score":0.18416558},"labels":[],"label_agreement":null},{"id":"W2963700364","doi":"10.3934/amc.2017056","title":"On the performance of optimal double circulant even codes","year":2017,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Mathematics; Dual (grammatical number); Decoding methods; Weight distribution; Bounded function; Minimum distance; Minimum weight; Combinatorics; Discrete mathematics; Distribution (mathematics); Algorithm; Mathematical analysis","score_opus":0.03960450188849118,"score_gpt":0.32103007023788704,"score_spread":0.28142556834939586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963700364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8755555,0.0014538268,0.069983736,0.001864514,0.00009511465,0.0003791494,0.000008208179,0.00003884678,0.050621103],"genre_scores_gemma":[0.92702454,0.0009022352,0.072020195,0.000011317325,0.0000020409607,0.000023145183,5.984095e-7,0.0000029336318,0.000013015429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942833,0.00004079528,0.00024124348,0.000073463874,0.00013190084,0.00008425483],"domain_scores_gemma":[0.9953197,0.0007392498,0.0003388363,0.0035306267,0.000059208993,0.000012379351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005974363,0.00006146789,0.0001378292,0.000055998556,0.00027804996,0.00003208089,0.004372907,0.000018042692,0.0000046470554],"category_scores_gemma":[0.00009432998,0.000044475335,0.000048417405,0.00010878452,0.0003682168,0.0003810295,0.00054939,0.0001072475,0.0000031287946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004204082,0.00013680736,0.00039173278,0.000036823556,0.000006481602,5.4500152e-8,0.0009830551,0.00068542815,0.00018802009,0.996009,0.0000044493004,0.0015539693],"study_design_scores_gemma":[0.00044647974,0.00015776423,0.0017680541,0.00069891405,0.000012552647,0.0000038088178,0.00031458336,0.13853857,0.010115047,0.8466424,0.001127779,0.00017404795],"about_ca_topic_score_codex":0.0000039388406,"about_ca_topic_score_gemma":0.000012947261,"teacher_disagreement_score":0.14936657,"about_ca_system_score_codex":0.000005713597,"about_ca_system_score_gemma":0.000016976062,"threshold_uncertainty_score":0.81260216},"labels":[],"label_agreement":null},{"id":"W2963782751","doi":"10.1007/s12190-016-1042-7","title":"Algebraic quantum synchronizable codes","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Mathematics and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"BCH code; Mathematics; Expander code; Discrete mathematics; Block code; Linear code; Extension (predicate logic); Intersection (aeronautics); Algorithm; Computer science; Error detection and correction; Decoding methods","score_opus":0.010122908029831243,"score_gpt":0.21649620788739593,"score_spread":0.2063732998575647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963782751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18798926,0.00012579265,0.8098916,0.00019387598,0.000104671606,0.000036513655,1.9557598e-7,0.000028392866,0.0016297243],"genre_scores_gemma":[0.8164664,0.000031979394,0.18335108,0.000062840336,0.00007646722,3.1631149e-7,1.9206661e-8,0.000006028794,0.0000048776583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991232,0.000009622639,0.000377203,0.00011686679,0.00019376735,0.00017929504],"domain_scores_gemma":[0.9988975,0.00038380822,0.00037686274,0.00018885224,0.0000700012,0.00008296387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008314686,0.00010479442,0.00023823678,0.00011461421,0.00012231238,0.000116635,0.00043444536,0.00003309834,0.000006538662],"category_scores_gemma":[0.000024078014,0.000063742045,0.00006967204,0.0001645445,0.00005010735,0.00013329137,0.00017599629,0.000087555585,0.000005131747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064103483,0.000047662084,0.000009645778,0.00003677454,0.000029556964,0.0000060976654,0.00062901655,0.000014541341,0.0073209223,0.916805,0.00012579108,0.07496858],"study_design_scores_gemma":[0.00060561736,0.0001556574,0.000049108374,0.00034763198,0.000021596981,0.0002208566,0.00020152527,0.026698062,0.005086601,0.965698,0.00072579365,0.00018955104],"about_ca_topic_score_codex":1.4780895e-7,"about_ca_topic_score_gemma":7.8533496e-8,"teacher_disagreement_score":0.62847716,"about_ca_system_score_codex":0.000012685993,"about_ca_system_score_gemma":0.000030017154,"threshold_uncertainty_score":0.25993252},"labels":[],"label_agreement":null},{"id":"W2963861488","doi":"10.22215/etd/2018-13380","title":"Composed Product and Factorization of Cyclotomic Polynomials Over Finite Fields","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Finite field; Cyclotomic polynomial; Mathematics; Factorization; Prime (order theory); Prime power; Modulo; Divisor (algebraic geometry); Product (mathematics); Field (mathematics); Cyclotomic field; Factorization of polynomials; Prime factor; Combinatorics; Polynomial; Discrete mathematics; Arithmetic; Pure mathematics; Matrix polynomial; Algorithm; Mathematical analysis","score_opus":0.009301017107973144,"score_gpt":0.2460644579323794,"score_spread":0.23676344082440626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963861488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82307565,0.00025976312,0.15931764,0.00006485144,0.0021252576,0.0004729552,0.000012321328,0.00018915362,0.014482412],"genre_scores_gemma":[0.99548435,0.00003781817,0.0029082885,0.00005530913,0.00011121391,0.0000059649074,0.00007867868,0.000009695362,0.001308683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990806,0.000050361985,0.00025070645,0.00034937888,0.00014872545,0.000120241966],"domain_scores_gemma":[0.9991577,0.0001071705,0.00020619581,0.00039754942,0.00009332863,0.000038013935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016322019,0.0001603464,0.00023179119,0.00020077555,0.00006571347,0.0000723407,0.0003735608,0.00013518885,0.00008369343],"category_scores_gemma":[0.00004259219,0.0001443332,0.00007037507,0.00023500792,0.000032695894,0.00020406576,0.000050132676,0.00009415917,0.000004937892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009114741,0.0006106765,0.009968014,0.0018800958,0.0006716488,0.000009110357,0.023568492,0.000034557394,0.13405752,0.6069479,0.014346176,0.20699434],"study_design_scores_gemma":[0.0025403665,0.0015463246,0.17468642,0.00092832936,0.0002446939,0.00000953574,0.0003623318,0.007857066,0.59479743,0.19545725,0.018747864,0.0028223551],"about_ca_topic_score_codex":0.000033869903,"about_ca_topic_score_gemma":0.00004714518,"teacher_disagreement_score":0.46073994,"about_ca_system_score_codex":0.0000059783115,"about_ca_system_score_gemma":0.00004815533,"threshold_uncertainty_score":0.5885737},"labels":[],"label_agreement":null},{"id":"W2963943201","doi":"10.1016/j.tcs.2018.06.039","title":"Constructing de Bruijn sequences by concatenating smaller universal cycles","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Disjoint sets; De Bruijn graph; Set (abstract data type); Combinatorics; Mathematics; Discrete mathematics; Algorithm; Computer science","score_opus":0.010244523004723291,"score_gpt":0.2417172559699828,"score_spread":0.23147273296525953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963943201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.175996,0.00001708225,0.81043464,0.00071147445,0.0004479893,0.000068274254,0.0000016761707,0.00029581835,0.012027064],"genre_scores_gemma":[0.8207243,0.00000149514,0.17854016,0.0005704137,0.0001509488,0.0000016212895,3.7016653e-7,0.0000056838276,0.0000050161075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976366,0.00019189848,0.00023248733,0.00070797425,0.00047448793,0.0007565428],"domain_scores_gemma":[0.99846226,0.00041468814,0.00009491158,0.0005043802,0.00022768935,0.00029608625],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019576054,0.00018872796,0.00017858567,0.00017653004,0.0008827592,0.0006177855,0.0027937836,0.000059603946,0.000076632554],"category_scores_gemma":[0.0001088743,0.0001640013,0.00006810018,0.0013034432,0.00933404,0.00078725826,0.0009723115,0.00020960416,0.00004661098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055402047,0.000017193497,0.000425831,0.0000026219855,0.0000050383205,0.000007860001,0.00075275206,0.000003817678,0.0026379658,0.9301869,0.00007293524,0.065881506],"study_design_scores_gemma":[0.00030307623,0.00040927512,0.00024073261,0.00005819763,0.000007226088,0.00016088292,0.0002088287,0.38412574,0.041111406,0.5726906,0.000245246,0.00043878556],"about_ca_topic_score_codex":0.000011587838,"about_ca_topic_score_gemma":0.0000015983758,"teacher_disagreement_score":0.6447283,"about_ca_system_score_codex":0.0000882635,"about_ca_system_score_gemma":0.00018528383,"threshold_uncertainty_score":0.993362},"labels":[],"label_agreement":null},{"id":"W2963965013","doi":"10.1007/978-3-319-55589-8_11","title":"Constacyclic Codes over Finite Principal Ideal Rings","year":2017,"lang":"en","type":"book-chapter","venue":"Digital Kenyon (Kenyon College)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Principal ideal; Ideal (ethics); Ring (chemistry); Isomorphism (crystallography); Principal (computer security); Principal ideal ring; Dual (grammatical number); Discrete mathematics; Computer science; Mathematics; Combinatorics; Commutative ring; Crystallography","score_opus":0.017059826668799287,"score_gpt":0.23443577686962072,"score_spread":0.21737595020082143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963965013","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010536193,0.00060324697,0.00642067,0.00019710248,0.0015839505,0.0007114123,0.0010290464,0.0007750483,0.9876259],"genre_scores_gemma":[0.41896653,0.0003266551,0.0010844275,0.0007188956,0.0007249307,0.00006087761,0.00017224308,0.00021518457,0.57773024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99540734,0.000043021802,0.0009091332,0.001629505,0.0010674505,0.00094355707],"domain_scores_gemma":[0.9949239,0.000657899,0.0009108767,0.002744464,0.00024896752,0.00051391154],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00045326052,0.0011190765,0.0011378394,0.0006470543,0.0007899317,0.0022211443,0.0035028001,0.000699153,0.0003638745],"category_scores_gemma":[0.00016419911,0.0011426753,0.0009199178,0.00013161043,0.00075825857,0.002176772,0.0018073248,0.00095708884,0.00074487296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008828748,0.00007207777,0.00023317272,0.00008085077,0.0002129673,0.00043473582,0.00014484146,0.000006220157,0.000011305414,0.97564584,0.005293627,0.01777606],"study_design_scores_gemma":[0.00088359654,0.00026531465,0.00022241188,0.0005378837,0.00005308588,0.000077987585,0.000008049359,0.00039868607,0.000064377,0.2210626,0.77508277,0.0013432432],"about_ca_topic_score_codex":0.000016504962,"about_ca_topic_score_gemma":0.0000437479,"teacher_disagreement_score":0.76978916,"about_ca_system_score_codex":0.00014642112,"about_ca_system_score_gemma":0.00036010944,"threshold_uncertainty_score":0.99910235},"labels":[],"label_agreement":null},{"id":"W2963971814","doi":"10.1016/j.ffa.2014.02.006","title":"On the inverses of some classes of permutations of finite fields","year":2014,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Class (philosophy); Algebra over a field; Field (mathematics); Combinatorics; Pure mathematics; Discrete mathematics; Computer science","score_opus":0.015100497092835462,"score_gpt":0.22195010277631844,"score_spread":0.20684960568348298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963971814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07145831,0.00007329065,0.9210679,0.0015302392,0.000036051802,0.00016783096,0.00003372671,0.000023174527,0.005609471],"genre_scores_gemma":[0.99878275,0.000044308585,0.000740072,0.00033353362,0.000018161767,0.000046248508,0.0000032166804,0.000002659277,0.000029060486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995062,0.0000504446,0.00018428593,0.00012175579,0.000066333116,0.000071002425],"domain_scores_gemma":[0.99708533,0.002250753,0.00012602106,0.00044930316,0.00006552857,0.000023083998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017441674,0.00006872163,0.00012086058,0.000082273706,0.00009386328,0.000012203015,0.00035411012,0.000055116772,0.000022857179],"category_scores_gemma":[0.000077298675,0.00004599403,0.00007296118,0.00027636383,0.00010704788,0.00006445602,0.00007315515,0.000088185734,0.0000020017367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000318947,0.000050945986,0.000115229515,0.000020260068,0.000014605699,1.4225102e-8,0.0008920131,0.00017055188,0.00022081625,0.9925535,0.000112701,0.0058462215],"study_design_scores_gemma":[0.00013373856,0.00022401272,0.0009523924,0.00003972589,0.000011987273,5.256564e-7,0.00022419069,0.0110460315,0.007583516,0.9750093,0.004687341,0.00008720951],"about_ca_topic_score_codex":0.000011045971,"about_ca_topic_score_gemma":0.0000062937224,"teacher_disagreement_score":0.9273244,"about_ca_system_score_codex":0.0000010012949,"about_ca_system_score_gemma":0.000015662725,"threshold_uncertainty_score":0.18755822},"labels":[],"label_agreement":null},{"id":"W2964009544","doi":"","title":"Asymptotic bounds for spherical codes","year":2019,"lang":"en","type":"article","venue":"MPG.PuRe (Max Planck Society)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hamming code; Mathematics; Cardinality (data modeling); Code (set theory); Unit square; Alphabet; Discrete mathematics; Hamming distance; Computability; Combinatorics; Set (abstract data type); Linear code; Block code; Algorithm; Computer science; Decoding methods","score_opus":0.008404612149608321,"score_gpt":0.21766901610359102,"score_spread":0.2092644039539827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964009544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17298041,0.0006412554,0.8019024,0.0016513455,0.0028310767,0.0009074988,0.000040584724,0.0009465962,0.018098814],"genre_scores_gemma":[0.9039138,0.000029590658,0.090090625,0.002454373,0.0004642898,0.000072810835,0.000026771011,0.000039358954,0.0029083586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983763,0.00005054629,0.0002216515,0.00054749293,0.00027961176,0.00052440766],"domain_scores_gemma":[0.99871457,0.0003519637,0.000091839705,0.0006473274,0.00006916667,0.00012516236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038968254,0.0002307899,0.0003025382,0.000032786294,0.00023486951,0.0002637153,0.0009722999,0.00017562616,0.00011736001],"category_scores_gemma":[0.000023530545,0.00021279449,0.00047977263,0.0005198868,0.00008249125,0.0003206949,0.0001840495,0.00022256382,0.00018160343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008204242,0.00028508884,0.017899523,0.0002494994,0.00030440616,0.000008257574,0.0031326571,0.00023147388,0.005699145,0.8569538,0.103908606,0.011245505],"study_design_scores_gemma":[0.0033559445,0.0012501982,0.006077026,0.00017640035,0.000091342736,0.000052894316,0.00057151477,0.039397754,0.0023297262,0.24839558,0.69660085,0.0017007983],"about_ca_topic_score_codex":0.0000030881076,"about_ca_topic_score_gemma":0.0000032524122,"teacher_disagreement_score":0.7309334,"about_ca_system_score_codex":0.000042573763,"about_ca_system_score_gemma":0.00007573774,"threshold_uncertainty_score":0.86775076},"labels":[],"label_agreement":null},{"id":"W2964083059","doi":"10.1007/s00200-019-00381-3","title":"On extremal double circulant self-dual codes of lengths 90–96","year":2019,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Japan Society for the Promotion of Science","keywords":"Circulant matrix; Dual (grammatical number); Mathematics; Code (set theory); Combinatorics; Discrete mathematics; Computer science","score_opus":0.006535158867155918,"score_gpt":0.20682669579713003,"score_spread":0.20029153692997412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964083059","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8918137,0.00039813758,0.10545989,0.00009033706,0.000059421487,0.00023105653,5.0207575e-7,0.00025157907,0.0016953785],"genre_scores_gemma":[0.9800426,0.00005094304,0.01980682,0.000058752707,0.000009996868,0.0000112185835,0.0000031630727,0.000011137383,0.000005411446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990423,0.000048002945,0.00028408208,0.0002643303,0.00014199819,0.00021933479],"domain_scores_gemma":[0.9985,0.00045616028,0.000094271396,0.00087084377,0.000030307621,0.000048456062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056870515,0.00014171729,0.00022309467,0.0001775834,0.00007327203,0.00006531084,0.00067741645,0.000059353482,0.0000051735856],"category_scores_gemma":[0.000008616938,0.00015214294,0.000047045567,0.00046802638,0.000023008308,0.0001411303,0.0004110966,0.0002376539,0.00000966815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116229785,0.00011286602,0.0019319737,0.00008640578,0.000023465202,8.711788e-7,0.0008374664,0.02774063,0.0029909608,0.95909214,0.0000104251985,0.0071611432],"study_design_scores_gemma":[0.0013511806,0.000120983,0.005778454,0.00030302146,0.000008226103,0.000020255842,0.00010897786,0.97642994,0.004680768,0.009783869,0.0010157789,0.0003985708],"about_ca_topic_score_codex":0.000026520072,"about_ca_topic_score_gemma":0.0000012084571,"teacher_disagreement_score":0.9493083,"about_ca_system_score_codex":0.000021699132,"about_ca_system_score_gemma":0.000014099287,"threshold_uncertainty_score":0.6204209},"labels":[],"label_agreement":null},{"id":"W2964086002","doi":"10.1007/s10801-018-0812-8","title":"Construction and nonexistence of strong external difference families","year":2018,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lambda; Algebraic number; Combinatorics; Algebraic combinatorics; Range (aeronautics); Scope (computer science); Discrete mathematics; Character (mathematics); Mathematical analysis; Geometry; Physics; Quantum mechanics; Computer science","score_opus":0.010477650962763556,"score_gpt":0.2262110500473466,"score_spread":0.21573339908458303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964086002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7775412,0.00034649423,0.22038381,0.00007177187,0.0009488791,0.000028562128,4.722169e-7,0.000012559143,0.0006662079],"genre_scores_gemma":[0.98756933,0.00012260293,0.012195435,0.00002291983,0.00007193704,3.317173e-7,3.155169e-8,0.0000035693845,0.000013867009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897003,0.00006886501,0.00037271183,0.00012786478,0.00032013084,0.00014037768],"domain_scores_gemma":[0.99874383,0.0001500563,0.00045611692,0.00022016725,0.0003386347,0.00009118794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004144271,0.0001019111,0.00022130003,0.00023339385,0.00009546679,0.00006384675,0.0005449187,0.000044036267,0.000006507441],"category_scores_gemma":[0.000073715564,0.000086862136,0.0000803056,0.00043423072,0.0003401461,0.0002987223,0.00015186066,0.00017174547,8.8145833e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002530095,0.00005885108,0.00984696,0.00001760133,0.000021928752,0.000007200327,0.00069221965,5.3446564e-7,0.0025217996,0.94851196,0.00001569115,0.038279977],"study_design_scores_gemma":[0.00089297595,0.0017606427,0.0531665,0.00020629629,0.0000313546,0.00056316843,0.00034938846,0.00072212884,0.008712068,0.93314,0.00026224946,0.00019321904],"about_ca_topic_score_codex":0.0000031512109,"about_ca_topic_score_gemma":7.2924036e-7,"teacher_disagreement_score":0.21002807,"about_ca_system_score_codex":0.000018232085,"about_ca_system_score_gemma":0.000064460866,"threshold_uncertainty_score":0.3542135},"labels":[],"label_agreement":null},{"id":"W2964100793","doi":"10.1016/j.ffa.2018.01.011","title":"A group action on multivariate polynomials over finite fields","year":2018,"lang":"en","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Finite field; Polynomial ring; Invariant (physics); Prime power; Invariant theory; Invariant polynomial; Prime (order theory); Action (physics); Polynomial; Finite group; Pure mathematics; Combinatorics; Group ring; Algebra over a field; Discrete mathematics; Group (periodic table); Matrix polynomial; Mathematical analysis","score_opus":0.029540127908605333,"score_gpt":0.2661090079301746,"score_spread":0.23656888002156928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964100793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19810313,0.00014317008,0.6180771,0.01947442,0.0062906686,0.000924832,0.00004082689,0.0019684634,0.1549774],"genre_scores_gemma":[0.99056476,0.000022562002,0.0072424076,0.00086531235,0.001021057,0.000089934154,0.000020088619,0.000026554831,0.00014729025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970579,0.0004349837,0.00047979722,0.0008217739,0.00057935226,0.0006261591],"domain_scores_gemma":[0.9977961,0.00045779123,0.00028180264,0.00090527645,0.00022474398,0.0003342456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007387394,0.00037187137,0.00031864736,0.00052096037,0.0008386163,0.00038953463,0.0010606728,0.00039706266,0.0000620235],"category_scores_gemma":[0.00037017875,0.0003505086,0.00024960813,0.00090201996,0.000031613636,0.0007587912,0.0003272991,0.00049873185,0.00005504842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023576668,0.00033907904,0.00010480923,0.00001711567,0.00007508826,0.000040270344,0.0010013682,0.000025080644,0.004270084,0.985012,0.0007308837,0.008148449],"study_design_scores_gemma":[0.0013429072,0.00045588784,0.007251204,0.00012225533,0.000033577337,0.00022209102,0.00006249114,0.004296644,0.004569329,0.010085811,0.9709388,0.00061903],"about_ca_topic_score_codex":0.0000020340656,"about_ca_topic_score_gemma":0.00008431206,"teacher_disagreement_score":0.9749262,"about_ca_system_score_codex":0.00022836949,"about_ca_system_score_gemma":0.00016747143,"threshold_uncertainty_score":0.9998947},"labels":[],"label_agreement":null},{"id":"W2964162826","doi":"10.1016/j.jnt.2015.09.008","title":"On the number of N-free elements with prescribed trace","year":2015,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; TRACE (psycholinguistics); Combinatorics","score_opus":0.02272514160561887,"score_gpt":0.2591571500289095,"score_spread":0.23643200842329062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964162826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80563605,0.00013676989,0.10785667,0.0020088744,0.00070229603,0.0002018622,0.000015731703,0.000046980404,0.08339474],"genre_scores_gemma":[0.99010444,0.0000039899937,0.009006655,0.00039379302,0.0000893345,0.0000028301129,1.9268101e-7,0.000010709486,0.0003880698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983278,0.00044217202,0.0003565678,0.00011772099,0.0005788776,0.00017684199],"domain_scores_gemma":[0.99779415,0.0007129611,0.00046976627,0.00063926034,0.00026500816,0.00011885862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025231054,0.00012312405,0.00019753975,0.000055390312,0.000058722577,0.00005707831,0.0015366519,0.00003598762,0.0005549539],"category_scores_gemma":[0.00029151744,0.00006705847,0.00013590752,0.00031186594,0.00011876945,0.00033072248,0.00013680533,0.00025937904,0.000036971513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006009912,0.00022984532,0.00195484,0.0000062178256,0.00014278738,0.000032433632,0.0018985954,0.000029599547,0.00006875113,0.9650861,0.026052762,0.00389709],"study_design_scores_gemma":[0.0012586575,0.00038292113,0.000814219,0.00014204124,0.00003627684,0.0003173347,0.00038110084,0.00006876728,0.0011883209,0.98595124,0.009326255,0.0001328814],"about_ca_topic_score_codex":0.0000012753105,"about_ca_topic_score_gemma":7.9062187e-7,"teacher_disagreement_score":0.18446836,"about_ca_system_score_codex":0.000021534415,"about_ca_system_score_gemma":0.000092881826,"threshold_uncertainty_score":0.60763556},"labels":[],"label_agreement":null},{"id":"W2966790914","doi":"10.5539/mas.v13n8p150","title":"The Possibility of Applying Rumen Research at the Projective Plane PG (2,17)","year":2019,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Paragraph; Projective plane; Set (abstract data type); Projection (relational algebra); Plane (geometry); Mathematics; Constraint (computer-aided design); Blocking (statistics); Combinatorics; Discrete mathematics; Pure mathematics; Computer science; Geometry; Algorithm","score_opus":0.03448192112627413,"score_gpt":0.30444077740428416,"score_spread":0.26995885627801003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966790914","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8001076,0.00014834722,0.10635241,0.00067424215,0.00025618408,0.0020453657,0.000004297775,0.0001133368,0.090298206],"genre_scores_gemma":[0.9983925,0.0000034340594,0.0008532023,0.0000665846,0.000017483944,0.00012546638,2.4801764e-7,0.0000047794515,0.00053628284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698025,0.00015220602,0.0002156199,0.0007229601,0.001301255,0.0006277029],"domain_scores_gemma":[0.9970183,0.0009050839,0.000103938866,0.0017154353,0.00018149387,0.000075799624],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00928689,0.000118718664,0.00013226336,0.00012960754,0.0018026023,0.00031330154,0.0037939067,0.00003768268,0.000014722695],"category_scores_gemma":[0.000068799214,0.000064667445,0.000054375578,0.0019249364,0.001957847,0.00024872128,0.0017436518,0.00032701317,0.000082169354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013565252,0.00008169833,0.0013075038,0.000017532475,0.000012249633,7.90385e-7,0.008971229,0.00016139129,0.4089287,0.4967132,0.00022771294,0.08344233],"study_design_scores_gemma":[0.0005269167,0.00026501477,0.014246,0.00003396994,0.000005683197,0.000013053056,0.0015132017,0.15025875,0.08413288,0.7442501,0.0043570898,0.0003973353],"about_ca_topic_score_codex":0.000037567257,"about_ca_topic_score_gemma":0.000032813532,"teacher_disagreement_score":0.3247958,"about_ca_system_score_codex":0.000108344146,"about_ca_system_score_gemma":0.00025283496,"threshold_uncertainty_score":0.99949694},"labels":[],"label_agreement":null},{"id":"W2967737995","doi":"10.1016/j.ffa.2020.101687","title":"Classification of multivariate skew polynomial rings over finite fields via affine transformations of variables","year":2020,"lang":"en","type":"preprint","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Danmarks Frie Forskningsfond","keywords":"Mathematics; Polynomial ring; Ring (chemistry); Skew; Polynomial; Automorphism; Diagonal; Finite field; Pure mathematics; Field (mathematics); Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.021477965358708686,"score_gpt":0.24511429906311336,"score_spread":0.22363633370440467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967737995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002948682,0.0001663421,0.99073654,0.0015908632,0.000119217846,0.00054250995,0.00026402975,0.00009631334,0.0035354977],"genre_scores_gemma":[0.9863568,0.00017030307,0.012782096,0.00015170165,0.00010037367,0.0002610257,0.00012789785,0.000012063045,0.00003771972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986003,0.000070113776,0.0005941424,0.00043793747,0.00012840224,0.00016911712],"domain_scores_gemma":[0.99792784,0.0006567756,0.00040571115,0.0007979512,0.0001233405,0.00008836196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023272222,0.0002454423,0.00038686438,0.00020126079,0.0001495681,0.00006751397,0.0008012107,0.00035840325,0.00004772872],"category_scores_gemma":[0.000033982316,0.00022713256,0.00021133678,0.00045171307,0.000098003766,0.00015243416,0.00041087277,0.00046955983,0.000003090881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006493873,0.00039074532,0.00020665862,0.00073848147,0.00028801494,3.970012e-7,0.00923062,0.0017556621,0.00530805,0.9074941,0.0004198268,0.07410246],"study_design_scores_gemma":[0.0009488296,0.00024558682,0.005896609,0.00029776286,0.0001496864,0.0000032721132,0.00010490028,0.33967695,0.0048880232,0.6171929,0.029832425,0.0007630724],"about_ca_topic_score_codex":0.00010988447,"about_ca_topic_score_gemma":0.000020198553,"teacher_disagreement_score":0.98340815,"about_ca_system_score_codex":0.000008401676,"about_ca_system_score_gemma":0.00008051037,"threshold_uncertainty_score":0.92621976},"labels":[],"label_agreement":null},{"id":"W2969023799","doi":"10.1007/s10623-020-00772-5","title":"Hamming and simplex codes for the sum-rank metric","year":2020,"lang":"en","type":"preprint","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Hamming code; Rank (graph theory); Linear code; Hamming distance; Hamming graph; Discrete mathematics; Hamming bound; Hamming(7,4); Block code; Algorithm; Decoding methods","score_opus":0.05666645853612167,"score_gpt":0.27979653241859404,"score_spread":0.22313007388247236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969023799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062879687,0.013055111,0.9766484,0.0018720049,0.00041347172,0.0010246912,0.000106560496,0.0003443503,0.00024747956],"genre_scores_gemma":[0.8978882,0.0032648703,0.097065575,0.001088711,0.00024225222,0.00036752925,0.000027214744,0.000048126414,0.000007550343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713427,0.00023919993,0.0004664259,0.0012236405,0.0003537271,0.00058273855],"domain_scores_gemma":[0.9962032,0.0021462925,0.00028279118,0.0009459376,0.0001506282,0.00027114793],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011175412,0.00059174065,0.0006753252,0.00065748254,0.0008929963,0.0013059924,0.0014896715,0.00028487723,0.000008741104],"category_scores_gemma":[0.00011601208,0.0004500635,0.00055573136,0.0013857771,0.0004337131,0.00021024288,0.0012962967,0.0005913059,0.0000014458883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013422858,0.00007850563,0.0019805573,0.00055942027,0.0007843861,0.000014783418,0.0018629571,0.0001171657,0.0005852013,0.7945234,0.00226538,0.19709402],"study_design_scores_gemma":[0.0012663457,0.0005084654,0.0066632587,0.00025195928,0.0006575345,0.000036921192,0.0005552969,0.050948553,0.00084860803,0.8800738,0.0565342,0.0016550885],"about_ca_topic_score_codex":0.00005171547,"about_ca_topic_score_gemma":0.00001364807,"teacher_disagreement_score":0.8916002,"about_ca_system_score_codex":0.000010118381,"about_ca_system_score_gemma":0.00006812294,"threshold_uncertainty_score":0.99979514},"labels":[],"label_agreement":null},{"id":"W2971765372","doi":"","title":"Gray code for generating tree of permutation with three cycles","year":2015,"lang":"en","type":"article","venue":"ARPN Journal of Engineering and Applied Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Gray code; Permutation (music); Gray (unit); Computer science; Tree (set theory); Algorithm; Mathematics; Combinatorics; Medicine; Physics","score_opus":0.025616388529559476,"score_gpt":0.23147420184914494,"score_spread":0.20585781331958547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971765372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47992912,0.00011043258,0.5197384,0.000048351434,0.000047694877,0.000023671084,3.6246317e-7,0.000007636102,0.000094347],"genre_scores_gemma":[0.81597334,0.0000022854383,0.18397416,0.000008744629,0.000037310496,0.0000015685205,5.5104746e-8,0.0000018674835,6.642104e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999483,0.0000054527713,0.00015141275,0.00008899532,0.00017285816,0.00009829399],"domain_scores_gemma":[0.9995945,0.00010038219,0.00012091793,0.000054892527,0.000067747984,0.000061523635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008088528,0.00005878782,0.00010999051,0.00011554302,0.00007158102,0.000068005684,0.00024812744,0.000012889734,1.5352812e-7],"category_scores_gemma":[0.000027449032,0.0000398512,0.00002545269,0.00023575324,0.00006896742,0.0001970297,0.000018990584,0.00004352141,5.063537e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049594,0.000038570466,0.001736449,0.000041517236,0.000040056708,0.0000024938442,0.0028102715,0.4240783,0.06391058,0.45853147,0.000043871074,0.04871684],"study_design_scores_gemma":[0.0022050377,0.0025405441,0.003804254,0.0002550596,0.00005432337,0.0002249323,0.0014864596,0.8578658,0.06723531,0.06334382,0.0004909983,0.0004934574],"about_ca_topic_score_codex":4.389739e-7,"about_ca_topic_score_gemma":0.0000030218046,"teacher_disagreement_score":0.43378752,"about_ca_system_score_codex":0.0000036055253,"about_ca_system_score_gemma":0.000039163042,"threshold_uncertainty_score":0.16250847},"labels":[],"label_agreement":null},{"id":"W2972280902","doi":"10.1109/tit.2019.2939113","title":"On Inverses of Permutation Polynomials of Small Degree Over Finite Fields","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Dongguan University of Technology; Guangdong Polytechnic of Science and Technology; China Postdoctoral Science Foundation; Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China; Peng Cheng Laboratory; National Science Foundation","keywords":"Finite field; Degree (music); Permutation (music); Inverse; Coding theory; Binomial (polynomial); Class (philosophy); Discrete orthogonal polynomials; Generalized permutation matrix","score_opus":0.015786315832481093,"score_gpt":0.2181984177347041,"score_spread":0.20241210190222303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972280902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19547726,0.0000029567834,0.7975659,0.000029428731,0.00042483117,0.00013782049,0.000013338844,0.000047498535,0.006300978],"genre_scores_gemma":[0.998291,0.000007096644,0.0012042935,0.00039354194,0.0000049447553,0.00000920002,0.0000023404941,0.000003365012,0.00008417988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918467,0.00009852577,0.00034712246,0.00009059171,0.0001777872,0.000101281745],"domain_scores_gemma":[0.9986815,0.00063007197,0.00020972635,0.00036445135,0.000082538216,0.00003172276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041089286,0.00009908663,0.00013774939,0.0004225988,0.000057871766,0.000026473692,0.00028838043,0.00007995842,0.00025764885],"category_scores_gemma":[0.000016959639,0.00009255916,0.0001372492,0.00032052907,0.00004099095,0.00084334775,0.0000023979962,0.00012124512,0.00009947911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053499197,0.00016371463,0.000046127254,0.0001395576,0.000081828475,2.1726022e-7,0.008215114,0.08164681,0.0008597164,0.72306216,0.00007934833,0.18517044],"study_design_scores_gemma":[0.005230303,0.003718013,0.0036223603,0.0006135689,0.0001222665,0.000011325616,0.0016809806,0.13239862,0.51133925,0.33878422,0.0013687429,0.0011103691],"about_ca_topic_score_codex":0.000008254752,"about_ca_topic_score_gemma":0.000002129384,"teacher_disagreement_score":0.80281377,"about_ca_system_score_codex":0.000015564781,"about_ca_system_score_gemma":0.000039137758,"threshold_uncertainty_score":0.3774453},"labels":[],"label_agreement":null},{"id":"W2975353307","doi":"10.1109/isit.2019.8849456","title":"Improved Soft Decoding of Reed-Solomon Codes on Gilbert-Elliott Channels","year":2019,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"List decoding; Decoding methods; Reed–Solomon error correction; Sequential decoding; Algorithm; Berlekamp–Welch algorithm; Concatenated error correction code; Computer science; Block code; Theoretical computer science; Mathematics; Arithmetic","score_opus":0.011934839004199567,"score_gpt":0.22933247536351012,"score_spread":0.21739763635931056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975353307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52136606,0.00006893131,0.42793182,0.00040472546,0.0012045293,0.00033657663,0.0000017131479,0.0003237132,0.04836193],"genre_scores_gemma":[0.9912392,0.000008625888,0.007211081,0.00032850823,0.000035834088,0.00000445056,7.4517123e-7,0.000008063727,0.0011635242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99894905,0.000056187066,0.00021171433,0.000356775,0.000165877,0.00026037524],"domain_scores_gemma":[0.9988611,0.000289954,0.000098826116,0.0006303926,0.00005283644,0.000066928726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042294283,0.00013139992,0.00020550082,0.00018205133,0.000059643706,0.00006953507,0.00075476343,0.00006596975,0.00009716217],"category_scores_gemma":[0.00002962493,0.00011470296,0.00012928597,0.00040656448,0.000038726925,0.000243934,0.0001801528,0.000106380394,0.0000888979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006996005,0.00013853975,0.0013081356,0.000046390196,0.000042293395,0.0000023973678,0.00076078833,0.00017671364,0.06745377,0.8760564,0.00026496258,0.05367966],"study_design_scores_gemma":[0.0016572775,0.0025402985,0.0010218149,0.0002727136,0.000022510954,0.000016793223,0.00023808435,0.24772695,0.6366142,0.10482404,0.004030434,0.0010349089],"about_ca_topic_score_codex":0.000024400866,"about_ca_topic_score_gemma":0.000007085956,"teacher_disagreement_score":0.77123237,"about_ca_system_score_codex":0.000010787129,"about_ca_system_score_gemma":0.000017767672,"threshold_uncertainty_score":0.46774513},"labels":[],"label_agreement":null},{"id":"W2979325266","doi":"10.1515/jmc-2019-0048","title":"On the equivalence of authentication codes and robust (2, 2)-threshold schemes","year":2020,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; London Mathematical Society","keywords":"Equivalence (formal languages); Authentication (law); Computer science; Secret sharing; Theoretical computer science; Mathematics; Discrete mathematics; Computer security; Cryptography","score_opus":0.062021590250013615,"score_gpt":0.2836574490103651,"score_spread":0.2216358587603515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979325266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1200235,0.00035997803,0.851594,0.027074073,0.000271391,0.00016331598,0.0000031039433,0.00002492753,0.000485716],"genre_scores_gemma":[0.9258237,0.000070261616,0.073555976,0.00046360804,0.00006830873,0.0000054323996,2.9701283e-7,0.000008662437,0.0000037642099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824256,0.00023140856,0.00073254964,0.00024230836,0.00037823798,0.0001729352],"domain_scores_gemma":[0.99706167,0.0012276297,0.0008806216,0.0005295938,0.00019581475,0.00010465105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00126221,0.00019159167,0.00059282104,0.0001583431,0.000062997846,0.00008021621,0.0014258557,0.00017935509,0.00003339847],"category_scores_gemma":[0.0008725004,0.000119019714,0.00023174433,0.0001657962,0.00024313095,0.000085700034,0.00081180275,0.00077942334,0.0000074793797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041115447,0.00011692889,0.000020016078,0.00027242082,0.00009292867,0.000011930946,0.0006653564,0.00005887638,0.00063388824,0.9969357,0.0005948814,0.0005559045],"study_design_scores_gemma":[0.00014615209,0.00028849713,0.00008478449,0.0004328543,0.00006666521,0.00010895788,0.000093732924,0.010530382,0.0012439259,0.98684114,0.000055345725,0.00010753691],"about_ca_topic_score_codex":1.9938156e-7,"about_ca_topic_score_gemma":9.9112235e-8,"teacher_disagreement_score":0.8058002,"about_ca_system_score_codex":0.000012959992,"about_ca_system_score_gemma":0.000084191845,"threshold_uncertainty_score":0.4853483},"labels":[],"label_agreement":null},{"id":"W2979569747","doi":"10.1109/tit.2020.2977319","title":"On the Weights of General MDS Codes","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Dimension (graph theory); Combinatorics; Code word; Discrete mathematics; Binary number; Mathematical proof; Linear code; Binary code; Block code; Arithmetic; Algorithm; Decoding methods","score_opus":0.0161087276406441,"score_gpt":0.22740331890276427,"score_spread":0.21129459126212016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979569747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006342687,0.000012092756,0.98029184,0.0009719333,0.001311682,0.00032726882,0.00009002958,0.00021876772,0.010433677],"genre_scores_gemma":[0.99517775,0.000037997925,0.0027640795,0.0017851145,0.00004092081,0.00009554306,0.000008950682,0.000008758875,0.00008090908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984433,0.0003264262,0.00047747736,0.00020424325,0.00038319454,0.00016535578],"domain_scores_gemma":[0.99799687,0.00062209764,0.00030643019,0.0008934736,0.00011204332,0.000069061236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071670813,0.00024455888,0.0002331139,0.0003425239,0.00026877617,0.000170099,0.0012367998,0.00016869802,0.00015141386],"category_scores_gemma":[0.000015532622,0.00017639075,0.00034158328,0.00036769174,0.00013615351,0.00050965627,0.000017241624,0.0007136082,0.00016273481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009879178,0.000048405625,1.6369994e-7,0.000055236953,0.00008707465,3.3419732e-7,0.0028122955,0.017044919,0.000037260346,0.95356363,0.00039311592,0.02585878],"study_design_scores_gemma":[0.00023670137,0.00019137956,0.00002146906,0.00014603222,0.000039167095,0.0000033063864,0.00012052997,0.031911932,0.032673746,0.9329762,0.0013890238,0.00029052456],"about_ca_topic_score_codex":0.000006122797,"about_ca_topic_score_gemma":8.1915573e-7,"teacher_disagreement_score":0.98883504,"about_ca_system_score_codex":0.00003413256,"about_ca_system_score_gemma":0.0000976029,"threshold_uncertainty_score":0.71930057},"labels":[],"label_agreement":null},{"id":"W2980330807","doi":"10.1016/j.jcta.2020.105337","title":"An analogue of Ruzsa's conjecture for polynomials over finite fields","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Conjecture; Polynomial; Field (mathematics); Combinatorics; Ring (chemistry); Physics; Mathematics; Discrete mathematics; Pure mathematics; Mathematical analysis; Chemistry","score_opus":0.01710372350876875,"score_gpt":0.2712803088292093,"score_spread":0.2541765853204405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980330807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13463415,0.0012305081,0.8252153,0.0027995405,0.034219135,0.00083312206,0.00020721083,0.00013417637,0.00072688045],"genre_scores_gemma":[0.99156934,0.00007613308,0.006244122,0.00027969835,0.0017718205,0.0000094136985,0.000008955027,0.000025552761,0.000014989617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735075,0.0006291236,0.0009895558,0.00035588827,0.00040566162,0.00026899888],"domain_scores_gemma":[0.9957907,0.0011198607,0.0016392887,0.00078603084,0.00044623105,0.00021789479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020465825,0.00035411003,0.0010410844,0.00029346126,0.00011662985,0.00024333075,0.0024048714,0.0004611465,0.00005061358],"category_scores_gemma":[0.0005547681,0.0003091038,0.0008282057,0.00029230912,0.00017274753,0.0005463411,0.00056318037,0.000872891,5.2715774e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021583273,0.00015322112,0.0000376935,0.00016344617,0.00034668483,0.000027008042,0.0016879712,0.00057160377,0.0007657751,0.9907136,0.00091946503,0.0024551875],"study_design_scores_gemma":[0.0012862865,0.002783034,0.00007852835,0.0001804207,0.00012050168,0.000024528423,0.000098179145,0.00024545472,0.0052367183,0.98291403,0.006724404,0.0003079373],"about_ca_topic_score_codex":0.0000043382893,"about_ca_topic_score_gemma":0.0000012951654,"teacher_disagreement_score":0.85693514,"about_ca_system_score_codex":0.0000331445,"about_ca_system_score_gemma":0.00043738753,"threshold_uncertainty_score":0.9999361},"labels":[],"label_agreement":null},{"id":"W2981927247","doi":"10.4153/s0008414x21000377","title":"Combinatorics of the geometry of Wilson loop diagrams II: Grassmann necklaces, dimensions, and denominators","year":2021,"lang":"en","type":"preprint","venue":"Canadian Journal of Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Diagram; Propagator; Grassmannian; Ideal (ethics); Loop (graph theory); Necklace; Mathematics; Feynman diagram; Dimension (graph theory); Product (mathematics); Scattering amplitude; Quadric; Pure mathematics; Mathematical physics; Combinatorics; Geometry; Scattering; Physics; Quantum mechanics","score_opus":0.012604360739530116,"score_gpt":0.20501290667547445,"score_spread":0.19240854593594434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981927247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844018,0.003583662,0.010090432,0.00037848874,0.0012281442,0.00013839193,0.000012210377,0.000005080318,0.00016178344],"genre_scores_gemma":[0.9900158,0.0002814773,0.009580135,0.0000424452,0.00002510065,0.0000013292721,8.068449e-7,0.000015305794,0.000037604794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982616,0.00015041542,0.0007870126,0.00018577857,0.000373182,0.00024203773],"domain_scores_gemma":[0.99668527,0.0003181423,0.0013411487,0.00083881157,0.00045633444,0.00036030248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011703213,0.0002209449,0.0006513339,0.00047179655,0.00017153552,0.00011345122,0.0015363188,0.00020092985,0.000008318881],"category_scores_gemma":[0.0004689318,0.00017074561,0.0003342323,0.00065595564,0.00025214517,0.00011950217,0.0006318261,0.0006366626,1.5976886e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071004843,0.0005687503,0.03389001,0.0030244444,0.00085346017,0.00023388649,0.019143118,0.000516106,0.00035021908,0.93118495,0.0025476553,0.0076803286],"study_design_scores_gemma":[0.0011351545,0.0006589056,0.0113663655,0.007525069,0.0007707681,0.0008892344,0.0048583983,0.004644537,0.008738829,0.95638394,0.0019224682,0.0011063053],"about_ca_topic_score_codex":0.00028012873,"about_ca_topic_score_gemma":0.0010010351,"teacher_disagreement_score":0.025199043,"about_ca_system_score_codex":0.000079500634,"about_ca_system_score_gemma":0.0012645324,"threshold_uncertainty_score":0.69628036},"labels":[],"label_agreement":null},{"id":"W2982529634","doi":"10.1515/jmc-2019-0048","title":"On the equivalence of authentication codes and robust (2, 2)-threshold schemes","year":2020,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Equivalence (formal languages); Authentication (law); Mathematics; Computer science; Theoretical computer science; Key (lock); Discrete mathematics; Computer security","score_opus":0.3196056766571743,"score_gpt":0.49898679185062084,"score_spread":0.17938111519344652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982529634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9401673,0.005181639,0.049431726,0.002395375,0.00018442026,0.0003221864,0.0000103759385,0.0000537874,0.0022531857],"genre_scores_gemma":[0.99677175,0.0014827658,0.0009902223,0.0006739445,0.00004077826,0.000012124918,6.856726e-7,0.000011047842,0.00001668544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831444,0.00019961456,0.00043960218,0.0003622558,0.0004831037,0.00020100364],"domain_scores_gemma":[0.99803835,0.0006297027,0.00048590786,0.0005328509,0.00016213492,0.0001510526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011991885,0.00017477987,0.00033754745,0.00023589884,0.00022535777,0.0008538451,0.0039257105,0.000046941565,0.0007410359],"category_scores_gemma":[0.00032745668,0.00012741772,0.000114877876,0.0010358618,0.00019748283,0.0013552606,0.0012092347,0.00024425864,0.0000049310634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028650142,0.00035149747,0.091158815,0.00022135254,0.0002603327,0.000013667527,0.0022406476,0.0006475495,0.23159441,0.6324221,0.013728001,0.02707512],"study_design_scores_gemma":[0.00089521485,0.00013441948,0.24786572,0.001254626,0.00013540359,0.000015206932,0.00026414453,0.020494027,0.25204727,0.47273704,0.0032526753,0.0009042585],"about_ca_topic_score_codex":0.000019191699,"about_ca_topic_score_gemma":0.0000014474887,"teacher_disagreement_score":0.15968508,"about_ca_system_score_codex":0.000010429012,"about_ca_system_score_gemma":0.00004727826,"threshold_uncertainty_score":0.8233648},"labels":[],"label_agreement":null},{"id":"W2984571407","doi":"10.33693/2313-223x-2019-6-2-85-89","title":"ON A CONSTRUCTION METHOD FOR PERMUTATIONS OVER FINITE FIELDS","year":2019,"lang":"en","type":"article","venue":"Computational nanotechnology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"123 Certification (Canada)","funders":"","keywords":"Finite field; Dimension (graph theory); Mathematics; Field (mathematics); Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.009436795283932415,"score_gpt":0.27141265576806706,"score_spread":0.2619758604841346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984571407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0425048,0.000014182736,0.95395404,0.0021861754,0.00048217745,0.00023559429,0.000008387318,0.00027783657,0.000336833],"genre_scores_gemma":[0.6229463,7.082119e-7,0.37620887,0.00072875485,0.00001576149,0.000032970704,0.000011104751,0.0000049450555,0.000050551458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992058,0.000044250042,0.00015569912,0.00032328433,0.0001129839,0.00015794527],"domain_scores_gemma":[0.998212,0.0013369281,0.000075964,0.00026009194,0.00009114689,0.000023918226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016198619,0.00009736587,0.00012479188,0.00032064915,0.00012467269,0.000038386337,0.00036275203,0.00015110822,0.00005075864],"category_scores_gemma":[0.00010139207,0.00009927993,0.000094544914,0.0004173908,0.000053147036,0.00012044096,0.000073890245,0.00013784227,0.00006788126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016463573,0.000025014837,0.000055778608,0.000006053315,0.000016131846,7.0130676e-7,0.00006040509,0.038826887,0.00016352342,0.93484575,0.0001501491,0.025833154],"study_design_scores_gemma":[0.0003877585,0.0002000103,0.00015973013,0.000007247253,0.0000033422377,0.000014734636,0.000009652668,0.29620707,0.00043178292,0.7005648,0.0019248221,0.00008902244],"about_ca_topic_score_codex":0.0000013118942,"about_ca_topic_score_gemma":8.2139485e-7,"teacher_disagreement_score":0.58044153,"about_ca_system_score_codex":0.00001890729,"about_ca_system_score_gemma":0.000047137615,"threshold_uncertainty_score":0.4048518},"labels":[],"label_agreement":null},{"id":"W2986162624","doi":"10.13069/jacodesmath.645015","title":"Construction of quasi-twisted codes and enumeration of defining polynomials","year":2019,"lang":"en","type":"article","venue":"Journal of Algebra Combinatorics Discrete Structures and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Enumeration; Hamming code; Combinatorics; Mathematics; Linear code; Minimum distance; Hamming distance; Code (set theory); Finite field; Discrete mathematics; Block code; Algorithm; Computer science; Decoding methods","score_opus":0.004648419889312304,"score_gpt":0.22453174188112726,"score_spread":0.21988332199181496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986162624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9042345,0.0011055792,0.093982056,0.00012577284,0.00014607164,0.00014194928,0.000013013986,0.000008756775,0.00024226717],"genre_scores_gemma":[0.99184555,0.00017180083,0.00793687,0.00001625953,0.000018388744,0.0000022027757,0.0000022547308,0.000004203535,0.0000024824901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913985,0.00005521532,0.00042497838,0.00012790189,0.00017015185,0.00008193618],"domain_scores_gemma":[0.99875116,0.00015722921,0.0006552623,0.00019584195,0.00018167589,0.000058850143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026168497,0.00009177596,0.00026052844,0.00016750475,0.00008174384,0.000052014835,0.00022112922,0.000054788878,0.0000050271783],"category_scores_gemma":[0.000020134641,0.000078137375,0.00006783378,0.00031111724,0.00011952068,0.00023979008,0.0000682631,0.00011464768,1.8824366e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015088435,0.000018589366,0.005308605,0.000041968462,0.000037027366,1.3499012e-7,0.00021598303,0.000010883116,0.0061058416,0.9792341,0.000008464283,0.009003327],"study_design_scores_gemma":[0.0006983017,0.00041209062,0.01894416,0.000048368805,0.000052185987,0.00009145516,0.00030755307,0.0005401902,0.008483881,0.9697919,0.0004961956,0.0001337027],"about_ca_topic_score_codex":0.00000547008,"about_ca_topic_score_gemma":5.2824697e-7,"teacher_disagreement_score":0.087611005,"about_ca_system_score_codex":0.000008124812,"about_ca_system_score_gemma":0.000040036946,"threshold_uncertainty_score":0.318635},"labels":[],"label_agreement":null},{"id":"W2988233485","doi":"10.1587/elex.16.20190600","title":"Novel bit-serial semi-systolic array structure for simultaneously computing field multiplication and squaring","year":2019,"lang":"en","type":"article","venue":"IEICE Electronics Express","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Deanship of Scientific Research, Prince Sattam bin Abdulaziz University; Prince Sattam bin Abdulaziz University","keywords":"Multiplication (music); Systolic array; Computer science; Bit (key); Arithmetic; Parallel computing; Field (mathematics); Mathematics; Embedded system; Very-large-scale integration; Computer network; Combinatorics","score_opus":0.006169500513034223,"score_gpt":0.22789496363776854,"score_spread":0.22172546312473432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988233485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47430664,0.00014770072,0.52472174,0.000082276674,0.00027849438,0.0002997866,0.0000029529067,0.00010967742,0.000050726074],"genre_scores_gemma":[0.97245336,0.000007688943,0.027065754,0.00022545671,0.00019076263,0.000012704664,0.000006077382,0.000016685002,0.000021505357],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998633,0.000034675028,0.0002083276,0.0005259922,0.00015015427,0.0004478219],"domain_scores_gemma":[0.99854517,0.0006604516,0.00013464227,0.0005070364,0.00008365723,0.00006904619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021531257,0.00018429676,0.00019640847,0.000089338944,0.00020280397,0.00025014344,0.00064095727,0.00012686715,0.0000039893926],"category_scores_gemma":[0.000060221806,0.0001881882,0.00007191764,0.00021634661,0.000018497074,0.00032119296,0.00012296326,0.0002347867,0.0000018403541],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008646726,0.000038975508,0.0002327435,0.00008046774,0.00003273644,4.7549185e-7,0.0019219439,0.0046615954,0.9310392,0.047879633,0.00003086987,0.013994852],"study_design_scores_gemma":[0.0031081669,0.0009732722,0.00021818464,0.00015890982,0.000041273448,0.00011279983,0.0001876837,0.6155995,0.3507025,0.013577699,0.014253225,0.0010667891],"about_ca_topic_score_codex":0.000021252656,"about_ca_topic_score_gemma":0.000028879942,"teacher_disagreement_score":0.6109379,"about_ca_system_score_codex":0.000034746186,"about_ca_system_score_gemma":0.000045045497,"threshold_uncertainty_score":0.76740927},"labels":[],"label_agreement":null},{"id":"W2991341770","doi":"10.3934/amc.2020047","title":"A construction of $ \\mathbb{F}_2 $-linear cyclic, MDS codes","year":2019,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Generator matrix; Combinatorics; Logarithm; Separable space; Partition (number theory); Dimension (graph theory); Prime (order theory); Parity (physics); Linear code; Discrete mathematics; Matrix (chemical analysis); Block code; Algorithm; Mathematical analysis","score_opus":0.014686634800500595,"score_gpt":0.29866985212177943,"score_spread":0.28398321732127885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991341770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30367,0.003938435,0.6307361,0.00057441683,0.00024282756,0.00057707436,0.000020893782,0.00013217099,0.06010807],"genre_scores_gemma":[0.5552992,0.0009200451,0.44374496,0.0000075872736,0.0000019798263,0.000009265365,0.0000018887166,0.0000034293703,0.000011597507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912256,0.00008118855,0.00044096404,0.00010921746,0.00014597528,0.00010008629],"domain_scores_gemma":[0.99683696,0.0007490148,0.0003247475,0.0019691777,0.00010028061,0.000019799923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042505004,0.00008085253,0.00023910642,0.00017002097,0.000043452757,0.000009697507,0.0017220569,0.000036021615,0.000014044777],"category_scores_gemma":[0.00007924564,0.00007912121,0.00007186012,0.0005252652,0.00027833975,0.0004609518,0.00036986082,0.000112461,0.000010177702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023078182,0.00016533224,0.0015478784,0.00010828257,0.000008813477,5.0006054e-8,0.00106724,0.00019118405,0.0012786454,0.9904596,0.0000018167441,0.0051688226],"study_design_scores_gemma":[0.0002700966,0.00006950858,0.0002879551,0.00028978943,0.000009330579,0.000006618569,0.00060703466,0.03222117,0.003662806,0.96019506,0.0022544723,0.00012612708],"about_ca_topic_score_codex":0.0000036228814,"about_ca_topic_score_gemma":0.000014156124,"teacher_disagreement_score":0.25162926,"about_ca_system_score_codex":0.000008894055,"about_ca_system_score_gemma":0.000024030334,"threshold_uncertainty_score":0.32264692},"labels":[],"label_agreement":null},{"id":"W2995380196","doi":"10.1145/3377006.3377021","title":"New bivariate Hensel lifting algorithm for <i>n</i> factors","year":2019,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Burnaby Hospital","funders":"","keywords":"Monic polynomial; Bivariate analysis; Univariate; Mathematics; Bounded function; Degree (music); Polynomial; Algorithm; Combinatorics; Finite field; Field (mathematics); Applied mathematics; Pure mathematics; Mathematical analysis; Multivariate statistics; Physics; Statistics","score_opus":0.03193140114877477,"score_gpt":0.28122522502960706,"score_spread":0.2492938238808323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995380196","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011672919,0.00026202988,0.98453474,0.0016677413,0.0006423,0.0004415261,0.000004976311,0.00030383255,0.00046994042],"genre_scores_gemma":[0.15097153,0.000039436156,0.8481917,0.00061670376,0.00007114702,0.000027018259,0.000020517737,0.000017344586,0.000044649918],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984622,0.00018779594,0.000393766,0.00044115307,0.00015574221,0.0003593472],"domain_scores_gemma":[0.9928946,0.00168922,0.00013728946,0.00509475,0.00008195372,0.000102177655],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00055389706,0.00020616449,0.00025668836,0.0002965396,0.00023211566,0.00025430118,0.006826965,0.000087942884,0.000013530213],"category_scores_gemma":[0.000043049353,0.0002107973,0.0001619937,0.00091676705,0.000045752688,0.0005326883,0.0029669916,0.00027991732,0.00005975035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030278443,0.00012060371,0.0037866752,0.00001009591,0.00004156806,5.8001984e-7,0.002060439,0.00005780377,0.00007733754,0.40809613,0.0009577536,0.58478796],"study_design_scores_gemma":[0.0014775607,0.00023164088,0.00697142,0.00013086398,0.000015503523,0.0000111338295,0.00006219052,0.43150264,0.00028752626,0.5286868,0.029942716,0.00067995937],"about_ca_topic_score_codex":0.000061256265,"about_ca_topic_score_gemma":0.000012474676,"teacher_disagreement_score":0.584108,"about_ca_system_score_codex":0.000037378653,"about_ca_system_score_gemma":0.00008988547,"threshold_uncertainty_score":0.9985466},"labels":[],"label_agreement":null},{"id":"W2996211895","doi":"10.1109/tit.2020.3005544","title":"On the Algebraic Combinatorics of Injections and its Applications to Injection Codes","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek","keywords":"Combinatorics; Set (abstract data type); Algebraic number; Mathematics; Algebraic combinatorics; Element (criminal law); Enumerative combinatorics; Discrete mathematics; Combinatorial proof; Extremal combinatorics; Computer science","score_opus":0.017538525243185533,"score_gpt":0.23840092839491958,"score_spread":0.22086240315173405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996211895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053858696,0.000022856582,0.9888888,0.0013096761,0.0007450252,0.0010364539,0.00011668862,0.00026951515,0.0022251431],"genre_scores_gemma":[0.99747545,0.000049346163,0.00052328076,0.0011968486,0.000021930264,0.00067431823,0.000008061294,0.000010767359,0.000040014336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852324,0.0002479849,0.00047668352,0.00027365496,0.00031864425,0.00015978367],"domain_scores_gemma":[0.997806,0.0009130253,0.00027375692,0.00067336217,0.00021780262,0.00011604813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067082286,0.00024685875,0.00022571645,0.0006027401,0.0005141413,0.00018967058,0.0007233616,0.00017596011,0.000029858895],"category_scores_gemma":[0.00004931594,0.00021199016,0.0001629201,0.0010305111,0.00007771946,0.00050514494,0.000030735293,0.0007076381,0.00010746954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056963592,0.00007893391,3.943584e-7,0.00008477966,0.000065591244,6.4643345e-8,0.0028468834,0.021475647,0.00005251047,0.96068317,0.00016106662,0.014493992],"study_design_scores_gemma":[0.00025619354,0.0004902725,0.000047159694,0.00014292917,0.00006447669,0.000009152426,0.00048725423,0.01367261,0.009392409,0.9735375,0.0015346336,0.00036537542],"about_ca_topic_score_codex":0.0000056649233,"about_ca_topic_score_gemma":0.0000021329604,"teacher_disagreement_score":0.99208957,"about_ca_system_score_codex":0.00006125062,"about_ca_system_score_gemma":0.00009326698,"threshold_uncertainty_score":0.8644708},"labels":[],"label_agreement":null},{"id":"W2996314380","doi":"10.4153/s0008439522000546","title":"The shape of cyclic number fields","year":2022,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Discriminant; TRACE (psycholinguistics); Zero (linguistics); Matrix (chemical analysis); Algebraic number field; Degree (music); Combinatorics; Field (mathematics); Gramian matrix; Prime (order theory); Discrete mathematics; Pure mathematics; Eigenvalues and eigenvectors; Physics","score_opus":0.008504844339050781,"score_gpt":0.20587415917286053,"score_spread":0.19736931483380976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996314380","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29931298,0.00040391996,0.07400021,0.1314491,0.0010426104,0.00078999304,0.000038612834,0.0002780162,0.49268454],"genre_scores_gemma":[0.9963376,0.0000020828918,0.0013455644,0.0011866249,0.000017602868,0.00003686754,5.144628e-7,0.000005529151,0.0010676164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915373,0.00010320779,0.00016974228,0.00013784524,0.00018148826,0.00025399853],"domain_scores_gemma":[0.99889976,0.00041993047,0.00004073739,0.0004492867,0.000020091546,0.00017017666],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00054597005,0.00006717238,0.000097583514,0.000044076914,0.0004446001,0.000052342784,0.000984231,0.000023429147,0.0128985895],"category_scores_gemma":[0.000101759375,0.00005269959,0.000085446336,0.00025447723,0.00007924271,0.000015626478,0.00017863308,0.00016940184,0.0008873134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016931888,0.000013892969,0.000028827495,0.0000068289273,0.00000785675,0.000009902623,0.00026247324,0.000004873052,0.000005893335,0.9735929,0.019871792,0.0061930884],"study_design_scores_gemma":[0.00007911813,0.00004029116,0.00008871795,0.0000074553127,0.000004377756,0.000040546845,0.00012960251,0.0017715562,0.00004345446,0.4811714,0.516516,0.00010753861],"about_ca_topic_score_codex":0.00016330843,"about_ca_topic_score_gemma":0.0001419304,"teacher_disagreement_score":0.6970246,"about_ca_system_score_codex":0.000029394216,"about_ca_system_score_gemma":0.00008187954,"threshold_uncertainty_score":0.9998906},"labels":[],"label_agreement":null},{"id":"W2996993513","doi":"","title":"Creepers: Real quadratic orders with large class number","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Fraction (chemistry); Combinatorics; Sequence (biology); Quadratic equation; Period (music); Class (philosophy); Continued fraction; Constant (computer programming); Genus; Exponential function; Arithmetic; Discrete mathematics; Geometry; Mathematical analysis; Computer science; Physics; Remainder","score_opus":0.007218629376710863,"score_gpt":0.2422814144611492,"score_spread":0.23506278508443834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996993513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08997182,0.0000038898343,0.71337646,0.00026708603,0.000083677834,0.000059162718,2.5426118e-7,0.00025519967,0.19598247],"genre_scores_gemma":[0.9634446,0.0000023562495,0.03492545,0.00084803364,0.000034994016,0.0000026088715,6.980877e-7,0.0000066164434,0.00073464884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904335,0.000033198423,0.000121465084,0.00025421538,0.00020021289,0.00034756554],"domain_scores_gemma":[0.99929565,0.00010578998,0.000033211974,0.0004215434,0.00004467645,0.00009913123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057783903,0.00010505876,0.00009381696,0.0000651486,0.00012715513,0.000096197145,0.0004405381,0.00004168026,0.00019812991],"category_scores_gemma":[0.0000056676063,0.00007685814,0.00004931552,0.0005664784,0.000048810893,0.00030411777,0.00007794971,0.000095316886,0.00013267547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019413545,0.00006229649,0.007921194,0.000003892481,0.000016389067,0.00002465625,0.00063615263,0.0000028458535,0.000051880757,0.98693335,0.0010255896,0.003302341],"study_design_scores_gemma":[0.012435541,0.0028252923,0.09042072,0.00030838058,0.000165256,0.00069147436,0.013767444,0.036401823,0.011032666,0.40115854,0.42505366,0.0057391827],"about_ca_topic_score_codex":0.000080661965,"about_ca_topic_score_gemma":0.0006441824,"teacher_disagreement_score":0.87347275,"about_ca_system_score_codex":0.000012160081,"about_ca_system_score_gemma":0.00002719457,"threshold_uncertainty_score":0.3134184},"labels":[],"label_agreement":null},{"id":"W2997631494","doi":"10.1137/1.9781611975994.84","title":"Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"UK Research and Innovation","keywords":"Constant (computer programming); Block (permutation group theory); Mathematics; Computer science; Algorithm; Combinatorics","score_opus":0.054141402275741435,"score_gpt":0.22390022182503222,"score_spread":0.16975881954929078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997631494","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005504504,0.0003487199,0.19889237,0.00023871873,0.00068407535,0.006123975,0.00045933228,0.0007123012,0.787036],"genre_scores_gemma":[0.053682487,0.00028940817,0.68054754,0.0015347634,0.0017875365,0.00041565325,0.0001627139,0.0005561469,0.26102376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815995,0.0000095264,0.00047063347,0.00065178156,0.0003229524,0.0003851462],"domain_scores_gemma":[0.99820006,0.00057904655,0.00042532483,0.00053431746,0.00010008659,0.00016114429],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000636184,0.0005214308,0.00083933125,0.000052944335,0.0004182638,0.00024867657,0.0004111366,0.0006282803,0.000007530751],"category_scores_gemma":[0.000010413317,0.00042384767,0.00029718966,0.00003737257,0.0007893863,0.00005835623,0.0003269589,0.000696666,0.0000047321632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009375919,0.000026871736,0.0000011013159,0.000241666,0.00030667562,0.0000011369181,0.0010916967,0.0000038277735,0.000073721756,0.991854,0.0011662587,0.0051392475],"study_design_scores_gemma":[0.004692953,0.0008180893,3.323485e-7,0.00097611,0.0004916455,0.00007479998,0.00069792435,0.005303655,0.0005583384,0.93397886,0.050979916,0.0014273779],"about_ca_topic_score_codex":0.0000039867477,"about_ca_topic_score_gemma":0.00000641846,"teacher_disagreement_score":0.52601224,"about_ca_system_score_codex":0.000031695457,"about_ca_system_score_gemma":0.00027004656,"threshold_uncertainty_score":0.9998213},"labels":[],"label_agreement":null},{"id":"W2999855170","doi":"10.37236/766","title":"Codes from Cubic Curves and their Extensions","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of New Brunswick","funders":"","keywords":"Mathematics; Code (set theory); Prime (order theory); Linear code; Combinatorics; Plane curve; Range (aeronautics); Plane (geometry); Discrete mathematics; Pure mathematics; Block code; Algorithm; Geometry; Computer science; Set (abstract data type); Decoding methods","score_opus":0.010323897206391932,"score_gpt":0.1986178620096991,"score_spread":0.18829396480330718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999855170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7550561,0.06016622,0.18114565,0.002783792,0.00041304898,0.00006860376,9.825524e-7,0.000040134757,0.00032551456],"genre_scores_gemma":[0.9856695,0.013852923,0.000061028924,0.00033050182,0.000047324655,8.177406e-7,2.0919674e-7,0.0000059741474,0.000031732303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989718,0.00018675513,0.00022737077,0.00010954277,0.00020370478,0.00030079964],"domain_scores_gemma":[0.9987663,0.00048901193,0.00020345087,0.00033044693,0.00013985693,0.00007090285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074207666,0.00011598555,0.00021156645,0.000077505734,0.00030091175,0.000033183966,0.00088065566,0.000031401283,0.0000044900817],"category_scores_gemma":[0.000060808456,0.000068249414,0.000111018744,0.00039859893,0.00012045561,0.00024309797,0.000122109,0.00047542536,0.000002079316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014600379,0.0000711866,0.00027078364,0.0000033156755,0.000070156304,0.000011520552,0.00074134103,0.0000042302668,0.00059051614,0.995828,0.0010120383,0.0013823112],"study_design_scores_gemma":[0.0003287035,0.00033040644,0.0015130201,0.000058130365,0.000019225303,0.00057221856,0.00004923074,0.0002984586,0.0015154694,0.9919212,0.0032949506,0.000099006866],"about_ca_topic_score_codex":0.000004539766,"about_ca_topic_score_gemma":0.0000016879645,"teacher_disagreement_score":0.23061343,"about_ca_system_score_codex":0.000034004734,"about_ca_system_score_gemma":0.0001898688,"threshold_uncertainty_score":0.27831304},"labels":[],"label_agreement":null},{"id":"W3004650230","doi":"10.37236/8040","title":"","year":2020,"lang":"en","type":"article","venue":"UWA Profiles and Research Repository (UWA)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Transitive relation; Hamming graph; Corollary; Discrete mathematics; Alphabet; Partition (number theory); Transitive closure; Hamming code; Affine transformation; Block code; Algorithm; Decoding methods; Pure mathematics","score_opus":0.05845801451762299,"score_gpt":0.3084744139944756,"score_spread":0.2500163994768526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004650230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9539155,0.0021074025,0.022761792,0.016263265,0.00036955372,0.0008629397,0.000004469802,0.0005861919,0.003128935],"genre_scores_gemma":[0.99265045,0.000165538,0.0055339695,0.00060366286,0.0006245391,0.00014781734,0.0000023245186,0.000024471256,0.00024723882],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9939585,0.0014372715,0.0005089749,0.0014277153,0.001470114,0.0011974358],"domain_scores_gemma":[0.99659115,0.00070124754,0.00012088107,0.0010460408,0.0004604511,0.0010802116],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002338861,0.00032801577,0.0004023354,0.00034374604,0.002292222,0.0014455082,0.002274577,0.00018685572,0.000004945242],"category_scores_gemma":[0.00029525382,0.00027241767,0.00020774071,0.0018376325,0.000779157,0.0011435114,0.0020045643,0.0011105074,0.000012287557],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003845714,0.00027961342,0.0119921025,0.00046357987,0.00014874619,0.00094817893,0.012101828,0.000028159844,0.47766662,0.46375334,0.002927714,0.029305536],"study_design_scores_gemma":[0.0010500398,0.002054724,0.011641238,0.0001520291,0.000013601209,0.00019713583,0.0016696604,0.017332572,0.9335481,0.020019438,0.011689284,0.0006321814],"about_ca_topic_score_codex":0.00007085326,"about_ca_topic_score_gemma":1.3195339e-7,"teacher_disagreement_score":0.45588148,"about_ca_system_score_codex":0.00003651092,"about_ca_system_score_gemma":0.00020115069,"threshold_uncertainty_score":0.9999728},"labels":[],"label_agreement":null},{"id":"W3007435930","doi":"10.1007/s40314-020-1120-1","title":"Quasi-cyclic codes: algebraic properties and applications","year":2020,"lang":"en","type":"article","venue":"Computational and Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Chinese remainder theorem; Dual (grammatical number); Linear code; Finite field; Galois extension; Generator matrix; Discrete mathematics; Generator (circuit theory); Block code; Galois group; Pure mathematics; Algorithm; Decoding methods; Physics","score_opus":0.03518806633077124,"score_gpt":0.2207856887193744,"score_spread":0.18559762238860317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007435930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023134869,0.00017368022,0.97364885,0.0013241679,0.000008789634,0.00023665781,0.0000026518962,0.00015728489,0.0013130356],"genre_scores_gemma":[0.8272286,0.000017179904,0.17159511,0.001021815,0.000048203816,0.00007086518,0.0000035884625,0.0000068095082,0.000007812274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993677,0.000008471226,0.00016415077,0.0002287586,0.00012964854,0.00010123394],"domain_scores_gemma":[0.99956995,0.00013810679,0.000057879075,0.00010652915,0.000027323013,0.00010018376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008758269,0.00010506958,0.0001364254,0.000035133915,0.0001754028,0.00012906507,0.00020101025,0.000026680027,0.00000357743],"category_scores_gemma":[0.000008280674,0.00008905073,0.000021855212,0.00019934562,0.000101055,0.00008269156,0.0001552899,0.0000660688,0.00001905853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023650257,0.00006785614,0.0000083550385,0.00012073412,0.000012671192,2.601735e-7,0.0017269923,0.0002512086,0.0003646322,0.98337364,0.000075995624,0.013995303],"study_design_scores_gemma":[0.00023964049,0.00005873562,0.000083695486,0.000017761884,0.000012101734,0.000013687598,0.00025062665,0.12275371,0.00029754202,0.874484,0.0016066396,0.0001818577],"about_ca_topic_score_codex":2.0845786e-7,"about_ca_topic_score_gemma":1.286472e-7,"teacher_disagreement_score":0.8040937,"about_ca_system_score_codex":0.0000027794274,"about_ca_system_score_gemma":0.0000161207,"threshold_uncertainty_score":0.36313835},"labels":[],"label_agreement":null},{"id":"W3010077287","doi":"10.5539/jmr.v12n2p12","title":"On the Hyper-Kloosterman Codes Over Galois Rings","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Kloosterman sum; TRACE (psycholinguistics); Hamming code; Code word; Code (set theory); Galois group; Discrete mathematics; Galois module; Combinatorics; Pure mathematics; Block code; Algorithm; Decoding methods; Computer science; Linguistics","score_opus":0.14376633328384109,"score_gpt":0.361740100144095,"score_spread":0.21797376686025394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010077287","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91593635,0.000116155934,0.05516936,0.019754754,0.0001133869,0.00015420736,0.0000011646931,0.00002867578,0.008725936],"genre_scores_gemma":[0.9930377,0.000030233934,0.006040878,0.0006800672,0.00012439801,0.0000020423665,3.8770846e-8,0.000008902956,0.00007575919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801874,0.00024932338,0.00029429598,0.000111956964,0.0010885288,0.00023717452],"domain_scores_gemma":[0.9972953,0.0018129279,0.00014895154,0.00034951663,0.00024518196,0.00014810714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003394824,0.00008157207,0.00016869957,0.00016957743,0.00019539926,0.00029703896,0.001694994,0.00003319327,0.00010648989],"category_scores_gemma":[0.00076155795,0.00004691085,0.00013712017,0.00053934293,0.00010474539,0.00020125923,0.00031818045,0.00065268297,0.00008984745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035779136,0.00020413527,0.00010790086,0.000082356346,0.00005519801,0.00004674457,0.0077539533,0.000027478338,0.0052465573,0.96331483,0.019861305,0.0032637825],"study_design_scores_gemma":[0.0007951111,0.0017930211,0.0005645797,0.00047225328,0.000017553932,0.00020071495,0.0012658859,0.03099954,0.014818416,0.9339698,0.014837444,0.0002656836],"about_ca_topic_score_codex":7.6395486e-7,"about_ca_topic_score_gemma":3.523759e-7,"teacher_disagreement_score":0.07710132,"about_ca_system_score_codex":0.000021016418,"about_ca_system_score_gemma":0.000057513796,"threshold_uncertainty_score":0.31497487},"labels":[],"label_agreement":null},{"id":"W3011787975","doi":"10.1109/tc.2020.2979460","title":"Analysis and Efficient Implementations of a Class of Composited de Bruijn Sequences","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Institute of Standards and Technology; U.S. Department of Commerce","keywords":"De Bruijn sequence; Sequence (biology); Randomness; Computer science; Tuple; Discrete mathematics; Binary number; Mathematics; Algorithm; Combinatorics; Arithmetic; Statistics","score_opus":0.017455396072236968,"score_gpt":0.25407952206589374,"score_spread":0.23662412599365676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011787975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25077325,0.000009707146,0.74855703,0.00045336183,0.000058669528,0.00006421377,0.000018069295,0.000043147324,0.000022549797],"genre_scores_gemma":[0.96697766,0.000006715178,0.032765098,0.00023764599,0.0000045948027,0.000003939579,9.4415543e-7,0.0000027555175,6.349223e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991968,0.000094161755,0.00022986063,0.0002124946,0.0001473376,0.00011931437],"domain_scores_gemma":[0.99938834,0.00020196565,0.000091592156,0.00017992443,0.000048329333,0.00008987417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121974575,0.000086755994,0.00018969268,0.0003074474,0.00009067769,0.000027926913,0.00029970662,0.000023430186,0.00000922338],"category_scores_gemma":[0.0000010106093,0.000087562796,0.00016327793,0.0015772718,0.00009818872,0.00006843235,0.000004445861,0.00007440195,6.6076524e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008064132,0.00034312185,0.0017280241,0.00006825158,0.0011856433,0.000005318165,0.009151631,0.90258217,0.024050873,0.010482444,0.000033394797,0.050288476],"study_design_scores_gemma":[0.00043744227,0.00039209993,0.002473591,0.00002267304,0.00025132947,0.0000038198355,0.00014688764,0.94108486,0.0548121,0.00021061578,0.000028409817,0.00013616792],"about_ca_topic_score_codex":0.000051452393,"about_ca_topic_score_gemma":0.000013995661,"teacher_disagreement_score":0.7162044,"about_ca_system_score_codex":0.000011509377,"about_ca_system_score_gemma":0.00002855832,"threshold_uncertainty_score":0.3570707},"labels":[],"label_agreement":null},{"id":"W3012606778","doi":"10.1016/j.disc.2021.112368","title":"An efficiently generated family of binary de Bruijn sequences","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Nanyang Technological University","keywords":"De Bruijn sequence; Successor cardinal; Binary number; Shift register; Class (philosophy); Combinatorics; Discrete mathematics; Mathematics; Function (biology); State space; Computer science; Pseudorandom binary sequence; State (computer science); Sequence (biology); Algorithm; Arithmetic; Artificial intelligence; Statistics; Telecommunications","score_opus":0.0204393012070907,"score_gpt":0.2677536446587591,"score_spread":0.24731434345166842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012606778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.652468,0.00016044662,0.34544778,0.000078334284,0.00007961477,0.000045129927,0.000005887881,0.000088833265,0.0016259524],"genre_scores_gemma":[0.84180385,0.000020394955,0.15795755,0.00013564978,0.00001929423,0.000004398709,0.0000060312855,0.000008216624,0.000044596214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989772,0.00011736293,0.0002459476,0.00022970891,0.0002172208,0.0002126006],"domain_scores_gemma":[0.9989607,0.000094286246,0.00010439074,0.0006479243,0.00011017945,0.00008254693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004114442,0.00011523117,0.00018243857,0.00007672972,0.00008988696,0.00010682562,0.0006567381,0.000048709928,0.000018721814],"category_scores_gemma":[0.00004150606,0.000101301455,0.00009314055,0.00066094013,0.00008404019,0.00018121397,0.00012644772,0.00007492683,0.000008282242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039932656,0.00028569647,0.00020706466,0.000118945405,0.000035473833,0.000061358915,0.0049909363,0.0011824145,0.34943357,0.64193124,0.0001268135,0.0016224879],"study_design_scores_gemma":[0.00043284093,0.00041151617,0.0014144091,0.00023769538,0.000054395154,0.00009247454,0.0026401677,0.54058874,0.23610291,0.21705912,0.0004039476,0.00056182337],"about_ca_topic_score_codex":0.000004623037,"about_ca_topic_score_gemma":0.0000017430929,"teacher_disagreement_score":0.5394063,"about_ca_system_score_codex":0.000011091715,"about_ca_system_score_gemma":0.000109125,"threshold_uncertainty_score":0.41309533},"labels":[],"label_agreement":null},{"id":"W3012810501","doi":"10.37236/9456","title":"On the Intersection Distribution of Degree Three Polynomials and Related Topics","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Mathematical Sciences; Universität Rostock; Pacific Institute for the Mathematical Sciences; Alexander von Humboldt-Stiftung","keywords":"Monomial; Conjecture; Intersection (aeronautics); Mathematics; Combinatorics; Degree (music); Affine transformation; Distribution (mathematics); Polynomial; Complete intersection; Interpretation (philosophy); Affine space; Field (mathematics); Discrete mathematics; Pure mathematics; Physics; Mathematical analysis; Computer science","score_opus":0.014862534747300586,"score_gpt":0.22313194988496887,"score_spread":0.20826941513766828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012810501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7784591,0.0034218687,0.21296677,0.003003568,0.0016682814,0.00014049775,0.000001344473,0.000015762498,0.00032280097],"genre_scores_gemma":[0.9992887,0.00057401194,0.000012865805,0.0000352556,0.000055576413,0.000002246131,0.0000016706903,0.0000068149643,0.000022857794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838114,0.00039122012,0.00047815533,0.00016275926,0.0003337623,0.0002529716],"domain_scores_gemma":[0.99783623,0.00046627503,0.0008224858,0.0005743912,0.00026423493,0.000036364327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021996247,0.0001661876,0.00030461344,0.00006954079,0.00015117021,0.00012515344,0.0011717533,0.00014657591,0.000005063825],"category_scores_gemma":[0.00021060396,0.00009974375,0.0002514315,0.00038838168,0.0000996108,0.00010402039,0.0004811023,0.0016102326,3.6493373e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003730944,0.000063501655,0.000049693183,0.000013977539,0.0001715225,0.0000034355198,0.00039016525,0.00008028186,0.000065443666,0.9941017,0.000110272296,0.0049126805],"study_design_scores_gemma":[0.00025411183,0.00050538516,0.001280297,0.00015962738,0.000075802855,0.00012450524,0.00007466409,0.0008438534,0.0012130769,0.99522126,0.00014790283,0.00009954424],"about_ca_topic_score_codex":0.000007727947,"about_ca_topic_score_gemma":0.000006926341,"teacher_disagreement_score":0.2208296,"about_ca_system_score_codex":0.00022492393,"about_ca_system_score_gemma":0.0003863932,"threshold_uncertainty_score":0.6995749},"labels":[],"label_agreement":null},{"id":"W3021510930","doi":"10.1007/s00200-020-00431-1","title":"Boomerang uniformity of normalized permutation polynomials of low degree","year":2020,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Boomerang attack; Block cipher; Permutation (music); Differential cryptanalysis; Mathematics; Linear cryptanalysis; Degree (music); Finite field; Higher-order differential cryptanalysis; Differential (mechanical device); Combinatorics; Discrete mathematics; Algorithm; Cryptography; Physics","score_opus":0.013960704577778095,"score_gpt":0.21488260193150707,"score_spread":0.20092189735372898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021510930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5286713,0.0004038406,0.47026828,0.00019978273,0.000012220656,0.00011872849,7.5254593e-7,0.00007061792,0.0002544513],"genre_scores_gemma":[0.9615052,0.00005355732,0.03835283,0.00006541391,0.000007684073,0.0000053314643,0.000003171505,0.0000062419986,6.0431523e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992168,0.000053513693,0.00035838276,0.00014961834,0.000095211755,0.00012647235],"domain_scores_gemma":[0.9991309,0.00024896034,0.00014742679,0.00038069463,0.000041347543,0.000050648596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039483927,0.00009415739,0.00021621559,0.00010468442,0.000049139308,0.000023876206,0.0005894643,0.00004054509,0.000002282442],"category_scores_gemma":[0.000040103558,0.00010564748,0.000043464977,0.0005920977,0.00003694599,0.0001737751,0.00032009697,0.00013020949,7.164349e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005695054,0.00017396551,0.009641836,0.0008968426,0.000071570015,0.0000014377924,0.010082319,0.06823466,0.086275026,0.6388118,0.000019112618,0.18573447],"study_design_scores_gemma":[0.00068501994,0.000057132787,0.009850461,0.0001522212,0.0000065799914,0.0000035329213,0.00013603673,0.9590493,0.027284568,0.002482608,0.000102606566,0.0001899647],"about_ca_topic_score_codex":0.00002886786,"about_ca_topic_score_gemma":9.895439e-7,"teacher_disagreement_score":0.8908146,"about_ca_system_score_codex":0.000008428906,"about_ca_system_score_gemma":0.0000133752155,"threshold_uncertainty_score":0.4308179},"labels":[],"label_agreement":null},{"id":"W3023517918","doi":"10.1016/j.disc.2021.112780","title":"Investigating the discrepancy property of de Bruijn sequences","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Substring; Mathematics; Combinatorics; String (physics); Upper and lower bounds; Binary number; Discrete mathematics; De Bruijn graph; Simple (philosophy); Data structure; Arithmetic; Computer science; Mathematical analysis","score_opus":0.02649436287000227,"score_gpt":0.25102502956612394,"score_spread":0.22453066669612168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023517918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.500749,0.000312005,0.4680189,0.0062123234,0.00029876307,0.0006602659,0.00002572359,0.00035405747,0.023368955],"genre_scores_gemma":[0.92262036,0.0000045877664,0.076826744,0.00025733028,0.000019052903,0.00006418388,0.0000012409143,0.000008844837,0.0001976543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988832,0.00017961631,0.00025114656,0.00016342469,0.00032380357,0.00019880015],"domain_scores_gemma":[0.9989668,0.0002096867,0.00018667418,0.00056803634,0.000025394618,0.000043389766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010357657,0.000098371675,0.00013755144,0.00004617762,0.00042829604,0.00007076015,0.0012951061,0.000014107665,0.000036595462],"category_scores_gemma":[0.00011811391,0.000052840034,0.0001009919,0.00050534663,0.00016415212,0.00013463266,0.0006115527,0.0001651653,0.000002291671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010335237,0.000044887296,0.00057633437,0.000067981324,0.000020892543,0.0000022195388,0.015665771,0.0002018877,0.0014310302,0.9795076,0.00021310397,0.0022672499],"study_design_scores_gemma":[0.000109291184,0.0001330408,0.0001917746,0.000057957484,0.000019938507,0.000052490475,0.0036884479,0.0776774,0.0025084235,0.91366565,0.0017098081,0.00018575006],"about_ca_topic_score_codex":0.000026608102,"about_ca_topic_score_gemma":0.0000029982193,"teacher_disagreement_score":0.42187133,"about_ca_system_score_codex":0.000018524914,"about_ca_system_score_gemma":0.000074064716,"threshold_uncertainty_score":0.32941502},"labels":[],"label_agreement":null},{"id":"W3026492770","doi":"10.1109/tcomm.2020.2996781","title":"A Joint Encryption, Channel Coding and Modulation Scheme Using QC-LDPC Lattice-Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Algorithm; Cryptosystem; Mathematics; Computer science; Theoretical computer science; Plaintext; Encryption; Decoding methods; Cryptography; Computer network","score_opus":0.10968305158944719,"score_gpt":0.28413902087906984,"score_spread":0.17445596928962265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026492770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016733155,0.00010753048,0.97644293,0.005786501,0.00011013143,0.00019090946,0.000014953063,0.00028843107,0.00032548624],"genre_scores_gemma":[0.88299984,0.0002165933,0.116238356,0.0004672722,0.00002165152,0.000030549683,0.000003449303,0.0000115392595,0.000010728715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988972,0.00018770626,0.00027262824,0.00030157878,0.00015905495,0.00018182462],"domain_scores_gemma":[0.99841386,0.00019154263,0.000095930496,0.0010585524,0.0001000797,0.00014005469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024560184,0.0001518538,0.00015918625,0.00018543152,0.00095300435,0.00016629424,0.0007402032,0.00006858814,0.000018057073],"category_scores_gemma":[0.000013657823,0.00016872553,0.000098769386,0.000741786,0.00013940476,0.00056237995,0.000024918687,0.0003162552,0.000019074107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009942727,0.0011793687,0.00012253347,0.00016785118,0.00042364068,0.000004941837,0.026273156,0.031513788,0.2266327,0.64484245,0.00018417493,0.06855594],"study_design_scores_gemma":[0.00029279102,0.00007520634,0.00021123518,0.000057631267,0.000030716867,0.0000113582,0.00015055852,0.98391503,0.003359574,0.011226842,0.00044604196,0.0002230024],"about_ca_topic_score_codex":0.000029881216,"about_ca_topic_score_gemma":0.000020272693,"teacher_disagreement_score":0.9524013,"about_ca_system_score_codex":0.00003433857,"about_ca_system_score_gemma":0.0000372661,"threshold_uncertainty_score":0.7329835},"labels":[],"label_agreement":null},{"id":"W3029268111","doi":"","title":"Asymptotic enumeration of correlation-immune boolean functions.","year":2009,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Boolean function; Mathematics; Parity function; Combinatorics; Function (biology); Discrete mathematics; Order (exchange); Maximum satisfiability problem; Boolean data type; Boolean expression","score_opus":0.009733637308701328,"score_gpt":0.21661350083371947,"score_spread":0.20687986352501814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029268111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050795665,0.00028160936,0.9732026,0.00028045807,0.0011170314,0.00018036223,0.0000027818812,0.00020542443,0.019650191],"genre_scores_gemma":[0.9743035,0.000023166043,0.024547463,0.00011184826,0.00007052364,0.00001066658,0.00003947464,0.000006449738,0.00088691013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878854,0.00010088984,0.0003873218,0.00036602333,0.00022329582,0.00013393967],"domain_scores_gemma":[0.99861544,0.00007673875,0.00024216385,0.0008940977,0.00012996729,0.00004160012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040033046,0.00016821877,0.00022457165,0.00025192165,0.0000987517,0.00011671497,0.0006628154,0.00016398229,0.000100412166],"category_scores_gemma":[0.000030436033,0.00016535613,0.00021276389,0.00030499414,0.000035952162,0.00019992638,0.00035563752,0.0003081534,0.000053989323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013824111,0.00011830811,0.00039920653,0.00004972078,0.000071150134,0.0000014605622,0.00046964563,0.031282756,0.00030254034,0.866669,0.0011906746,0.09943173],"study_design_scores_gemma":[0.00045586028,0.00030614718,0.01904894,0.0002857265,0.00008846324,0.000011793682,0.000037149635,0.3069725,0.0019996576,0.66712177,0.0029478818,0.00072410743],"about_ca_topic_score_codex":0.000022221608,"about_ca_topic_score_gemma":0.0000035446183,"teacher_disagreement_score":0.9692239,"about_ca_system_score_codex":0.000031226245,"about_ca_system_score_gemma":0.00010789055,"threshold_uncertainty_score":0.67430276},"labels":[],"label_agreement":null},{"id":"W3029570467","doi":"10.1007/s40314-020-01181-z","title":"New classes of codes over $$R_{q,p,m}={\\mathbb {Z}}_{p^{m}}[u_{1}, u_{2}, \\ldots , u_{ q}]/\\left\\langle u_{i}^{2}=0,u_{i}u_{j}=u_{j}u_{i}\\right\\rangle $$ and their applications","year":2020,"lang":"en","type":"article","venue":"Computational and Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Simplex; Mathematics; Physics; Discrete mathematics","score_opus":0.016092455912445933,"score_gpt":0.2244787084467095,"score_spread":0.20838625253426357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029570467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07603601,0.0008313104,0.91419786,0.0015743911,0.00014465766,0.0011020688,0.000177668,0.0004490963,0.0054869265],"genre_scores_gemma":[0.8094784,0.000113732545,0.1883684,0.0011582976,0.00037126863,0.00010573255,0.00012042601,0.000074719916,0.0002090172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681556,0.00007276722,0.0009561606,0.0009433482,0.0006684517,0.0005436824],"domain_scores_gemma":[0.99687105,0.0012646893,0.0005415963,0.00065212004,0.00021140068,0.00045915338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042887064,0.0006361657,0.00087397493,0.0002576128,0.00054268976,0.00039245296,0.0010304503,0.00021813331,0.00012880842],"category_scores_gemma":[0.00004170443,0.00054505764,0.0002454583,0.0009420313,0.00037662438,0.00036491422,0.00056789356,0.0003563881,0.00007147159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005695627,0.0005521416,0.00012049022,0.0008419444,0.00024505463,0.000006636417,0.007078158,0.0022502576,0.0063423216,0.9633246,0.0061743218,0.013007116],"study_design_scores_gemma":[0.0019235235,0.00023824583,0.0005585879,0.000243576,0.00015384,0.00007811346,0.0010119522,0.11129235,0.007445307,0.86316437,0.012785108,0.001105045],"about_ca_topic_score_codex":0.000008873181,"about_ca_topic_score_gemma":0.000010632998,"teacher_disagreement_score":0.73344237,"about_ca_system_score_codex":0.000035054785,"about_ca_system_score_gemma":0.00019245813,"threshold_uncertainty_score":0.99970007},"labels":[],"label_agreement":null},{"id":"W3033054633","doi":"10.2478/udt-2019-0010","title":"Joint Distribution in Residue Classes of the Base- <i>q</i> and Ostrowski Digital Sums","year":2019,"lang":"en","type":"article","venue":"Uniform distribution theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Physics; Base (topology); Combinatorics; Crystallography; Analytical Chemistry (journal); Mathematics; Chemistry","score_opus":0.005694574982321248,"score_gpt":0.18203905387445798,"score_spread":0.17634447889213672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033054633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8478707,0.00010698714,0.14842881,0.0003816937,0.00024100968,0.00029155865,0.0004838589,0.00007363207,0.0021217177],"genre_scores_gemma":[0.99962413,0.0000114937875,0.00005121257,0.000051657626,0.000013246094,0.0000058732167,0.00016043159,0.000004658154,0.000077266894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881303,0.00014681101,0.000298969,0.0002730609,0.00021681306,0.0002512858],"domain_scores_gemma":[0.9989515,0.00019914455,0.00014923312,0.00057394285,0.000070214024,0.00005596939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008065885,0.00014133999,0.00017405009,0.000052694606,0.00009928884,0.00011292213,0.00046508407,0.00007842164,0.000017891272],"category_scores_gemma":[0.00015647303,0.00010430988,0.00011236913,0.00061606173,0.00019605369,0.0005733085,0.00031216606,0.00017895487,0.000011861167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042806587,0.00006141633,0.015702058,0.000022578364,0.000007871154,0.0000010136807,0.000079221005,0.000022713688,0.00051807653,0.9787631,0.00013130579,0.004647855],"study_design_scores_gemma":[0.0012451645,0.00024434837,0.18529436,0.00023887758,0.000017987517,0.000035266763,0.0004907959,0.0018763207,0.03340149,0.77114064,0.0055881646,0.00042656672],"about_ca_topic_score_codex":0.000008119606,"about_ca_topic_score_gemma":0.0000058188293,"teacher_disagreement_score":0.20762242,"about_ca_system_score_codex":0.00006501556,"about_ca_system_score_gemma":0.000057177615,"threshold_uncertainty_score":0.42536333},"labels":[],"label_agreement":null},{"id":"W3033468545","doi":"10.3934/amc.2020084","title":"Involutory-Multiple-Lightweight MDS Matrices based on Cauchy-type Matrices","year":2020,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cauchy distribution; Cauchy matrix; Combinatorics; Matrix (chemical analysis); Separable space; Arithmetic; Algebra over a field; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.031567735736418245,"score_gpt":0.29276075773538546,"score_spread":0.2611930219989672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033468545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021514049,0.035513595,0.85970163,0.014424697,0.0004986649,0.0013430993,0.000053536733,0.0008822578,0.06606846],"genre_scores_gemma":[0.66954374,0.0018443895,0.32829946,0.00025256682,0.000013224097,0.000023139146,0.0000055456926,0.000010620016,0.000007324745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866664,0.00015104865,0.00049168675,0.00022547589,0.00028055027,0.00018460432],"domain_scores_gemma":[0.9956068,0.0019471463,0.00032540062,0.0019258321,0.000116525815,0.000078292775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036941265,0.0001621338,0.00027808847,0.00024254163,0.00014872605,0.000053248394,0.003476458,0.000054801112,0.00001663262],"category_scores_gemma":[0.00032702004,0.00015077187,0.00009290067,0.001538395,0.00017173991,0.0005779439,0.00044598678,0.00022476535,0.000030245092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002334165,0.00059299543,0.0020194084,0.00030260012,0.000017095088,0.0000017837021,0.0028593298,0.0026953449,0.00040559942,0.98549765,0.00016330209,0.005421565],"study_design_scores_gemma":[0.0007097817,0.0003785106,0.00025606228,0.00045169925,0.00003077779,0.0000020019318,0.0003544374,0.65843254,0.0021259575,0.29317555,0.043617893,0.0004648029],"about_ca_topic_score_codex":0.000003922417,"about_ca_topic_score_gemma":0.000022229933,"teacher_disagreement_score":0.6923221,"about_ca_system_score_codex":0.000020667125,"about_ca_system_score_gemma":0.00005064978,"threshold_uncertainty_score":0.64601815},"labels":[],"label_agreement":null},{"id":"W3036011203","doi":"10.48550/arxiv.1712.00669","title":"Drinfeld Modules with Complex Multiplication, Hasse Invariants and\\n Factoring Polynomials over Finite Fields","year":2017,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Public Works and Government Services Canada; National Science Foundation","keywords":"Mathematics; Finite field; Lift (data mining); Polynomial ring; Hasse principle; Invariant (physics); Multiplication (music); Complex multiplication; Discrete mathematics; Polynomial; Combinatorics; Pure mathematics; Algebraic number field; Elliptic curve","score_opus":0.08979091947607205,"score_gpt":0.20168409357704017,"score_spread":0.11189317410096812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036011203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56676966,0.000004376267,0.4316695,0.00013695125,0.000054733082,0.00006702572,0.0000025081251,0.00007159944,0.0012236021],"genre_scores_gemma":[0.9981362,0.00002099869,0.0014983658,0.000106158215,0.000029741095,4.771341e-7,0.0000011179538,0.0000056435492,0.00020128362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99921775,0.000037082824,0.000080689126,0.00042692295,0.000046003133,0.00019155044],"domain_scores_gemma":[0.99861526,0.00013285584,0.00013101079,0.0009636765,0.000050131515,0.00010706152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012342127,0.00012803778,0.00013167926,0.00009825663,0.0006079903,0.0002579678,0.00092017546,0.00006035158,0.000020743879],"category_scores_gemma":[0.0000389487,0.00012592135,0.000045422523,0.00013902674,0.00013565776,0.00087916065,0.0003919514,0.00010322128,0.0000109915545],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007345366,0.00007144379,0.19370218,0.000014954236,0.000072667994,0.000068731555,0.00062341394,0.002956328,0.0007333663,0.7985317,0.000091777016,0.0030599781],"study_design_scores_gemma":[0.0016952547,0.00015929033,0.74545795,0.00005963738,0.000037326008,0.000007315168,0.00006281156,0.21187347,0.0009528645,0.036881335,0.0022553306,0.00055739656],"about_ca_topic_score_codex":0.00013157491,"about_ca_topic_score_gemma":0.0000807466,"teacher_disagreement_score":0.7616504,"about_ca_system_score_codex":0.000015461566,"about_ca_system_score_gemma":0.000018568351,"threshold_uncertainty_score":0.51349235},"labels":[],"label_agreement":null},{"id":"W3036019187","doi":"10.1109/tit.2020.3002993","title":"Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Pacific Institute for the Mathematical Sciences; Alexander von Humboldt-Stiftung","keywords":"Planarity testing; Computer science; Mathematics; Theoretical computer science; Combinatorics; Algorithm","score_opus":0.011628620521478302,"score_gpt":0.19264855307998355,"score_spread":0.18101993255850524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036019187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069829393,0.00000810726,0.98764634,0.0024237703,0.00034843036,0.00025290466,0.000027864946,0.0001392986,0.002170348],"genre_scores_gemma":[0.99779457,0.000010610106,0.00017497079,0.0019369418,0.000023728597,0.00004975645,0.0000025761171,0.0000035192206,0.0000033473757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992207,0.00014981689,0.00026339944,0.00011984677,0.00014735977,0.00009882404],"domain_scores_gemma":[0.99895597,0.0004880388,0.00013085749,0.00030435462,0.00006024142,0.000060561135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057430053,0.0001121312,0.00010989652,0.000099313744,0.00035109,0.000090188165,0.00032175783,0.000054038283,0.000023269666],"category_scores_gemma":[0.000019373181,0.00007909315,0.00008512205,0.00040206127,0.00008035136,0.0008157577,0.000004528333,0.0002450563,0.000043359192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013097716,0.000046255947,0.0000010963574,0.000020489026,0.00003131355,4.9114664e-8,0.006282794,0.0013998633,0.00025190477,0.9106411,0.00011105691,0.081083134],"study_design_scores_gemma":[0.0019393692,0.0014722741,0.00014640582,0.00012104259,0.000068164445,0.00001737658,0.006920205,0.1306825,0.062049907,0.7786015,0.017340897,0.00064036],"about_ca_topic_score_codex":0.0000032746032,"about_ca_topic_score_gemma":7.356768e-7,"teacher_disagreement_score":0.9908116,"about_ca_system_score_codex":0.000014895955,"about_ca_system_score_gemma":0.000022778453,"threshold_uncertainty_score":0.32253253},"labels":[],"label_agreement":null},{"id":"W3038455654","doi":"10.4153/s0008439520000892","title":"Degree gaps for multipliers and the dynamical André–Oort conjecture","year":2020,"lang":"en","type":"preprint","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Conjecture; Degree (music); Mathematics; Multiplier (economics); Pure mathematics; Combinatorics; Physics; Economics; Keynesian economics","score_opus":0.023204606471731695,"score_gpt":0.2279272374924802,"score_spread":0.2047226310207485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038455654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004054411,0.0006119862,0.8483371,0.13582656,0.00043334046,0.0021113344,0.00014787115,0.00021318567,0.00826422],"genre_scores_gemma":[0.9299554,0.000029256695,0.062131368,0.006794314,0.00024334123,0.0004367102,0.00003117903,0.000053390046,0.00032503606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981716,0.00014629163,0.00033667465,0.0006688024,0.00019079843,0.0004857933],"domain_scores_gemma":[0.9972217,0.0011405797,0.00010287942,0.0007776332,0.000056444103,0.00070076727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072474225,0.00033229322,0.0005302607,0.000114491355,0.00026893392,0.0004021854,0.0013508627,0.00031594172,0.0003483789],"category_scores_gemma":[0.0006839148,0.00023606341,0.00029139506,0.00013048173,0.0005021274,0.000018823906,0.00056510896,0.00068975746,0.00020837045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033023858,0.000010772152,0.000005409266,0.00029393853,0.00007304467,0.0000252569,0.0007618918,0.000013576815,0.0000029129849,0.98374456,0.011035853,0.0039997515],"study_design_scores_gemma":[0.0009134945,0.000042689433,0.000037402326,0.00015302851,0.00006163537,0.0000415691,0.000055723125,0.0383901,0.000010084239,0.9070287,0.05288256,0.00038305094],"about_ca_topic_score_codex":0.00019025695,"about_ca_topic_score_gemma":0.00047317677,"teacher_disagreement_score":0.925901,"about_ca_system_score_codex":0.00006539572,"about_ca_system_score_gemma":0.0002812677,"threshold_uncertainty_score":0.9626387},"labels":[],"label_agreement":null},{"id":"W3044913267","doi":"10.48550/arxiv.2007.12825","title":"A note on watchman's walks in de Bruijn graphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"De Bruijn sequence; De Bruijn graph; Digraph; Graph; Combinatorics; Order (exchange); Sequence (biology); Mathematics; Computer science; Discrete mathematics; Business","score_opus":0.05746061102912097,"score_gpt":0.18824048836806503,"score_spread":0.13077987733894406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044913267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5603649,0.0000314606,0.42843202,0.0008436169,0.00056963315,0.00030343907,0.000009901812,0.00047576256,0.008969301],"genre_scores_gemma":[0.99785215,0.00008576623,0.0012743078,0.00059364946,0.00004280447,0.0000012735293,0.000004865857,0.000015599671,0.00012958351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978755,0.0002564437,0.00017144761,0.0011704214,0.00009436914,0.00043177698],"domain_scores_gemma":[0.9983477,0.00016842748,0.00013546842,0.0010937682,0.000042004012,0.00021261316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033850144,0.00031828493,0.0003224643,0.0005010241,0.00010562068,0.000106543106,0.0022932256,0.00027955935,0.000019456997],"category_scores_gemma":[0.000034344885,0.00038014213,0.00032959034,0.0012155827,0.0000962098,0.00019173897,0.0015920174,0.0009834509,0.00008405552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009915889,0.000116524636,0.0026686774,0.000050619507,0.00003781612,0.0009886466,0.0008845165,0.02825836,0.00007440924,0.96500987,0.00022580821,0.0015856035],"study_design_scores_gemma":[0.00054270664,0.0001261186,0.003940509,0.00015192096,0.000027757531,0.0000032877415,0.000037507412,0.116774894,0.00020382178,0.8767105,0.0009700711,0.00051092915],"about_ca_topic_score_codex":0.00014452504,"about_ca_topic_score_gemma":0.00007950956,"teacher_disagreement_score":0.43748727,"about_ca_system_score_codex":0.0001541877,"about_ca_system_score_gemma":0.00015250048,"threshold_uncertainty_score":0.99986506},"labels":[],"label_agreement":null},{"id":"W3044956106","doi":"","title":"On double circulant doubly even self-dual [72, 36, 12] codes and their neighbors","year":2008,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Mathematics; Dual (grammatical number); Combinatorics; Discrete mathematics; Philosophy; Linguistics","score_opus":0.020536902347200583,"score_gpt":0.22682279172034892,"score_spread":0.20628588937314835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044956106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98446506,0.0002798516,0.0101006115,0.001575371,0.0009427282,0.0001390265,0.0000021599528,0.00008583124,0.0024093536],"genre_scores_gemma":[0.99921095,0.00015272689,0.00030589846,0.00013472556,0.0000976896,0.0000017481891,3.1847162e-7,0.000013143475,0.000082808765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984327,0.00018301111,0.00040294303,0.00019932569,0.00040622032,0.0003758207],"domain_scores_gemma":[0.998497,0.0002988485,0.00035955213,0.0004937461,0.00013837333,0.00021245379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009583664,0.00023587514,0.000327671,0.00020346987,0.00044632505,0.00014028695,0.0010921797,0.00008197219,0.000007848325],"category_scores_gemma":[0.000020366595,0.00014709971,0.00019354859,0.0004942868,0.00016125059,0.00040142483,0.0001417523,0.0005444906,0.000006759459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021081683,0.00037712028,0.0027673496,0.000014520842,0.00019548897,0.00024604794,0.006168063,0.00019575622,0.0002462872,0.98625004,0.002050543,0.001277962],"study_design_scores_gemma":[0.0053057782,0.002569439,0.03471384,0.00017341675,0.00009080244,0.007561714,0.0005408713,0.0007134259,0.0051799454,0.93685776,0.0056173895,0.0006756387],"about_ca_topic_score_codex":0.0000030089934,"about_ca_topic_score_gemma":5.753741e-7,"teacher_disagreement_score":0.0493923,"about_ca_system_score_codex":0.000045577053,"about_ca_system_score_gemma":0.00011853098,"threshold_uncertainty_score":0.5998552},"labels":[],"label_agreement":null},{"id":"W3045549505","doi":"10.1145/3373207.3404022","title":"A Las Vegas algorithm for computing the smith form of a nonsingular integer matrix","year":2020,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Invertible matrix; Integer (computer science); Dimension (graph theory); Matrix (chemical analysis); Integer matrix; Las vegas; Mathematics; Combinatorics; Matrix multiplication; Algorithm; Discrete mathematics; Arithmetic; Computer science; Symmetric matrix; Nonnegative matrix; Pure mathematics","score_opus":0.017071315956414358,"score_gpt":0.25445148857132766,"score_spread":0.2373801726149133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045549505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003900831,0.00009651053,0.99230236,0.0023078413,0.00011691857,0.00019815013,0.000002172185,0.00012317998,0.00095204083],"genre_scores_gemma":[0.6164727,0.0000017711193,0.38226637,0.0011014041,0.000100144105,0.000004598645,4.977255e-7,0.000007333768,0.000045152457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927443,0.000033733886,0.00018136838,0.00020404726,0.00012645943,0.00017997269],"domain_scores_gemma":[0.99918437,0.00034230988,0.000075399126,0.00026695698,0.00007662684,0.000054326578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036172077,0.00009188401,0.00013899877,0.00004062667,0.00013016655,0.000076641176,0.0006879653,0.000027331058,0.00000817447],"category_scores_gemma":[0.00005092631,0.00005934236,0.00015419147,0.00042926407,0.000057666475,0.0001199757,0.00024427864,0.000084669504,0.000005665269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016443031,0.000041814055,0.00008267864,0.00004014796,0.0000560117,0.000002908109,0.005828312,0.000040036295,0.00030494013,0.6626224,0.0016432889,0.32932106],"study_design_scores_gemma":[0.00042723655,0.0002961559,0.000071627874,0.000033328823,0.0000167904,0.000010653622,0.00030203347,0.936638,0.0042487876,0.04506073,0.012741751,0.00015293187],"about_ca_topic_score_codex":0.0000060245784,"about_ca_topic_score_gemma":0.0000010036566,"teacher_disagreement_score":0.93659794,"about_ca_system_score_codex":0.000005317426,"about_ca_system_score_gemma":0.00003523117,"threshold_uncertainty_score":0.24199113},"labels":[],"label_agreement":null},{"id":"W3045916595","doi":"10.1145/3457341.3457342","title":"Computing one billion roots using the tangent Graeffe method","year":2020,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Tangent; Degree (music); Factorization; Prime factor; Polynomial; Fast Fourier transform; Prime (order theory); Tangent vector; Combinatorics; Algorithm; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.12045959822385764,"score_gpt":0.345415546345897,"score_spread":0.22495594812203934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045916595","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016787028,0.00067942723,0.9615331,0.02007533,0.00020023555,0.0003015072,0.0000014296576,0.00027460628,0.00014732472],"genre_scores_gemma":[0.4644806,0.000038464896,0.53295624,0.0024205493,0.00008235843,0.000007695953,0.0000034093189,0.000010083835,5.9534597e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997343,0.001146679,0.000466558,0.00045267472,0.00026327462,0.00032779784],"domain_scores_gemma":[0.9937558,0.0015466298,0.00017807624,0.004315593,0.00009414485,0.000109745335],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011881393,0.00020385084,0.00026048406,0.000180883,0.000593761,0.00029183648,0.008556175,0.00006947754,0.000006518686],"category_scores_gemma":[0.00010633267,0.00017569622,0.00014290186,0.0020131695,0.00014714575,0.00033114103,0.006724794,0.00053375546,0.000020327472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000142691815,0.00041584278,0.003069046,0.000034544304,0.00013160982,0.000007809682,0.010226631,0.008975952,0.001753871,0.48219016,0.00053088926,0.49264938],"study_design_scores_gemma":[0.00031568782,0.00007427163,0.0033702462,0.00007516528,0.000017965338,0.000016881222,0.00005073734,0.94349986,0.00027381603,0.04887101,0.0031684216,0.0002659542],"about_ca_topic_score_codex":0.000047124857,"about_ca_topic_score_gemma":0.000016870576,"teacher_disagreement_score":0.9345239,"about_ca_system_score_codex":0.00005095229,"about_ca_system_score_gemma":0.00005314915,"threshold_uncertainty_score":0.996808},"labels":[],"label_agreement":null},{"id":"W3046165332","doi":"10.18280/ts.370315","title":"Sequences with Perfect Periodic Auto and Cross Correlation Properties","year":2020,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Correlation; Cross-correlation; Mathematics; Computer science; Statistical physics; Statistics; Physics; Geometry","score_opus":0.02233387545748542,"score_gpt":0.2101774619114213,"score_spread":0.1878435864539359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046165332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78085786,0.00017208356,0.21717003,0.0010836782,0.000036129,0.00014717558,0.0000012146454,0.0001592488,0.00037255767],"genre_scores_gemma":[0.9976143,0.000004334743,0.0018002508,0.00049287896,0.00004997413,0.000016143538,0.0000010309434,0.000004382227,0.000016656588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921745,0.00005839739,0.00011634833,0.00026741167,0.00019490495,0.0001454929],"domain_scores_gemma":[0.9997282,0.000024061497,0.00004293621,0.000088346074,0.00003269081,0.000083770305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017016003,0.00010721683,0.00009430734,0.000034076824,0.00022529412,0.0003206679,0.00022994608,0.000021707894,0.000064372645],"category_scores_gemma":[0.000005615418,0.00007604409,0.000029513814,0.00019827404,0.00014433793,0.00043535017,0.000056439927,0.000076643446,0.0000099155495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014209354,0.0003732324,0.26986286,0.00053783745,0.00034863056,0.00016622704,0.12295334,0.014352756,0.0901145,0.32864106,0.0006754198,0.17055322],"study_design_scores_gemma":[0.0034238703,0.0063651176,0.12364537,0.00026626335,0.000083461615,0.000121345955,0.0010117285,0.8386787,0.012676842,0.0043648286,0.008038231,0.0013241983],"about_ca_topic_score_codex":0.000005443072,"about_ca_topic_score_gemma":0.0000018325579,"teacher_disagreement_score":0.824326,"about_ca_system_score_codex":0.000008052541,"about_ca_system_score_gemma":0.000035574296,"threshold_uncertainty_score":0.3100988},"labels":[],"label_agreement":null},{"id":"W3081150612","doi":"10.1515/jmc-2019-0033","title":"New Zémor-Tillich Type Hash Functions Over GL <sub>2</sub> (𝔽 <sub> <i>p</i> <sup> <i>n</i> </sup> </sub> )","year":2020,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hash function; Mathematics; Lemma (botany); Discrete mathematics; Type (biology); Combinatorics; Hash chain; Class (philosophy); Group (periodic table); Set (abstract data type); Computer science; Physics; Biology","score_opus":0.018942253248732804,"score_gpt":0.2340439368169824,"score_spread":0.2151016835682496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081150612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3322114,0.00028986463,0.6574125,0.008097947,0.00055263384,0.00017322143,0.0000038042017,0.00015526579,0.0011033373],"genre_scores_gemma":[0.9561553,0.00011332215,0.03743077,0.0050845505,0.001129933,0.000007344858,0.0000024231044,0.000059599886,0.00001672528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634206,0.00036593765,0.0012741071,0.00054077123,0.0007416282,0.00073549943],"domain_scores_gemma":[0.9967338,0.00071666914,0.0006289967,0.00067201327,0.00036874137,0.0008798096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008619595,0.00044874017,0.0009886441,0.00030815386,0.0002380433,0.00022340768,0.0015211572,0.00032757552,0.00013165816],"category_scores_gemma":[0.000778042,0.00038040528,0.00060736947,0.0013699128,0.00015182665,0.0007067247,0.00045223726,0.0010423986,0.00073610863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065376284,0.0008717635,0.00038994427,0.00029749933,0.0006410152,0.0006069684,0.0032112505,0.00077447644,0.23501109,0.55778754,0.15130334,0.048451368],"study_design_scores_gemma":[0.0045664576,0.004215458,0.00041056215,0.00039654053,0.00060443254,0.0040247124,0.00057084364,0.016548924,0.16440473,0.77802104,0.02467651,0.0015598084],"about_ca_topic_score_codex":6.090407e-7,"about_ca_topic_score_gemma":0.0000011733031,"teacher_disagreement_score":0.6239439,"about_ca_system_score_codex":0.000052456562,"about_ca_system_score_gemma":0.00034824744,"threshold_uncertainty_score":0.9998648},"labels":[],"label_agreement":null},{"id":"W3083053830","doi":"10.1109/cec48606.2020.9185728","title":"Cryptanalysis of RSA: Integer Prime Factorization Using Genetic Algorithms","year":2020,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Prime factor; Integer factorization; Factorization; Integer (computer science); Prime number; Algorithm; Prime (order theory); Cryptanalysis; Mathematics; Computer science; Cryptosystem; Decimal; Genetic algorithm; Cryptography; Discrete mathematics; Arithmetic; Public-key cryptography; Combinatorics; Mathematical optimization; Encryption","score_opus":0.03534518883123066,"score_gpt":0.24723534307749917,"score_spread":0.2118901542462685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083053830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035293855,0.00004690551,0.9638326,0.0001863923,0.0000710678,0.00004332552,6.7932405e-7,0.00008309099,0.00044204216],"genre_scores_gemma":[0.83019984,0.000003603018,0.16958867,0.00016003531,0.000034742232,6.0295116e-7,5.735192e-7,0.00000361916,0.000008342194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928087,0.000050436698,0.00018465123,0.00021621089,0.00016244526,0.00010536061],"domain_scores_gemma":[0.9995219,0.000032111886,0.00007480983,0.00023119038,0.000072734176,0.00006724904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007775893,0.00007742435,0.0001307916,0.00008720069,0.00004162177,0.00004363435,0.00040215914,0.000030450065,0.00009193727],"category_scores_gemma":[0.000025497202,0.00006732806,0.00010027402,0.0009424069,0.000026546251,0.00017810316,0.00012772999,0.000048250437,0.000007933173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039393188,0.0002643975,0.02308906,0.000093445546,0.00057457964,0.00002115428,0.009761309,0.008857035,0.23577869,0.3140682,0.00022839262,0.40722433],"study_design_scores_gemma":[0.00018759092,0.00012040389,0.0024861505,0.000011427765,0.000052861564,0.0000024223737,0.00007202262,0.91457224,0.07093601,0.010911841,0.0004230738,0.00022394002],"about_ca_topic_score_codex":0.000014969585,"about_ca_topic_score_gemma":4.92252e-7,"teacher_disagreement_score":0.9057152,"about_ca_system_score_codex":0.000008418458,"about_ca_system_score_gemma":0.000024052564,"threshold_uncertainty_score":0.27455586},"labels":[],"label_agreement":null},{"id":"W3086805570","doi":"10.1007/s12095-021-00490-2","title":"Kim-type APN functions are affine equivalent to Gold functions","year":2021,"lang":"en","type":"preprint","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Type (biology); Permutation (music); Affine transformation; Combinatorics; Mathematics; Function (biology); Physics; Pure mathematics","score_opus":0.04773061018136424,"score_gpt":0.27858215718456353,"score_spread":0.2308515470031993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086805570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03948375,0.013632387,0.89479387,0.016825099,0.0032724855,0.001263594,0.0002552626,0.0014397432,0.029033795],"genre_scores_gemma":[0.9280721,0.0033952876,0.06561815,0.0012596687,0.00017985856,0.00063149066,0.00041693012,0.000047737285,0.00037876717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970605,0.00046969915,0.0005797455,0.0010522448,0.0003372686,0.0005005553],"domain_scores_gemma":[0.9911398,0.00039004252,0.00029269815,0.007165091,0.0005883684,0.00042397727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004849102,0.00051298476,0.00052851724,0.0010163254,0.0011655866,0.000983578,0.0037336065,0.00029517704,0.00009241694],"category_scores_gemma":[0.000102150254,0.0005655131,0.00057110866,0.0033088366,0.00037077142,0.0004058893,0.00781235,0.0012851006,0.00005710708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010331658,0.0031593808,0.00868143,0.00044833228,0.001895014,0.00002210307,0.008838974,0.0013599253,0.0012776775,0.74077314,0.03131815,0.20212258],"study_design_scores_gemma":[0.0017529109,0.0010762877,0.09985293,0.002841468,0.0014132424,0.00014914961,0.012258116,0.0050968034,0.0003201955,0.14415419,0.72549254,0.0055921436],"about_ca_topic_score_codex":0.00006226034,"about_ca_topic_score_gemma":0.0003822608,"teacher_disagreement_score":0.88858837,"about_ca_system_score_codex":0.000040906354,"about_ca_system_score_gemma":0.00017359918,"threshold_uncertainty_score":0.9996796},"labels":[],"label_agreement":null},{"id":"W30882982","doi":"10.1007/978-1-4615-0304-0_10","title":"On Edit Distance Attack to Alternating Step Generator","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Zero (linguistics); Mathematics; Generator (circuit theory); Binary number; Combinatorics; String (physics); Edit distance; Conditional probability; Regular conditional probability; Discrete mathematics; Algorithm; Arithmetic; Probability mass function; Statistics; Probability distribution; Physics","score_opus":0.023100079193239264,"score_gpt":0.2447477257809203,"score_spread":0.22164764658768105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30882982","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006827447,0.000077271536,0.4038048,0.00027496542,0.0013610026,0.00013997674,0.000007437697,0.00016416241,0.5941021],"genre_scores_gemma":[0.0024736463,0.00003386875,0.06688851,0.012926894,0.0011492604,0.00002579643,0.0000064140477,0.00008339928,0.91641223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982855,0.000024873867,0.00026314324,0.000727039,0.0004098854,0.0002895722],"domain_scores_gemma":[0.9985275,0.000117723845,0.00011843994,0.0009777003,0.00007429778,0.00018428282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023776204,0.000340808,0.00026531643,0.00018637418,0.00014058713,0.0001990408,0.0011180864,0.00013272275,0.00035956642],"category_scores_gemma":[0.000018656017,0.00031098805,0.00017916846,0.00008572216,0.000039211118,0.00011415506,0.00021423346,0.00027348538,0.00056241284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048945135,0.000009060734,0.0000010274055,0.0000073689353,0.000021533282,0.000020141686,0.00003845323,0.00006071641,0.000008660622,0.9328415,0.055444457,0.0115422],"study_design_scores_gemma":[0.00011498482,0.00016528841,0.0000010078368,0.0001390078,0.000006942883,0.0000048657253,0.0000015961098,0.00070914906,0.00013921008,0.077859215,0.92035604,0.0005026741],"about_ca_topic_score_codex":0.0000012390294,"about_ca_topic_score_gemma":0.000011255076,"teacher_disagreement_score":0.8649116,"about_ca_system_score_codex":0.000051523322,"about_ca_system_score_gemma":0.000026340314,"threshold_uncertainty_score":0.9999342},"labels":[],"label_agreement":null},{"id":"W3088897051","doi":"10.21136/cmj.2020.0543-19","title":"Sidon basis in polynomial rings over finite fields","year":2020,"lang":"en","type":"article","venue":"Czechoslovak Mathematical Journal","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Basis (linear algebra); Polynomial ring; Pure mathematics; Finite field; Polynomial; Algebra over a field; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.02087699387912606,"score_gpt":0.24134891164860692,"score_spread":0.22047191776948086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088897051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16086479,0.00007890375,0.8255792,0.0069723246,0.00024741056,0.00010149631,0.0000011396866,0.00012086936,0.0060338355],"genre_scores_gemma":[0.9726294,0.00001729637,0.024033863,0.0029568502,0.00030540585,0.0000042000515,1.9278886e-7,0.00001282189,0.000039956503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847907,0.00010551615,0.00045035416,0.0002651048,0.0003337914,0.0003661606],"domain_scores_gemma":[0.998847,0.00040741774,0.000113655195,0.00027436615,0.0000345735,0.00032295968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056533096,0.00016973427,0.0002762892,0.00015737308,0.00011356752,0.00032219512,0.0009613996,0.00010805474,0.0004331137],"category_scores_gemma":[0.00040726364,0.00014423372,0.0002088775,0.0005749265,0.00005170775,0.0004582344,0.00025251537,0.0006757352,0.00013532622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039490437,0.0009915058,0.0049445126,0.0003716824,0.00021587347,0.0014855368,0.030245673,0.0007432982,0.0033666312,0.78591627,0.02471064,0.14661345],"study_design_scores_gemma":[0.0030745587,0.0007505257,0.0034115526,0.00046568416,0.0000437733,0.0005025625,0.00032072916,0.13864687,0.0036584912,0.83719444,0.010893889,0.0010369011],"about_ca_topic_score_codex":9.990371e-7,"about_ca_topic_score_gemma":7.1646315e-7,"teacher_disagreement_score":0.8117646,"about_ca_system_score_codex":0.000026548803,"about_ca_system_score_gemma":0.000046212128,"threshold_uncertainty_score":0.5881681},"labels":[],"label_agreement":null},{"id":"W3088932472","doi":"10.1142/s0219498823500512","title":"Feedback linearly extended discrete functions","year":2021,"lang":"en","type":"preprint","venue":"Journal of Algebra and Its Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Mathematics; Linear space; System of linear equations; Cryptography; Extension (predicate logic); Linear equation; Mathematical proof; Block cipher; Linear algebra; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.013034073725008904,"score_gpt":0.2499844969864728,"score_spread":0.2369504232614639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088932472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044498883,0.0061656046,0.94446707,0.0030560207,0.0005129211,0.00025266616,0.00001754088,0.00005863811,0.0009706852],"genre_scores_gemma":[0.9711149,0.0016499675,0.02582035,0.000286634,0.00066430384,0.0000689883,0.000017193259,0.000018710269,0.00035900055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987043,0.000075407595,0.00048817578,0.0003217273,0.000247924,0.00016244745],"domain_scores_gemma":[0.9981925,0.0001244104,0.00050132273,0.0005474831,0.00044741956,0.00018686727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034799404,0.00018169485,0.00030397612,0.00022964833,0.00022889012,0.0005094251,0.00081204803,0.0001430678,0.000037367234],"category_scores_gemma":[0.00003361223,0.00015965913,0.0002814451,0.00041611947,0.000049843322,0.0003713148,0.00061892957,0.0006799083,0.0000101821715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036114798,0.00057473907,0.00015693698,0.00023645005,0.0006850848,0.0000317339,0.00203457,0.00030136274,0.0035927515,0.84055084,0.0035314055,0.14826798],"study_design_scores_gemma":[0.0021029254,0.00092117453,0.031334512,0.0012033958,0.0010418494,0.0015657123,0.001524649,0.011240873,0.0037295606,0.7824289,0.16066273,0.0022437188],"about_ca_topic_score_codex":0.0000012050696,"about_ca_topic_score_gemma":0.0000015477843,"teacher_disagreement_score":0.92661595,"about_ca_system_score_codex":0.000018905706,"about_ca_system_score_gemma":0.00019072708,"threshold_uncertainty_score":0.6510711},"labels":[],"label_agreement":null},{"id":"W3090085778","doi":"10.4086/toc.2020.v016a005","title":"","year":2020,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Achievement Rewards for College Scientists Foundation; Center for Long-Term Cybersecurity, University of California Berkeley; National Science Foundation","keywords":"Mathematics; Combinatorics; Degree (music); Hyperplane; Inverse; Product (mathematics); Discrete mathematics; Geometry; Physics","score_opus":0.026835770313589143,"score_gpt":0.2276405655685452,"score_spread":0.20080479525495606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090085778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45083606,0.00007829149,0.54720587,0.0009509284,0.00007781632,0.00007238035,3.3294117e-7,0.00035441422,0.00042394467],"genre_scores_gemma":[0.93869925,0.0000016716874,0.05894615,0.0022277443,0.0001130233,8.6737356e-7,3.6969308e-7,0.000010061484,8.8667935e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975623,0.00064487115,0.00052904966,0.0005179854,0.00032598464,0.00041984697],"domain_scores_gemma":[0.99758804,0.001151456,0.00030744428,0.00060748233,0.000106784,0.00023879712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020153613,0.00021571144,0.00039289414,0.000117757554,0.00025107726,0.0000867828,0.0024785134,0.00004845512,0.0000053279186],"category_scores_gemma":[0.00025991516,0.00021263529,0.00024045612,0.0011981366,0.00019750423,0.0004777522,0.0010019485,0.00022232956,0.0000043197833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008080096,0.00003908099,0.00088497094,0.00003856987,0.000034875255,0.000008367764,0.017044438,0.0016804248,0.009081002,0.87258273,0.0000069360963,0.098517776],"study_design_scores_gemma":[0.0011026493,0.00078067125,0.0070302445,0.000103436316,0.000020691767,0.000022568274,0.0010630332,0.13635692,0.047285676,0.80561763,0.00010874826,0.00050772756],"about_ca_topic_score_codex":0.0000013788665,"about_ca_topic_score_gemma":9.676861e-8,"teacher_disagreement_score":0.4882597,"about_ca_system_score_codex":0.000006178719,"about_ca_system_score_gemma":0.00003489755,"threshold_uncertainty_score":0.86710155},"labels":[],"label_agreement":null},{"id":"W3092499131","doi":"10.1007/s00200-020-00467-3","title":"On the stability of periodic binary sequences with zone restriction","year":2020,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Algorithm; Computer science","score_opus":0.014500206227143132,"score_gpt":0.19992791936478252,"score_spread":0.1854277131376394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092499131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69769865,0.00018731691,0.30037418,0.0013570089,0.000007730754,0.00012245601,3.0589223e-7,0.000086909786,0.00016544465],"genre_scores_gemma":[0.98933667,0.00004818103,0.010421934,0.00016890447,0.0000060438815,0.000012520465,9.650093e-7,0.000004508232,2.454039e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993665,0.00007770652,0.00016960101,0.0001743151,0.000103293176,0.000108582244],"domain_scores_gemma":[0.9988907,0.000503493,0.00007083535,0.00047550205,0.000023559076,0.000035886933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039263716,0.00008499,0.00011186582,0.000050007016,0.00012133705,0.000049812264,0.0005721107,0.000024684186,0.0000024336155],"category_scores_gemma":[0.00003256523,0.00006503192,0.00001969079,0.0006808454,0.000064437045,0.00009771995,0.00021570068,0.00020397214,8.528862e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023831471,0.00005847656,0.002771574,0.00006566036,0.000014707572,9.276956e-7,0.0026182188,0.029945293,0.0053013484,0.9512841,0.000010395774,0.007905474],"study_design_scores_gemma":[0.0002889473,0.00026509268,0.0073049017,0.00013682459,0.0000049570954,0.0000038428716,0.00042813946,0.9824467,0.003963347,0.004719959,0.0002446094,0.00019269767],"about_ca_topic_score_codex":0.000024183493,"about_ca_topic_score_gemma":0.0000010330873,"teacher_disagreement_score":0.9525014,"about_ca_system_score_codex":0.00001061273,"about_ca_system_score_gemma":0.0000134506945,"threshold_uncertainty_score":0.26519248},"labels":[],"label_agreement":null},{"id":"W3093330059","doi":"10.1145/3679015","title":"Efficient Constructions of the Prefer-Same and Prefer-Opposite de Bruijn Sequences","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Construct (python library); Combinatorics; Greedy algorithm; Mathematics; Space (punctuation); De Bruijn graph; Computer science; Algorithm; Discrete mathematics; Theoretical computer science","score_opus":0.014745811284684978,"score_gpt":0.2426197850901976,"score_spread":0.22787397380551264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093330059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15169853,0.00036774858,0.8446991,0.0016309315,0.00081239507,0.0001724457,0.00003083718,0.00021103435,0.00037698602],"genre_scores_gemma":[0.97363394,0.000052385643,0.026058858,0.00008605188,0.00002221573,0.000027864402,2.548852e-7,0.0000075162116,0.00011092424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990326,0.00010317896,0.00016896236,0.00031261155,0.00019627648,0.00018635413],"domain_scores_gemma":[0.99900794,0.00025321095,0.00003163389,0.00060252094,0.00003714884,0.00006753347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024241519,0.00012204496,0.00011266332,0.00016189473,0.00028922563,0.00013060465,0.0006120063,0.00006153017,0.000025142932],"category_scores_gemma":[0.000011545776,0.00008899804,0.00013118569,0.00082041504,0.00022701648,0.00011418002,0.000027180946,0.0002472069,0.0000055983414],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019979288,0.00026032215,0.00017847335,0.00012452486,0.00027249966,0.000007174541,0.0064483704,0.013473532,0.0056203636,0.12357085,0.000048835293,0.84997505],"study_design_scores_gemma":[0.0011676443,0.0010610216,0.014294693,0.0011144897,0.0005074019,0.0011807142,0.0013061134,0.59326255,0.109500244,0.26972336,0.0056506232,0.0012311531],"about_ca_topic_score_codex":0.000046485777,"about_ca_topic_score_gemma":0.000018554327,"teacher_disagreement_score":0.8487439,"about_ca_system_score_codex":0.000028115064,"about_ca_system_score_gemma":0.00008171945,"threshold_uncertainty_score":0.36292347},"labels":[],"label_agreement":null},{"id":"W3094918795","doi":"10.26493/1855-3974.2374.9ff","title":"New results on modular Golomb rulers, optical orthogonal codes and related structures","year":2020,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Golomb coding; Mathematics; Modular design; Combinatorics; Order (exchange); Discrete mathematics; Computer science; Image (mathematics)","score_opus":0.03876912149739215,"score_gpt":0.27644960453701095,"score_spread":0.2376804830396188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094918795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9608852,0.0007052981,0.012533904,0.020687962,0.00019953064,0.0006369196,0.00012752163,0.0002826085,0.0039410456],"genre_scores_gemma":[0.9884564,0.000093932096,0.010951876,0.00005450405,0.000077142824,2.0904164e-7,0.000038516162,0.000009465681,0.00031791898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972166,0.00036852638,0.00020224263,0.00093861186,0.00079306785,0.00048098303],"domain_scores_gemma":[0.9981428,0.00030128908,0.00008614931,0.0007347008,0.0002557898,0.00047931346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011397703,0.0001770241,0.00027784047,0.0003561668,0.00040579712,0.00008287111,0.0013944313,0.00010884962,0.000038080238],"category_scores_gemma":[0.0005970774,0.00018243426,0.00009822508,0.0012807832,0.0006655478,0.00042968578,0.0009503339,0.0006890984,0.000046546615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043606134,0.0004014995,0.001423089,0.00027301328,0.00055463874,0.0011203105,0.0280573,0.0010903146,0.03288356,0.71513104,0.07882343,0.13588117],"study_design_scores_gemma":[0.020792697,0.0152622545,0.2580971,0.0006794658,0.00019267063,0.00042294688,0.0063182237,0.012818155,0.060660638,0.33595586,0.28471896,0.0040810094],"about_ca_topic_score_codex":0.00014080243,"about_ca_topic_score_gemma":0.000012312804,"teacher_disagreement_score":0.3791752,"about_ca_system_score_codex":0.000040875002,"about_ca_system_score_gemma":0.00023146336,"threshold_uncertainty_score":0.7439453},"labels":[],"label_agreement":null},{"id":"W3097401090","doi":"10.4230/lipics.icalp.2021.18","title":"Relaxed Locally Correctable Codes with Improved Parameters","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Code word; Mathematics; Decoding methods; Block (permutation group theory); Combinatorics; Constant (computer programming); Discrete mathematics; Block code; List decoding; Algorithm; Computer science; Concatenated error correction code","score_opus":0.009338702257736227,"score_gpt":0.21309815665717333,"score_spread":0.2037594543994371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097401090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14471649,0.000078668796,0.8468881,0.0003711639,0.0009904819,0.0006989388,0.0001164729,0.00046545797,0.00567419],"genre_scores_gemma":[0.7867599,0.00003066251,0.20964588,0.0024453474,0.00006590211,0.00016506911,0.00020824697,0.00005285985,0.0006261158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744976,0.00007432072,0.0007752465,0.00042271052,0.00042471947,0.0008532341],"domain_scores_gemma":[0.99741787,0.00029872428,0.00034601588,0.001217323,0.00045592317,0.0002641317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005954437,0.00041673932,0.00048843055,0.00020839086,0.00043875427,0.0008010775,0.0012167182,0.00018158449,0.000028384777],"category_scores_gemma":[0.00011230019,0.00035269975,0.00028323135,0.0008505888,0.00017753438,0.0016864084,0.0004455703,0.0004317456,0.00006363276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032416955,0.003960159,0.02521893,0.0031846466,0.0035538755,0.00034927498,0.062793836,0.002956984,0.004187569,0.6037327,0.026062455,0.2607579],"study_design_scores_gemma":[0.02314669,0.0050981157,0.001808548,0.0016096217,0.0004282484,0.0017500909,0.010921255,0.64602757,0.079515554,0.02764194,0.19654578,0.00550658],"about_ca_topic_score_codex":0.000012224127,"about_ca_topic_score_gemma":0.000043711414,"teacher_disagreement_score":0.6430706,"about_ca_system_score_codex":0.00007455478,"about_ca_system_score_gemma":0.00021337227,"threshold_uncertainty_score":0.9998925},"labels":[],"label_agreement":null},{"id":"W3098017919","doi":"","title":"MINIMAL MODELS FOR RATIONAL FUNCTIONS IN A DYNAMICAL SETTING","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Simon Fraser University","funders":"","keywords":"Mathematics; Rational function; Orbit (dynamics); Rational number; Conjecture; Elliptic rational functions; Set (abstract data type); Function (biology); Quadratic equation; Pure mathematics; Dynamical systems theory; Discrete mathematics; Computer science; Elliptic curve; Geometry","score_opus":0.018219096254482644,"score_gpt":0.23829896445878615,"score_spread":0.2200798682043035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098017919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010785559,0.0000034395387,0.98196936,0.0027646103,0.00008594687,0.00007202588,0.0000037511725,0.000070473136,0.0042448225],"genre_scores_gemma":[0.92863744,1.7255651e-7,0.07052254,0.00014929123,0.00002912863,0.00003705654,8.602855e-7,0.0000020874465,0.00062142394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995311,0.000020452173,0.00009657604,0.00016424239,0.000062758714,0.00012490239],"domain_scores_gemma":[0.99958736,0.00022513601,0.00001441712,0.00012088661,0.000025074434,0.000027144897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021106454,0.000042705888,0.000043350024,0.00006482287,0.000069622816,0.000037750277,0.00017631959,0.000022245786,0.000026894691],"category_scores_gemma":[0.000023070384,0.000028602111,0.00004788006,0.00013281924,0.000018595556,0.00034591302,0.000049542115,0.000021592952,0.000007527333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011702578,0.000024919176,0.00018519696,0.000001186268,0.0000026031298,3.03404e-7,0.000059634975,0.00010922257,0.00071419985,0.98160017,0.00067763706,0.0166132],"study_design_scores_gemma":[0.00037732488,0.000047900103,0.0004626179,0.000010281268,0.0000010844687,0.0000028303007,0.000017761688,0.42937368,0.00009768242,0.5689784,0.00055337674,0.00007703732],"about_ca_topic_score_codex":0.0000020922075,"about_ca_topic_score_gemma":0.000025920086,"teacher_disagreement_score":0.91785187,"about_ca_system_score_codex":0.00001341849,"about_ca_system_score_gemma":0.000025654837,"threshold_uncertainty_score":0.11663602},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024738018419190207,"score_gpt":0.256358574827968,"score_spread":0.23162055640877777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099148554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13830459,0.0010557228,0.8349727,0.00014329907,0.0006989621,0.00015353179,0.0000058636133,0.00020954918,0.024455773],"genre_scores_gemma":[0.91099155,0.00012103232,0.08868714,0.000051169874,0.000073803676,0.000007592468,0.0000016790724,0.000007386297,0.000058621386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883634,0.00008393052,0.00027765296,0.0003870327,0.00016810303,0.0002469392],"domain_scores_gemma":[0.99886984,0.00019923293,0.00017580888,0.00059759495,0.000054378652,0.00010317597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069819443,0.00019422623,0.00030448142,0.00020470162,0.00007668805,0.00012730727,0.00080654176,0.00014601187,0.00004791538],"category_scores_gemma":[0.000031054486,0.00017633609,0.00012328406,0.00016236947,0.00008961062,0.00019609506,0.00202055,0.0002683909,0.000005726435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071276777,0.00005775632,0.008028187,0.00025677416,0.00006567184,0.0000024236135,0.002363085,0.00006731322,0.0021994354,0.8953975,0.00011739499,0.09143737],"study_design_scores_gemma":[0.0011701207,0.00023395372,0.020021804,0.001990362,0.00023565446,0.00010398541,0.0008384795,0.07028016,0.07307452,0.8260398,0.0029045031,0.0031066907],"about_ca_topic_score_codex":0.000023888846,"about_ca_topic_score_gemma":0.0000066144203,"teacher_disagreement_score":0.77268696,"about_ca_system_score_codex":0.0000110782275,"about_ca_system_score_gemma":0.000032632626,"threshold_uncertainty_score":0.7190777},"labels":[],"label_agreement":null},{"id":"W3099901842","doi":"","title":"On permutation binomials over finite fields","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Finite field; Combinatorics; Binomial (polynomial); Permutation (music); Field (mathematics); Binomial coefficient; Polynomial; Gaussian binomial coefficient; Discrete mathematics; Negative binomial distribution; Pure mathematics; Physics; Statistics; Mathematical analysis","score_opus":0.012060074968069823,"score_gpt":0.23320000709834293,"score_spread":0.2211399321302731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099901842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13558266,0.0000039484994,0.8406616,0.0013933846,0.00021701911,0.00003393006,5.9317136e-7,0.00012857508,0.021978293],"genre_scores_gemma":[0.99613976,0.0000029973637,0.0014414452,0.0012085021,0.000030392506,0.0000035885362,1.3747272e-7,0.0000019258293,0.0011712513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957144,0.000032640844,0.00006902936,0.00014948989,0.0000821402,0.00009526893],"domain_scores_gemma":[0.99929243,0.00039640925,0.000020032863,0.00024714155,0.000013971957,0.00003001275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013198312,0.000049420316,0.000044379674,0.000069812224,0.000045284745,0.000042139578,0.00023674792,0.00002978061,0.00039568538],"category_scores_gemma":[0.000046266898,0.000028728053,0.000044876608,0.00011694479,0.000014513481,0.0001943249,0.000043591994,0.000023394794,0.00022382407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064120622,0.000012994405,0.00014720205,7.132096e-7,0.0000030812866,0.0000013919712,0.00008302366,0.000008678409,0.000844159,0.9341861,0.0017955466,0.06291068],"study_design_scores_gemma":[0.00065224315,0.0003194279,0.007020055,0.000037016853,0.0000032067653,0.000002201457,0.0000056653457,0.002225502,0.014664683,0.9656178,0.009206697,0.00024553505],"about_ca_topic_score_codex":0.0000022076736,"about_ca_topic_score_gemma":0.0000019078063,"teacher_disagreement_score":0.8605571,"about_ca_system_score_codex":0.0000059823383,"about_ca_system_score_gemma":0.000008140549,"threshold_uncertainty_score":0.43324772},"labels":[],"label_agreement":null},{"id":"W3101685628","doi":"10.1016/j.tcs.2020.11.018","title":"Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Lexicographical order; Sequence (biology); Combinatorics; Mathematics; Representation (politics); Construct (python library); Greedy algorithm; Simple (philosophy); Discrete mathematics; Algorithm; Computer science","score_opus":0.02492197415689523,"score_gpt":0.2510284939185019,"score_spread":0.22610651976160667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101685628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09373164,0.000065285094,0.8896894,0.013427279,0.00016451368,0.0001653971,0.000002201453,0.00028157138,0.0024727206],"genre_scores_gemma":[0.909018,0.000009991637,0.08735502,0.0033664622,0.00023463761,0.0000070769515,2.2989502e-7,0.000006036785,0.000002567092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978104,0.00026557548,0.00024173797,0.0007242033,0.00041724285,0.00054081413],"domain_scores_gemma":[0.9982726,0.0005176141,0.00007427129,0.0006248268,0.00011555767,0.00039513232],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014818609,0.00018271532,0.00018665314,0.000101105536,0.0009717121,0.00083983573,0.0022636363,0.000036977155,0.000024166691],"category_scores_gemma":[0.00015049409,0.00013048272,0.0000687674,0.0019013443,0.0036155882,0.0006341774,0.0013586734,0.0003395774,0.000021053598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000631828,0.0000051809834,0.0004366649,0.0000104284245,0.0000046104306,0.0000043526816,0.0014582747,0.00004958052,0.0017334456,0.93210435,0.000012043873,0.06417474],"study_design_scores_gemma":[0.00019304777,0.00017136685,0.0027793678,0.000067311594,0.000016651367,0.00021508787,0.00004025033,0.52013165,0.0030886019,0.47247556,0.00050256646,0.00031856884],"about_ca_topic_score_codex":0.0000033922981,"about_ca_topic_score_gemma":5.035159e-7,"teacher_disagreement_score":0.81528634,"about_ca_system_score_codex":0.000027281245,"about_ca_system_score_gemma":0.00011296318,"threshold_uncertainty_score":0.999096},"labels":[],"label_agreement":null},{"id":"W3103484676","doi":"","title":"Fast computation of the roots of polynomials over the ring of power series","year":2017,"lang":"en","type":"preprint","venue":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Series (stratigraphy); Computation; Ring (chemistry); Power series; Computer science; Power (physics); Mathematics; Algorithm; Physics; Mathematical analysis","score_opus":0.014583707499634578,"score_gpt":0.22237244522748698,"score_spread":0.2077887377278524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103484676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80761397,0.00061258243,0.16228949,0.0017709673,0.0006668372,0.001865125,0.00039810326,0.00023205794,0.024550898],"genre_scores_gemma":[0.9883362,0.00025672186,0.010964409,0.000017560156,0.000018865414,2.7278284e-7,0.0000060618577,0.00002228679,0.00037762546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9958395,0.00063322484,0.0008880684,0.00093960395,0.0012134245,0.000486225],"domain_scores_gemma":[0.99202836,0.00083653274,0.0030925758,0.0030746176,0.000788999,0.00017892587],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016205618,0.00054569135,0.0015755476,0.00056429725,0.0005319905,0.000036847116,0.008813684,0.0009771808,0.00018484483],"category_scores_gemma":[0.000317984,0.00051559525,0.0015698653,0.00096795935,0.004252186,0.0005515193,0.0097118355,0.0013424095,0.00000613408],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010815339,0.0076693115,0.037027415,0.00650606,0.005085434,0.0004237987,0.00712684,0.009710133,0.25420585,0.6072596,0.0177416,0.036428656],"study_design_scores_gemma":[0.007955034,0.0027805339,0.8474882,0.009208043,0.0026858025,0.0001790448,0.0036268542,0.0031427895,0.036750488,0.07568642,0.00701251,0.0034842836],"about_ca_topic_score_codex":0.0006844105,"about_ca_topic_score_gemma":0.000464008,"teacher_disagreement_score":0.8104608,"about_ca_system_score_codex":0.00018611038,"about_ca_system_score_gemma":0.00049854803,"threshold_uncertainty_score":0.9997296},"labels":[],"label_agreement":null},{"id":"W3103656886","doi":"10.22215/etd/2020-14317","title":"Error Correcting Codes in Post-Quantum Cryptography","year":2020,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"McEliece cryptosystem; Cryptosystem; Computer science; Key encapsulation; Cryptography; Public-key cryptography; Coding theory; Theoretical computer science; NIST; Error detection and correction; Key size; Computer security; Algorithm; Symmetric-key algorithm; Encryption","score_opus":0.014853325197370355,"score_gpt":0.26071084434221675,"score_spread":0.2458575191448464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103656886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5523993,0.0016905143,0.1768534,0.0016050604,0.012276573,0.0014799127,0.000027657397,0.0032334656,0.2504341],"genre_scores_gemma":[0.9873747,0.000040759798,0.01077351,0.00090369827,0.00011229688,0.000057152054,0.00029543284,0.00004540391,0.00039700474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802464,0.0001429166,0.0004141709,0.0007295395,0.00031099544,0.00037774825],"domain_scores_gemma":[0.9988633,0.00023483759,0.00019869335,0.0004688896,0.00011106762,0.00012322392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032145603,0.00034829316,0.0004040521,0.0007066743,0.00014142299,0.00024767494,0.0012505976,0.00026297284,0.00011359407],"category_scores_gemma":[0.00010639925,0.00034193587,0.00027368945,0.0016926196,0.000026188687,0.00031306504,0.00009820804,0.0006532735,0.00007513766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000154201,0.00014653568,0.0009286977,0.00017533764,0.000091849106,0.00008444051,0.008952944,0.000012276999,0.0017135955,0.9185231,0.0011924396,0.06802461],"study_design_scores_gemma":[0.0043220767,0.0034627486,0.076246336,0.00291399,0.00033631877,0.00013849833,0.04785304,0.08432733,0.031304933,0.6982348,0.04039834,0.010461598],"about_ca_topic_score_codex":0.0000891664,"about_ca_topic_score_gemma":0.0005648928,"teacher_disagreement_score":0.43497545,"about_ca_system_score_codex":0.000017038137,"about_ca_system_score_gemma":0.00011344744,"threshold_uncertainty_score":0.99990326},"labels":[],"label_agreement":null},{"id":"W3104505159","doi":"","title":"THE FREQUENCY OF ELLIPTIC CURVE GROUPS OVER PRIME FINITE FIELDS","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Concordia University","funders":"","keywords":"Mathematics; Pointwise; Elliptic curve; Conjecture; Prime (order theory); Group (periodic table); Combinatorics; Integer (computer science); Bounded function; Finite group; Order (exchange); Cyclic group; Prime number; Algebraic number field; Finite field; Prime number theorem; Asymptotic formula; Discrete mathematics; Pure mathematics; Mathematical analysis; Physics; Abelian group; Quantum mechanics","score_opus":0.010901713623249994,"score_gpt":0.21963552476260687,"score_spread":0.20873381113935688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104505159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066196635,0.00016011427,0.91740125,0.001235242,0.0003341223,0.00006982744,9.831385e-7,0.0000909893,0.01451083],"genre_scores_gemma":[0.9966603,0.00004042021,0.0023793664,0.0001597629,0.000031750005,0.000004134863,6.8317874e-8,0.000002769703,0.00072141504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999336,0.000065564636,0.0001474739,0.00015435515,0.00013360054,0.00016299704],"domain_scores_gemma":[0.99851507,0.000782184,0.000055324344,0.00057568983,0.000036578633,0.000035136214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034545746,0.00006885413,0.00007146913,0.00003787676,0.0000897968,0.00003851252,0.00075639173,0.000037131686,0.00011599981],"category_scores_gemma":[0.00006118572,0.000032071366,0.0000853033,0.00020958137,0.0000869009,0.00020322493,0.00013058427,0.000048327296,0.000044170352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028556574,0.000015198396,0.0024903156,0.0000017523961,0.0000107402,8.628435e-7,0.00010987132,4.5383308e-7,0.0013412035,0.9667326,0.00025396716,0.02904013],"study_design_scores_gemma":[0.00031254275,0.00017058344,0.012002596,0.0000380307,0.0000060801735,0.0000028678612,0.00001121242,0.00068199774,0.012155089,0.9699985,0.004437116,0.00018341352],"about_ca_topic_score_codex":0.000010728692,"about_ca_topic_score_gemma":0.000013998345,"teacher_disagreement_score":0.9304637,"about_ca_system_score_codex":0.00000503582,"about_ca_system_score_gemma":0.000017597255,"threshold_uncertainty_score":0.14055766},"labels":[],"label_agreement":null},{"id":"W3104885263","doi":"10.48550/arxiv.1710.07765","title":"On the Derivative Imbalance and Ambiguity of Functions","year":2017,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Abelian group; Mathematics; Ambiguity; Upper and lower bounds; Multiplicative function; Nonlinear system; Inverse; Discrete mathematics; Measure (data warehouse); Combinatorics; Applied mathematics; Pure mathematics; Mathematical analysis; Computer science; Physics","score_opus":0.06407652677467528,"score_gpt":0.17461623467384446,"score_spread":0.11053970789916918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104885263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8381627,0.000004846286,0.1527604,0.00023747246,0.00007636327,0.000043154716,0.000001959186,0.000025733543,0.0086873425],"genre_scores_gemma":[0.9995663,0.000010469836,0.00007433965,0.000069560454,0.0000070672404,1.535664e-7,1.03286474e-7,0.0000015133161,0.00027047156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996046,0.000047395875,0.000038374335,0.00019638638,0.000027095482,0.00008618806],"domain_scores_gemma":[0.99901503,0.00014635593,0.00008694357,0.0006820224,0.000038140468,0.00003151847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014802758,0.00005624392,0.00006270495,0.000037338246,0.0005051085,0.00004880765,0.0006894102,0.00002079185,0.000010935273],"category_scores_gemma":[0.00005704249,0.00004526885,0.000042012965,0.0001368047,0.00024432756,0.00023788634,0.00022915809,0.00007197438,0.000008637227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014099025,0.000021143804,0.009115154,0.0000016629926,0.000013575194,0.000005161052,0.000093049566,0.00012005714,0.00011591492,0.989825,0.00010406993,0.00057112164],"study_design_scores_gemma":[0.0005216998,0.00022895927,0.261496,0.000045994293,0.000023162722,0.0000024728076,0.00017618934,0.02262576,0.0017535726,0.71229494,0.00061411434,0.00021712977],"about_ca_topic_score_codex":0.000020080593,"about_ca_topic_score_gemma":0.000011235225,"teacher_disagreement_score":0.27753004,"about_ca_system_score_codex":0.000006867028,"about_ca_system_score_gemma":0.00001075694,"threshold_uncertainty_score":0.38849375},"labels":[],"label_agreement":null},{"id":"W3105288378","doi":"","title":"Codes and Supersymmetry in One Dimension","year":2011,"lang":"en","type":"article","venue":"UWA Profiles and Research Repository (University of Western Australia)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Dimension (graph theory); Enumeration; Topology (electrical circuits); Code (set theory); Computation; Network topology; Supersymmetry; Mathematics; Discrete mathematics; Computer science; Combinatorics; Set (abstract data type); Algorithm; Mathematical physics","score_opus":0.12623930580998557,"score_gpt":0.28935174643963296,"score_spread":0.1631124406296474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105288378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99820906,0.00011553746,0.00059522106,0.0001096292,0.000037537106,0.000127886,0.0000016396754,0.000023147544,0.00078035815],"genre_scores_gemma":[0.99568796,0.00008713185,0.0032933243,0.0000034409595,0.000009345251,3.442365e-7,5.7775964e-7,0.0000028583129,0.0009150261],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99891204,0.00023083578,0.00008849015,0.00029777476,0.00023945761,0.00023140488],"domain_scores_gemma":[0.9994504,0.0000758814,0.000037451366,0.00024485556,0.000076562916,0.00011487678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005966663,0.00007337975,0.00014416475,0.00026068478,0.00023063706,0.000041679647,0.00034902152,0.000078763405,0.000008239317],"category_scores_gemma":[0.0000066209695,0.00007868537,0.000031311563,0.00030297274,0.00044546116,0.00037750608,0.00040806207,0.00021061071,0.000002830256],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002297957,0.00035289113,0.85028994,0.00027884412,0.000063218526,0.0003450442,0.014517081,5.685683e-7,0.05957578,0.06865697,0.00014079276,0.005549083],"study_design_scores_gemma":[0.00062854117,0.0005534966,0.94241804,0.00023033399,0.000010683333,0.000044121538,0.0035823712,0.00022428643,0.04821185,0.0037305402,0.0001698218,0.0001959397],"about_ca_topic_score_codex":0.0011753811,"about_ca_topic_score_gemma":0.000025596031,"teacher_disagreement_score":0.09212808,"about_ca_system_score_codex":0.000013025627,"about_ca_system_score_gemma":0.00001981196,"threshold_uncertainty_score":0.32086962},"labels":[],"label_agreement":null},{"id":"W3107248454","doi":"10.1007/s11786-020-00495-9","title":"Mathematics in Computer Science volume / Common Factors in Fraction-Free Matrix Decompositions","year":2021,"lang":"en","type":"article","venue":"University Library Linz repository (Johannes Kepler Universitat Linz)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Fraction (chemistry); Mathematics; Matrix (chemical analysis); LU decomposition; Reduction (mathematics); Computation; QR decomposition; Sparse matrix; Matrix decomposition; Triangular matrix; Combinatorics; Eigenvalues and eigenvectors; Algorithm; Pure mathematics; Computational chemistry; Gaussian; Geometry; Physics","score_opus":0.006337564556684981,"score_gpt":0.19198404876411987,"score_spread":0.18564648420743488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107248454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91773975,0.00010867547,0.06701483,0.0011596807,0.001001245,0.000254872,0.000027604903,0.00049409294,0.012199257],"genre_scores_gemma":[0.93999326,0.000058651676,0.057978354,0.00012249684,0.00008821792,5.019914e-7,0.000032162345,0.000024010655,0.001702332],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740696,0.00030663854,0.0003689717,0.0008975411,0.00045246482,0.00056745374],"domain_scores_gemma":[0.99770546,0.0003906737,0.00019195369,0.0012877268,0.0001391034,0.00028505796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020553333,0.00032507602,0.00041998137,0.0016064,0.00078799244,0.00038219214,0.0025566681,0.00018452949,0.00007800172],"category_scores_gemma":[0.000020216643,0.00040528658,0.00023909172,0.0039748256,0.00041007303,0.0057443175,0.0019411787,0.00051063317,0.000024406472],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028537834,0.0043502734,0.48785195,0.00027024208,0.00022754149,0.012226077,0.020258281,0.013482886,0.0052684266,0.44964308,0.004454289,0.0016815696],"study_design_scores_gemma":[0.014419908,0.0017949748,0.34474656,0.002467381,0.00038515948,0.000901072,0.04546468,0.3726807,0.06446424,0.090695515,0.05480136,0.007178444],"about_ca_topic_score_codex":0.000089753565,"about_ca_topic_score_gemma":0.000108285785,"teacher_disagreement_score":0.3591978,"about_ca_system_score_codex":0.0002871514,"about_ca_system_score_gemma":0.00047306565,"threshold_uncertainty_score":0.9998399},"labels":[],"label_agreement":null},{"id":"W3112560171","doi":"10.3934/amc.2020125","title":"On ideal $ t $-tuple distribution of orthogonal functions in filtering de bruijn generators","year":2020,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; De Bruijn sequence; Tuple; Combinatorics; Ideal (ethics); Binary number; Generator (circuit theory); Discrete mathematics; Sequence (biology); Arithmetic","score_opus":0.02528393588309801,"score_gpt":0.2869563206010946,"score_spread":0.2616723847179966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112560171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21323122,0.00064482767,0.7835328,0.0006479299,0.000029059085,0.00011062289,0.000027209186,0.00003096953,0.0017453701],"genre_scores_gemma":[0.90461713,0.00020747814,0.09510026,0.00003470236,0.000003833149,0.000019251434,0.000012846305,0.0000033202311,0.0000011968864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992806,0.00008140989,0.00034028324,0.00009525553,0.000102928774,0.00009958017],"domain_scores_gemma":[0.99857235,0.0005150644,0.00014613298,0.0006965876,0.000039137674,0.00003072785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002923143,0.000064566724,0.00014322829,0.00007930013,0.000051282506,0.000009948254,0.0009502808,0.000025054796,0.0000057337],"category_scores_gemma":[0.0001876971,0.000068244626,0.000048182676,0.0006403591,0.000093281764,0.00022949677,0.00024229103,0.00013245891,0.0000018572531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054082443,0.00019243419,0.0014377735,0.000052068994,0.000004382852,2.519739e-7,0.0012978659,0.006621064,0.00079399144,0.98685944,0.000014110415,0.0027212084],"study_design_scores_gemma":[0.00041402082,0.00016931037,0.0024761779,0.00029440614,0.000008842207,0.0000026271714,0.00044876174,0.18203078,0.0035596974,0.80902475,0.0013883597,0.00018227719],"about_ca_topic_score_codex":0.00000397638,"about_ca_topic_score_gemma":0.0000505139,"teacher_disagreement_score":0.69138587,"about_ca_system_score_codex":0.000019196263,"about_ca_system_score_gemma":0.000031522108,"threshold_uncertainty_score":0.27829352},"labels":[],"label_agreement":null},{"id":"W3113528066","doi":"10.1016/j.jnt.2020.11.009","title":"Gap principle of divisibility sequences of polynomials","year":2020,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Divisibility rule; Order (exchange); Combinatorics; Polynomial; Conjecture; Integer (computer science); Discrete mathematics; Mathematical analysis","score_opus":0.03901787686208228,"score_gpt":0.29367471951881574,"score_spread":0.25465684265673344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113528066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91756266,0.00023807635,0.07845995,0.00046166594,0.00022665806,0.000056742218,0.000015170024,0.00001713746,0.0029619287],"genre_scores_gemma":[0.9912029,0.000012519268,0.008481434,0.00019151278,0.00009280476,4.32812e-7,1.7137529e-7,0.0000042353226,0.000013980401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843746,0.00039227735,0.0006126854,0.00013089745,0.00030178198,0.00012491066],"domain_scores_gemma":[0.9981056,0.00056158483,0.0007494644,0.0002799318,0.00018704611,0.00011639584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018810665,0.000091978494,0.00034004264,0.000057704823,0.000032256932,0.000019824196,0.0009601364,0.000041223226,0.00048684704],"category_scores_gemma":[0.00034268826,0.00007117983,0.00028030074,0.00032325307,0.00016713784,0.00034014086,0.00017464036,0.00015798448,0.000007273362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047660436,0.000316635,0.01773442,0.00015923138,0.00018950972,0.000033162105,0.0047046733,0.00011178769,0.045105662,0.9122471,0.00087388646,0.018047303],"study_design_scores_gemma":[0.00089082343,0.0009363627,0.011867247,0.00023389744,0.00006877147,0.00012520207,0.00035453957,0.00025622678,0.123434916,0.856895,0.004653765,0.0002832067],"about_ca_topic_score_codex":0.0000012261935,"about_ca_topic_score_gemma":2.067394e-7,"teacher_disagreement_score":0.07832926,"about_ca_system_score_codex":0.000010642005,"about_ca_system_score_gemma":0.000108566666,"threshold_uncertainty_score":0.5330634},"labels":[],"label_agreement":null},{"id":"W3115319021","doi":"10.1109/uemcon51285.2020.9298177","title":"Optimal Labeling with Cyclic Gray Codes for Generalized 16PAM Constellations","year":2020,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Compute Canada","keywords":"Gray code; Constellation; Computer science; Gray (unit); Algorithm; Mathematics; Physics","score_opus":0.026636058101324092,"score_gpt":0.2470954724922617,"score_spread":0.22045941439093758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115319021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049261194,0.00005093814,0.9452124,0.0023236244,0.00006181621,0.00017457653,0.0000037846273,0.00029896718,0.0026126537],"genre_scores_gemma":[0.5796974,0.0000037864545,0.4192151,0.00096924906,0.00004937169,0.00001317719,0.0000027385836,0.0000052352866,0.00004396314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993448,0.000030378422,0.00011724834,0.00024890064,0.000091719136,0.00016694175],"domain_scores_gemma":[0.99948305,0.000145212,0.000036682315,0.0001837961,0.00005448446,0.000096805874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011086055,0.00009198659,0.00011605953,0.000040912415,0.0001752045,0.00012501869,0.00032799444,0.000024360663,0.000036463847],"category_scores_gemma":[0.00001702221,0.000070402246,0.000063944586,0.000345911,0.000049000802,0.00016497975,0.00006057923,0.000047212798,0.000010070051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004763894,0.000023027298,0.00060793257,0.000016836924,0.00004225821,0.0000014876457,0.00064379507,0.0056274566,0.0035333333,0.98531514,0.0011398057,0.00300126],"study_design_scores_gemma":[0.0044955285,0.0012968678,0.00022109183,0.000056201236,0.00012032757,0.000033800738,0.00037748297,0.8721809,0.03156998,0.03769418,0.050834123,0.0011195559],"about_ca_topic_score_codex":0.0000031087561,"about_ca_topic_score_gemma":0.0000030850374,"teacher_disagreement_score":0.947621,"about_ca_system_score_codex":0.0000034368152,"about_ca_system_score_gemma":0.000027832128,"threshold_uncertainty_score":0.28709203},"labels":[],"label_agreement":null},{"id":"W3121783067","doi":"","title":"2 TURYN-TYPE SEQUENCES: CLASSIFICATION, ENUMERATION AND CONSTRUCTION","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid; Compute Canada","keywords":"Mathematics; Enumeration; Combinatorics; Type (biology); Equivalence (formal languages); Construct (python library); Equivalence relation; Discrete mathematics","score_opus":0.019663406855316267,"score_gpt":0.22907554908332142,"score_spread":0.20941214222800517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121783067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0894497,0.000038297338,0.9029654,0.0023727457,0.00029285788,0.000048233018,3.393035e-7,0.00016451748,0.0046678856],"genre_scores_gemma":[0.972131,0.000040309584,0.027539028,0.00012870503,0.000027679112,0.0000024210622,3.2475126e-7,0.0000013368222,0.00012917098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995967,0.000035283276,0.00007542352,0.00016283321,0.000063218555,0.00006653562],"domain_scores_gemma":[0.99965984,0.00005287477,0.00002891145,0.00017083356,0.000056368695,0.00003118187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013288287,0.000042596588,0.0000361572,0.000048498223,0.00008368716,0.00006740504,0.00012135752,0.000024686138,0.000042327498],"category_scores_gemma":[0.000021588143,0.000026468433,0.000011486072,0.00017991338,0.00007717054,0.000444091,0.000025385021,0.000017938297,0.000026530905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019083732,0.0000027697577,0.0015382152,8.9050206e-7,0.00000300534,1.5958683e-7,0.00005797439,7.1309856e-8,0.015022634,0.8518492,0.00010597019,0.13141719],"study_design_scores_gemma":[0.0004275828,0.00017461194,0.016695444,0.000033477063,0.000007779548,0.000082338694,0.00009883219,0.002499736,0.02367466,0.93234634,0.023661187,0.0002979824],"about_ca_topic_score_codex":0.0000022106638,"about_ca_topic_score_gemma":0.0000021447072,"teacher_disagreement_score":0.8826813,"about_ca_system_score_codex":0.0000069756284,"about_ca_system_score_gemma":0.000016831675,"threshold_uncertainty_score":0.10793514},"labels":[],"label_agreement":null},{"id":"W3123136894","doi":"10.4153/s0008439521000035","title":"Vanishing of multizeta values over at negative integers","year":2021,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Valuation (finance); Finite field; Statement (logic); Element (criminal law); Discrete mathematics","score_opus":0.010789220712540957,"score_gpt":0.21743265659883818,"score_spread":0.20664343588629722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123136894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58028114,0.00041517004,0.20995174,0.014320227,0.0005770665,0.0004370923,0.00004622592,0.00024971445,0.19372162],"genre_scores_gemma":[0.9627169,0.0000037972552,0.034413707,0.0010755096,0.0000272972,0.000007476632,0.0000019825618,0.000012229478,0.001741129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998882,0.00011729739,0.00023670877,0.00027690534,0.00018377486,0.0003033023],"domain_scores_gemma":[0.99845105,0.00057134253,0.000061134044,0.0004832898,0.00009322845,0.00033994063],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00033382737,0.00012185991,0.00021873704,0.000096903896,0.00012167444,0.0000799849,0.00049653364,0.00006479277,0.0063695763],"category_scores_gemma":[0.0006787656,0.00011671297,0.00013566596,0.00030523541,0.00012573146,0.00006110458,0.00017576966,0.00012954239,0.000868111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052087357,0.000047871068,0.0000972166,0.00007911271,0.000051278952,0.00012904489,0.0034406525,0.00000944029,0.0010558683,0.98150843,0.011051533,0.0025243321],"study_design_scores_gemma":[0.0006322642,0.00008244856,0.0006359271,0.00039601137,0.000038349233,0.00008792729,0.0009131926,0.0052271252,0.022940977,0.9329785,0.035492234,0.00057505973],"about_ca_topic_score_codex":0.00032711055,"about_ca_topic_score_gemma":0.00064116647,"teacher_disagreement_score":0.38243574,"about_ca_system_score_codex":0.00008949105,"about_ca_system_score_gemma":0.00014760558,"threshold_uncertainty_score":0.9999098},"labels":[],"label_agreement":null},{"id":"W3131781081","doi":"10.1007/s40314-021-01425-6","title":"Some skew constacyclic codes over $$\\mathbb {F}_{q}+u\\mathbb {F}_{q}$$","year":2021,"lang":"en","type":"article","venue":"Computational and Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Skew; Combinatorics; Mathematics; Ring (chemistry); Extension (predicate logic); Code (set theory); Discrete mathematics; Integer (computer science); Magma; Physics; Computer science","score_opus":0.0147979128769053,"score_gpt":0.23760458405689175,"score_spread":0.22280667117998645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131781081","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11238575,0.0005839491,0.8794565,0.0006097674,0.0001717653,0.00016986976,0.00001467623,0.00030477,0.0063029076],"genre_scores_gemma":[0.44801855,0.00008442883,0.5501135,0.0014506361,0.00013940311,0.000031917923,0.000026966305,0.000020818417,0.00011376597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986845,0.00002521685,0.0003297273,0.00039003816,0.00032268223,0.00024779874],"domain_scores_gemma":[0.9987889,0.0005536407,0.000119835204,0.00032819,0.00008344003,0.00012597362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022879295,0.00020532591,0.00028701423,0.00009079022,0.00025641153,0.00028079128,0.00033222107,0.00006612068,0.00003750978],"category_scores_gemma":[0.000025068211,0.00019427785,0.00008744165,0.00034514096,0.00013897965,0.0002134178,0.00032926156,0.00013424948,0.000056184534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002540435,0.00015351528,0.00001526081,0.00009547345,0.000036848298,0.000012187646,0.0006041643,0.0002703244,0.0007995349,0.9920404,0.00053678796,0.00543296],"study_design_scores_gemma":[0.00040892183,0.000016483276,0.00027101024,0.000042533273,0.00001707359,0.0000842672,0.00009415106,0.029531857,0.0011354007,0.96672857,0.0014183493,0.00025138157],"about_ca_topic_score_codex":4.5847784e-7,"about_ca_topic_score_gemma":5.4687854e-7,"teacher_disagreement_score":0.3356328,"about_ca_system_score_codex":0.000013316007,"about_ca_system_score_gemma":0.00008344261,"threshold_uncertainty_score":0.79224205},"labels":[],"label_agreement":null},{"id":"W3134457264","doi":"10.1007/s10623-021-00958-5","title":"On security properties of all-or-nothing transforms","year":2021,"lang":"en","type":"preprint","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tuple; Bijection; Alphabet; Mathematics; Computer science; Distribution (mathematics); Discrete mathematics; Theoretical computer science","score_opus":0.05225892664937497,"score_gpt":0.25629722241208525,"score_spread":0.20403829576271026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134457264","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5302419,0.003836587,0.4632755,0.0003538345,0.00046765758,0.00055111875,0.000026724148,0.00029951715,0.00094713666],"genre_scores_gemma":[0.9843162,0.0013273482,0.013654796,0.00053478865,0.000043027845,0.000078426914,0.000012020801,0.000027608965,0.0000057981897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972764,0.00026162952,0.0005510336,0.0009653498,0.0004942435,0.00045133568],"domain_scores_gemma":[0.9981796,0.0001846499,0.00025120686,0.0010472398,0.00016217596,0.00017510184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006923964,0.00052717736,0.00073383853,0.00059780665,0.00020740577,0.0005456454,0.0011528287,0.00035938973,0.00002679788],"category_scores_gemma":[0.000032202075,0.00039534687,0.0006155858,0.0007202199,0.00030599392,0.00029861764,0.0005431982,0.0007263037,8.7689926e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007797724,0.0011428854,0.00051482447,0.0030754888,0.0015447758,0.00015693228,0.05819677,0.0004349843,0.016925,0.869791,0.00030822877,0.047129374],"study_design_scores_gemma":[0.0023641277,0.0026537394,0.0007484396,0.007093689,0.0005464142,0.00012498809,0.0030650606,0.01308411,0.1280019,0.83461565,0.003887538,0.003814368],"about_ca_topic_score_codex":0.00005803904,"about_ca_topic_score_gemma":0.000023307699,"teacher_disagreement_score":0.45407426,"about_ca_system_score_codex":0.000012389647,"about_ca_system_score_gemma":0.00012847797,"threshold_uncertainty_score":0.99984986},"labels":[],"label_agreement":null},{"id":"W3134795428","doi":"10.4208/cmr.2021-0029","title":"Generalized Cyclotomic Mappings: Switching Between Polynomial, Cyclotomic, and Wreath Product Form","year":2022,"lang":"en","type":"article","venue":"Communications in Mathematical Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Wreath product; Cyclotomic polynomial; Mathematics; Product (mathematics); Polynomial; Reciprocal polynomial; Pure mathematics; Combinatorics; Algebra over a field; Discrete mathematics; Matrix polynomial; Mathematical analysis; Geometry","score_opus":0.14362795037890888,"score_gpt":0.4024250961783892,"score_spread":0.2587971457994803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134795428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9443345,0.0012596456,0.02941187,0.010673476,0.000052442665,0.0013288527,0.000009843148,0.00023994793,0.012689396],"genre_scores_gemma":[0.9490298,0.00018707316,0.04996771,0.00006632067,0.00002943686,0.00056310033,0.000006455698,0.000017727036,0.00013234474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99668646,0.00131446,0.00045924442,0.00043934138,0.0005783544,0.00052216015],"domain_scores_gemma":[0.9943043,0.0023881742,0.00007326645,0.0030232386,0.000079654914,0.00013138312],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00689041,0.00014207499,0.00028543343,0.0006967066,0.0013678396,0.00026913683,0.004320765,0.00004059485,0.00006388325],"category_scores_gemma":[0.00060783455,0.00014118104,0.00007277898,0.0014451076,0.00030874767,0.00028371485,0.006813545,0.0011609367,0.00003825526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018233746,0.00031784564,0.0021601017,0.000059279268,0.000029093515,0.0000042961906,0.004665619,0.000007885889,0.0018088451,0.958121,0.00057848933,0.032229334],"study_design_scores_gemma":[0.00063426234,0.0001117503,0.0028062756,0.000080556114,0.000008452946,0.00003948182,0.0006053833,0.029053051,0.00027514008,0.95075125,0.015329174,0.00030521577],"about_ca_topic_score_codex":0.000039369253,"about_ca_topic_score_gemma":0.000006973339,"teacher_disagreement_score":0.031924117,"about_ca_system_score_codex":0.00018065394,"about_ca_system_score_gemma":0.00015135622,"threshold_uncertainty_score":0.9999322},"labels":[],"label_agreement":null},{"id":"W3135612806","doi":"10.1109/tit.2021.3129767","title":"Space–Time Codes From Sum-Rank Codes","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Block code; Rank (graph theory); Generalization; Mathematics; Metric (unit); Concatenated error correction code; Construct (python library); Linear code; Expander code; Computer science; Discrete mathematics; Algorithm; Decoding methods; Combinatorics; Engineering","score_opus":0.010482989564470219,"score_gpt":0.22020837598437343,"score_spread":0.2097253864199032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135612806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013679399,0.00010593209,0.9767936,0.0003187885,0.0023400623,0.00031999545,0.00036258803,0.00074281247,0.0053368276],"genre_scores_gemma":[0.98058844,0.00018285062,0.017464623,0.0010026539,0.00008614286,0.00016032557,0.00018710314,0.000024185794,0.00030367798],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756426,0.00049054914,0.0006551967,0.00044509882,0.0005060756,0.00033884114],"domain_scores_gemma":[0.9970867,0.00072161923,0.00033785775,0.0014590032,0.00023986463,0.00015495616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000918337,0.00044254377,0.00045902943,0.00060357974,0.00042734115,0.0010115325,0.0012929082,0.00040964945,0.0008550375],"category_scores_gemma":[0.0000205785,0.00045748573,0.000509708,0.0005011604,0.00015284303,0.001972194,0.00003499328,0.0009880837,0.0006744298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006793861,0.0007894434,0.000014207871,0.00048615568,0.0017784998,0.000026000285,0.034274492,0.17074698,0.001426162,0.35941726,0.0015396641,0.42882174],"study_design_scores_gemma":[0.002754648,0.00032676788,0.00045933985,0.0019876212,0.0005906328,0.000053127405,0.0030222056,0.16043219,0.14149822,0.6752435,0.009733315,0.0038984169],"about_ca_topic_score_codex":0.00005157671,"about_ca_topic_score_gemma":0.0000086972605,"teacher_disagreement_score":0.96690905,"about_ca_system_score_codex":0.00009682854,"about_ca_system_score_gemma":0.00022492043,"threshold_uncertainty_score":0.9997877},"labels":[],"label_agreement":null},{"id":"W3135842381","doi":"10.1049/cdt2.12026","title":"Low‐space bit‐serial systolic array architecture for interleaved multiplication over GF(2 <sup> <i>m</i> </sup> )","year":2021,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multiplier (economics); Very-large-scale integration; Arithmetic; Application-specific integrated circuit; Systolic array; Computer science; Multiplication (music); GF(2); Binary number; Cryptography; Finite field; Computer hardware; Parallel computing; Mathematics; Algorithm; Embedded system; Discrete mathematics; Combinatorics","score_opus":0.007820306266085804,"score_gpt":0.230148635912285,"score_spread":0.2223283296461992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135842381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025475873,0.00006831498,0.96944004,0.0011542378,0.00034502405,0.0006463396,0.000053209347,0.0018064108,0.0010105264],"genre_scores_gemma":[0.7919886,0.000011090822,0.20626554,0.00093887374,0.00040159107,0.00018513032,0.000075910364,0.00004365991,0.00008960005],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99784315,0.00009020586,0.00040306777,0.0008861112,0.0002840741,0.00049342203],"domain_scores_gemma":[0.998036,0.00034177737,0.00016962177,0.0010809279,0.00020634366,0.00016529633],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022071466,0.00038145494,0.00038672326,0.00024469607,0.00018293287,0.0011112553,0.0012550197,0.00017345254,0.000003999387],"category_scores_gemma":[0.00006863709,0.00037891368,0.00041385661,0.00069485034,0.00012607526,0.00089219864,0.00045012642,0.00024776495,0.000010072419],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003025624,0.00095080386,0.0002564772,0.0003660653,0.00027406332,0.00006772959,0.004016689,0.0004783607,0.0607854,0.17600238,0.029220108,0.72727937],"study_design_scores_gemma":[0.001621993,0.0010721441,0.00013590304,0.00093225256,0.00004475519,0.00036984307,0.00011265544,0.022414017,0.57322985,0.15366566,0.24457723,0.0018237127],"about_ca_topic_score_codex":0.000003701693,"about_ca_topic_score_gemma":0.000002698954,"teacher_disagreement_score":0.76651275,"about_ca_system_score_codex":0.00006549856,"about_ca_system_score_gemma":0.00007846986,"threshold_uncertainty_score":0.9999257},"labels":[],"label_agreement":null},{"id":"W3136843670","doi":"","title":"On symmetric (78, 22, 6) designs and related self-orthogonal codes","year":2018,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Orthogonal array; Combinatorics; Arithmetic; Discrete mathematics; Statistics","score_opus":0.01960781965211929,"score_gpt":0.24961681807749406,"score_spread":0.23000899842537476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136843670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5514408,0.0005952937,0.25609776,0.0005658349,0.0004891967,0.00057884445,0.0000098523415,0.0014264442,0.18879598],"genre_scores_gemma":[0.95470464,0.00001132542,0.044956166,0.00015064406,0.00002563098,0.000012165263,7.619494e-7,0.000011131966,0.00012754134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865925,0.00013265053,0.00026110976,0.00039172496,0.00026251955,0.00029276605],"domain_scores_gemma":[0.9982269,0.0008786664,0.0000778593,0.0006186909,0.00006951029,0.00012840361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008321121,0.00017461226,0.00020768034,0.00029681428,0.0002379164,0.000115570874,0.00050254987,0.00007715314,0.0002521532],"category_scores_gemma":[0.00023460014,0.00014443275,0.00008345901,0.0009125564,0.00018348868,0.0001806508,0.00017474391,0.00012920905,0.00035079385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009611429,0.00016027638,0.000040899802,0.000034451212,0.000044672073,0.000006649407,0.0010982421,1.9782364e-7,0.00007095523,0.9919273,0.0008924792,0.005714258],"study_design_scores_gemma":[0.00026492387,0.00049325207,0.0007471353,0.000094241324,0.000027087155,0.00006002804,0.00003851452,0.014289366,0.0005525231,0.9826045,0.0006216857,0.00020673219],"about_ca_topic_score_codex":5.9639876e-7,"about_ca_topic_score_gemma":3.4736047e-7,"teacher_disagreement_score":0.40326384,"about_ca_system_score_codex":0.000014869449,"about_ca_system_score_gemma":0.000025477611,"threshold_uncertainty_score":0.58897966},"labels":[],"label_agreement":null},{"id":"W314096538","doi":"10.1109/ccc.2010.14","title":"Simple Affine Extractors Using Dimension Expansion","year":2010,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Omega; Affine transformation; Dimension (graph theory); Combinatorics; Constant (computer programming); Mathematics; Affine combination; Affine space; Field (mathematics); Simple (philosophy); Type (biology); Discrete mathematics; Physics; Pure mathematics; Quantum mechanics; Computer science","score_opus":0.016612393714402044,"score_gpt":0.2560692697915057,"score_spread":0.23945687607710364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W314096538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7194922,0.0000059837344,0.27813235,0.00006302911,0.00044155793,0.00003748913,1.6356431e-7,0.000186694,0.001640533],"genre_scores_gemma":[0.94964653,8.5857664e-7,0.05007159,0.00015176434,0.00006139148,8.8351845e-7,6.7527975e-7,0.0000049198384,0.00006139515],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99932796,0.000024538691,0.00010791414,0.0002301593,0.00013378442,0.00017567158],"domain_scores_gemma":[0.99932677,0.00006751882,0.00003344744,0.00046404864,0.000033420674,0.00007477804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022431591,0.0000868742,0.00007490502,0.000095921016,0.00014731626,0.0000800572,0.00035590146,0.000051186395,0.00024548094],"category_scores_gemma":[0.00002035322,0.00006973917,0.00005901753,0.00030267795,0.000027688744,0.00037707406,0.00017179466,0.00014121228,0.000025359237],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042169577,0.000050932078,0.001239238,0.00000192444,0.0000030656277,0.0000052644264,0.00014017725,0.000019781743,0.69397336,0.2727941,0.00023559386,0.031532347],"study_design_scores_gemma":[0.0009882246,0.00029047654,0.021469539,0.000031876585,0.000023021405,0.00012026462,0.000108678134,0.19846919,0.48556152,0.24477196,0.046990737,0.0011745249],"about_ca_topic_score_codex":0.00002434163,"about_ca_topic_score_gemma":0.00001979208,"teacher_disagreement_score":0.23015432,"about_ca_system_score_codex":0.0000041722533,"about_ca_system_score_gemma":0.00001668689,"threshold_uncertainty_score":0.2843881},"labels":[],"label_agreement":null},{"id":"W3140997097","doi":"10.1007/978-3-030-90567-5_6","title":"On MILP-Based Automatic Search for Bit-Based Division Property for Ciphers with (Large) Linear Layers","year":2021,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Division (mathematics); Permutation (music); Computer science; Multiplication (music); Integer programming; Algorithm; Integer (computer science); Linear programming; Matrix (chemical analysis); Set (abstract data type); Invertible matrix; Theoretical computer science; Mathematics; Mathematical optimization; Arithmetic","score_opus":0.023792039517128483,"score_gpt":0.28191057570485345,"score_spread":0.25811853618772496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140997097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048875842,0.00005875571,0.9459117,0.001806987,0.0011486214,0.0018720779,0.000019025401,0.0003009379,0.000006022282],"genre_scores_gemma":[0.5222091,4.8094535e-7,0.47599792,0.0015172078,0.00006838597,0.00016954099,0.000015859416,0.000020955162,5.3301983e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509674,0.00023383576,0.00043894927,0.0021483693,0.0010384942,0.001043634],"domain_scores_gemma":[0.9950159,0.002141562,0.00020844032,0.0018705806,0.0005446961,0.00021877974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026020287,0.00056244177,0.00058397395,0.0008576106,0.00058971497,0.0010171152,0.003512014,0.00026661454,0.000006233212],"category_scores_gemma":[0.00025939406,0.0003788368,0.00033105235,0.0022357062,0.00043867476,0.0002732881,0.0009833387,0.000738535,0.0000018777554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093724506,0.000312125,0.00030491146,0.00051170244,0.00001946738,0.00001642777,0.00079027994,0.80200785,0.00032377976,0.0008377227,0.000013117,0.19476886],"study_design_scores_gemma":[0.0012773612,0.0011185684,0.00020242261,0.0012816484,0.000012974273,0.0000022185786,0.0000020407708,0.9683342,0.020689834,0.0064415596,0.0000445836,0.00059256714],"about_ca_topic_score_codex":0.000023122662,"about_ca_topic_score_gemma":0.000050679042,"teacher_disagreement_score":0.47333327,"about_ca_system_score_codex":0.0002138626,"about_ca_system_score_gemma":0.0018956406,"threshold_uncertainty_score":0.99986637},"labels":[],"label_agreement":null},{"id":"W3150871087","doi":"","title":"Quaternary Quasi-Cyclic Codes with Even Length Components.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quaternary; Mathematics; Geology; Paleontology","score_opus":0.025103895406318192,"score_gpt":0.21940292284172855,"score_spread":0.19429902743541036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150871087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9822316,0.000119176344,0.00800942,0.00012028193,0.0011184345,0.00015485032,0.0000016242825,0.000400203,0.007844364],"genre_scores_gemma":[0.99600846,0.000015512025,0.0036989702,0.00015151259,0.0000069549546,0.000019784631,0.0000027220567,0.000017065957,0.00007905132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985924,0.00015670898,0.00020143806,0.00041497906,0.0002811884,0.00035328476],"domain_scores_gemma":[0.99879587,0.0000935437,0.00010609061,0.00080172013,0.000060781276,0.00014202017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003183276,0.00020661432,0.00022221051,0.00013161938,0.00018888112,0.00007643686,0.0012322582,0.000061830884,0.00003286467],"category_scores_gemma":[0.000009858916,0.00017458425,0.00008474216,0.00042258704,0.00011472761,0.00046272136,0.00023826337,0.00018055803,0.00011790566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056557572,0.00039934093,0.023438409,0.000007891449,0.000057148492,0.000049410348,0.0015044754,5.428174e-7,0.00028726194,0.97139233,0.00021581983,0.0025907797],"study_design_scores_gemma":[0.001149489,0.0008973392,0.037290376,0.00006447433,0.000021431599,0.000043019383,0.00006665659,0.00083856494,0.0033656573,0.95400536,0.0018023035,0.00045531898],"about_ca_topic_score_codex":0.00011953677,"about_ca_topic_score_gemma":0.0000066502057,"teacher_disagreement_score":0.017386993,"about_ca_system_score_codex":0.000021656071,"about_ca_system_score_gemma":0.000029334215,"threshold_uncertainty_score":0.71193385},"labels":[],"label_agreement":null},{"id":"W3155947921","doi":"","title":"On some transitive combinatorial structures and codes constructed from the symplectic group S(6, 2)","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Transitive relation; Symplectic geometry; Group (periodic table); Symplectic group; Combinatorics; Pure mathematics; Discrete mathematics; Physics","score_opus":0.009439262635961614,"score_gpt":0.22536039241987535,"score_spread":0.21592112978391373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155947921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9437242,0.00045078123,0.03560458,0.00076460396,0.018860172,0.00032748238,0.000013104987,0.00009021118,0.00016483507],"genre_scores_gemma":[0.9961349,0.00005725134,0.0024020786,0.000116170915,0.0012564597,0.000002443013,7.882511e-7,0.00002913626,7.699488e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968002,0.0004658772,0.001010829,0.00043680257,0.0008368951,0.0004494351],"domain_scores_gemma":[0.99139756,0.0065121106,0.00096677593,0.00048860046,0.00037607003,0.00025888337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016209517,0.00044711787,0.00085659244,0.00020074184,0.0006579018,0.00055994384,0.0010832584,0.00020841992,0.0000083262],"category_scores_gemma":[0.00071190274,0.00026811557,0.00023806044,0.00039238983,0.00042146473,0.0005652317,0.00036276656,0.0005536839,0.0000016272448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021235339,0.00020835038,0.00022836657,0.000026980437,0.00020415519,0.000023650384,0.001285729,0.0000014185775,0.0016443013,0.9906099,0.00013680328,0.005418],"study_design_scores_gemma":[0.0065366505,0.0014114316,0.0008269478,0.00045887768,0.00010856759,0.000111746565,0.00022871674,0.0005123837,0.0010581808,0.9882535,0.00012766494,0.00036536157],"about_ca_topic_score_codex":0.000014935066,"about_ca_topic_score_gemma":6.3072423e-7,"teacher_disagreement_score":0.052410677,"about_ca_system_score_codex":0.000069450536,"about_ca_system_score_gemma":0.000122011326,"threshold_uncertainty_score":0.9999771},"labels":[],"label_agreement":null},{"id":"W3157716736","doi":"10.25073/2588-1086/vnucsce.240","title":"Performance of Orthogonal Frequency Division Multiplexing Based Advanced Encryption Standard","year":2020,"lang":"en","type":"article","venue":"VNU Journal of Science Computer Science and Communication Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Encryption; Advanced Encryption Standard; Computer network; Physical layer; Wireless; Telecommunications; Channel (broadcasting)","score_opus":0.011756225582458854,"score_gpt":0.21899476441871077,"score_spread":0.20723853883625193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157716736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4872519,0.0001264123,0.51206917,0.00035517858,0.00011475103,0.000040347764,4.4564513e-7,0.00002333663,0.000018424269],"genre_scores_gemma":[0.704194,0.000058450572,0.29563192,0.00009292292,0.000018913137,8.601458e-7,1.2854227e-7,0.0000027120225,7.263373e-8],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979204,0.0000378763,0.00046388948,0.00026762058,0.0010480441,0.00026218852],"domain_scores_gemma":[0.9978258,0.0001328065,0.00035950588,0.00047210846,0.0009679746,0.00024182851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030334897,0.0001249589,0.00020408609,0.0005825461,0.0004688577,0.00022512171,0.0028983115,0.000023694778,0.0000018548021],"category_scores_gemma":[0.00021959063,0.00011081835,0.00005751702,0.002618257,0.00092625414,0.003470569,0.00055587257,0.0002298527,5.267097e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043888598,0.000063597705,0.0057468466,0.00008194289,0.000009062493,0.0000032804785,0.0036492364,0.23885737,0.40327844,0.046424188,0.000005114578,0.30183703],"study_design_scores_gemma":[0.00033674532,0.0005558439,0.01404241,0.00020589227,0.0000027743206,0.000015708236,0.000031769705,0.9625822,0.021662015,0.0003699237,0.000056811372,0.00013793622],"about_ca_topic_score_codex":6.457803e-7,"about_ca_topic_score_gemma":9.033836e-8,"teacher_disagreement_score":0.7237248,"about_ca_system_score_codex":0.000056347773,"about_ca_system_score_gemma":0.00042495143,"threshold_uncertainty_score":0.5385832},"labels":[],"label_agreement":null},{"id":"W3158493150","doi":"10.3934/math.2021428","title":"Unit groups of finite group algebras of Abelian groups of order 17 to 20","year":2021,"lang":"en","type":"article","venue":"AIMS Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Abelian group; Group (periodic table); Mathematics; Order (exchange); Unit (ring theory); Elementary abelian group; Rank of an abelian group; G-module; Non-abelian group; Pure mathematics; p-group; Field (mathematics); Finite group; Combinatorics; Algebra over a field; Physics; Mathematics education; Quantum mechanics","score_opus":0.01969302596798267,"score_gpt":0.24367161276261948,"score_spread":0.2239785867946368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158493150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3819019,0.000120107055,0.6141066,0.0002897287,0.00016865038,0.00015993089,0.000017707465,0.000055693792,0.0031797132],"genre_scores_gemma":[0.7746432,0.000025844023,0.22486916,0.00020861602,0.000024623545,0.000008471752,0.0000059193326,0.00001795871,0.00019620139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984976,0.000074713316,0.00059511675,0.000247405,0.00036181725,0.00022333975],"domain_scores_gemma":[0.99775,0.0005230006,0.00030899866,0.0010107236,0.00031674316,0.000090526955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005150969,0.0001638909,0.0004279599,0.00020558588,0.000045066205,0.000025250052,0.0008492738,0.000073778734,0.000104247934],"category_scores_gemma":[0.00020171585,0.00015439132,0.00015962808,0.0017192897,0.00010166449,0.00016164682,0.0004109921,0.00010265309,0.000015746493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008293478,0.00055674993,0.0005335285,0.00047509777,0.000086071515,0.000008905243,0.0051833442,0.000105523104,0.011029833,0.9791535,0.00047762052,0.0023815003],"study_design_scores_gemma":[0.00079459534,0.0006564831,0.0014750903,0.0008222658,0.00010102762,0.00002881357,0.0012828327,0.007131432,0.06240011,0.9229348,0.0018547272,0.0005178712],"about_ca_topic_score_codex":0.000006446718,"about_ca_topic_score_gemma":0.000023959105,"teacher_disagreement_score":0.3927413,"about_ca_system_score_codex":0.000005896874,"about_ca_system_score_gemma":0.000048868515,"threshold_uncertainty_score":0.62958956},"labels":[],"label_agreement":null},{"id":"W3158772284","doi":"10.48550/arxiv.2105.02374","title":"The additive index of polynomials over finite fields","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite field; Multiplicative function; Mathematics; Permutation (music); Character (mathematics); Polynomial; Set (abstract data type); Index (typography); Field (mathematics); Combinatorics; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis; Computer science; Physics","score_opus":0.03920610609754951,"score_gpt":0.17957277293206456,"score_spread":0.14036666683451504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158772284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35960218,0.00018464822,0.6328194,0.00011922268,0.000940129,0.0001745889,0.000028773216,0.000099063494,0.006031984],"genre_scores_gemma":[0.99873066,0.00030965664,0.00016209512,0.00011222655,0.000056044693,7.996778e-7,0.0000061235605,0.0000071885033,0.00061523035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863434,0.0002511209,0.00018354577,0.0006024853,0.00008737114,0.00024115335],"domain_scores_gemma":[0.99744964,0.0008114308,0.00026774855,0.0012448222,0.00014839618,0.00007798247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032433379,0.00020008255,0.00025953172,0.00014968822,0.00019993684,0.00013786892,0.0018360334,0.00023851819,0.000074943084],"category_scores_gemma":[0.00008011881,0.00018686769,0.00035504324,0.00059614936,0.00019288027,0.0002014327,0.0021828704,0.00049092615,0.000006831487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120580546,0.00013444107,0.0038478787,0.0000553675,0.00043542596,0.000249938,0.0011942312,0.038419977,0.000039726678,0.9462247,0.0011602471,0.008117477],"study_design_scores_gemma":[0.0016037327,0.00028303402,0.02336212,0.0006076969,0.00025535177,0.000008245785,0.0011667308,0.30627733,0.0031375424,0.6515903,0.010020262,0.001687673],"about_ca_topic_score_codex":0.00008995068,"about_ca_topic_score_gemma":0.000080070444,"teacher_disagreement_score":0.63912845,"about_ca_system_score_codex":0.0000364714,"about_ca_system_score_gemma":0.00018737593,"threshold_uncertainty_score":0.76202434},"labels":[],"label_agreement":null},{"id":"W3167837386","doi":"10.1109/icjece.2020.3035182","title":"Compact Bit-Parallel Systolic Multiplier Over GF(2<i><sup>m</sup></i>)","year":2021,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Prince Sattam bin Abdulaziz University","keywords":"Computer science; Multiplier (economics); Arithmetic; Computer hardware; Parallel computing; Mathematics","score_opus":0.006237417558194646,"score_gpt":0.1783032788657816,"score_spread":0.17206586130758694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167837386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18483084,0.00322049,0.81094974,0.00039573308,0.0003869483,0.000046963305,0.0000018247488,0.000041347845,0.00012611752],"genre_scores_gemma":[0.9827476,0.000032183925,0.016403573,0.00042125033,0.00035761445,6.383351e-7,7.124796e-7,0.00001274362,0.000023643113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880916,0.000049847153,0.00030598717,0.00021525256,0.00016240474,0.00045734446],"domain_scores_gemma":[0.99864876,0.00017604386,0.000068737296,0.00021561213,0.00012234233,0.0007685228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018397698,0.0001791224,0.00030013305,0.00040611083,0.00011663576,0.00027881798,0.00046011875,0.00007096345,0.000015096762],"category_scores_gemma":[0.000040269715,0.00016861968,0.00016263398,0.0007508833,0.000025270105,0.00027635126,0.000041155676,0.0003866032,0.000003320722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043997876,0.00018434926,0.014435485,0.00016036732,0.0008012992,0.005949204,0.0028629494,0.39319232,0.0013827141,0.43792182,0.012584823,0.13048065],"study_design_scores_gemma":[0.00066379603,0.00019945354,0.010967502,0.00011179743,0.000022004873,0.0019293401,0.0000050648987,0.95961326,0.00019462132,0.0014922753,0.024449239,0.0003516629],"about_ca_topic_score_codex":0.00008360231,"about_ca_topic_score_gemma":0.000036586967,"teacher_disagreement_score":0.79791677,"about_ca_system_score_codex":0.000065756525,"about_ca_system_score_gemma":0.00031854954,"threshold_uncertainty_score":0.6876111},"labels":[],"label_agreement":null},{"id":"W3169276539","doi":"10.1515/spma-2021-0154","title":"Combinatorial properties of the enhanced principal rank characteristic sequence over finite fields","year":2021,"lang":"en","type":"article","venue":"Special Matrices","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Finite field; Rank (graph theory); Principal (computer security); Mathematics; Combinatorics; Field (mathematics); Electron paramagnetic resonance; Pure mathematics; Discrete mathematics; Physics; Computer science; Quantum mechanics; Genetics; Biology","score_opus":0.019173717969474775,"score_gpt":0.23007974273332416,"score_spread":0.21090602476384937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169276539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98369515,0.00018073723,0.004619969,0.00030181694,0.004624675,0.00012709494,0.0000053474714,0.00005409548,0.0063911304],"genre_scores_gemma":[0.9985539,0.000032523116,0.000197616,0.000101982434,0.0009908756,0.0000071860636,4.9190305e-7,0.0000039452116,0.000111509995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902874,0.00011491736,0.00020600186,0.00022209215,0.0002632815,0.00016498243],"domain_scores_gemma":[0.9992151,0.00009760372,0.00012952733,0.0004282578,0.00009777721,0.000031689793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015721508,0.000099344616,0.00015438303,0.000043083106,0.00013616726,0.000109727574,0.00073142257,0.000056622226,0.00011042169],"category_scores_gemma":[0.00014828278,0.00007044039,0.00011939095,0.0005819878,0.00008863193,0.00021843986,0.00032876583,0.00013170669,0.0000116016445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112833855,0.00016347355,0.0010975883,0.00014190738,0.00004618111,0.000023057044,0.0032090049,0.000025529798,0.073005155,0.9097897,0.00015666874,0.012228905],"study_design_scores_gemma":[0.0018102216,0.0002796206,0.030199353,0.00045728602,0.000075714655,0.00002119898,0.00016263779,0.0011063578,0.7269381,0.2116044,0.026517551,0.00082754146],"about_ca_topic_score_codex":0.000010199906,"about_ca_topic_score_gemma":0.000010698968,"teacher_disagreement_score":0.69818527,"about_ca_system_score_codex":0.000012655859,"about_ca_system_score_gemma":0.000110826055,"threshold_uncertainty_score":0.28724757},"labels":[],"label_agreement":null},{"id":"W3169525880","doi":"","title":"Three Cousins of Recamán's Sequence","year":2020,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Combinatorics; Concatenation (mathematics); Sequence (biology); Conjecture; Multiplicative function; Product (mathematics); Mathematics; Arithmetic; Geometry; Chemistry","score_opus":0.02553951201979339,"score_gpt":0.2218846697340467,"score_spread":0.19634515771425332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169525880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047719803,0.00020258695,0.91176826,0.016332971,0.00006614529,0.00012320161,0.000008731685,0.00024959035,0.023528699],"genre_scores_gemma":[0.88964576,0.000051410818,0.1097985,0.00034092925,0.000009519121,0.0000071420404,0.000008319491,0.000010045159,0.00012836419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99772125,0.0011023667,0.000275188,0.00041294523,0.000279961,0.00020830093],"domain_scores_gemma":[0.99701566,0.00068874896,0.0002035024,0.0011765164,0.00076021586,0.00015536141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052736,0.00013199964,0.00017872771,0.00007633256,0.00018062642,0.0001340895,0.0017102264,0.000060158174,0.000058932055],"category_scores_gemma":[0.000618733,0.00013664585,0.000121300276,0.00091858825,0.00019671986,0.00027615414,0.0005112444,0.00016650163,0.00003031079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000608095,0.00010885641,0.0012310761,0.00002690785,0.000016917791,0.0000033703939,0.0052592894,0.000011102895,0.016360441,0.9115723,0.0004669537,0.064936735],"study_design_scores_gemma":[0.0017307756,0.0000075907888,0.009926815,0.0011674532,0.000055150478,0.000037461414,0.00022561655,0.2219854,0.51720285,0.18192509,0.06448349,0.0012523173],"about_ca_topic_score_codex":0.00010554692,"about_ca_topic_score_gemma":0.00016940534,"teacher_disagreement_score":0.841926,"about_ca_system_score_codex":0.000015514692,"about_ca_system_score_gemma":0.00009805215,"threshold_uncertainty_score":0.5572256},"labels":[],"label_agreement":null},{"id":"W3186796962","doi":"","title":"Relaxed Locally Correctable Codes with Improved Parameters.","year":2020,"lang":"en","type":"article","venue":"Summit (Simon Fraser University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Code word; Mathematics; Decoding methods; Combinatorics; Block (permutation group theory); Constant (computer programming); Discrete mathematics; List decoding; Block code; Algorithm; Computer science; Concatenated error correction code","score_opus":0.011903369849054928,"score_gpt":0.17892688384034117,"score_spread":0.16702351399128623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186796962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24196316,0.00005332162,0.7447079,0.0015579893,0.00020068572,0.0002718613,0.000010292018,0.00074206427,0.010492719],"genre_scores_gemma":[0.9854253,0.0000146394295,0.0131336395,0.0009350019,0.000021689219,6.8954154e-7,0.000004541261,0.000012310656,0.00045220132],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878424,0.00010477828,0.000104020066,0.00051235233,0.00017309286,0.00032152276],"domain_scores_gemma":[0.99903655,0.00011294627,0.00008095756,0.00043072068,0.00008404227,0.0002547632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009792576,0.00018730763,0.00020496703,0.00016485367,0.00020492532,0.000113115515,0.0011065358,0.000077789744,0.000034968787],"category_scores_gemma":[0.00002343695,0.00018275877,0.000101459045,0.0015984209,0.00012233894,0.0006272307,0.00025400944,0.00023300231,0.000051330237],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003938904,0.00068826124,0.53772223,0.00019174436,0.0008823805,0.002525948,0.0012217372,0.0034772444,0.0008898843,0.33576477,0.051862232,0.06083468],"study_design_scores_gemma":[0.011461028,0.0067103915,0.0016347265,0.00027221948,0.0004048546,2.6148555e-7,0.024536416,0.15254568,0.04402427,0.007553824,0.74711233,0.0037440164],"about_ca_topic_score_codex":0.00004896947,"about_ca_topic_score_gemma":0.0015483667,"teacher_disagreement_score":0.74346215,"about_ca_system_score_codex":0.000035380068,"about_ca_system_score_gemma":0.000083475665,"threshold_uncertainty_score":0.7452686},"labels":[],"label_agreement":null},{"id":"W3189065149","doi":"","title":"Some optimal codes and strongly regular graphs from the linear group L(4, 3)","year":2012,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Group (periodic table); Discrete mathematics","score_opus":0.018421924291718222,"score_gpt":0.23843827640479506,"score_spread":0.22001635211307685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189065149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.784839,0.0060947808,0.2056759,0.0010126056,0.00034680188,0.0003575416,0.000032433014,0.0003545534,0.0012863969],"genre_scores_gemma":[0.905369,0.000030238964,0.094224684,0.0001647597,0.00014977336,0.000020813886,0.00000367363,0.000010933056,0.000026158212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877477,0.00014608953,0.00021731382,0.00025718336,0.00023671835,0.00036791843],"domain_scores_gemma":[0.99821705,0.000728372,0.000068685185,0.0008294274,0.00002172359,0.00013476424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008740556,0.00017125584,0.00019736278,0.0000502143,0.00024150765,0.000111264824,0.0007279625,0.00005687834,0.00004771192],"category_scores_gemma":[0.00007607992,0.00011322861,0.00011001721,0.0002065962,0.00022708655,0.00055864477,0.0003302579,0.0001426017,0.00005122378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007049832,0.00009783535,0.00043416457,0.00001564879,0.0000447679,0.0000010445489,0.002420814,9.766485e-7,0.0002019554,0.9944763,0.00047863665,0.0018208087],"study_design_scores_gemma":[0.00031017195,0.00010778772,0.0051323525,0.00007748043,0.00006226705,0.00001834617,0.00083422515,0.010152459,0.00057010003,0.97809166,0.0043455632,0.00029761737],"about_ca_topic_score_codex":0.000008915735,"about_ca_topic_score_gemma":0.000001034708,"teacher_disagreement_score":0.12052997,"about_ca_system_score_codex":0.000007656451,"about_ca_system_score_gemma":0.000008029838,"threshold_uncertainty_score":0.4617329},"labels":[],"label_agreement":null},{"id":"W3195953963","doi":"","title":"Finding discrete logarithms with a set orbit distinguisher.","year":2010,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Discrete logarithm; Logarithm; Binary logarithm; Mathematics; Time complexity; Discrete mathematics; Set (abstract data type); Prime (order theory); Combinatorics; Polynomial; Algorithm; Computer science; Public-key cryptography","score_opus":0.019487887778501516,"score_gpt":0.2691911555552283,"score_spread":0.2497032677767268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195953963","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092281066,0.000056318862,0.8897069,0.0012369383,0.0016610124,0.0005562834,0.00007608869,0.0006385047,0.013786864],"genre_scores_gemma":[0.37454456,0.000018865356,0.6245363,0.00026017075,0.00030324937,0.0001941404,0.00007994324,0.0000544475,0.000008350223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955677,0.00049761217,0.00058333675,0.001921069,0.00042065675,0.0010096577],"domain_scores_gemma":[0.9955897,0.0008179992,0.00056625303,0.0025536222,0.0001373761,0.0003350736],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00074354326,0.0007836557,0.00088769465,0.00050689606,0.00046288825,0.0004125513,0.003626805,0.0005718602,0.00011719995],"category_scores_gemma":[0.00024574125,0.0006721238,0.00041115156,0.00037011507,0.0009867323,0.00017375025,0.00607527,0.0037161957,0.00012596248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010214832,0.00007599237,0.008162643,0.000092860406,0.00023412732,0.00038329276,0.0036667774,0.00027585146,0.00026857306,0.98079896,0.0002541097,0.0056846477],"study_design_scores_gemma":[0.0005012786,0.00020516406,0.0072485083,0.00025752262,0.00007286341,0.0002969065,0.00008142834,0.0055861296,0.0004056453,0.98000914,0.00437458,0.00096081966],"about_ca_topic_score_codex":0.00007412135,"about_ca_topic_score_gemma":0.00032772476,"teacher_disagreement_score":0.2822635,"about_ca_system_score_codex":0.00004837582,"about_ca_system_score_gemma":0.00030937456,"threshold_uncertainty_score":0.999573},"labels":[],"label_agreement":null},{"id":"W3197582521","doi":"10.4230/lipics.ccc.2018.4","title":"Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs","year":2018,"lang":"en","type":"article","venue":"DR-NTU (Nanyang Technological University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Dimension (graph theory); Mathematics; Degree (music); Combinatorics; Subspace topology; Rank (graph theory); Finite field; Expander graph; Discrete mathematics; Mathematical analysis; Physics; Graph","score_opus":0.02242866294649585,"score_gpt":0.21290635848642606,"score_spread":0.19047769553993021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197582521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36452064,0.00005952268,0.6298457,0.001353942,0.0001410636,0.00017285415,0.0000011460129,0.0011610417,0.0027441017],"genre_scores_gemma":[0.98458755,0.000043822653,0.014775416,0.00013401215,0.000028061324,7.504868e-7,7.8996237e-7,0.000006969171,0.0004226488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865144,0.00012751218,0.00011958527,0.00055663026,0.0001793132,0.00036549033],"domain_scores_gemma":[0.99901855,0.00014911154,0.00008361426,0.000550866,0.00007417319,0.000123695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030851952,0.00019234682,0.00023174961,0.0004563947,0.0004322312,0.0000818309,0.0009620782,0.00028462865,0.000025759568],"category_scores_gemma":[0.00006575872,0.0001729094,0.00008975765,0.0013089451,0.000839549,0.00031239018,0.0008209997,0.00022498259,0.000032095257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020940954,0.00019462776,0.0015700781,0.000011290223,0.00006303845,0.00025637983,0.00031283838,0.0000030851927,0.094934255,0.8471748,0.000521141,0.054749053],"study_design_scores_gemma":[0.009271996,0.0051907673,0.0067986436,0.00035357045,0.00027793163,0.00029044377,0.0029450129,0.025207976,0.38114214,0.36186555,0.20242693,0.004229065],"about_ca_topic_score_codex":0.0000075595003,"about_ca_topic_score_gemma":0.000005907197,"teacher_disagreement_score":0.6200669,"about_ca_system_score_codex":0.000041524232,"about_ca_system_score_gemma":0.000022597524,"threshold_uncertainty_score":0.70510405},"labels":[],"label_agreement":null},{"id":"W3199746871","doi":"","title":"Gray Codes for AT-Free Orders","year":2021,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Gray (unit); Gray code; Arithmetic; Algorithm; Medicine","score_opus":0.011691373019040696,"score_gpt":0.23394766561978073,"score_spread":0.22225629260074004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199746871","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8545537,0.0014871954,0.10573481,0.006459657,0.015310326,0.0005869524,0.000029625693,0.0010469796,0.014790727],"genre_scores_gemma":[0.98544073,0.00001778506,0.013566974,0.00040977792,0.000012430327,0.000040153893,0.0000074967998,0.0000126775985,0.00049198454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990232,0.000067367786,0.00013658567,0.0003454705,0.00016013811,0.0002672104],"domain_scores_gemma":[0.9985026,0.00027662268,0.000047895133,0.0009525606,0.0001372205,0.0000830784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027441813,0.000115583585,0.000145176,0.000054171975,0.00025241976,0.000106718304,0.000941701,0.000053796397,0.000028570174],"category_scores_gemma":[0.000174093,0.000118890384,0.00013810866,0.00047248902,0.00004898671,0.00017753511,0.00049678073,0.00007110982,0.000024856156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009434188,0.00006354985,0.0006643064,0.000012436998,0.000024295092,0.00000750501,0.00015975634,0.0000023358966,0.00068771135,0.9814947,0.014892112,0.001981803],"study_design_scores_gemma":[0.00082480157,0.000077579214,0.00042578633,0.000012313833,0.00000845614,0.000009393339,0.000018269615,0.00035331154,0.0077361865,0.94224006,0.048132636,0.00016120105],"about_ca_topic_score_codex":0.0000039209085,"about_ca_topic_score_gemma":0.000010397112,"teacher_disagreement_score":0.13088699,"about_ca_system_score_codex":0.000027365415,"about_ca_system_score_gemma":0.000057018842,"threshold_uncertainty_score":0.4848209},"labels":[],"label_agreement":null},{"id":"W3200192232","doi":"10.1016/j.ffa.2022.102083","title":"Enumeration of self-reciprocal irreducible monic polynomials with prescribed leading coefficients over a finite field","year":2022,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Carleton University","keywords":"Monic polynomial; Mathematics; Reciprocal; Irreducible polynomial; Finite field; Polynomial; Sequence (biology); Field (mathematics); Degree (music); Palindrome; Pure mathematics; Bell polynomials; Combinatorics; Matrix polynomial; Mathematical analysis","score_opus":0.009924961351266281,"score_gpt":0.22295115900243867,"score_spread":0.2130261976511724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200192232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05883568,0.00020987904,0.938339,0.00042601608,0.00006046037,0.00036051564,0.000031323645,0.0000978033,0.0016393122],"genre_scores_gemma":[0.9969167,0.000015918635,0.0022767417,0.00030905526,0.000028677465,0.00033446247,0.000012166732,0.0000063819243,0.00009990108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992116,0.000058050497,0.00017879822,0.00028506212,0.00011568061,0.00015078693],"domain_scores_gemma":[0.9989625,0.00044110982,0.00009986473,0.00041366508,0.000035738045,0.000047127316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020268772,0.000104412866,0.00013514144,0.00012212539,0.00038733523,0.00006032357,0.00036276487,0.000042552776,0.000059849033],"category_scores_gemma":[0.000011774346,0.00008999806,0.000050814062,0.00051886763,0.000027471526,0.0001219123,0.00020465902,0.00016935669,0.0000024568722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024401321,0.0013770189,0.0034846251,0.00014069559,0.00028785472,0.0000038543762,0.022927826,0.011039501,0.0048631174,0.82011807,0.001800082,0.13371333],"study_design_scores_gemma":[0.004820829,0.0059466613,0.004439861,0.0001951197,0.00021489902,0.000071777264,0.0018572294,0.40200686,0.049115326,0.15028027,0.3787282,0.0023229735],"about_ca_topic_score_codex":0.00002118708,"about_ca_topic_score_gemma":0.000005367291,"teacher_disagreement_score":0.938081,"about_ca_system_score_codex":0.0000094198585,"about_ca_system_score_gemma":0.000041495907,"threshold_uncertainty_score":0.3670014},"labels":[],"label_agreement":null},{"id":"W3202612442","doi":"10.1002/jcd.21806","title":"Legendre pairs of lengths ℓ≡0(mod3)","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Legendre polynomials; Mathematics; Combinatorics; Integer (computer science); Legendre transformation; Legendre function; Multiplier (economics); Order (exchange); Mathematical analysis","score_opus":0.02414696928504522,"score_gpt":0.2488568550173062,"score_spread":0.22470988573226097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202612442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24308096,0.002311414,0.7221994,0.0013298483,0.022751698,0.00014496887,0.000003830588,0.000080180354,0.008097747],"genre_scores_gemma":[0.991715,0.000053442694,0.007800002,0.000054781864,0.0003321783,5.986492e-7,2.1563227e-7,0.0000074880336,0.00003627591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838233,0.00032058053,0.0005102466,0.0001390385,0.0004645792,0.00018322127],"domain_scores_gemma":[0.9981856,0.00032352915,0.00041517735,0.00036158288,0.0005910056,0.00012310225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009797736,0.00011387364,0.0003293234,0.00016833775,0.000072173316,0.000073602474,0.00079175556,0.00007622036,0.000035832327],"category_scores_gemma":[0.00019756374,0.00010395905,0.00032645298,0.000627304,0.000051533778,0.00044023697,0.00011946265,0.00024431088,0.00000433369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005729886,0.00026361094,0.00031095525,0.000017138842,0.000080802965,0.00016061465,0.0003523717,0.000028178361,0.013794137,0.978259,0.0014332377,0.005242624],"study_design_scores_gemma":[0.0024226978,0.0013058695,0.0009960218,0.00015490373,0.00006520783,0.00038319378,0.00020717623,0.00023585414,0.17305431,0.8065657,0.014320461,0.00028861722],"about_ca_topic_score_codex":0.0000013179432,"about_ca_topic_score_gemma":3.0533738e-7,"teacher_disagreement_score":0.74863404,"about_ca_system_score_codex":0.000024434017,"about_ca_system_score_gemma":0.00032549878,"threshold_uncertainty_score":0.4239327},"labels":[],"label_agreement":null},{"id":"W3205562261","doi":"10.4064/aa220315-13-8","title":"Statistics for $p$-ranks of Artin–Schreier covers","year":2022,"lang":"en","type":"preprint","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Infinity; Isomorphism (crystallography); Finite field; Combinatorics; Prime (order theory); Limit (mathematics); Genus; Algebraic number field; Distribution (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.020933436295170714,"score_gpt":0.27408051809788675,"score_spread":0.25314708180271606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205562261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041532377,0.00011385107,0.98838437,0.0006064791,0.0013390903,0.0004946218,0.0006903,0.00011815913,0.004099914],"genre_scores_gemma":[0.5275023,0.000056082234,0.47157013,0.00022129921,0.00007665399,0.0001854717,0.00008585841,0.000028228033,0.00027397004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982295,0.00012550825,0.00039669021,0.0005651439,0.0003744818,0.00030869586],"domain_scores_gemma":[0.9974138,0.0008855315,0.00029873842,0.0011657793,0.00014544856,0.00009070549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066307525,0.00022776102,0.0003806074,0.00022049996,0.00015022946,0.00011488567,0.0016754211,0.00013290536,0.00029039962],"category_scores_gemma":[0.0002511281,0.00024453955,0.0002486267,0.00026569254,0.00013146873,0.00008128592,0.0019267066,0.00048625612,0.0000036542258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006278143,0.00022515788,0.0001242877,0.00023295698,0.00018287012,0.000009158746,0.0006741379,0.000398564,0.0003180137,0.969405,0.010044408,0.018322682],"study_design_scores_gemma":[0.00065436104,0.00057659385,0.0005454764,0.00007507239,0.00016855988,0.0000066334724,0.00006272508,0.029496852,0.0014857458,0.8003302,0.16592388,0.00067386637],"about_ca_topic_score_codex":0.00001187478,"about_ca_topic_score_gemma":0.0000018894731,"teacher_disagreement_score":0.52334905,"about_ca_system_score_codex":0.000033529883,"about_ca_system_score_gemma":0.00019838357,"threshold_uncertainty_score":0.99720335},"labels":[],"label_agreement":null},{"id":"W3206898017","doi":"10.26493/1855-3974.2724.83d","title":"The search for small association schemes with noncyclotomic eigenvalues","year":2022,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Association scheme; Eigenvalues and eigenvectors; Rank (graph theory); Commutative property; Algebraic number; Table (database); Pure mathematics; Algebra over a field; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.024295702719765194,"score_gpt":0.23637362297935255,"score_spread":0.21207792025958735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206898017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41405866,0.0005019465,0.5616679,0.009060301,0.00046849993,0.0022662824,0.000025818,0.0005747531,0.011375793],"genre_scores_gemma":[0.9824943,0.000007645781,0.015270602,0.0002372853,0.000024776455,0.0005346339,0.000003916053,0.00001979809,0.0014070431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985493,0.00021411496,0.00024072167,0.00027236465,0.0004016299,0.00032187445],"domain_scores_gemma":[0.997619,0.0014989129,0.0001738786,0.00055257155,0.00010364723,0.00005199479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00250144,0.00012894586,0.00017634068,0.00006776382,0.0011149053,0.00022010968,0.0010198159,0.000024707044,0.00001544217],"category_scores_gemma":[0.00008166877,0.000089536145,0.00012143982,0.00033103756,0.00005155914,0.00013086046,0.00023110303,0.00016262493,0.000012426425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008109974,0.00010660443,0.0007997538,0.000043995835,0.00013202432,0.0000042445713,0.0024676793,0.000024140287,0.00039140187,0.9907237,0.0010902218,0.004135107],"study_design_scores_gemma":[0.003315623,0.0016488164,0.00037010762,0.00009979093,0.0000991605,0.000073457784,0.003081596,0.049442988,0.008915555,0.7953644,0.13658136,0.0010071478],"about_ca_topic_score_codex":0.0000051149163,"about_ca_topic_score_gemma":0.000005872574,"teacher_disagreement_score":0.5684356,"about_ca_system_score_codex":0.000079579346,"about_ca_system_score_gemma":0.00009570436,"threshold_uncertainty_score":0.85750633},"labels":[],"label_agreement":null},{"id":"W3209060430","doi":"10.1007/s12095-022-00580-9","title":"Construction of APN permutations via Walsh zero spaces","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subspace topology; Combinatorics; Mathematics; Zero (linguistics); Space (punctuation); Vector space; Inverse; Affine transformation; Affine space; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.015044641152424142,"score_gpt":0.23563386381277215,"score_spread":0.220589222660348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209060430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06037271,0.0028512757,0.9220455,0.0031130484,0.00022006988,0.00025795598,0.000047727463,0.00023295477,0.010858705],"genre_scores_gemma":[0.92953587,0.0002574532,0.069942564,0.00012413504,0.0000052859027,0.00010593198,0.00001865964,0.0000052990363,0.0000048297766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896914,0.00029540723,0.00023205689,0.00019958286,0.00016552067,0.00013827352],"domain_scores_gemma":[0.9981168,0.00024284235,0.00015208178,0.0013491493,0.000078936755,0.00006016939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003113824,0.000100202386,0.00013517661,0.00038568443,0.0012611109,0.00006783583,0.0013092649,0.000026439722,0.000046273482],"category_scores_gemma":[0.000011183871,0.000111773654,0.0001332124,0.0014349056,0.00050006167,0.0002493194,0.0008469639,0.00021867639,0.0000012469837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004843475,0.00011895001,0.0027813618,0.000006596028,0.00003812818,2.3894376e-7,0.0016620832,0.000024126628,0.00054838945,0.95269734,0.00006859897,0.042049322],"study_design_scores_gemma":[0.0003663944,0.00021017047,0.006247845,0.00001343741,0.000047270845,0.00006960793,0.0021724028,0.0030490076,0.00038816055,0.9630455,0.024119971,0.00027027892],"about_ca_topic_score_codex":0.000028042989,"about_ca_topic_score_gemma":0.000006551532,"teacher_disagreement_score":0.86916316,"about_ca_system_score_codex":0.0000073213764,"about_ca_system_score_gemma":0.00002950526,"threshold_uncertainty_score":0.9699573},"labels":[],"label_agreement":null},{"id":"W3210629821","doi":"10.4153/s0008439521000928","title":"Corrections to “Value sets of sparse polynomials”","year":2021,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Value (mathematics); Algebra over a field; Pure mathematics; Statistics","score_opus":0.013440009344836459,"score_gpt":0.22693184765922733,"score_spread":0.21349183831439086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210629821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24075177,0.00019487545,0.5304893,0.05496022,0.0012490003,0.0005186987,0.00006378132,0.00025021646,0.17152211],"genre_scores_gemma":[0.94713813,0.0000019006642,0.048327185,0.0029090247,0.000042426884,0.000018247929,0.0000020183213,0.000012120412,0.0015489176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905443,0.000083261,0.00021270187,0.00023649551,0.00012718505,0.00028594717],"domain_scores_gemma":[0.9986117,0.00021014686,0.000031027696,0.0005257108,0.0000804457,0.0005409883],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027607603,0.00009506634,0.00018212154,0.00015812427,0.00009998769,0.00006387877,0.0004098006,0.000052511354,0.0036691509],"category_scores_gemma":[0.00039254682,0.00009891529,0.00009705868,0.00051020837,0.000046532765,0.000025628606,0.00008814407,0.00009186213,0.0029193414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019096422,0.000045872304,0.00003266567,0.000023662546,0.000015118226,0.00005638553,0.00048734498,0.000028664575,0.00041184848,0.97030514,0.023852415,0.004738966],"study_design_scores_gemma":[0.00042081188,0.00017971746,0.0011146835,0.0003283722,0.00004189301,0.00021285104,0.00040089316,0.0024222294,0.013476096,0.41754043,0.56314373,0.00071832404],"about_ca_topic_score_codex":0.00035263866,"about_ca_topic_score_gemma":0.00075981615,"teacher_disagreement_score":0.7063864,"about_ca_system_score_codex":0.000043226482,"about_ca_system_score_gemma":0.0002674444,"threshold_uncertainty_score":0.997857},"labels":[],"label_agreement":null},{"id":"W3214813422","doi":"10.61091/ars163-02","title":"On the circuits of splitting matroids representable over GF(p)","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matroid; Electronic circuit; Combinatorics; Arithmetic; Mathematics; Graphic matroid; Computer science; Discrete mathematics; Theoretical computer science; Engineering; Electrical engineering","score_opus":0.010047099580994947,"score_gpt":0.24210190770688347,"score_spread":0.23205480812588852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214813422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9285731,0.0001503853,0.003594574,0.0008969451,0.0018918469,0.00016720471,0.0000010088629,0.00012102877,0.064603925],"genre_scores_gemma":[0.99909294,0.000004850888,0.00011996377,0.0004006286,0.000003686897,0.000010435808,3.1744165e-7,0.000004360985,0.00036280334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902207,0.00012598654,0.00019243252,0.00026126183,0.0002003291,0.0001979058],"domain_scores_gemma":[0.9982542,0.0006659964,0.000080908896,0.00091997004,0.000050766346,0.000028176579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006505321,0.00009791194,0.00013551957,0.00010789597,0.00017027807,0.00007801,0.0009833104,0.000041002462,0.000029077764],"category_scores_gemma":[0.0001436183,0.000075531316,0.00010304903,0.00084068964,0.00006160776,0.00013562519,0.0002977929,0.00015002777,0.000013323562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004387934,0.000063868356,0.0024607875,0.00000949748,0.000024548135,0.0000017680892,0.00014588905,0.0000070182396,0.000749938,0.99038684,0.0036290276,0.0025164438],"study_design_scores_gemma":[0.00025438814,0.000049191054,0.0038534945,0.00006354725,0.000006319728,7.5016357e-7,0.000026785456,0.0006491296,0.00736345,0.9864682,0.0011903885,0.00007435255],"about_ca_topic_score_codex":0.000017389724,"about_ca_topic_score_gemma":4.402596e-7,"teacher_disagreement_score":0.070519865,"about_ca_system_score_codex":0.000017975006,"about_ca_system_score_gemma":0.000035271838,"threshold_uncertainty_score":0.30800778},"labels":[],"label_agreement":null},{"id":"W360545484","doi":"","title":"Error-correcting codes, finite geometries and cryptography : Conference on Error-control Codes, Information Theory and Applied Cryptography, December 5-6, 2007, Fields Institute, Toronto, Ontario, Canada : Canadian Mathematical Society Special Session Error Control Codes, Information Theory and Applied Cryptography, CMS Winter Meeting, December 8-10, 2007, London, Ontario, Canada","year":2010,"lang":"en","type":"book","venue":"American Mathematical Society eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Block code; Linear code; Cryptography; Computer science; Turbo code; Theoretical computer science; Low-density parity-check code; Error detection and correction; Concatenated error correction code; Hash function; Algorithm; Mathematics; Decoding methods; Computer security","score_opus":0.00628123852213238,"score_gpt":0.2032742254719883,"score_spread":0.19699298694985592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W360545484","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025446048,0.00031572397,0.43848908,0.00043755816,0.0017542223,0.005363318,0.0010164989,0.0005360831,0.5266415],"genre_scores_gemma":[0.8689424,0.00025299945,0.07383057,0.040190686,0.001665273,0.0019840393,0.0016256296,0.0004996655,0.011008749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99254775,0.00036513794,0.0021442305,0.0013409277,0.0017404492,0.0018615215],"domain_scores_gemma":[0.9909729,0.003956788,0.0016474365,0.0013477339,0.0005453529,0.0015298164],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts"],"category_scores_codex":[0.003154898,0.0018517076,0.0024293493,0.00043173082,0.0017234803,0.001234038,0.0013224672,0.0012065355,0.0017787229],"category_scores_gemma":[0.00030717702,0.0017057969,0.00072882994,0.00047097856,0.0027463236,0.0011721778,0.0004922668,0.0029141596,0.000014569949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011276162,0.00015742726,0.00062467856,0.0009114281,0.002192767,0.000016248225,0.026076715,0.000104488936,0.000018442426,0.80165243,0.14507332,0.022044431],"study_design_scores_gemma":[0.010180992,0.0011995326,0.0025239554,0.0023998802,0.0023836577,0.00028965538,0.018842831,0.0042654886,0.00010421756,0.55038667,0.39911646,0.00830664],"about_ca_topic_score_codex":0.9097887,"about_ca_topic_score_gemma":0.9976631,"teacher_disagreement_score":0.8434963,"about_ca_system_score_codex":0.0016481307,"about_ca_system_score_gemma":0.0077159153,"threshold_uncertainty_score":0.99996763},"labels":[],"label_agreement":null},{"id":"W36280574","doi":"","title":"Reciprocal Sums of lth Power of Generalized Binary Sequences with Indices.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reciprocal; Mathematics; Binary number; Arithmetic; Statistics; Linguistics","score_opus":0.01479477952527019,"score_gpt":0.22573780007210892,"score_spread":0.21094302054683872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36280574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965272,0.00027698273,0.0008806344,0.00007439804,0.00048025357,0.00010663375,0.0000018315477,0.00006781416,0.0015842465],"genre_scores_gemma":[0.9954977,0.00004782204,0.004352782,0.000053101227,0.0000028221266,0.00000716974,0.00000132853,0.0000075608973,0.000029695353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988004,0.00011426915,0.00026326638,0.00026778638,0.00034917542,0.00020509821],"domain_scores_gemma":[0.9989842,0.00009814578,0.00021495171,0.00050497055,0.00012377511,0.000073928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030560407,0.00013393142,0.0002712743,0.00017123079,0.000100388,0.000012194665,0.00077522954,0.00006276546,0.000020918189],"category_scores_gemma":[0.000017707,0.00010746421,0.000085056745,0.00088182674,0.0003262568,0.00029223642,0.00013648476,0.000111837864,0.0000036687911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008292517,0.00016383984,0.025603669,0.00001835292,0.00005009324,0.000040852115,0.0020422435,0.000014214162,0.00288127,0.96838033,0.00028965613,0.00043254736],"study_design_scores_gemma":[0.0036442971,0.0036706286,0.044837683,0.0002130317,0.000035772788,0.00014342423,0.0002022618,0.0005198871,0.088271216,0.85659194,0.0011794626,0.0006903815],"about_ca_topic_score_codex":0.00004521043,"about_ca_topic_score_gemma":0.0000017772087,"teacher_disagreement_score":0.111788385,"about_ca_system_score_codex":0.000012292129,"about_ca_system_score_gemma":0.0001230478,"threshold_uncertainty_score":0.43822634},"labels":[],"label_agreement":null},{"id":"W395247565","doi":"10.1007/s002000050126","title":"Optimal Formally Self-Dual Codes over 𝔽 5 and 𝔽 7","year":2000,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Minimum weight; Dual (grammatical number); Construct (python library); Dimension (graph theory); Minimum distance; Mathematics; Linear code; Code (set theory); Computer science; Discrete mathematics; Block code; Combinatorics; Algorithm; Decoding methods","score_opus":0.003958740976191346,"score_gpt":0.19714958100646507,"score_spread":0.19319084003027373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W395247565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8745496,0.00085555314,0.12291621,0.00012819945,0.000014736925,0.00012180325,3.7675807e-7,0.00034398885,0.001069524],"genre_scores_gemma":[0.9007605,0.00027758337,0.09879852,0.00012063465,0.000013048461,0.000011481172,0.0000020659486,0.0000083120585,0.000007853421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992291,0.000037785107,0.00020249921,0.00022227355,0.00008405195,0.00022429912],"domain_scores_gemma":[0.9992126,0.00020340053,0.00003389563,0.0004718766,0.000012993935,0.000065197375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041600273,0.0001277305,0.00014168806,0.00009666251,0.00016125372,0.00016659207,0.00042554198,0.000050209288,0.000009281415],"category_scores_gemma":[0.0000051017305,0.00014129268,0.000023272525,0.00033258653,0.000031311767,0.0002785826,0.00033141475,0.00020117179,0.0000032601515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014705636,0.00014131272,0.0031240867,0.000093854636,0.00004802688,0.0000045692773,0.0038404036,0.04015015,0.0008380562,0.6782209,0.000052243297,0.27347165],"study_design_scores_gemma":[0.00040940143,0.00003442767,0.009309385,0.000058920104,0.000004645405,0.00003414748,0.00003519461,0.98306984,0.00019657543,0.0022699332,0.0043406314,0.0002369066],"about_ca_topic_score_codex":0.000019041747,"about_ca_topic_score_gemma":0.000001690127,"teacher_disagreement_score":0.9429197,"about_ca_system_score_codex":0.0000123653135,"about_ca_system_score_gemma":0.0000076224933,"threshold_uncertainty_score":0.5761748},"labels":[],"label_agreement":null},{"id":"W401987441","doi":"10.1007/978-3-319-10683-0_7","title":"Generating Good Span n Sequences Using Orthogonal Functions in Nonlinear Feedback Shift Registers","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Span (engineering); Shift register; Linear span; Sequence (biology); Randomness; Nonlinear system; Golomb coding; Pseudorandom binary sequence; Mathematics; Binary number; Ideal (ethics); Algorithm; Combinatorics; Arithmetic; Computer science; Statistics; Artificial intelligence; Telecommunications; Physics","score_opus":0.035031963168030235,"score_gpt":0.24177506436023172,"score_spread":0.2067431011922015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W401987441","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026277886,0.00013555236,0.5722768,0.0003337893,0.0009011071,0.00019563448,0.000011531169,0.0002461962,0.42327163],"genre_scores_gemma":[0.14113855,0.000059568112,0.49325502,0.0033549077,0.0029619625,0.000028089824,0.00011588221,0.00020439626,0.35888162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798113,0.00006825944,0.00048584203,0.00076500035,0.00034515615,0.00035460186],"domain_scores_gemma":[0.99867266,0.00014124117,0.000260011,0.0007478549,0.000059071583,0.00011912927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005715451,0.00038404585,0.00038038392,0.00043056367,0.00025574298,0.000297325,0.00082692044,0.00025828124,0.00020486956],"category_scores_gemma":[0.000014655303,0.00036417186,0.00025795583,0.00017286364,0.00015334893,0.00025190916,0.0003019805,0.00047892632,0.00008174949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058983887,0.000011222555,0.00029181145,0.000022903221,0.000035016135,0.000022524853,0.0001275338,0.0015333596,0.00006750526,0.9902925,0.0000949288,0.007494791],"study_design_scores_gemma":[0.0013558037,0.0006077758,0.0003838771,0.0017625279,0.00017518921,0.00028329188,0.0001070313,0.39280865,0.00010168418,0.3823913,0.2159377,0.004085163],"about_ca_topic_score_codex":0.00005177541,"about_ca_topic_score_gemma":0.0004814579,"teacher_disagreement_score":0.6079012,"about_ca_system_score_codex":0.00006013141,"about_ca_system_score_gemma":0.00015649076,"threshold_uncertainty_score":0.999881},"labels":[],"label_agreement":null},{"id":"W4200452304","doi":"10.18280/isi.260609","title":"Towards the Construction of Reed-Muller Code Based Symmetric Key FHE","year":2021,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Homomorphic encryption; Computer science; Code word; Correctness; Cryptography; Theoretical computer science; Code (set theory); Encryption; Multiplication (music); Homomorphic secret sharing; Scheme (mathematics); Algorithm; Decoding methods; Mathematics; Secret sharing; Programming language; Computer security","score_opus":0.01749223748164754,"score_gpt":0.22048882900779732,"score_spread":0.20299659152614977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200452304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05875228,0.00017130247,0.9125488,0.00043570835,0.000664584,0.00015993816,0.000017244194,0.00016534548,0.027084844],"genre_scores_gemma":[0.97032857,0.000018394087,0.029235102,0.00033719948,0.00002801333,0.00001677423,0.000019642388,0.000003876271,0.000012411123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988195,0.00014200462,0.0004360863,0.00011540224,0.00031000358,0.00017706223],"domain_scores_gemma":[0.99860245,0.0001472997,0.00027765354,0.0004876993,0.0004421367,0.000042735785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006557909,0.00011319831,0.00014974462,0.0002906341,0.0002439962,0.00024355459,0.00044740931,0.00007076369,0.000036845337],"category_scores_gemma":[0.0003287552,0.000089075846,0.00011568884,0.0018527944,0.0001800658,0.0015700237,0.00011927796,0.00011406648,0.00002208078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019709696,0.000022374805,0.00066409213,0.00013610465,0.00003406784,0.0000017357503,0.0027819565,0.00046832493,0.00026726245,0.7091752,0.0002716134,0.28615755],"study_design_scores_gemma":[0.0029258444,0.0006175586,0.038983896,0.0008353161,0.00013939381,0.0005197323,0.005802535,0.31941357,0.12093313,0.4096616,0.098811336,0.0013560959],"about_ca_topic_score_codex":0.000016908125,"about_ca_topic_score_gemma":0.000003955312,"teacher_disagreement_score":0.91157633,"about_ca_system_score_codex":0.000060865004,"about_ca_system_score_gemma":0.00018022984,"threshold_uncertainty_score":0.36324078},"labels":[],"label_agreement":null},{"id":"W4206881602","doi":"","title":"Towa error-bounded algorithms for infinite-horizon DEC-POMDPs","year":2011,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bounded function; Computer science; Algorithm; Horizon; Mathematics; Mathematical analysis","score_opus":0.036099323379928154,"score_gpt":0.25397334438246466,"score_spread":0.2178740210025365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206881602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011382853,0.00072258257,0.9364996,0.0031953873,0.0009513303,0.00081435934,0.0000499848,0.0009692684,0.045414615],"genre_scores_gemma":[0.3088258,0.00033281517,0.68700224,0.00020522844,0.00008184454,0.00039503083,0.00025559196,0.000076676624,0.0028248075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99372673,0.0031615929,0.00068112137,0.0013492284,0.00046108323,0.0006202266],"domain_scores_gemma":[0.99107736,0.0018766978,0.00064152817,0.0040524253,0.0020625696,0.00028940185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0068265717,0.0005159776,0.0005210347,0.00042607813,0.0006237298,0.000937433,0.0045899707,0.00044806878,0.00007494759],"category_scores_gemma":[0.0008585423,0.00055928703,0.00054950034,0.0006821637,0.00024241113,0.00035340714,0.0031373461,0.00064926286,0.000043687745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015881498,0.0005055448,0.00013732906,0.00012992349,0.00011459547,0.0000034375253,0.008169363,0.000009608934,0.00022721346,0.8693958,0.0009492023,0.1203421],"study_design_scores_gemma":[0.0013738407,0.000007091542,0.0007399884,0.0016911534,0.00013308144,0.00002202396,0.00011021125,0.056810882,0.039690856,0.7932222,0.104519814,0.0016788895],"about_ca_topic_score_codex":0.00030581234,"about_ca_topic_score_gemma":0.00040867992,"teacher_disagreement_score":0.2974429,"about_ca_system_score_codex":0.0001038382,"about_ca_system_score_gemma":0.00041011168,"threshold_uncertainty_score":0.9996859},"labels":[],"label_agreement":null},{"id":"W4210440004","doi":"10.1109/apccas51387.2021.9687675","title":"Area-Efficient Finite Field Multiplication in $\\text{GF} (2^{n})$ Using Single-Electron Transistors","year":2021,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"GF(2); Finite field; Multiplication (music); Computer science; Transistor; Arithmetic; Physics; Mathematics; Discrete mathematics; Combinatorics; Voltage; Quantum mechanics","score_opus":0.028683540506581583,"score_gpt":0.24331429881239588,"score_spread":0.2146307583058143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210440004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31509927,0.00012028197,0.6812801,0.00062734843,0.00012644782,0.00006405433,3.3059771e-7,0.00010652325,0.0025757009],"genre_scores_gemma":[0.9843223,0.000005121209,0.015083345,0.00048203146,0.000018005123,0.0000059798544,0.0000018072541,0.000005501579,0.000075883625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894005,0.00008503679,0.00019934116,0.0003773457,0.00014656996,0.00025164484],"domain_scores_gemma":[0.99915695,0.00026163593,0.000040541,0.0004317915,0.000056935576,0.000052119674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020867253,0.000109323504,0.000118768716,0.00016464075,0.000089134955,0.000087293214,0.00030186833,0.000061855426,0.000056546374],"category_scores_gemma":[0.00006385212,0.00011112132,0.00009155643,0.0009597469,0.000018632667,0.00013252597,0.000062818974,0.00012702953,0.000006783519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009725715,0.001982179,0.004021234,0.000063785104,0.000053046886,0.00011354561,0.00675914,0.05725703,0.3540458,0.38088995,0.0002977482,0.19441928],"study_design_scores_gemma":[0.0007309395,0.00018782004,0.0019530391,0.00008763624,0.000014073969,0.000029853138,0.00014334026,0.6809738,0.30243582,0.009044819,0.0038838428,0.000514974],"about_ca_topic_score_codex":0.00003040046,"about_ca_topic_score_gemma":0.00010475957,"teacher_disagreement_score":0.66922307,"about_ca_system_score_codex":0.000055620912,"about_ca_system_score_gemma":0.000055962282,"threshold_uncertainty_score":0.4531396},"labels":[],"label_agreement":null},{"id":"W4210620791","doi":"10.1016/j.ffa.2022.102002","title":"The additive index of polynomials over finite fields","year":2022,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Multiplicative function; Permutation (music); Combinatorics; Polynomial; Degree (music); Character (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.009206383225221415,"score_gpt":0.22017459575699758,"score_spread":0.21096821253177617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210620791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075444356,0.0005176003,0.9798112,0.002251866,0.00014727701,0.00035157375,0.0001797192,0.00007108979,0.00912526],"genre_scores_gemma":[0.99842864,0.000084459505,0.00021174937,0.00060359214,0.00004932887,0.00036893916,0.000008884232,0.0000042081647,0.00024018076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993324,0.00007551992,0.00016922153,0.0001933042,0.00009221458,0.00013731672],"domain_scores_gemma":[0.997939,0.0013983566,0.000099233366,0.00049370097,0.00003117406,0.000038542654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026871334,0.000085499865,0.00010111725,0.00006414318,0.00069966406,0.0000548189,0.0005949294,0.00004349292,0.00011158326],"category_scores_gemma":[0.000020643847,0.00006301792,0.000079172794,0.000390335,0.00007814497,0.00006725125,0.00040265702,0.00021069746,0.0000026515036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002013043,0.000069188485,0.00027889418,0.000005213233,0.000043835935,4.105223e-7,0.0018460115,0.00019699706,0.00004945916,0.8632082,0.002097539,0.13218413],"study_design_scores_gemma":[0.00031157685,0.00021204002,0.0023191248,0.0000074433374,0.000009949694,0.000004977623,0.0005821257,0.011454242,0.0005718179,0.43719915,0.5471068,0.00022073656],"about_ca_topic_score_codex":0.000020996544,"about_ca_topic_score_gemma":0.0000131725155,"teacher_disagreement_score":0.99088424,"about_ca_system_score_codex":0.0000048312486,"about_ca_system_score_gemma":0.000028374776,"threshold_uncertainty_score":0.53813213},"labels":[],"label_agreement":null},{"id":"W4213257702","doi":"10.1016/j.disc.2006.05.004","title":"Classification of extremal double circulant self-dual codes of lengths 74–88","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Mathematics; Dual (grammatical number); Combinatorics; Discrete mathematics","score_opus":0.022833401465611032,"score_gpt":0.250057329470382,"score_spread":0.22722392800477098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213257702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55052406,0.00008764342,0.4338619,0.000110585504,0.00009696858,0.00020500834,0.000013811791,0.00016490628,0.014935125],"genre_scores_gemma":[0.9408713,0.0000070697506,0.059024304,0.000006152381,0.000026989539,0.000008020988,0.000006633576,0.0000087907465,0.000040762097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998852,0.000040558345,0.00044414162,0.00019279475,0.0003024456,0.00016803606],"domain_scores_gemma":[0.9988302,0.0001404448,0.00031365274,0.000596131,0.00008700174,0.00003259448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004209611,0.00012552975,0.00024998322,0.00011578759,0.00005572469,0.00003874812,0.00046447245,0.00005683483,0.00001248833],"category_scores_gemma":[0.000012375717,0.00010802969,0.00013348872,0.00031848182,0.00009002016,0.00016670657,0.00010031836,0.00006540244,0.0000069540324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068133218,0.00022042784,0.00053432764,0.00019962336,0.000025896983,0.0000014584439,0.0012341046,0.000034211214,0.013165625,0.9841105,0.00010266642,0.0003643474],"study_design_scores_gemma":[0.0017733104,0.00030358485,0.011543563,0.00039868834,0.00017617579,0.00005738462,0.0012164565,0.17821565,0.0909585,0.7135836,0.0010094512,0.00076364994],"about_ca_topic_score_codex":0.000014098634,"about_ca_topic_score_gemma":0.000005150775,"teacher_disagreement_score":0.39034724,"about_ca_system_score_codex":0.000011483529,"about_ca_system_score_gemma":0.000030217112,"threshold_uncertainty_score":0.4405323},"labels":[],"label_agreement":null},{"id":"W4214518471","doi":"10.1109/access.2022.3155457","title":"CRC-Based Correction of Multiple Errors Using an Optimized Lookup Table","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Université Polytechnique Hauts-de-France","keywords":"Notation; Lookup table; Speedup; Table (database); Error detection and correction; Arithmetic; Computer science; Mathematics; Algorithm; Discrete mathematics; Parallel computing","score_opus":0.05214330034223808,"score_gpt":0.30089516029245744,"score_spread":0.24875185995021937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214518471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4936682,0.000014909687,0.50433815,0.00001589467,0.001588229,0.00009166153,0.000003854322,0.00009656161,0.00018253496],"genre_scores_gemma":[0.98867655,5.469081e-7,0.011068608,0.00016170747,0.000031762087,0.000022292987,0.000003199574,0.000008996882,0.000026357544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989051,0.00020346457,0.00018111386,0.0002845427,0.00024118983,0.0001845814],"domain_scores_gemma":[0.99914134,0.000118734904,0.00015010904,0.00047358894,0.00006199414,0.000054255743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044317404,0.00009519062,0.00014682006,0.00021454725,0.0003524159,0.000110288216,0.0011642217,0.00002447329,0.0001024454],"category_scores_gemma":[0.000021169153,0.00010331722,0.00007514779,0.0009745508,0.000039620027,0.00076564256,0.00020165558,0.00013096897,9.3860405e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001358497,0.00030097924,0.0027630925,0.000011950699,0.0000146357215,0.0000066268335,0.0003287428,0.97811943,0.012213566,0.00046776218,0.0002806676,0.005356687],"study_design_scores_gemma":[0.0006726722,0.00011735688,0.00021796182,0.000009231192,0.000010192999,0.0000048022375,0.000056519624,0.94970185,0.0477125,0.00089569564,0.00045385608,0.00014736786],"about_ca_topic_score_codex":0.00030772292,"about_ca_topic_score_gemma":0.000015840214,"teacher_disagreement_score":0.49500832,"about_ca_system_score_codex":0.000036428683,"about_ca_system_score_gemma":0.000080736936,"threshold_uncertainty_score":0.4213154},"labels":[],"label_agreement":null},{"id":"W4220728365","doi":"10.3390/math10050815","title":"Low-Space Bit-Parallel Systolic Structure for AOP-Based Multiplier Suitable for Resource-Constrained IoT Edge Devices","year":2022,"lang":"en","type":"article","venue":"Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Prince Sattam bin Abdulaziz University","keywords":"Computer science; Multiplier (economics); Application-specific integrated circuit; Field-programmable gate array; Cryptography; Parallel computing; Algorithm; Computer hardware","score_opus":0.016603813245955695,"score_gpt":0.23913817828294473,"score_spread":0.22253436503698903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220728365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053386655,0.000090773494,0.9433963,0.0007411706,0.00025810653,0.0012520637,0.00018508769,0.00027936423,0.0004105055],"genre_scores_gemma":[0.5058144,3.3539936e-7,0.49244547,0.00061993056,0.000089878355,0.0004966763,0.0000284741,0.000040337232,0.000464554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845904,0.00007149679,0.00032491182,0.00039810885,0.00027966255,0.00046679084],"domain_scores_gemma":[0.99785393,0.0010328612,0.00022200761,0.00071361195,0.000081600265,0.00009600072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007115376,0.0002326669,0.00032555062,0.00019608761,0.00069588993,0.00016886713,0.0011370261,0.000072650495,0.000055381006],"category_scores_gemma":[0.00012945404,0.00021833567,0.00023473795,0.00046637788,0.00006498232,0.00008142451,0.0002344059,0.00016099557,0.0000033859953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001235414,0.0005179478,0.00007629362,0.0018746661,0.00012877467,0.0000056751446,0.0066206744,0.015106031,0.0037936294,0.95948637,0.008603768,0.0036626349],"study_design_scores_gemma":[0.0028107727,0.00048005825,0.00002676639,0.00013104705,0.00008718056,0.00003396598,0.0014212391,0.72088194,0.0047690505,0.19069323,0.0779114,0.000753345],"about_ca_topic_score_codex":0.0000019217493,"about_ca_topic_score_gemma":0.000008794602,"teacher_disagreement_score":0.7687931,"about_ca_system_score_codex":0.000050966653,"about_ca_system_score_gemma":0.00009639568,"threshold_uncertainty_score":0.890347},"labels":[],"label_agreement":null},{"id":"W4221049443","doi":"10.3390/cryptography6010006","title":"Post-Quantum Two-Party Adaptor Signature Based on Coding Theory","year":2022,"lang":"en","type":"article","venue":"Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Impact Fund; Silicon Valley Community Foundation","keywords":"Computer science; Cryptography; Hash function; Ring signature; Digital signature; Theoretical computer science; Computer security","score_opus":0.00996884791988141,"score_gpt":0.2234456738021167,"score_spread":0.21347682588223527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221049443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0935259,0.00093824026,0.8720566,0.0029027914,0.0039897915,0.0009818228,0.00023855794,0.00238465,0.022981662],"genre_scores_gemma":[0.9875868,0.0000042791144,0.0061715827,0.0058972393,0.00011688892,0.00013950156,0.000024154207,0.000034495442,0.000025077821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665695,0.0008153171,0.00030660562,0.000834957,0.0007586202,0.000627531],"domain_scores_gemma":[0.9975502,0.0006921462,0.00016918557,0.0012707023,0.000103310405,0.00021448078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014846115,0.00036074335,0.00029007325,0.0010217093,0.0012618197,0.00021694327,0.0019877213,0.00007486314,0.00046468744],"category_scores_gemma":[0.00005857748,0.0003490931,0.0005965261,0.0025196085,0.00016484974,0.00029721286,0.00046733746,0.0008201335,0.000025867035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030261654,0.00028451523,0.0003514351,0.0000124352955,0.000045817174,0.00004285784,0.00037149302,0.0010781119,0.0039875293,0.98503447,0.0019018248,0.006586876],"study_design_scores_gemma":[0.0034469524,0.004040091,0.0022321872,0.00009828984,0.00009471527,0.000043128544,0.00089048245,0.06863331,0.0056835604,0.81975514,0.0930132,0.0020689492],"about_ca_topic_score_codex":0.0000040542545,"about_ca_topic_score_gemma":9.993718e-7,"teacher_disagreement_score":0.8940609,"about_ca_system_score_codex":0.00003957701,"about_ca_system_score_gemma":0.00009104584,"threshold_uncertainty_score":0.9998961},"labels":[],"label_agreement":null},{"id":"W4226120589","doi":"10.22215/etd/2022-14866","title":"Cycle Lengths of Finite Cyclotomic Mappings","year":2022,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Integer (computer science); Function (biology); Cyclotomic polynomial; Index (typography); Combinatorics; Discrete mathematics; Pure mathematics; Polynomial; Mathematical analysis; Computer science","score_opus":0.005963649993695944,"score_gpt":0.23444191173008405,"score_spread":0.2284782617363881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226120589","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31431502,0.0009810993,0.052048143,0.00029686565,0.0047611776,0.0006858637,0.000034510336,0.0010078385,0.6258695],"genre_scores_gemma":[0.9698432,0.0001268831,0.0075871972,0.00039785606,0.00006984235,0.00009741508,0.00023823965,0.000040224306,0.021599125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884164,0.00006661232,0.00027395485,0.0003620428,0.00027983135,0.00017589235],"domain_scores_gemma":[0.99894387,0.0001801782,0.00020886282,0.00057727745,0.000048660975,0.00004117097],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002579726,0.00016857499,0.00023563679,0.00033207465,0.00011927428,0.000046886904,0.0012235198,0.00009032596,0.0010583113],"category_scores_gemma":[0.000028142838,0.00017361202,0.00021926279,0.0005536237,0.000017932593,0.0001468773,0.00014396966,0.000244908,0.000028666653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005126712,0.00012255329,0.00005604377,0.00018420248,0.00009062694,0.000010299497,0.0041229697,0.0001359278,0.0015161077,0.9474323,0.00258498,0.043692753],"study_design_scores_gemma":[0.0013838067,0.00081031624,0.0057891603,0.00029901924,0.0001465275,0.000018377661,0.003339739,0.015383991,0.021593194,0.6392094,0.30948836,0.0025381],"about_ca_topic_score_codex":0.000042856278,"about_ca_topic_score_gemma":0.0000204874,"teacher_disagreement_score":0.6555282,"about_ca_system_score_codex":0.000016183167,"about_ca_system_score_gemma":0.00007231753,"threshold_uncertainty_score":0.99985486},"labels":[],"label_agreement":null},{"id":"W4226147448","doi":"10.1017/fms.2022.71","title":"An improvement on Schmidt’s bound on the number of number fields of bounded discriminant and small degree","year":2022,"lang":"en","type":"article","venue":"Forum of Mathematics Sigma","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Discriminant; Mathematics; Degree (music); Bounded function; Monic polynomial; Integer (computer science); Combinatorics; Linear discriminant analysis; Upper and lower bounds; Algebraic number field; Square (algebra); Discrete mathematics; Polynomial; Statistics; Artificial intelligence; Mathematical analysis; Computer science; Geometry","score_opus":0.0341852324190214,"score_gpt":0.26253189520007775,"score_spread":0.22834666278105636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226147448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96797925,0.000011903397,0.025308084,0.0006208109,0.000113262715,0.00023010325,0.000010860129,0.000018302066,0.0057073934],"genre_scores_gemma":[0.99193233,0.0000036895938,0.007764934,0.00015722295,0.0000069868634,0.000026885771,0.000001075647,0.000008835613,0.00009800844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988427,0.00007704806,0.00034573453,0.00019523117,0.00035455622,0.00018472459],"domain_scores_gemma":[0.9984783,0.00036255835,0.0002887208,0.0007876137,0.000043366996,0.000039423856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000705168,0.00012697285,0.00023112756,0.00005294113,0.00017795988,0.000033040265,0.00074902625,0.000033148925,0.00015148467],"category_scores_gemma":[0.00003725963,0.00008890597,0.00010781394,0.00018147718,0.00012383457,0.00006760415,0.0003541264,0.00013998774,0.0000022630431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003516002,0.0006857963,0.00052474317,0.00012158344,0.00003668921,0.0000013505874,0.0029232139,0.00002161395,0.0016233746,0.9889731,0.00020283055,0.0048505673],"study_design_scores_gemma":[0.0004858994,0.0016773897,0.00057271693,0.00013317331,0.000035843677,0.000012857438,0.0028915002,0.0068189823,0.037333123,0.9495281,0.0002998905,0.00021053829],"about_ca_topic_score_codex":0.000027125887,"about_ca_topic_score_gemma":0.000012410616,"teacher_disagreement_score":0.03944499,"about_ca_system_score_codex":0.00001279156,"about_ca_system_score_gemma":0.000030759937,"threshold_uncertainty_score":0.36254802},"labels":[],"label_agreement":null},{"id":"W4229985284","doi":"10.22215/etd/2013-10033","title":"Interleaved Sequences Over Finite Fields","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polyphase system; Complementary sequences; Mathematics; Autocorrelation; Sequence (biology); Power of two; Pseudorandom number generator; Measure (data warehouse); Integer (computer science); Combinatorics; Linear span; Correlation; Algorithm; Discrete mathematics; Computer science; Statistics","score_opus":0.0120006681858887,"score_gpt":0.2503784513973232,"score_spread":0.2383777832114345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229985284","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0822136,0.00123239,0.4498605,0.0010194324,0.007914376,0.00067254785,0.0000057817597,0.0013526658,0.4557287],"genre_scores_gemma":[0.87580985,0.00011978467,0.011491105,0.002283578,0.00017964432,0.000079845966,0.00013364041,0.000024159988,0.10987841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990057,0.000054036518,0.00021072006,0.000352051,0.00017872239,0.00019880135],"domain_scores_gemma":[0.99916834,0.00011744465,0.0001296175,0.00046768365,0.000053287888,0.00006360664],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013546243,0.00018500407,0.00019319495,0.00018020612,0.0000884987,0.00030262268,0.0010270482,0.00016357144,0.0010703936],"category_scores_gemma":[0.000021113256,0.0001530003,0.0001602932,0.0002556501,0.000016732185,0.0003228912,0.00006389117,0.00022708334,0.00022171912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011713864,0.00004630674,0.00006290879,0.00009278685,0.00008912627,0.000007798173,0.005086196,0.000009127178,0.0001791058,0.75138235,0.029818136,0.21321446],"study_design_scores_gemma":[0.0007819378,0.0010559404,0.0065896558,0.0011485037,0.00005001178,0.0000122072615,0.002205927,0.019655403,0.010295466,0.86301434,0.09227004,0.002920587],"about_ca_topic_score_codex":0.00010397845,"about_ca_topic_score_gemma":0.00016628634,"teacher_disagreement_score":0.7935962,"about_ca_system_score_codex":0.000010739579,"about_ca_system_score_gemma":0.00006262174,"threshold_uncertainty_score":0.99984276},"labels":[],"label_agreement":null},{"id":"W4230296085","doi":"10.22215/etd/2018-12849","title":"Fixed Points of Rational Functions Satisfying the Carlitz Property","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Fixed point; Mathematics; Property (philosophy); Rational function; Field (mathematics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.01738869069007446,"score_gpt":0.24324929686779453,"score_spread":0.22586060617772008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230296085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09486975,0.00040714256,0.45296672,0.0019497043,0.0075915665,0.001324141,0.00003630865,0.00055798166,0.44029668],"genre_scores_gemma":[0.88122445,0.000022773427,0.030033357,0.0005202879,0.00050653925,0.00015904578,0.00033930797,0.000035132372,0.08715913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989708,0.0000939053,0.00024541994,0.0002729021,0.00028738484,0.0001296013],"domain_scores_gemma":[0.99891084,0.00011389408,0.00015857077,0.00052265864,0.00026386732,0.000030157335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036633658,0.00013863017,0.00014114197,0.00011651641,0.00028942924,0.00009542767,0.00069088227,0.00009215873,0.0003411981],"category_scores_gemma":[0.000055264132,0.00007213317,0.00014092619,0.00039363076,0.000057835845,0.00019114469,0.00005707641,0.0001438978,0.000054727978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008819464,0.00011453916,0.00048084473,0.00012559068,0.00021624738,0.0000013320808,0.0064113922,0.000008365407,0.0024073587,0.8588445,0.03875998,0.092541665],"study_design_scores_gemma":[0.0025243987,0.0018303996,0.096699454,0.0015583981,0.0005967525,0.00006769381,0.0102021815,0.018580308,0.056611393,0.49003285,0.3175458,0.003750372],"about_ca_topic_score_codex":0.000048288948,"about_ca_topic_score_gemma":0.00025431465,"teacher_disagreement_score":0.78635466,"about_ca_system_score_codex":0.000011430049,"about_ca_system_score_gemma":0.00013993525,"threshold_uncertainty_score":0.37358797},"labels":[],"label_agreement":null},{"id":"W4232343029","doi":"10.22215/etd/2010-09044","title":"On the existence of irreducible polynomials with prescribed coeffecients over finite fields","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; University of Ottawa; Library and Archives Canada","funders":"","keywords":"Finite field; Mathematics; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.01268840810658657,"score_gpt":0.24291704436477973,"score_spread":0.23022863625819318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232343029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83355874,0.000080878504,0.019016808,0.00026258733,0.0020347056,0.0007300059,0.000014361922,0.00014478275,0.14415714],"genre_scores_gemma":[0.9900436,0.000007096313,0.0014589067,0.00034611038,0.0000385426,0.000045306024,0.000020738644,0.000012935576,0.008026755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99866956,0.00008875595,0.00022611844,0.0004224432,0.00038675754,0.00020637497],"domain_scores_gemma":[0.9976797,0.00083153497,0.00023386626,0.0010993688,0.000103212195,0.00005230268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038752405,0.00021875254,0.00023734457,0.00015842443,0.0001318966,0.00012763546,0.0014051226,0.00020300747,0.00027951668],"category_scores_gemma":[0.00011045999,0.00012594183,0.00013300106,0.0004128997,0.00006886023,0.00014035725,0.00006498024,0.00040687216,0.00001720232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041719025,0.00022809232,0.0001055041,0.00010705048,0.00010135624,0.000005037043,0.0032567754,0.000045234974,0.0028955091,0.9781295,0.0052119615,0.009496795],"study_design_scores_gemma":[0.0039871153,0.0064577633,0.03824118,0.0040137884,0.00038910547,0.000017557875,0.0012962503,0.008412578,0.5152417,0.39937904,0.018417373,0.0041465727],"about_ca_topic_score_codex":0.000055173645,"about_ca_topic_score_gemma":0.00013506369,"teacher_disagreement_score":0.57875043,"about_ca_system_score_codex":0.000005444302,"about_ca_system_score_gemma":0.00008670787,"threshold_uncertainty_score":0.5135759},"labels":[],"label_agreement":null},{"id":"W4232626058","doi":"10.4213/im8739","title":"Asymptotic bounds for spherical codes","year":2019,"lang":"en","type":"article","venue":"Известия Российской академии наук Серия математическая","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hamming code; Mathematics; Cardinality (data modeling); Code (set theory); Hamming distance; Alphabet; Discrete mathematics; Linear code; Unit square; Computability; Set (abstract data type); Combinatorics; Constant-weight code; Block code; Algorithm; Computer science; Decoding methods","score_opus":0.008963900251776027,"score_gpt":0.22889879917547643,"score_spread":0.21993489892370038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232626058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18513793,0.0010500136,0.7550517,0.0031201309,0.004683876,0.0021740037,0.00005529435,0.002131656,0.046595432],"genre_scores_gemma":[0.94473106,0.000035670968,0.049106844,0.0019551222,0.00045015337,0.00020487305,0.000030159443,0.00009190751,0.0033941881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955935,0.00020184422,0.0007184757,0.0014113993,0.00073716225,0.0013376182],"domain_scores_gemma":[0.9962015,0.0007419797,0.00029509977,0.0020693284,0.00026834127,0.00042374892],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001052163,0.00063966,0.0007710483,0.0003285442,0.00045325074,0.0006641287,0.0026669777,0.00031679732,0.00049576646],"category_scores_gemma":[0.00016721283,0.0006151616,0.0006541341,0.001339479,0.00022339323,0.0010314775,0.0005948539,0.0004604255,0.0011161687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025525724,0.00062773406,0.007900324,0.00024644495,0.00027258438,0.000027635053,0.0010518205,0.00039736563,0.007017748,0.89678115,0.010187666,0.07523428],"study_design_scores_gemma":[0.008347302,0.003986427,0.021073475,0.00052047265,0.00024232636,0.00024886377,0.00063853426,0.05406094,0.013131255,0.4163115,0.47664076,0.004798131],"about_ca_topic_score_codex":0.000023188179,"about_ca_topic_score_gemma":0.00002199017,"teacher_disagreement_score":0.7595931,"about_ca_system_score_codex":0.0001307865,"about_ca_system_score_gemma":0.00026334697,"threshold_uncertainty_score":0.99966156},"labels":[],"label_agreement":null},{"id":"W4233307210","doi":"10.1109/tc.2007.70834","title":"A New Finite-Field Multiplier Using Redundant Representation","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Finite field; Critical path method; Mathematics; Algorithm; Representation (politics); Computer science; Arithmetic; Discrete mathematics","score_opus":0.046651435540987045,"score_gpt":0.2699889923095845,"score_spread":0.22333755676859746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233307210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021712424,0.000011609452,0.9756148,0.00031920706,0.0016982646,0.00012751913,0.0000012706064,0.00029518185,0.00021972941],"genre_scores_gemma":[0.7987221,0.000012451541,0.20052513,0.0005277906,0.00006860865,0.00000466182,3.6234115e-7,0.0000100156,0.00012887926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883443,0.00007957441,0.0002123906,0.0004064966,0.00023326276,0.00023385027],"domain_scores_gemma":[0.99882495,0.00039319176,0.00006127045,0.00054113654,0.000038723647,0.00014073245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008797154,0.00015594796,0.00014476807,0.00028928957,0.00041707975,0.000080037324,0.00047170313,0.00006495149,0.00003182584],"category_scores_gemma":[0.0000042921674,0.00016359567,0.0001867576,0.0007032148,0.000038988655,0.0003968271,0.0000048664347,0.0002096017,0.00003681308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016251317,0.00032740642,0.00007832022,0.000010760754,0.00014191188,0.00016802677,0.005209444,0.5221926,0.0038909144,0.0033389141,0.00276283,0.46171638],"study_design_scores_gemma":[0.001342949,0.0004340003,0.00019497368,0.00009699088,0.000030151412,0.00031476573,0.000042207837,0.9259354,0.067197695,0.0025818737,0.0012691496,0.0005598737],"about_ca_topic_score_codex":0.00010681096,"about_ca_topic_score_gemma":0.000005932866,"teacher_disagreement_score":0.77700967,"about_ca_system_score_codex":0.0000371767,"about_ca_system_score_gemma":0.000076619195,"threshold_uncertainty_score":0.6671238},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01607861547041342,"score_gpt":0.2638310748973232,"score_spread":0.2477524594269098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234843542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004296637,0.00025893957,0.9920653,0.0002948724,0.000081355356,0.00025041497,0.00004383114,0.00014075538,0.0025678943],"genre_scores_gemma":[0.8933409,0.0001551946,0.106290184,0.000026427686,0.000008076791,0.00011361372,0.00000616139,0.000009838714,0.00004963948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987471,0.00013421485,0.00051360304,0.00022914616,0.00021803445,0.0001579176],"domain_scores_gemma":[0.99588066,0.0010402238,0.00022057527,0.00262623,0.00018544636,0.000046883484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000359294,0.00012528726,0.0002109625,0.00041652282,0.00041970258,0.000032650827,0.0020113532,0.00007832492,0.000023778786],"category_scores_gemma":[0.000006815861,0.00013787189,0.00020278407,0.0012640242,0.00027495288,0.00025262946,0.000020915157,0.00021538786,0.000015580837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003105634,0.0014785419,0.00011884038,0.000031554213,0.00006479216,2.4018792e-7,0.00049065566,0.0034366501,0.015460976,0.5329793,0.00014579554,0.44576162],"study_design_scores_gemma":[0.0017135924,0.00062359823,0.0019003282,0.00044678035,0.0002340562,0.000035056542,0.00033451285,0.07266575,0.20720877,0.7018544,0.011996157,0.0009869926],"about_ca_topic_score_codex":0.00013465506,"about_ca_topic_score_gemma":0.00028449262,"teacher_disagreement_score":0.8890442,"about_ca_system_score_codex":0.000025825604,"about_ca_system_score_gemma":0.000049730384,"threshold_uncertainty_score":0.5622252},"labels":[],"label_agreement":null},{"id":"W4236247724","doi":"10.22215/etd/2007-07938","title":"Langford sequences and their variants: partitions of {1, . . . , 2m + 2} \\ {k, 2m + 1}, {1, . . . , 2m—1, L} and {1, . . . , 2m, L} \\ {2} into differences in {d, . . . , d + m —1}","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.015555556260213148,"score_gpt":0.26174232423337923,"score_spread":0.24618676797316608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236247724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9579671,0.0042010183,0.016586939,0.0003967865,0.0009100714,0.000637098,0.00004995541,0.00027814662,0.01897291],"genre_scores_gemma":[0.991223,0.0015449004,0.005918357,0.00016531184,0.00007526877,0.0000639053,0.00011218108,0.000027835635,0.0008692564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970598,0.00021564992,0.00082082365,0.0009699535,0.00038405837,0.0005496751],"domain_scores_gemma":[0.99793154,0.0006169235,0.0003983795,0.0006715287,0.00016985447,0.00021175144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009864139,0.000579816,0.0008161801,0.00084019196,0.0002692404,0.00029003934,0.0010177747,0.00044565002,0.00009887285],"category_scores_gemma":[0.00010362182,0.00046171824,0.00016186162,0.0011514714,0.00032206078,0.0007098414,0.00022331411,0.00048104976,0.000006700117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026534896,0.0005871278,0.028699974,0.0010769339,0.00035794947,0.0000581721,0.029642459,0.0000068588,0.0051084775,0.8000687,0.0007152646,0.13341276],"study_design_scores_gemma":[0.0019973756,0.0010744443,0.19893596,0.0021316062,0.00014997191,0.00008357977,0.01702197,0.0026484374,0.008891754,0.7612564,0.003104701,0.002703809],"about_ca_topic_score_codex":0.0006815168,"about_ca_topic_score_gemma":0.0052968985,"teacher_disagreement_score":0.17023599,"about_ca_system_score_codex":0.000032547265,"about_ca_system_score_gemma":0.00015772782,"threshold_uncertainty_score":0.99978346},"labels":[],"label_agreement":null},{"id":"W4236751895","doi":"10.22215/etd/2013-08571","title":"On difference maps and their cryptographic applications","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Cryptography; Humanities; Art; Computer security","score_opus":0.007838704822617884,"score_gpt":0.21598707970696537,"score_spread":0.20814837488434748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236751895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11465112,0.0012709146,0.7346386,0.00028649933,0.00077864574,0.0015220608,0.000020524718,0.0010902182,0.14574145],"genre_scores_gemma":[0.9779726,0.0004498593,0.00858808,0.0007446177,0.0001134803,0.0012362156,0.00023323655,0.00004456617,0.0106173465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989066,0.00004572846,0.00017224424,0.0005396967,0.00013417091,0.00020152862],"domain_scores_gemma":[0.99880666,0.00020761267,0.000101821475,0.0007130588,0.00007028476,0.00010056706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009362439,0.00027176447,0.00020437776,0.0003403737,0.00020895412,0.00027332775,0.0008173295,0.0001671659,0.00006185335],"category_scores_gemma":[0.000007169021,0.00020008799,0.000112206646,0.00047050847,0.000043309,0.000110900524,0.00006069152,0.000252506,0.000075641816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039249912,0.00003939669,0.000018468669,0.000029254537,0.000018437191,1.793888e-7,0.00029392904,2.2168304e-7,0.00035695313,0.89970785,0.0003578019,0.09917359],"study_design_scores_gemma":[0.00011267694,0.00010408294,0.0050068577,0.00007246258,0.000009180314,0.000002241773,0.00017338703,0.00040105783,0.0006944718,0.98908925,0.0039448007,0.00038955957],"about_ca_topic_score_codex":0.000011743324,"about_ca_topic_score_gemma":0.000023449931,"teacher_disagreement_score":0.8633215,"about_ca_system_score_codex":0.0000052537907,"about_ca_system_score_gemma":0.000023300798,"threshold_uncertainty_score":0.81593513},"labels":[],"label_agreement":null},{"id":"W4237806138","doi":"10.1360/zf2010-40-9-1240","title":"低复杂度准循环低密度奇偶校验码的逐块构造法","year":2010,"lang":"ja","type":"article","venue":"Scientia Sinica Informationis","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science","score_opus":0.009124254520266814,"score_gpt":0.2385197187964452,"score_spread":0.2293954642761784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237806138","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42039853,0.00024168091,0.087589845,0.009802643,0.042575266,0.0011598424,0.000111126064,0.0013434805,0.4367776],"genre_scores_gemma":[0.9790804,0.000018506735,0.017964736,0.0012898899,0.0003005464,0.000015159278,0.000020396563,0.000013816284,0.0012965587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99680656,0.00009230692,0.0009139677,0.0005295167,0.0008889677,0.0007686811],"domain_scores_gemma":[0.99665797,0.00019630964,0.0004661209,0.0018723084,0.00040489723,0.00040240886],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0025046312,0.0003258971,0.0002798139,0.00056439394,0.0015830839,0.0031740554,0.0027789385,0.0002626569,0.0017238157],"category_scores_gemma":[0.0003368453,0.0003238001,0.0003643495,0.0024926092,0.0008187508,0.004270582,0.00082130753,0.00084014895,0.004384018],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002187277,0.00022247164,0.0005876327,0.00007165737,0.00006718697,0.000004963645,0.00906542,0.00004953219,0.0022256477,0.83793896,0.022742024,0.1270026],"study_design_scores_gemma":[0.0010853143,0.00025663173,0.0068041044,0.000086980865,0.00006440766,0.000088442874,0.00035873262,0.046049487,0.003901019,0.023299929,0.91699344,0.00101152],"about_ca_topic_score_codex":0.000016376498,"about_ca_topic_score_gemma":0.000037913927,"teacher_disagreement_score":0.8942514,"about_ca_system_score_codex":0.000022621529,"about_ca_system_score_gemma":0.00035035398,"threshold_uncertainty_score":0.9999214},"labels":[],"label_agreement":null},{"id":"W4238079082","doi":"10.1017/cbo9781139195768.006","title":"Deciphering delay","year":2009,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Literal (mathematical logic); Prefix; Computer science; Arithmetic; Mathematics; Algorithm; Linguistics","score_opus":0.0179503510271684,"score_gpt":0.18597688397889078,"score_spread":0.16802653295172237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238079082","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003401993,0.00013960116,0.069859326,0.000014631103,0.00023617207,0.00015399847,0.000014562349,0.00041388534,0.92913383],"genre_scores_gemma":[0.0009832003,0.00005252171,0.0025362112,0.00013543695,0.000092270006,2.2926184e-7,0.0000047921762,0.000021026794,0.99617434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866503,0.000035171724,0.00014927161,0.0006002537,0.00024746795,0.00030278554],"domain_scores_gemma":[0.99854404,0.00006548553,0.00015304149,0.0009654212,0.000091546135,0.0001804806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012675239,0.00033900078,0.0003026657,0.0002189646,0.00023851247,0.00011791324,0.0016847345,0.00027044816,0.000003017999],"category_scores_gemma":[0.0000036336353,0.00041501984,0.00030867138,0.000017422699,0.00011684215,0.00018956156,0.0006353039,0.0004136692,0.000020827914],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019335534,0.000005366587,3.026761e-7,0.000012093719,0.0000547529,0.0004060935,0.000035261546,0.000004344092,0.00001783657,0.9449488,0.0044532446,0.050042566],"study_design_scores_gemma":[0.00024914314,0.00006971321,0.0000069345697,0.00011563604,0.000056848185,0.000035844052,0.0000030499407,0.00021515012,0.00013230082,0.00073414174,0.9979044,0.0004768141],"about_ca_topic_score_codex":0.000011397504,"about_ca_topic_score_gemma":6.888383e-7,"teacher_disagreement_score":0.9934512,"about_ca_system_score_codex":0.000089392546,"about_ca_system_score_gemma":0.0000641754,"threshold_uncertainty_score":0.9998302},"labels":[],"label_agreement":null},{"id":"W4239741176","doi":"10.1007/3-540-44977-9_8","title":"Prime Decompositions of Regular Prefix Codes","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Prefix; Prefix code; Prime (order theory); Computer science; Automaton; Decomposition; Code (set theory); Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Linear code; Combinatorics; Programming language; Block code; Decoding methods","score_opus":0.011576820774909497,"score_gpt":0.2315566761640496,"score_spread":0.2199798553891401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239741176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017015351,0.000604141,0.9915009,0.0003423682,0.00087303703,0.00026763172,0.000007447263,0.00012351458,0.0061108177],"genre_scores_gemma":[0.15420902,0.000055763023,0.8442361,0.0010809085,0.00016077119,0.000010171135,0.000005471417,0.000035236728,0.00020654958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707544,0.000071454735,0.00051654375,0.0011265253,0.00072129886,0.0004887425],"domain_scores_gemma":[0.9972002,0.00041883547,0.00032343002,0.0016727847,0.00024250896,0.00014222211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009364874,0.00041913372,0.00052972196,0.00093879714,0.00024247017,0.00022720321,0.003012218,0.00025441026,0.000027701748],"category_scores_gemma":[0.00004612257,0.00039871444,0.00022841121,0.00083405006,0.0010070782,0.00041137368,0.0007453681,0.00051110884,0.00001353355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009870208,0.00008782648,0.00005800411,0.000056929857,0.000034539975,0.00003827578,0.0006446263,0.0051936056,0.0018178156,0.61091393,0.00004933607,0.38109523],"study_design_scores_gemma":[0.00023265788,0.00027645825,0.00009239878,0.0005042677,0.000017976003,0.00008920255,1.13980235e-7,0.027890595,0.019334573,0.94823223,0.0026903183,0.00063921727],"about_ca_topic_score_codex":0.000004913211,"about_ca_topic_score_gemma":0.0000121184885,"teacher_disagreement_score":0.380456,"about_ca_system_score_codex":0.000098818295,"about_ca_system_score_gemma":0.00024061126,"threshold_uncertainty_score":0.99984646},"labels":[],"label_agreement":null},{"id":"W4242110846","doi":"10.1109/isit.2001.936087","title":"On factor graphs and the Fourier transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Duality (order theory); Mathematics; Factor graph; Fourier transform; Discrete mathematics; Combinatorics; Mathematical analysis; Algorithm","score_opus":0.014084778959244775,"score_gpt":0.19516190344741607,"score_spread":0.1810771244881713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242110846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19996552,0.00043994337,0.41859952,0.015834993,0.0004071973,0.00038041928,0.0000021399464,0.00051211345,0.36385816],"genre_scores_gemma":[0.99695545,0.00003744058,0.0011874988,0.0011891779,0.0000059795343,0.000004810395,3.082862e-8,0.000001934673,0.0006176689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995873,0.000030840758,0.000055615554,0.00012352139,0.000099711884,0.00010301944],"domain_scores_gemma":[0.9995327,0.00017272771,0.000009609641,0.00024381242,0.0000069376024,0.000034188586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012221499,0.00005798162,0.00005567415,0.000042768235,0.000120055476,0.00008157542,0.00027532922,0.000017358574,0.00021565353],"category_scores_gemma":[0.000006426137,0.000030123723,0.000059961083,0.00017081747,0.00008655344,0.00011477692,0.000021612623,0.000061235,0.000023969555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004323396,0.000010282663,0.000022439515,7.1642876e-7,0.000005176926,5.7359813e-7,0.00068585045,2.717812e-7,0.000003720169,0.8936837,0.0005185615,0.10506443],"study_design_scores_gemma":[0.00076330086,0.000087040375,0.00046326275,0.000003994861,0.000003125655,0.000005872544,0.000016327804,0.010913083,0.00021217942,0.9799425,0.00750734,0.00008196182],"about_ca_topic_score_codex":0.0000023544999,"about_ca_topic_score_gemma":0.0000032622036,"teacher_disagreement_score":0.7969899,"about_ca_system_score_codex":0.0000013421597,"about_ca_system_score_gemma":9.78361e-7,"threshold_uncertainty_score":0.2361255},"labels":[],"label_agreement":null},{"id":"W4242297744","doi":"10.1109/fdtc.2007.4318983","title":"Fault Detection Structures for the Montgomery Multiplication over Binary Extension Fields","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Error detection and correction; Binary number; Multiplication (music); Arithmetic; Finite field; Finite field arithmetic; Redundancy (engineering); Cryptography; Multiplier (economics); Algorithm; Parallel computing; Theoretical computer science; Mathematics; Discrete mathematics","score_opus":0.015906011759059296,"score_gpt":0.2645926643358906,"score_spread":0.24868665257683134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242297744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14355206,0.000090748064,0.8551571,0.00028322893,0.00034757613,0.00018261696,3.1074254e-7,0.00012533198,0.0002610727],"genre_scores_gemma":[0.9902719,0.000009190057,0.008992967,0.00052452245,0.00008955533,0.000014997128,6.6374787e-7,0.0000036900697,0.000092501934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994286,0.00001632679,0.00011053123,0.00020085528,0.000101903664,0.0001418349],"domain_scores_gemma":[0.99908084,0.00040036754,0.000041857784,0.00039479762,0.00005383759,0.000028313629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040702976,0.00006966373,0.000048600657,0.00007436271,0.00025973422,0.00005364006,0.00029997795,0.000060436832,0.000009991437],"category_scores_gemma":[0.0000340614,0.000044074382,0.00007766283,0.00023789714,0.000023476321,0.00018119624,0.0000659021,0.000072003095,0.000002587298],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008637514,0.00002724564,0.00014364952,0.0000064331157,0.000015014984,8.3240775e-7,0.0003068868,0.00037323538,0.03932504,0.12833004,0.0007119331,0.83067334],"study_design_scores_gemma":[0.00086281914,0.0004242071,0.2595236,0.00001262247,0.000027925702,0.000021535117,0.00023216054,0.3719929,0.12935495,0.21447067,0.022651948,0.00042467652],"about_ca_topic_score_codex":0.000026391204,"about_ca_topic_score_gemma":0.000052855998,"teacher_disagreement_score":0.84671986,"about_ca_system_score_codex":0.00000881509,"about_ca_system_score_gemma":0.000004575842,"threshold_uncertainty_score":0.1997692},"labels":[],"label_agreement":null},{"id":"W4248613845","doi":"10.22215/etd/2015-10627","title":"Deterministic Factorization of Polynomials over Finite Fields","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Finite field; Mathematics; Factorization of polynomials; Factorization; Euler's totient function; Degree (music); Polynomial; Bounded function; Coprime integers; Field (mathematics); Prime factor; Discrete mathematics; Difference polynomials; Prime (order theory); Euler's formula; Orthogonal polynomials; Combinatorics; Pure mathematics; Matrix polynomial; Algorithm; Mathematical analysis","score_opus":0.018700554306535798,"score_gpt":0.28432940002124985,"score_spread":0.26562884571471407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248613845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073810965,0.00021725468,0.8194964,0.000031692813,0.0044752616,0.00031891913,0.00002239507,0.00026468132,0.10136246],"genre_scores_gemma":[0.99488324,0.000010741086,0.0013630643,0.00005056905,0.000068604735,0.0000067434758,0.00010256662,0.000009322034,0.0035051466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907583,0.000050417784,0.00027677047,0.00024268702,0.00023151962,0.00012278404],"domain_scores_gemma":[0.9989976,0.00017318992,0.00022084832,0.00041810572,0.00013326984,0.000056948837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018053805,0.00015026188,0.00022705266,0.00020676597,0.00003625432,0.00006312984,0.00056434906,0.00021321165,0.00012129983],"category_scores_gemma":[0.00011136374,0.00013794331,0.00010993435,0.00027538883,0.000012960832,0.00016005101,0.000041765692,0.000105794796,0.00001387698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002585503,0.0002944358,0.0010182714,0.00062750577,0.0002225937,0.000019233536,0.0111579755,0.0001482832,0.0037488893,0.73434204,0.011504452,0.23665777],"study_design_scores_gemma":[0.0015685945,0.0013716895,0.014563642,0.000608006,0.00022765202,0.0000055937667,0.0005286869,0.013002154,0.030627765,0.9190225,0.01628744,0.002186252],"about_ca_topic_score_codex":0.000022005097,"about_ca_topic_score_gemma":0.000047316214,"teacher_disagreement_score":0.92107224,"about_ca_system_score_codex":0.000010920017,"about_ca_system_score_gemma":0.00012432423,"threshold_uncertainty_score":0.5625165},"labels":[],"label_agreement":null},{"id":"W4248623970","doi":"10.1109/isit.1991.695146","title":"Exact Lower Bounds On The Code Length Of Three-step Permutation-decodable Cyclic Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Permutation (music); Cyclic code; Code (set theory); Computer science; Upper and lower bounds; Mathematics; Algorithm; Combinatorics; Block code; Linear code; Decoding methods; Physics; Programming language","score_opus":0.019430490607029373,"score_gpt":0.24456108052989448,"score_spread":0.2251305899228651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248623970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51607317,0.000103157414,0.3959474,0.004394024,0.00026175386,0.00020089747,0.000005471123,0.00022847413,0.08278566],"genre_scores_gemma":[0.9918623,0.000012111039,0.006454412,0.0009824693,0.000058754915,0.0000113290425,8.8021386e-7,0.0000074625523,0.00061027944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897236,0.0000752578,0.00020951907,0.00025890698,0.00026262322,0.0002213184],"domain_scores_gemma":[0.9986496,0.0004938725,0.000081965365,0.0006667265,0.00005811191,0.000049730155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053446833,0.00012761606,0.0001358214,0.000092802235,0.0002127766,0.00012244825,0.00082822685,0.000042341275,0.00037250834],"category_scores_gemma":[0.000038542814,0.00008132237,0.00012331393,0.0003795344,0.00011158699,0.00029243366,0.00009762919,0.00011798448,0.00011491322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020230444,0.00015252556,0.00073025416,0.000004407117,0.000031641444,0.0000012238561,0.00040182754,0.00034833036,0.0005461276,0.97199297,0.0024652379,0.02330523],"study_design_scores_gemma":[0.0019414214,0.0017031676,0.02661497,0.00018703411,0.000077281824,0.000038888225,0.00057715055,0.3584777,0.04651509,0.3925076,0.16989687,0.0014628139],"about_ca_topic_score_codex":0.000026000545,"about_ca_topic_score_gemma":0.00023854435,"teacher_disagreement_score":0.57948536,"about_ca_system_score_codex":0.000017487067,"about_ca_system_score_gemma":0.00003290195,"threshold_uncertainty_score":0.40787053},"labels":[],"label_agreement":null},{"id":"W4249698913","doi":"10.1109/glocom.2014.7417538","title":"Low Complexity Hybrid ARQ Using Extended Turbo Product Codes Self-Detection","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hybrid automatic repeat request; Cyclic redundancy check; Computer science; Error detection and correction; Turbo code; Algorithm; Throughput; Automatic repeat request; Turbo; Low-density parity-check code; Redundancy (engineering); Real-time computing; Decoding methods; Wireless; Computer network; Telecommunications link; Engineering; Telecommunications","score_opus":0.06391313434900145,"score_gpt":0.30757356344370057,"score_spread":0.24366042909469912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249698913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13508928,0.0003802695,0.8455301,0.0022195114,0.0011925651,0.0006843937,0.000070168375,0.0015343402,0.013299384],"genre_scores_gemma":[0.93650657,0.00009723123,0.06296609,0.00024793128,0.00009204334,0.000036803827,0.000022479291,0.00001332308,0.00001750251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669456,0.0010593918,0.00054085546,0.0007226064,0.0004135069,0.00056906295],"domain_scores_gemma":[0.99370223,0.00018859695,0.0003524485,0.0048994026,0.0006152034,0.00024213192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011658461,0.00038360208,0.00041870415,0.00015202712,0.0010402532,0.00055399013,0.0047797374,0.000091629714,0.000030202074],"category_scores_gemma":[0.00013513702,0.00040213097,0.00018891851,0.0009993006,0.0005326809,0.0008603814,0.0010601243,0.00042831316,0.00013613717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063400395,0.0012293861,0.0010378808,0.00007975116,0.00014390807,0.0000030530648,0.0004533447,0.00021353594,0.004074186,0.8148276,0.0015476671,0.17632626],"study_design_scores_gemma":[0.0011579328,0.00037582478,0.007740681,0.00019760847,0.00012663298,0.00023223499,0.00012070831,0.5814861,0.012909017,0.37862846,0.015549235,0.0014755615],"about_ca_topic_score_codex":0.00031314619,"about_ca_topic_score_gemma":0.0006079416,"teacher_disagreement_score":0.8014173,"about_ca_system_score_codex":0.00022970712,"about_ca_system_score_gemma":0.00022888416,"threshold_uncertainty_score":0.99984306},"labels":[],"label_agreement":null},{"id":"W4250205828","doi":"10.1016/s0304-3975(04)00113-6","title":"The number of binary words avoiding abelian fourth powers grows exponentially","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Exponential growth; Abelian group; Binary number; Mathematics; Combinatorics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.00792064906453805,"score_gpt":0.24223702468757136,"score_spread":0.2343163756230333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250205828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23148263,0.000033066557,0.76372385,0.0012974993,0.00090491393,0.00011128002,6.7324754e-7,0.0001453499,0.002300754],"genre_scores_gemma":[0.91656834,0.000013765398,0.083057724,0.00026101427,0.000080070444,0.0000051930447,2.0761253e-7,0.00000846037,0.000005210734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972402,0.00018194747,0.00037785078,0.0006321409,0.00085953134,0.0007083669],"domain_scores_gemma":[0.9977956,0.0005199308,0.00012769167,0.0011372877,0.00016848068,0.00025100654],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003352275,0.00021262463,0.00020931411,0.00016928953,0.0012693673,0.00047558485,0.004168345,0.00005292693,0.000023648341],"category_scores_gemma":[0.00011172146,0.00014705896,0.00016870642,0.002112562,0.0046123797,0.0006886302,0.0013390954,0.0003094401,0.000052286447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001960305,0.00006360052,0.00008131861,0.000004627583,0.000008060892,0.00001143674,0.0010433829,0.00022836574,0.0027476957,0.98094475,0.000013132747,0.014834027],"study_design_scores_gemma":[0.0003953789,0.00024212446,0.00082534744,0.00008123122,0.00000774477,0.00006722635,0.000052943997,0.019731758,0.008495491,0.96964264,0.0001693898,0.00028874702],"about_ca_topic_score_codex":0.00000538657,"about_ca_topic_score_gemma":7.336635e-7,"teacher_disagreement_score":0.6850857,"about_ca_system_score_codex":0.00004805957,"about_ca_system_score_gemma":0.00018354115,"threshold_uncertainty_score":0.9980965},"labels":[],"label_agreement":null},{"id":"W4250336549","doi":"10.1109/isit.1997.613319","title":"Fast erasure and error decoding of algebraic geometry codes up to the Feng-Rao bound","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Erasure; Decoding methods; Generalization; Algorithm; List decoding; Algebraic number; Point (geometry); Computer science; Upper and lower bounds; Mathematics; Discrete mathematics; Concatenated error correction code; Geometry; Block code; Mathematical analysis","score_opus":0.025665025729640984,"score_gpt":0.23733339046640667,"score_spread":0.21166836473676567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250336549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80139947,0.00057463185,0.18974224,0.0022784604,0.00032971677,0.00014663074,0.000002863175,0.0001154689,0.0054104887],"genre_scores_gemma":[0.9920884,0.000020946369,0.0065029003,0.0006517566,0.000028441256,0.000005394711,1.8595361e-7,0.0000052853766,0.000696715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991129,0.00006220037,0.00016123218,0.0002592066,0.00018540016,0.00021906654],"domain_scores_gemma":[0.99917203,0.0002064299,0.000045758155,0.00044535266,0.00004426291,0.00008614552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004563623,0.000110668014,0.00013794031,0.00015923774,0.00022551199,0.00017009897,0.00064080465,0.00003702969,0.0001719159],"category_scores_gemma":[0.000050105034,0.000075208656,0.00006288671,0.00076074287,0.000078401645,0.00021022701,0.00024706515,0.00009489731,0.000032105323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017465385,0.00008922659,0.007548035,0.00004632172,0.00009238694,0.0000061182864,0.010041205,0.00011177692,0.002723175,0.81205857,0.012931356,0.15433437],"study_design_scores_gemma":[0.0055411533,0.0032593037,0.123923175,0.0007530519,0.0002722897,0.0005547171,0.011462547,0.29378417,0.059887983,0.31725755,0.17823572,0.005068342],"about_ca_topic_score_codex":0.000012282599,"about_ca_topic_score_gemma":0.000041707866,"teacher_disagreement_score":0.494801,"about_ca_system_score_codex":0.0000063030498,"about_ca_system_score_gemma":0.0000061945184,"threshold_uncertainty_score":0.30669197},"labels":[],"label_agreement":null},{"id":"W4252118012","doi":"10.22215/etd/2016-11313","title":"Deficiency and Ambiguity of Low Degree Permutation Polynomials","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Ambiguity; Permutation (music); Degree (music); Bijection; Abelian group; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.015065077950135106,"score_gpt":0.2503919824769201,"score_spread":0.235326904526785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252118012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.795409,0.0007074352,0.102856904,0.00009716476,0.00090261106,0.00026514265,0.000012199971,0.0001644703,0.099585034],"genre_scores_gemma":[0.99571186,0.000060190323,0.0023147208,0.000029364403,0.000027919978,0.000008328262,0.000014763729,0.000007705769,0.0018251709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990152,0.000056989695,0.0002545108,0.00033233373,0.00019189705,0.00014906282],"domain_scores_gemma":[0.9991798,0.00011137392,0.00020391938,0.00034388836,0.00011165415,0.000049366306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002949,0.00015062052,0.00020729406,0.00021756797,0.00009283065,0.00005998764,0.00045213793,0.00013056137,0.000050080995],"category_scores_gemma":[0.000048965234,0.00011458409,0.00009118568,0.00021394646,0.000043546384,0.00023088536,0.000048549427,0.00006868073,0.0000106732505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000481629,0.00007328747,0.00046821637,0.00027751055,0.000022456941,0.0000022321099,0.0017595026,4.5124816e-7,0.018382844,0.50752497,0.00020311093,0.47123727],"study_design_scores_gemma":[0.0018163609,0.0008801761,0.23129186,0.001361615,0.0001415907,0.000028515777,0.0009920559,0.00070041296,0.22251333,0.5376873,0.00054257654,0.0020442067],"about_ca_topic_score_codex":0.000027028736,"about_ca_topic_score_gemma":0.000046896806,"teacher_disagreement_score":0.46919307,"about_ca_system_score_codex":0.000009772105,"about_ca_system_score_gemma":0.00007240701,"threshold_uncertainty_score":0.46726033},"labels":[],"label_agreement":null},{"id":"W4281395388","doi":"10.1007/s10958-022-05840-w","title":"Victor Timofeevich Markov (21.06.1948–15.07.2019)","year":2022,"lang":"de","type":"article","venue":"Journal of Mathematical Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Markov chain; Statistics","score_opus":0.023162792040450863,"score_gpt":0.2712931386627968,"score_spread":0.24813034662234595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281395388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3488778,0.037612885,0.45399454,0.07359387,0.024522671,0.0016366504,0.000107017455,0.0003552048,0.059299383],"genre_scores_gemma":[0.9073809,0.00036645975,0.085583925,0.0021659774,0.0017704697,0.00001898744,0.0000012945667,0.000040482922,0.002671536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99369127,0.0008689083,0.0013473523,0.0005181206,0.0027729543,0.000801376],"domain_scores_gemma":[0.9961222,0.0014776881,0.0011549675,0.0005400495,0.00022821846,0.00047690235],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010151135,0.00034098089,0.00072977017,0.0005505687,0.0015219696,0.0007978786,0.0045312783,0.00008533586,0.0059478516],"category_scores_gemma":[0.0005156894,0.0002566708,0.00063080026,0.002315066,0.00085264695,0.0009007467,0.0013475793,0.0009174399,0.00069912244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017937919,0.0026677463,0.00096097874,0.0002436142,0.0004013553,0.0005020354,0.00798928,0.00084342604,0.001031184,0.8558356,0.1040691,0.025276259],"study_design_scores_gemma":[0.0010790033,0.004143558,0.0005949148,0.0005271444,0.000317172,0.0014574829,0.0017194487,0.026994174,0.0003645811,0.76896024,0.19288206,0.0009602363],"about_ca_topic_score_codex":0.0000018510766,"about_ca_topic_score_gemma":4.3733348e-7,"teacher_disagreement_score":0.5585031,"about_ca_system_score_codex":0.00011449253,"about_ca_system_score_gemma":0.0005377365,"threshold_uncertainty_score":0.99998856},"labels":[],"label_agreement":null},{"id":"W4284664208","doi":"10.1145/3476446.3536178","title":"Linear Hensel Lifting for Zp[x,y] for n Factors with Cubic Cost","year":2022,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monic polynomial; Mathematics; Cubic function; Combinatorics; Polynomial; Univariate; Quadratic equation; Algorithm; Bounded function; Mathematical analysis; Geometry; Statistics","score_opus":0.03198754815850494,"score_gpt":0.2539633507745535,"score_spread":0.22197580261604857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4284664208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061899554,0.00001900745,0.9358812,0.0004439248,0.00022875385,0.0005301659,0.000017891407,0.00022182682,0.0007576714],"genre_scores_gemma":[0.8718998,5.430063e-7,0.12662615,0.0006114344,0.000057845147,0.00031439716,0.000011089775,0.000014356838,0.00046442248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991865,0.000030257639,0.00011281274,0.0002833181,0.00013484451,0.00025226185],"domain_scores_gemma":[0.9991733,0.00038992916,0.000053213575,0.00027729836,0.000049949882,0.000056309087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034199777,0.00009976913,0.000109116925,0.000087449975,0.00058729376,0.00006578868,0.0005299555,0.000015235683,0.000037852675],"category_scores_gemma":[0.000024582767,0.00007897726,0.00010183552,0.0003342033,0.000020972844,0.000139669,0.00015979585,0.00007686522,0.0000014248642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001309095,0.000117349926,0.00193336,0.000030326682,0.00005215248,0.0000017083617,0.0017378402,0.00067815534,0.0004817931,0.97916454,0.0026183943,0.013053495],"study_design_scores_gemma":[0.003971733,0.004523768,0.00070232945,0.000029459594,0.00006429729,0.000035338948,0.0027781776,0.20113602,0.011827796,0.12475008,0.6488509,0.0013300596],"about_ca_topic_score_codex":0.0000057057073,"about_ca_topic_score_gemma":0.000004822673,"teacher_disagreement_score":0.85441446,"about_ca_system_score_codex":0.000016553167,"about_ca_system_score_gemma":0.000037687652,"threshold_uncertainty_score":0.45170483},"labels":[],"label_agreement":null},{"id":"W4285296771","doi":"10.1561/0100000120","title":"Codes in the Sum-Rank Metric: Fundamentals and Applications","year":2022,"lang":"en","type":"article","venue":"Foundations and Trends® in Communications and Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rank (graph theory); Metric (unit); Mathematics; Combinatorics; Computer science; Engineering; Operations management","score_opus":0.022634120572137064,"score_gpt":0.28143243875738033,"score_spread":0.2587983181852433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285296771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124462314,0.019540874,0.5928442,0.039309014,0.00034991803,0.0030749533,0.000496547,0.0005050419,0.21941717],"genre_scores_gemma":[0.99504673,0.0010413923,0.002548054,0.0006424196,0.000004731792,0.000554357,0.00012775215,0.000002485505,0.000032067375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989332,0.00040170932,0.00030896068,0.00011699154,0.0001222706,0.00011689467],"domain_scores_gemma":[0.9984453,0.0006700961,0.000107044856,0.00071943883,0.00002798643,0.000030144449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016277906,0.00008714508,0.00009688012,0.0008558392,0.0011711505,0.00034259423,0.00068991317,0.000022116561,0.000044190037],"category_scores_gemma":[0.000018469125,0.00007581546,0.000023716098,0.0017231003,0.00020768399,0.0014928617,0.00058474863,0.00021841745,0.000002398134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003340797,0.000047777154,0.0008427508,0.0000034618738,0.000004705476,5.0991375e-8,0.0025789954,0.0000143178,0.0000010782168,0.7188301,0.000022107582,0.27765128],"study_design_scores_gemma":[0.0010687478,0.00012593744,0.07116306,0.000015084032,0.00002246613,0.00006784241,0.012699641,0.015027272,0.0000026676637,0.43707073,0.46242028,0.00031627892],"about_ca_topic_score_codex":0.000042479463,"about_ca_topic_score_gemma":0.00004729064,"teacher_disagreement_score":0.8705844,"about_ca_system_score_codex":0.00002586202,"about_ca_system_score_gemma":0.00001652721,"threshold_uncertainty_score":0.9007661},"labels":[],"label_agreement":null},{"id":"W4286614538","doi":"","title":"Décodage de turbo codes concaténés en série","year":2022,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Computer science; Programming language; Operating system","score_opus":0.017398850844093292,"score_gpt":0.23915812403932177,"score_spread":0.22175927319522848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286614538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08136879,0.0040685255,0.67114943,0.03885509,0.001572762,0.0007853755,0.00019704245,0.0007989632,0.20120402],"genre_scores_gemma":[0.8141177,0.0016126669,0.13506018,0.00078615383,0.00010486152,0.00024499954,0.00037281544,0.0000962493,0.04760434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9702564,0.025406023,0.00087435957,0.0016604719,0.0008216758,0.0009811091],"domain_scores_gemma":[0.98633444,0.0062894844,0.0007700408,0.0045818184,0.0015220412,0.00050217926],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.018810026,0.00067830423,0.0006900776,0.00035769283,0.0014184257,0.0013485196,0.0060241763,0.00045127544,0.0026932077],"category_scores_gemma":[0.002088876,0.00082605035,0.00067076454,0.0012796812,0.00073962146,0.0004289673,0.0067789042,0.0019083905,0.00015385608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001920079,0.00068285177,0.002050717,0.00014262603,0.00014515099,0.00004014972,0.03262514,0.00026150254,0.0017038557,0.89305854,0.0020567644,0.067213476],"study_design_scores_gemma":[0.001186884,0.000004365586,0.012662387,0.0024521863,0.00022280912,0.00015718398,0.0011000595,0.0662988,0.04122755,0.24353181,0.6290243,0.0021316293],"about_ca_topic_score_codex":0.0017788279,"about_ca_topic_score_gemma":0.00084171706,"teacher_disagreement_score":0.7327489,"about_ca_system_score_codex":0.00041204196,"about_ca_system_score_gemma":0.001000665,"threshold_uncertainty_score":0.99988157},"labels":[],"label_agreement":null},{"id":"W4286890469","doi":"10.48550/arxiv.2110.15582","title":"Construction of APN permutations via Walsh zero spaces","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subspace topology; Mathematics; Zero (linguistics); Combinatorics; Affine transformation; Vector space; Space (punctuation); Inverse; Affine space; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.042106735222034175,"score_gpt":0.1739180368166843,"score_spread":0.13181130159465013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286890469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36757275,0.00004194433,0.6296324,0.000047859234,0.00043380426,0.00007552334,0.0000058209653,0.00009777899,0.0020921212],"genre_scores_gemma":[0.9926605,0.000080263155,0.007065679,0.000025920119,0.00002370644,5.100024e-7,0.000012453827,0.0000072022544,0.00012372043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987646,0.00016558399,0.00016384818,0.0006510704,0.00007765549,0.00017726564],"domain_scores_gemma":[0.9985132,0.000106858395,0.00024585886,0.000834627,0.00021505459,0.000084398955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016375924,0.00018506999,0.00025799012,0.00030469426,0.00013539594,0.00010357874,0.0008954378,0.0001720914,0.00005144682],"category_scores_gemma":[0.000020633788,0.00022894982,0.00027165504,0.00080029987,0.00021254431,0.00031838473,0.0009089121,0.0003001829,0.000009515615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001406695,0.00008633052,0.0030271953,0.000085126405,0.00013634893,0.00009222048,0.00072829187,0.028451493,0.00033669686,0.963952,0.00002695626,0.003063264],"study_design_scores_gemma":[0.0005287114,0.000095018564,0.0031254096,0.00024057798,0.0002059916,0.000038427886,0.000936304,0.14186986,0.0029681642,0.8489907,0.00027481062,0.00072604435],"about_ca_topic_score_codex":0.00006673378,"about_ca_topic_score_gemma":0.000017831964,"teacher_disagreement_score":0.6250878,"about_ca_system_score_codex":0.000043733882,"about_ca_system_score_gemma":0.00013719569,"threshold_uncertainty_score":0.9336303},"labels":[],"label_agreement":null},{"id":"W4288088887","doi":"10.48550/arxiv.1910.12158","title":"Combinatorics of the geometry of Wilson loop diagrams II: Grassmann\\n necklaces, dimensions, and denominators","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Alexander von Humboldt-Stiftung","keywords":"Diagram; Grassmannian; Propagator; Loop (graph theory); Ideal (ethics); Mathematics; Dimension (graph theory); Necklace; Product (mathematics); Scattering amplitude; Feynman diagram; Pure mathematics; Combinatorics; Mathematical physics; Geometry; Scattering; Physics; Quantum mechanics","score_opus":0.02852317553058432,"score_gpt":0.16268050230356054,"score_spread":0.13415732677297623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288088887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97150856,0.00035858827,0.02628062,0.000044891658,0.000871303,0.0002697894,0.000011319588,0.000049495928,0.0006054301],"genre_scores_gemma":[0.99898845,0.0003978303,0.00016458382,0.000023265364,0.000008908951,3.754955e-7,0.0000022458767,0.000011381755,0.00040295746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851316,0.00020808772,0.00024203914,0.00066093885,0.00013751659,0.00023823151],"domain_scores_gemma":[0.9974552,0.0002605035,0.00050500897,0.0015208717,0.00016244562,0.00009598556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044073223,0.0002603823,0.00043197762,0.0003386302,0.00017892009,0.000032248747,0.0018927491,0.0002556132,0.000004588664],"category_scores_gemma":[0.00005282838,0.00023514195,0.0002827669,0.0012416786,0.00031620634,0.00017956039,0.0043922267,0.00046766704,0.0000019114784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002186583,0.00018029478,0.092653066,0.00018131164,0.000105958585,0.000010677236,0.00028138838,0.0047782883,0.00008298661,0.9011485,0.00011306371,0.0004426075],"study_design_scores_gemma":[0.0015956658,0.0005286417,0.04660246,0.00067534624,0.00042832486,0.000009501285,0.00040340712,0.07742824,0.004077012,0.8660279,0.0010788286,0.0011446712],"about_ca_topic_score_codex":0.00006852718,"about_ca_topic_score_gemma":0.000008779721,"teacher_disagreement_score":0.07264995,"about_ca_system_score_codex":0.00005362543,"about_ca_system_score_gemma":0.00011629006,"threshold_uncertainty_score":0.958881},"labels":[],"label_agreement":null},{"id":"W4289519905","doi":"10.1007/s12095-022-00585-4","title":"Status of three classes of sequences","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Binary Golay code; Pseudorandom number generator; Ambiguity; Field (mathematics); Autocorrelation; Computer science; Cryptography; Complementary sequences; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Statistics; Pure mathematics; Programming language","score_opus":0.04423353199970351,"score_gpt":0.2763334129997022,"score_spread":0.2320998809999987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289519905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62310225,0.030722607,0.3129238,0.0019586803,0.00027702784,0.0005098052,0.00018752123,0.00026498653,0.030053338],"genre_scores_gemma":[0.96337026,0.0009518874,0.03557055,0.00004790395,0.0000024065964,0.000046183435,0.0000062864333,0.0000030496901,0.0000014734437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999131,0.00018932958,0.00022964233,0.00013782091,0.00015959323,0.00015256304],"domain_scores_gemma":[0.99802727,0.0003041445,0.00016577542,0.001381183,0.00006856573,0.000053062373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002841861,0.000072460665,0.00013906685,0.00027647018,0.000442628,0.000020661892,0.0016330804,0.000017542576,0.000030509995],"category_scores_gemma":[0.000014428289,0.000074088515,0.00011345691,0.0012788312,0.0005005941,0.00015723598,0.0010575046,0.00014857475,2.0526222e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000598374,0.00012634334,0.024174573,0.000011556535,0.000035831512,1.380579e-7,0.0009795176,0.000013841372,0.0008818316,0.95116216,0.000041209172,0.022567002],"study_design_scores_gemma":[0.00034946293,0.00046706086,0.0424201,0.000026082642,0.000038651673,0.0000091860975,0.0018180363,0.0012313479,0.0011434223,0.9202251,0.032041166,0.00023038419],"about_ca_topic_score_codex":0.000082007435,"about_ca_topic_score_gemma":0.00003774692,"teacher_disagreement_score":0.34026802,"about_ca_system_score_codex":0.0000044495305,"about_ca_system_score_gemma":0.00005291781,"threshold_uncertainty_score":0.34043813},"labels":[],"label_agreement":null},{"id":"W4289524100","doi":"10.1007/s12095-022-00603-5","title":"Concrete constructions of weightwise perfectly balanced (2-rotation symmetric) functions with optimal algebraic immunity and high weightwise nonlinearity","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Armand Frappier Museum","funders":"Key Scientific Research Project of Colleges and Universities in Henan Province; National Natural Science Foundation of China","keywords":"Boolean function; Hamming weight; Mathematics; Cipher; Hamming distance; Stream cipher; Cryptography; Rotation (mathematics); Algebraic number; Class (philosophy); Simplicity; Discrete mathematics; Topology (electrical circuits); Hamming code; Combinatorics; Computer science; Algorithm; Encryption; Mathematical analysis; Block code","score_opus":0.010158535419387221,"score_gpt":0.2119433588205441,"score_spread":0.2017848234011569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289524100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8715648,0.0023987307,0.122094855,0.0011568143,0.0001504808,0.0004723284,0.0002204193,0.0002244997,0.001717076],"genre_scores_gemma":[0.9213836,0.0005345468,0.077670686,0.00008129556,0.000011892653,0.00020052293,0.000097231474,0.000011503288,0.000008689531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982257,0.00056922645,0.00035044804,0.00036815734,0.0002479365,0.00023856787],"domain_scores_gemma":[0.9971137,0.00060608744,0.00024921686,0.0016913901,0.00020461943,0.00013500935],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00042144267,0.00020959058,0.00028386494,0.0006900507,0.0023121757,0.000121099496,0.001071745,0.000055605375,0.000051148352],"category_scores_gemma":[0.000028108225,0.00020815016,0.00011970785,0.0027973077,0.0010837285,0.00044974036,0.00096600945,0.0005522628,9.552912e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088873494,0.0001860801,0.014179587,0.000027441496,0.00019173133,0.0000015315666,0.0016429105,0.000038969167,0.0009012389,0.96924764,0.000059064638,0.013434924],"study_design_scores_gemma":[0.019157115,0.00982975,0.4382294,0.00041777172,0.0017080783,0.0019995447,0.030703686,0.07949962,0.0030227755,0.35616985,0.053972457,0.0052899322],"about_ca_topic_score_codex":0.00015678204,"about_ca_topic_score_gemma":0.000024984223,"teacher_disagreement_score":0.6130778,"about_ca_system_score_codex":0.000017010645,"about_ca_system_score_gemma":0.00008950882,"threshold_uncertainty_score":0.99898666},"labels":[],"label_agreement":null},{"id":"W4289655091","doi":"10.1109/isit50566.2022.9834891","title":"Maximum-Length Low-Density MDS Codes and Near Resolvable Designs","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Information Theory (ISIT)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Dimension (graph theory); Combinatorics; Separable space; Discrete mathematics; Code (set theory); Computer science; Mathematical analysis","score_opus":0.01110291532929121,"score_gpt":0.2274738459194741,"score_spread":0.21637093059018286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289655091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50126106,0.00007085833,0.4251609,0.0035973568,0.005458731,0.0007427969,0.0002291226,0.00079694926,0.06268224],"genre_scores_gemma":[0.994606,0.00003284015,0.0014189996,0.003199593,0.00008985068,0.00009875264,0.00006901229,0.000012002524,0.0004729278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781877,0.0003584974,0.00045519735,0.00030084339,0.0007977764,0.00026893447],"domain_scores_gemma":[0.99863565,0.0003712449,0.00026790326,0.0004749473,0.00014045836,0.00010980613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001894485,0.00020902221,0.0001785585,0.00030644215,0.00097037584,0.0005734732,0.001207742,0.000055234254,0.00047016112],"category_scores_gemma":[0.000051052237,0.00021828951,0.00012509598,0.00042170478,0.00010905881,0.0017839805,0.0005210965,0.00037007694,0.00014342791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043132986,0.00011921825,0.00026522978,0.000017639852,0.00009636293,0.000010979506,0.0039025315,0.007554746,0.0014336889,0.9717873,0.003950924,0.010430104],"study_design_scores_gemma":[0.00331242,0.0015335983,0.002199466,0.00009673899,0.000056814344,0.00037514145,0.002089511,0.2155253,0.019659793,0.5861243,0.1674083,0.0016186167],"about_ca_topic_score_codex":0.000019099507,"about_ca_topic_score_gemma":0.0000017265488,"teacher_disagreement_score":0.493345,"about_ca_system_score_codex":0.00018046433,"about_ca_system_score_gemma":0.000060599068,"threshold_uncertainty_score":0.8901588},"labels":[],"label_agreement":null},{"id":"W4293776836","doi":"10.3390/electronics11172717","title":"Decoding Quadratic Residue Codes Using Deep Neural Networks","year":2022,"lang":"en","type":"article","venue":"Electronics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Decoding methods; Algorithm; Binary number; Computational complexity theory; Quadratic equation; Quadratic residue; Computer science; Berlekamp–Welch algorithm; Binary code; Artificial neural network; Reduction (mathematics); Sequential decoding; Mathematics; Block code; Arithmetic; Artificial intelligence","score_opus":0.014002833986491195,"score_gpt":0.23982951663361515,"score_spread":0.22582668264712397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293776836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15673277,0.008793579,0.83327353,0.00020360193,0.0003856584,0.000101658734,5.0789504e-7,0.00021641473,0.00029229646],"genre_scores_gemma":[0.99306923,0.000046769677,0.0063020387,0.00045586278,0.00007319118,0.000015572641,0.000002470804,0.000013471918,0.000021397209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847794,0.000268778,0.00017719826,0.00031273128,0.0002265065,0.0005368255],"domain_scores_gemma":[0.9992568,0.00014930587,0.00008363528,0.00042867137,0.000021632366,0.000059956237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059398805,0.00012780959,0.00013728144,0.00011884279,0.00086151133,0.00014632348,0.00087823503,0.00002790489,0.000047433867],"category_scores_gemma":[0.000017687735,0.0001420032,0.00009622274,0.000834254,0.000027371538,0.00022246948,0.00039754866,0.0004368173,0.0000016765138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003806045,0.00007705479,0.00095060386,0.0000076485785,0.000046852583,0.000039025053,0.0008055208,0.40532827,0.0011697566,0.51418257,0.00020837139,0.07714624],"study_design_scores_gemma":[0.00013299963,0.00016800937,0.00004558885,0.000002205347,0.000010181532,0.00007173933,0.000040869727,0.96957994,0.00024421656,0.026840251,0.002682929,0.00018105206],"about_ca_topic_score_codex":0.0000036283984,"about_ca_topic_score_gemma":0.000043562817,"teacher_disagreement_score":0.83633643,"about_ca_system_score_codex":0.00013640964,"about_ca_system_score_gemma":0.00006595679,"threshold_uncertainty_score":0.6626136},"labels":[],"label_agreement":null},{"id":"W4294811685","doi":"10.1109/iwsda50346.2022.9870453","title":"Equivalence Classes and Balance Properties of Interleaved Sequences","year":2022,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Equivalence (formal languages); Sequence (biology); Balance (ability); Base (topology); Mathematics; Equivalence class (music); Computer science; Algorithm; Discrete mathematics; Mathematical analysis; Biology","score_opus":0.02680412976019372,"score_gpt":0.22119616291697963,"score_spread":0.1943920331567859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294811685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94805557,0.00084484514,0.046810586,0.00062000565,0.00017372424,0.00007892049,0.0000014159679,0.00012078715,0.0032941233],"genre_scores_gemma":[0.99580103,0.00002089639,0.003825106,0.00016580272,0.0000055496753,0.000014351119,8.451051e-8,0.000001677613,0.0001655139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999394,0.00008775056,0.00010394894,0.00017230088,0.00014092709,0.000101076184],"domain_scores_gemma":[0.9996712,0.000039917177,0.000043200183,0.0002002299,0.000022784414,0.000022651378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026168942,0.000053507767,0.00008105917,0.000059358917,0.00013384358,0.000036306817,0.00054656016,0.000007243111,0.000052969197],"category_scores_gemma":[0.000015261458,0.000042146257,0.000026436031,0.00024756914,0.00012155505,0.00021544806,0.00051612145,0.00006267527,9.002717e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028672232,0.00006275438,0.0059226565,0.00006193487,0.000018367027,0.0000054242973,0.0030611765,0.000048272632,0.091947295,0.8810252,0.00024570894,0.017572535],"study_design_scores_gemma":[0.0013983714,0.0033847743,0.010856199,0.00031799622,0.00003229456,0.00033011747,0.009616176,0.09411531,0.44104454,0.42318657,0.014193832,0.0015238338],"about_ca_topic_score_codex":0.000014799847,"about_ca_topic_score_gemma":0.0000020123423,"teacher_disagreement_score":0.45783865,"about_ca_system_score_codex":0.000005765491,"about_ca_system_score_gemma":0.000021632826,"threshold_uncertainty_score":0.17186745},"labels":[],"label_agreement":null},{"id":"W4296192831","doi":"","title":"Minimum Sizes of Identifying Codes in Graphs Differing by One Edge or One Vertex","year":2012,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Graph; Computer science; Artificial intelligence","score_opus":0.029201065800860765,"score_gpt":0.24304280871619374,"score_spread":0.21384174291533298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296192831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5064595,0.0041338373,0.47957003,0.0015862932,0.00051594723,0.00052764267,0.0000532806,0.00032209515,0.006831418],"genre_scores_gemma":[0.9588122,0.0008736606,0.039435178,0.000040625775,0.000011379356,0.00006382667,0.00007856429,0.000032240052,0.00065235427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9937761,0.0035511698,0.0007702893,0.0008428716,0.0005353961,0.0005241954],"domain_scores_gemma":[0.9937951,0.0021336228,0.00061764766,0.0025798213,0.0006814828,0.00019230347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0055057653,0.0003711083,0.0006375086,0.00048816184,0.0002278972,0.0004038849,0.003104106,0.0002806677,0.00008010098],"category_scores_gemma":[0.0006632698,0.00039834375,0.0002751427,0.0009702892,0.0002948965,0.0003806208,0.00304417,0.0006693611,0.00001208528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012203249,0.005123873,0.01566094,0.0017113376,0.0004369114,0.000009780984,0.045503177,0.000032057273,0.10027197,0.65077144,0.0007244721,0.17963204],"study_design_scores_gemma":[0.0032477328,0.0000055248715,0.04444435,0.019447632,0.00024253559,0.000018917346,0.00055363995,0.022992669,0.67843795,0.2251053,0.0026104294,0.0028933154],"about_ca_topic_score_codex":0.00046432484,"about_ca_topic_score_gemma":0.00075087283,"teacher_disagreement_score":0.578166,"about_ca_system_score_codex":0.000073740106,"about_ca_system_score_gemma":0.00013953101,"threshold_uncertainty_score":0.9998468},"labels":[],"label_agreement":null},{"id":"W4297234428","doi":"10.48550/arxiv.1111.5604","title":"Shirshov's theorem and division rings that are left algebraic over a\\n subfield","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subring; Mathematics; Division ring; Ring (chemistry); Discrete mathematics; Algebraic number; Combinatorics; Bounded function; Division (mathematics); Pure mathematics; Arithmetic","score_opus":0.06469745723471905,"score_gpt":0.1709160450110573,"score_spread":0.10621858777633826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297234428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.754077,0.00014701873,0.23846295,0.000055814675,0.0004841315,0.00017877344,0.0000057680822,0.000302516,0.0062859957],"genre_scores_gemma":[0.9986447,0.00023340802,0.0003384482,0.00018700286,0.000040157793,4.628739e-7,0.000003488936,0.000018906467,0.000533429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997931,0.00017662089,0.00014637804,0.0012471699,0.00011066598,0.000388166],"domain_scores_gemma":[0.99792314,0.000185326,0.00025970896,0.0013625463,0.00006326346,0.00020599822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039781138,0.00038482598,0.00035240236,0.00034676158,0.00024501196,0.00020743452,0.0018181334,0.00034681184,0.00014626193],"category_scores_gemma":[0.00002318879,0.0004028934,0.000267284,0.0002980448,0.0002223867,0.0005133677,0.0034647242,0.00065581925,0.000032946733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037308822,0.000069300564,0.06602752,0.000075017175,0.00008132313,0.00018055875,0.0009059572,0.00027251075,0.00002444557,0.93101394,0.0001685853,0.0011435251],"study_design_scores_gemma":[0.0004306662,0.00008188215,0.07000773,0.00027569314,0.00007372534,0.000009274722,0.000124259,0.0102180885,0.0005287828,0.91709566,0.00045180952,0.0007024435],"about_ca_topic_score_codex":0.00006494921,"about_ca_topic_score_gemma":0.000044082914,"teacher_disagreement_score":0.24456768,"about_ca_system_score_codex":0.00003907996,"about_ca_system_score_gemma":0.000040620685,"threshold_uncertainty_score":0.9998423},"labels":[],"label_agreement":null},{"id":"W4300056268","doi":"10.48550/arxiv.1803.06539","title":"The Graph Structure of Chebyshev Polynomials over Finite Fields and\\n Applications","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chebyshev polynomials; Mathematics; Chebyshev filter; Graph; Chebyshev nodes; Chebyshev equation; Gegenbauer polynomials; Finite field; Discrete mathematics; Orthogonal polynomials; Applied mathematics; Classical orthogonal polynomials; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.02886546373519731,"score_gpt":0.18013911963992482,"score_spread":0.15127365590472752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300056268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32222703,0.00021068659,0.67534,0.00008459467,0.00032842378,0.00031030225,0.00003884945,0.000098476645,0.0013616271],"genre_scores_gemma":[0.99896353,0.0002716244,0.00043617477,0.00007330474,0.00008933908,0.0000010748756,0.0000037150573,0.0000064811084,0.00015477171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998952,0.00010293089,0.00015417008,0.0005435447,0.000059079546,0.00018828119],"domain_scores_gemma":[0.99807924,0.00032191136,0.00022598615,0.0011998098,0.00009738978,0.0000756517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018323184,0.0001801362,0.00019173895,0.00015722022,0.00028586233,0.00008942526,0.0015242853,0.00022089358,0.000023806848],"category_scores_gemma":[0.000019229768,0.00015728254,0.00016652604,0.0005023677,0.00032577146,0.00011752029,0.0013304496,0.0003175788,0.0000036969618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000320021,0.000026526091,0.0020303498,0.00004875616,0.0001246123,0.0000043255313,0.0002741882,0.00298516,0.00012344554,0.9914139,0.00034873336,0.0025880083],"study_design_scores_gemma":[0.00023701199,0.000055740347,0.003195175,0.00004177173,0.00006847986,0.0000017499444,0.000043778025,0.011229017,0.000697466,0.9804901,0.0036418356,0.000297861],"about_ca_topic_score_codex":0.000031225678,"about_ca_topic_score_gemma":0.000046223686,"teacher_disagreement_score":0.6767365,"about_ca_system_score_codex":0.000014757236,"about_ca_system_score_gemma":0.00006072479,"threshold_uncertainty_score":0.6413796},"labels":[],"label_agreement":null},{"id":"W4303647666","doi":"10.1145/3567428","title":"Design Space Exploration of Galois and Fibonacci Configuration Based on Espresso Stream Cipher","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Stream cipher; Cipher; Cryptography; Parallel computing; Fibonacci number; Field-programmable gate array; Theoretical computer science; Arithmetic; Embedded system; Algorithm; Encryption; Computer network; Mathematics; Discrete mathematics","score_opus":0.029275299881515227,"score_gpt":0.2330761123535786,"score_spread":0.2038008124720634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4303647666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017577523,0.00029155667,0.97751415,0.0025309396,0.00031940304,0.0004951862,0.000015031455,0.00028693562,0.0009692972],"genre_scores_gemma":[0.99758065,0.000042097283,0.0017759168,0.000059694437,0.00000515465,0.0002927286,0.0000028991572,0.000009188721,0.00023167938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872833,0.00027802796,0.0002598817,0.00039091118,0.00016963374,0.00017321661],"domain_scores_gemma":[0.9987238,0.0003620385,0.0001489934,0.0006649215,0.000059520647,0.00004073531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000532673,0.00015290065,0.00022632266,0.0007159856,0.00051911257,0.00005897417,0.00038748537,0.00012914419,0.000071058654],"category_scores_gemma":[0.000024975609,0.00015434329,0.000041091447,0.0007477796,0.00009766075,0.00029518054,0.000008782735,0.00029009205,0.0000031614272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077515113,0.0008736347,0.00030212753,0.00022709322,0.00024255084,0.00002531691,0.0019616093,0.19304101,0.030401127,0.48827356,0.00044866014,0.28342816],"study_design_scores_gemma":[0.005075655,0.009950734,0.00036198806,0.00048259157,0.00017369699,0.00022904323,0.0068998574,0.49017107,0.31878716,0.15456542,0.011733809,0.0015689764],"about_ca_topic_score_codex":0.00002549498,"about_ca_topic_score_gemma":0.000003803296,"teacher_disagreement_score":0.9800031,"about_ca_system_score_codex":0.000026623458,"about_ca_system_score_gemma":0.00003823048,"threshold_uncertainty_score":0.62939364},"labels":[],"label_agreement":null},{"id":"W43061790","doi":"10.1007/978-3-642-30615-0_18","title":"Word-Oriented Transformation Shift Registers and Their Linear Complexity","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shift register; Transformation (genetics); Computer science; Word (group theory); Arithmetic; Time complexity; Word length; Linear map; Algorithm; Mathematics; Natural language processing; Pure mathematics; Telecommunications","score_opus":0.028436077941673105,"score_gpt":0.24101112186937168,"score_spread":0.21257504392769858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43061790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006752695,0.0006545093,0.9936905,0.00096726016,0.0010579616,0.00032483292,0.000008081453,0.00020670255,0.002414904],"genre_scores_gemma":[0.80236083,0.000097065684,0.19561215,0.0014017898,0.0004373756,0.0000089604555,0.0000126428195,0.00003261078,0.00003654905],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974991,0.00006033057,0.00043011265,0.0009320868,0.00047994335,0.00059843366],"domain_scores_gemma":[0.99810183,0.00032918376,0.00021880986,0.0010308555,0.00010103884,0.00021828014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011352901,0.0004890161,0.00044028895,0.00069989084,0.00037239658,0.00030070083,0.0017174745,0.00023978276,0.000015270716],"category_scores_gemma":[0.000023543336,0.00040705176,0.00014566934,0.0005977566,0.0012416474,0.000965885,0.00060703454,0.0006710957,0.000014254156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000134921,0.000021801634,0.00005112006,0.000041306303,0.000010829066,0.000004893114,0.005428662,0.00027709015,0.00003342271,0.33073238,0.0000030892054,0.66338193],"study_design_scores_gemma":[0.00047098577,0.00020606775,0.0006459912,0.00045035503,0.000013394825,0.000083497136,0.0000014546596,0.17181389,0.00080628676,0.8133068,0.011206415,0.0009948432],"about_ca_topic_score_codex":0.000013859737,"about_ca_topic_score_gemma":0.00006113047,"teacher_disagreement_score":0.8016856,"about_ca_system_score_codex":0.00009067022,"about_ca_system_score_gemma":0.00012328076,"threshold_uncertainty_score":0.9998381},"labels":[],"label_agreement":null},{"id":"W4307434441","doi":"10.1007/s11128-022-03712-5","title":"A new post-quantum multivariate polynomial public key encapsulation algorithm","year":2022,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Quantropi (Canada)","funders":"","keywords":"Univariate; Mathematics; Irreducible polynomial; Polynomial; Finite field; Cryptosystem; Discrete mathematics; Public-key cryptography; Multivariate statistics; Matrix polynomial; Algorithm; Cryptography; Computer science; Encryption; Statistics; Mathematical analysis","score_opus":0.014076099941054276,"score_gpt":0.23242338599106852,"score_spread":0.21834728605001424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307434441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012654529,0.000085839645,0.9829177,0.0018504817,0.00075969106,0.00020380584,0.000013030447,0.00053749635,0.0009774019],"genre_scores_gemma":[0.9547913,0.0000018434274,0.043695696,0.0012443525,0.00009308106,0.00004105061,0.00008256231,0.000010241549,0.000039884882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812496,0.00012709803,0.0005433086,0.00023354833,0.0005837443,0.0003873599],"domain_scores_gemma":[0.9988187,0.000052183088,0.0004296533,0.000335946,0.00020988207,0.00015364237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082054513,0.00018675411,0.00015741723,0.0005881523,0.0012388236,0.001000501,0.00086472835,0.000054768687,0.00013931376],"category_scores_gemma":[0.00008594144,0.00019642602,0.00009798482,0.0013544864,0.000027819953,0.007944746,0.0004263127,0.0003006893,0.00006535891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023392637,0.000039143462,0.000043379365,0.000025704729,0.0000112937105,0.0000016906973,0.008878423,0.00038397542,0.0003225675,0.19464056,0.000860331,0.7947695],"study_design_scores_gemma":[0.0007786075,0.00018274046,0.0009412028,0.000015463856,0.000007816018,0.000056973364,0.00088240876,0.93005264,0.00017833701,0.019474875,0.047066174,0.00036276624],"about_ca_topic_score_codex":0.00006139033,"about_ca_topic_score_gemma":7.199317e-7,"teacher_disagreement_score":0.94213676,"about_ca_system_score_codex":0.00010366706,"about_ca_system_score_gemma":0.00049387873,"threshold_uncertainty_score":0.9647854},"labels":[],"label_agreement":null},{"id":"W4307648411","doi":"10.1007/s10623-022-01133-0","title":"Several secondary methods for constructing bent–negabent functions","year":2022,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Bent molecular geometry; Boolean function; Bent function; Hadamard transform; Elementary function; Function (biology); Class (philosophy); Mathematics; Discrete mathematics; Computer science; Structural engineering; Mathematical analysis; Artificial intelligence; Engineering","score_opus":0.029170421387386722,"score_gpt":0.29509345325435093,"score_spread":0.2659230318669642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307648411","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010952943,0.0009927601,0.98468834,0.00024471906,0.0007187586,0.00038152066,0.000059311224,0.0002622702,0.0016994049],"genre_scores_gemma":[0.28525838,0.000029989425,0.71343434,0.0007288189,0.00006981019,0.00039558252,0.000022608925,0.000020670064,0.00003981927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981124,0.00041575477,0.00029096956,0.0005769674,0.00017998979,0.0004239208],"domain_scores_gemma":[0.99864495,0.0005834358,0.00013010026,0.00042503874,0.000069034366,0.00014744748],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012233173,0.00022423553,0.00026163997,0.00045220484,0.0015310049,0.00024780715,0.0005507079,0.00004653826,0.0001462001],"category_scores_gemma":[0.000020846146,0.00023398861,0.0003341497,0.0010279244,0.00014955857,0.00029306897,0.00037875056,0.00028985296,9.4906005e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005933974,0.0000918167,0.0008478711,0.00002978584,0.00014721544,0.0000033776248,0.0007787649,0.00010845549,0.002943164,0.6994608,0.0014247353,0.2941047],"study_design_scores_gemma":[0.0023920422,0.0017257843,0.0011857662,0.000026480671,0.00016783236,0.00034239024,0.0041639535,0.019962432,0.00218276,0.6175317,0.34902778,0.0012910746],"about_ca_topic_score_codex":0.0000086592645,"about_ca_topic_score_gemma":0.0000021600931,"teacher_disagreement_score":0.34760302,"about_ca_system_score_codex":0.000017506016,"about_ca_system_score_gemma":0.000059921247,"threshold_uncertainty_score":0.99976885},"labels":[],"label_agreement":null},{"id":"W4307815954","doi":"10.1016/j.ffa.2022.102114","title":"Two-weight or three-weight binary linear codes from cyclotomic mappings","year":2022,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Construct (python library); Linear code; Binary number; Weight distribution; Discrete mathematics; Secret sharing; Block code; Cryptography; Algorithm; Arithmetic; Computer science; Decoding methods","score_opus":0.015861239519083786,"score_gpt":0.2287484881883779,"score_spread":0.21288724866929412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307815954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046965748,0.00061420986,0.9459894,0.002157882,0.00016608053,0.00039770553,0.000207419,0.00028918596,0.003212394],"genre_scores_gemma":[0.987794,0.000088297704,0.009811233,0.0011230309,0.00018706801,0.0006961292,0.00006656068,0.000012657414,0.00022106187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990486,0.000059241556,0.00018603298,0.00040697056,0.00010563069,0.00019354845],"domain_scores_gemma":[0.9986898,0.00048565594,0.00007837309,0.00064055936,0.000026143452,0.00007951786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017189833,0.0001493229,0.00015630088,0.00011663022,0.00074390415,0.00007309897,0.00077041093,0.000048965972,0.0003574774],"category_scores_gemma":[0.000005651315,0.00011871188,0.000082857965,0.000553413,0.00006172877,0.00011972392,0.0005762913,0.00027026382,0.000025564332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008165405,0.00032262676,0.0014876775,0.000017316203,0.000120602286,0.0000108614095,0.002724336,0.00026712372,0.0014478954,0.9322208,0.0020007328,0.05929833],"study_design_scores_gemma":[0.0006079656,0.00021724054,0.0011089067,0.000015322606,0.000020820264,0.000019195064,0.00020294114,0.057532277,0.00057981093,0.5074009,0.43186864,0.00042598372],"about_ca_topic_score_codex":0.00006289707,"about_ca_topic_score_gemma":0.00002863778,"teacher_disagreement_score":0.9408282,"about_ca_system_score_codex":0.000010554392,"about_ca_system_score_gemma":0.000035867346,"threshold_uncertainty_score":0.57215846},"labels":[],"label_agreement":null},{"id":"W4308166550","doi":"10.48550/arxiv.2211.00897","title":"On the equivalence of linear cyclic and constacyclic codes","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equivalence (formal languages); Mathematics; Computer science; Discrete mathematics","score_opus":0.0758015718727185,"score_gpt":0.1971062776511119,"score_spread":0.1213047057783934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308166550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88188535,0.00009704663,0.112661645,0.00018312853,0.000244463,0.0001923999,0.000023155148,0.00010226381,0.0046105566],"genre_scores_gemma":[0.9990977,0.00024844898,0.00029109194,0.00016429929,0.000014169472,0.000001141994,0.0000021425958,0.000007023018,0.00017395956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986277,0.00030545864,0.0001386742,0.0006363707,0.00009767901,0.00019408067],"domain_scores_gemma":[0.99779946,0.00076579174,0.00020652366,0.0011155886,0.000044222525,0.00006843007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004598394,0.00018987457,0.0002268503,0.00019242654,0.00028579493,0.000043140742,0.0017919876,0.00008403628,0.00010245184],"category_scores_gemma":[0.000055018,0.00017081945,0.00016210199,0.00053011446,0.0003653687,0.00010098916,0.0026856456,0.00052301295,0.000007164312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029940897,0.000052694926,0.0012517108,0.000034678753,0.00004974018,0.00003900583,0.00026992086,0.0066813184,0.000073054944,0.9911077,0.00007194044,0.00033831425],"study_design_scores_gemma":[0.00035553568,0.00023334024,0.0012430471,0.00014368375,0.000072260205,0.000005752125,0.0003025145,0.06774453,0.00059504615,0.9279285,0.00092964893,0.0004461564],"about_ca_topic_score_codex":0.000032961434,"about_ca_topic_score_gemma":0.0000042570446,"teacher_disagreement_score":0.11721238,"about_ca_system_score_codex":0.000030614556,"about_ca_system_score_gemma":0.00006632273,"threshold_uncertainty_score":0.6965815},"labels":[],"label_agreement":null},{"id":"W4311209563","doi":"10.1007/s12095-022-00616-0","title":"Self-dual and LCD double circulant and double negacirculant codes over a family of finite rings $ \\mathbb {F}_{q}[v_{1}, v_{2},\\dots ,v_{t}]$","year":2022,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Circulant matrix; Dual (grammatical number); Finite field; Physics; Discrete mathematics; Arithmetic; Crystallography; Combinatorics; Mathematics; Chemistry; Art","score_opus":0.02588309565317558,"score_gpt":0.24789743877748394,"score_spread":0.22201434312430834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311209563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96114576,0.01440597,0.01742773,0.00096827844,0.00015895144,0.00064097426,0.000114346585,0.0003938839,0.0047441255],"genre_scores_gemma":[0.9853929,0.0026598836,0.011348249,0.0003531314,0.000014596735,0.00017724268,0.000028163216,0.000017731289,0.00000809416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813306,0.00025172363,0.00043300877,0.0005131576,0.00031366578,0.00035537442],"domain_scores_gemma":[0.9972948,0.00040314323,0.00023549685,0.0017896023,0.00009030991,0.00018665715],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007110301,0.00027368372,0.00037282004,0.00052544224,0.0014830775,0.00026365256,0.0012393583,0.00007718898,0.0000150061105],"category_scores_gemma":[0.0000075085254,0.0002856769,0.00016609958,0.0012833168,0.00058382703,0.0004400205,0.0021467416,0.00042761283,0.0000010759439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105682615,0.00050513895,0.01494616,0.00011566804,0.00025765868,0.000006462757,0.008512778,0.00003276917,0.0023841758,0.96833605,0.00017895337,0.004618491],"study_design_scores_gemma":[0.020869657,0.0023548913,0.2301464,0.0005224326,0.0010401756,0.00090413244,0.010333815,0.0472508,0.002111568,0.4395426,0.24052821,0.0043953396],"about_ca_topic_score_codex":0.00015944088,"about_ca_topic_score_gemma":0.000028295897,"teacher_disagreement_score":0.52879345,"about_ca_system_score_codex":0.000014140078,"about_ca_system_score_gemma":0.000059264174,"threshold_uncertainty_score":0.9999595},"labels":[],"label_agreement":null},{"id":"W4311555247","doi":"","title":"Stochastic Chase Decoder for Reed-Solomon Codes","year":2012,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Reed–Solomon error correction; Decoding methods; Parallel computing; Algorithm; Concatenated error correction code; Block code","score_opus":0.01547421244656132,"score_gpt":0.23462077809485193,"score_spread":0.2191465656482906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311555247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032174103,0.000572908,0.9568825,0.002736107,0.00022723862,0.00026240895,0.000011769186,0.00028354579,0.0068494235],"genre_scores_gemma":[0.8872499,0.00001825181,0.1114469,0.00016967232,0.000029033454,0.00007028965,0.000026447551,0.000016542757,0.0009729582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735665,0.0013400764,0.00025593195,0.0003771964,0.0002152331,0.00045488134],"domain_scores_gemma":[0.99591136,0.0017460152,0.00016527028,0.0013144431,0.00064541417,0.00021750927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048342855,0.00016739167,0.00017849935,0.0001471732,0.00044221306,0.00023247855,0.0011753475,0.00008352502,0.000034891837],"category_scores_gemma":[0.00080218964,0.00017596465,0.00015398205,0.0004616942,0.00013404942,0.00049195916,0.00035500436,0.0001400982,0.000039528226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011220239,0.00036165965,0.0005304797,0.000019731508,0.000024618721,3.817422e-7,0.0061606904,0.000015580967,0.0020722253,0.9283524,0.00051365094,0.061937347],"study_design_scores_gemma":[0.006171015,0.000012623911,0.015227592,0.0019897106,0.00022557272,0.00015299967,0.0008173727,0.3177205,0.2600306,0.29512542,0.09901817,0.003508412],"about_ca_topic_score_codex":0.00004899657,"about_ca_topic_score_gemma":0.0001152579,"teacher_disagreement_score":0.8550758,"about_ca_system_score_codex":0.000030611325,"about_ca_system_score_gemma":0.000050369425,"threshold_uncertainty_score":0.71756303},"labels":[],"label_agreement":null},{"id":"W4312608599","doi":"10.3934/amc.2022083","title":"Improved lower bounds for self-dual codes over $ \\mathbb{F}_{11} $, $ \\mathbb{F}_{13} $, $ \\mathbb{F}_{17} $, $ \\mathbb{F}_{19} $ and $ \\mathbb{F}_{23} $","year":2022,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dual (grammatical number)","score_opus":0.016897714460177005,"score_gpt":0.3018250839024632,"score_spread":0.2849273694422862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312608599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2829517,0.04864464,0.617821,0.008306698,0.0035086172,0.010714418,0.001982081,0.0039052032,0.022165645],"genre_scores_gemma":[0.5982219,0.0036609485,0.39429286,0.0006537161,0.00010223838,0.002163374,0.00015755676,0.00017360236,0.000573814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935342,0.00063846755,0.002288524,0.0012380496,0.0010690104,0.0012317447],"domain_scores_gemma":[0.9878386,0.003929342,0.0014669719,0.0059616957,0.00042535967,0.000378025],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0035525854,0.00093653944,0.0014730573,0.0010454034,0.0018919568,0.00040761882,0.0062754233,0.0002641912,0.000093823335],"category_scores_gemma":[0.00055640977,0.0010010055,0.00060601195,0.0021872555,0.0011018394,0.0023226636,0.0045963693,0.0009782759,0.000011367206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012519625,0.0037920978,0.0009296654,0.001036258,0.00024664286,0.0000132725845,0.011256378,0.00062043226,0.0023356765,0.9728254,0.002213732,0.0046052416],"study_design_scores_gemma":[0.0042330096,0.0012155297,0.00049589435,0.00044054777,0.00028490383,0.00022907494,0.0037565874,0.18755049,0.00066918996,0.6620145,0.13695993,0.0021503365],"about_ca_topic_score_codex":0.000043358927,"about_ca_topic_score_gemma":0.00029418003,"teacher_disagreement_score":0.3152702,"about_ca_system_score_codex":0.00028393514,"about_ca_system_score_gemma":0.000352589,"threshold_uncertainty_score":0.9994075},"labels":[],"label_agreement":null},{"id":"W4312939501","doi":"10.1145/3572867.3572881","title":"Factoring non-monic polynomials represented by black boxes","year":2022,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monic polynomial; Factorization; Factoring; Subroutine; Mathematics; Square (algebra); Maple; Black box; Polynomial; Computer science; Combinatorics; Algorithm; Discrete mathematics; Algebra over a field; Pure mathematics; Programming language; Artificial intelligence","score_opus":0.02913105223767142,"score_gpt":0.28632427609355016,"score_spread":0.2571932238558787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312939501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.353591,0.001714246,0.6233305,0.016228838,0.0011328678,0.0007768628,0.000034954268,0.000819401,0.0023713608],"genre_scores_gemma":[0.9318346,0.000111332556,0.067026906,0.0007581352,0.00003952442,0.00012290844,0.000032174958,0.000017003711,0.00005742348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977892,0.0006008363,0.00045918234,0.0005002251,0.00028278775,0.0003677459],"domain_scores_gemma":[0.99176294,0.00096477236,0.00016028967,0.0069871037,0.000043673117,0.00008120451],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0008232212,0.00019267503,0.00024626058,0.00035182305,0.00069274876,0.00021328295,0.010704254,0.000045146186,0.000044970548],"category_scores_gemma":[0.000052060725,0.00022688616,0.00013322617,0.0014284017,0.0001641044,0.00043112706,0.012849316,0.0005976883,0.000030226583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008304563,0.004032481,0.045898322,0.000060476064,0.0004719781,0.000047218004,0.035974868,0.0060707796,0.007920112,0.4179306,0.09088499,0.39062512],"study_design_scores_gemma":[0.0030821485,0.0007080896,0.027181536,0.00014050529,0.000041242798,0.0000899863,0.0005803802,0.47628742,0.0025687634,0.20108974,0.28606474,0.002165434],"about_ca_topic_score_codex":0.00011198274,"about_ca_topic_score_gemma":0.000013435948,"teacher_disagreement_score":0.5782436,"about_ca_system_score_codex":0.00011792641,"about_ca_system_score_gemma":0.00006199718,"threshold_uncertainty_score":0.9951346},"labels":[],"label_agreement":null},{"id":"W4313036617","doi":"10.5486/pmd.2004.3190","title":"On the greatest and least prime factors of $n!+1$. II.","year":2004,"lang":"en","type":"article","venue":"Publicationes Mathematicae Debrecen","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Prime (order theory); Combinatorics","score_opus":0.018479221465145395,"score_gpt":0.21125601287628681,"score_spread":0.19277679141114143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313036617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.864979,0.00005818025,0.1069741,0.018424936,0.000059038306,0.00036267983,0.000004810049,0.00021640358,0.00892084],"genre_scores_gemma":[0.9960619,0.000005312404,0.0036795933,0.00015648693,0.000008128765,0.000018782308,0.000001989636,0.0000065224863,0.00006124034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992499,0.00003498212,0.00019256807,0.00019871026,0.00018598195,0.00013787654],"domain_scores_gemma":[0.99875534,0.00034071956,0.0001264085,0.00063335936,0.00008754357,0.00005660938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032802555,0.000108239416,0.00012710925,0.00010870928,0.00020809483,0.00010013528,0.0006710322,0.000032908516,0.000034536213],"category_scores_gemma":[0.00025389393,0.00006658854,0.00004920176,0.00048924866,0.00011207087,0.0002665859,0.0001651591,0.000068643196,0.000022857788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015296673,0.00011629256,0.00023297753,0.000011617865,0.000013666022,6.909027e-8,0.0015786587,0.000002500715,0.00021046195,0.99606127,0.00006415869,0.0017067736],"study_design_scores_gemma":[0.00019222303,0.00009652334,0.008944379,0.000049491344,0.000009627081,0.000010281009,0.000101674,0.00045413707,0.005673406,0.9837898,0.00054546515,0.00013301158],"about_ca_topic_score_codex":0.000004398379,"about_ca_topic_score_gemma":9.953793e-7,"teacher_disagreement_score":0.13108294,"about_ca_system_score_codex":0.000011420856,"about_ca_system_score_gemma":0.000026378259,"threshold_uncertainty_score":0.27154016},"labels":[],"label_agreement":null},{"id":"W4315607727","doi":"10.1016/j.jat.2023.105866","title":"On maximal autocorrelations of Rudin–Shapiro sequences","year":2023,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Autocorrelation; Aperiodic graph; Mathematical proof; Sequence (biology); Algebraic number; Spectral radius; Translation (biology); Connection (principal bundle); Order (exchange); Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Statistics","score_opus":0.02071554068216593,"score_gpt":0.258096093016961,"score_spread":0.23738055233479508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315607727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20598489,0.000059998427,0.7860999,0.0008655035,0.0005689012,0.00013293563,0.0000031373922,0.0001075952,0.0061771045],"genre_scores_gemma":[0.98845917,0.0000128326965,0.011263082,0.00009272273,0.00005673013,0.00000429882,0.0000010828571,0.0000057549287,0.000104324026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987751,0.0002152485,0.00042990618,0.00010599692,0.00034740887,0.00012633803],"domain_scores_gemma":[0.99841535,0.00063159416,0.00051656127,0.00022714157,0.00015623256,0.000053109714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002164055,0.00008483211,0.0001641362,0.00054408464,0.00010114873,0.000047051453,0.0005513328,0.000046682537,0.000051030114],"category_scores_gemma":[0.00023350005,0.00006782134,0.00016622491,0.0009054048,0.00008156937,0.0005039448,0.00005746393,0.00016540076,0.000037291735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004743211,0.000049276492,0.00006253244,0.000013842048,0.000027068774,0.0000057975976,0.00094264117,0.0018295214,0.0010012102,0.98040646,0.000526379,0.015087815],"study_design_scores_gemma":[0.00024815486,0.0002746142,0.0017967956,0.000077324024,0.000011556828,0.00002990351,0.00018036201,0.012371205,0.0023048578,0.98238283,0.00024521397,0.00007718915],"about_ca_topic_score_codex":3.092577e-7,"about_ca_topic_score_gemma":1.007408e-7,"teacher_disagreement_score":0.7824743,"about_ca_system_score_codex":0.000018721139,"about_ca_system_score_gemma":0.000060905088,"threshold_uncertainty_score":0.2765674},"labels":[],"label_agreement":null},{"id":"W4319302639","doi":"10.1109/tit.2023.3242612","title":"Improved Error Bounds for the Distance Distribution of Reed-Solomon Codes","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Reed–Solomon error correction; Mathematics; Finite field; Reed–Muller code; Factorial; Linear code; Simple (philosophy); Distribution (mathematics); Discrete mathematics; Error detection and correction; Function (biology); Combinatorics; Decoding methods; Block code; Algorithm; Mathematical analysis","score_opus":0.013738735108576653,"score_gpt":0.245341328404443,"score_spread":0.23160259329586635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319302639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031484521,0.000012507177,0.99476177,0.00032816874,0.0007002292,0.00034441878,0.00022088486,0.0002712121,0.00021233445],"genre_scores_gemma":[0.9989911,0.000023884206,0.000523866,0.00012739343,0.000013844289,0.00017830804,0.000029237815,0.000004527622,0.0001078883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991611,0.00006861324,0.0003152348,0.00010790136,0.00016172825,0.00018536838],"domain_scores_gemma":[0.9985278,0.0007251315,0.00015241139,0.00043390665,0.00012645619,0.000034273922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010500018,0.00010332255,0.00010756325,0.00014007668,0.0004758847,0.000096444186,0.00047683562,0.000057473615,0.000008828175],"category_scores_gemma":[0.0000263351,0.00008168405,0.0001642783,0.0007775861,0.0001322523,0.0010148502,0.0000033192885,0.000115395145,0.000024705796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035786882,0.000053138127,0.0000024402625,0.00007169642,0.00006961509,1.03266544e-7,0.00282453,0.008609697,0.0004394732,0.7610133,0.00043288883,0.22612523],"study_design_scores_gemma":[0.001865721,0.00080308877,0.0008382193,0.000118403696,0.000109943074,0.0000089864725,0.0027004299,0.65588313,0.06719158,0.24919078,0.020692991,0.00059673755],"about_ca_topic_score_codex":0.0000045984875,"about_ca_topic_score_gemma":0.000005888401,"teacher_disagreement_score":0.9958426,"about_ca_system_score_codex":0.000029473436,"about_ca_system_score_gemma":0.000034301505,"threshold_uncertainty_score":0.36601686},"labels":[],"label_agreement":null},{"id":"W4321015079","doi":"10.1007/s12095-022-00623-1","title":"Comparing balanced sequences obtained from ElGamal function to random balanced sequences","year":2023,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"ElGamal encryption; Mathematics; Combinatorics; Discrete mathematics; Randomness; Modulo; Function (biology); Random function; Golomb coding; Prime (order theory); Sequence (biology); Random variable; Computer science; Public-key cryptography","score_opus":0.039306736832341094,"score_gpt":0.2698127270029333,"score_spread":0.2305059901705922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321015079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5875821,0.0016859492,0.39741084,0.0047427425,0.000522373,0.00053718744,0.000039334238,0.0015901474,0.0058892914],"genre_scores_gemma":[0.9762305,0.00063698145,0.022268668,0.0005407368,0.000051592375,0.00016712071,0.00008048542,0.000010957285,0.000012954859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817294,0.00033705056,0.00035434336,0.0005032463,0.00024297419,0.00038942802],"domain_scores_gemma":[0.9970522,0.0007104594,0.00012306702,0.0018019875,0.00011059025,0.00020168755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059386203,0.00023156253,0.0003191129,0.0005131633,0.0010582497,0.00038795487,0.002148748,0.00008511954,0.000019378107],"category_scores_gemma":[0.000054862066,0.00022412384,0.00017566161,0.0032009736,0.00032884002,0.00053531554,0.0007580271,0.00025911475,0.000055830213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022948765,0.00015044434,0.08018717,0.000026267053,0.00029596002,0.0000050634167,0.0055373716,0.0004195586,0.013334524,0.8490877,0.0013475397,0.04937889],"study_design_scores_gemma":[0.0028191332,0.00039130304,0.28232813,0.0002797747,0.00011650716,0.000008613671,0.0024229551,0.036349315,0.0010430182,0.6482523,0.024823332,0.0011655997],"about_ca_topic_score_codex":0.00014623122,"about_ca_topic_score_gemma":0.00013755674,"teacher_disagreement_score":0.38864836,"about_ca_system_score_codex":0.000012840386,"about_ca_system_score_gemma":0.000039763534,"threshold_uncertainty_score":0.9139505},"labels":[],"label_agreement":null},{"id":"W4323359295","doi":"10.2478/tmmp-2023-0001","title":"Irreducibility and Multiplicative Composition of Polynomials Over Finite Fields","year":2023,"lang":"en","type":"article","venue":"Tatra Mountains Mathematical Publications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Multiplicative function; Irreducibility; Prime (order theory); Modulo; Pure mathematics; Composition (language); Multiplicative group; Finite field; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.03050358314027969,"score_gpt":0.29826170415397063,"score_spread":0.26775812101369095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323359295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38203624,0.000019541816,0.607045,0.0063941926,0.00003905007,0.00036695335,0.000037409813,0.00042964186,0.0036319874],"genre_scores_gemma":[0.98626184,0.000006260176,0.01336619,0.00012775492,0.000018019948,0.00008611961,0.000017777034,0.0000062665417,0.000109739056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887526,0.00008642068,0.000334221,0.00033061142,0.00017377536,0.0001997409],"domain_scores_gemma":[0.9977456,0.0011649791,0.00011655253,0.0007547491,0.00010854131,0.00010957622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006550554,0.000107551015,0.00018543661,0.00024189206,0.00015233521,0.00010323068,0.00045613697,0.00006613683,0.00005487984],"category_scores_gemma":[0.00031073706,0.00009910304,0.00008200354,0.0010705306,0.00020454366,0.00039693018,0.00021434866,0.00010726038,0.000046288602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003805371,0.00016847234,0.00039652453,0.000046095425,0.000020040741,2.1249012e-7,0.0013766242,0.00002270752,0.0013390498,0.9937578,0.00069377414,0.0021749325],"study_design_scores_gemma":[0.0003208183,0.00007883326,0.044441577,0.000034523768,0.000021808788,0.000005888169,0.00016827187,0.067110054,0.0015137644,0.88543236,0.0006572801,0.00021480986],"about_ca_topic_score_codex":0.0000064504147,"about_ca_topic_score_gemma":0.0000017689177,"teacher_disagreement_score":0.60422564,"about_ca_system_score_codex":0.000017334844,"about_ca_system_score_gemma":0.000035342153,"threshold_uncertainty_score":0.40413046},"labels":[],"label_agreement":null},{"id":"W4324056828","doi":"10.1016/j.ffa.2023.102180","title":"On the functional graph of f(X)=c(Xq+1 + aX2) over quadratic extensions of finite fields","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Finite field; Quadratic equation; Graph; Combinatorics; Field (mathematics); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.024333156700218014,"score_gpt":0.22919570255133512,"score_spread":0.2048625458511171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324056828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0804367,0.00009111832,0.91240865,0.0028141541,0.0001151783,0.00028365466,0.000052131803,0.000097445176,0.0037009593],"genre_scores_gemma":[0.9988327,0.00006575047,0.00026900505,0.00053112133,0.000029365887,0.00012069596,0.000010629554,0.0000046731834,0.00013606013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993025,0.000048717862,0.00020770868,0.00020210209,0.00011324156,0.00012572114],"domain_scores_gemma":[0.9968617,0.002348044,0.00009514014,0.00059288775,0.00006334054,0.000038908616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024177371,0.00009998261,0.00012948396,0.00015814549,0.00021982983,0.000024262867,0.0003383999,0.00007529347,0.00008767365],"category_scores_gemma":[0.000057057885,0.0000661216,0.000117347285,0.00090807345,0.00010328376,0.000058716818,0.00012493209,0.00015431596,0.000015685844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007695382,0.000056522837,0.00012073843,0.000013936477,0.000026906675,2.2271551e-7,0.00057517766,0.00041919277,0.00024039997,0.99235463,0.001540637,0.0046439446],"study_design_scores_gemma":[0.00017636573,0.00015476871,0.007530937,0.00004427133,0.000013159267,0.000001328455,0.00017078924,0.015811423,0.00086577865,0.97104394,0.0040535326,0.0001336759],"about_ca_topic_score_codex":0.000009685164,"about_ca_topic_score_gemma":0.000008483752,"teacher_disagreement_score":0.918396,"about_ca_system_score_codex":0.0000015013314,"about_ca_system_score_gemma":0.000019645438,"threshold_uncertainty_score":0.26963606},"labels":[],"label_agreement":null},{"id":"W4328003225","doi":"10.1142/s1005386723000147","title":"A Class of Quadratic Matrix Equations over Finite Fields","year":2022,"lang":"en","type":"article","venue":"Algebra Colloquium","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Cardinality (data modeling); Pure mathematics; Class (philosophy); Quadratic equation; Action (physics); Ideal (ethics); Matrix (chemical analysis); Finite field; Finite set; Set (abstract data type); Mathematical analysis; Discrete mathematics; Geometry","score_opus":0.011808009341182379,"score_gpt":0.2459260883841396,"score_spread":0.23411807904295723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328003225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23169065,0.00030146042,0.75681895,0.0025976973,0.0013170994,0.00036868764,0.000028931556,0.0002570392,0.0066195135],"genre_scores_gemma":[0.99650323,0.0000030739068,0.002128861,0.00058509095,0.000028481018,0.00007006269,0.0000039000606,0.0000067937817,0.00067050866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988181,0.00017579476,0.00024329836,0.00023737186,0.00032556828,0.00019987328],"domain_scores_gemma":[0.99866927,0.00055060774,0.000115968265,0.00057162816,0.00004019522,0.00005234915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040494182,0.000097479904,0.00014825845,0.00019703408,0.00029008565,0.000052722047,0.00082146033,0.00003301796,0.00053437497],"category_scores_gemma":[0.00006951037,0.00010523969,0.00013957355,0.0011389245,0.000043876305,0.0002006025,0.0004968124,0.00016725755,0.000017125738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015592652,0.00010870605,0.0003126736,0.000012127258,0.000029753024,0.000007185545,0.0010782313,0.0012614772,0.00050903717,0.9927204,0.002788303,0.0011564916],"study_design_scores_gemma":[0.001819525,0.0015020279,0.0023570275,0.000034291847,0.00008596556,0.000024006149,0.0006408283,0.21736681,0.0021800406,0.71781725,0.055304214,0.00086802593],"about_ca_topic_score_codex":0.000020957521,"about_ca_topic_score_gemma":0.000013571127,"teacher_disagreement_score":0.7648126,"about_ca_system_score_codex":0.000023872804,"about_ca_system_score_gemma":0.000102942715,"threshold_uncertainty_score":0.5851031},"labels":[],"label_agreement":null},{"id":"W4361269916","doi":"10.1002/jcd.21882","title":"Ordered covering arrays and upper bounds on covering codes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Ciência sem Fronteiras; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Ministério da Ciência, Tecnologia e Inovação; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Upper and lower bounds; Combinatorics; Concatenation (mathematics); Cartesian product; Hamming code; Hamming distance; Discrete mathematics; Connection (principal bundle); Product (mathematics); Block code; Algorithm; Decoding methods; Geometry","score_opus":0.02489971877531201,"score_gpt":0.2561583306077486,"score_spread":0.23125861183243662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361269916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.808066,0.00015995662,0.17943466,0.00058466906,0.009141016,0.0001283495,0.0000021498543,0.00018301135,0.0023001966],"genre_scores_gemma":[0.99809605,0.00008431393,0.001364584,0.00009019076,0.0003169828,0.0000016809228,2.6955522e-7,0.00001194583,0.000033957283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987281,0.0001341663,0.00031675334,0.00016870421,0.00039817663,0.00025407693],"domain_scores_gemma":[0.9988612,0.00044715547,0.00021161209,0.00022652226,0.00011668032,0.00013684452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010764422,0.00014230596,0.0002674961,0.00033427693,0.0002155961,0.00032843705,0.0005221395,0.000066214445,0.00000647384],"category_scores_gemma":[0.00012550702,0.00012750467,0.00012857406,0.00064026885,0.00005233991,0.00048349437,0.00012423247,0.00025085124,0.000013028203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019210363,0.000082860635,0.0009977915,0.000020524933,0.00007886987,0.000105051215,0.00063760346,0.00039610444,0.011103869,0.980904,0.0014384753,0.004042744],"study_design_scores_gemma":[0.004126923,0.0030025032,0.0059322636,0.00036533087,0.00005040986,0.00019279623,0.00019255001,0.0038663757,0.018561218,0.942591,0.020518227,0.00060041936],"about_ca_topic_score_codex":0.000002736706,"about_ca_topic_score_gemma":2.810529e-7,"teacher_disagreement_score":0.19003008,"about_ca_system_score_codex":0.000036252215,"about_ca_system_score_gemma":0.0000782279,"threshold_uncertainty_score":0.51994896},"labels":[],"label_agreement":null},{"id":"W4361760461","doi":"10.1007/978-3-031-29689-5_5","title":"Software Implementation of a Code-Based Key Encapsulation Mechanism from Binary QD Generalized Srivastava Codes","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Key encapsulation; Computer science; Cryptography; NIST; Theoretical computer science; Encryption; Public-key cryptography; Post-quantum cryptography; McEliece cryptosystem; Algorithm; Computer engineering; Symmetric-key algorithm; Computer security","score_opus":0.023902914797538918,"score_gpt":0.2659791799049679,"score_spread":0.24207626510742897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361760461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040804246,0.00012647797,0.99323463,0.00028408307,0.001328947,0.00042907035,0.000105368155,0.00035628193,0.00005468747],"genre_scores_gemma":[0.38301182,0.000037358663,0.61584085,0.0006464315,0.00024175408,0.000020606272,0.00011154602,0.000051793068,0.000037858954],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963716,0.00010590568,0.0006780483,0.0013203865,0.0010381804,0.00048587637],"domain_scores_gemma":[0.9970956,0.00077319104,0.00052522076,0.0012096651,0.0002746165,0.000121720164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010122522,0.00047527085,0.0005567288,0.0012013267,0.0002543751,0.00027462773,0.0022693507,0.00026184204,0.00006985275],"category_scores_gemma":[0.00005579092,0.0004705478,0.00023226724,0.0010993695,0.0003767495,0.00045472052,0.00077863404,0.0003793751,0.000019412802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004258461,0.000057651898,0.0002748057,0.0000889634,0.00006136739,0.000070889284,0.0027686,0.033394467,0.0065865978,0.26804698,0.000033205655,0.6885739],"study_design_scores_gemma":[0.0005713965,0.00024803926,0.000490868,0.00030665062,0.000021975842,0.0000033353833,0.000001033117,0.24710037,0.0138424225,0.7367848,0.00010911247,0.0005199768],"about_ca_topic_score_codex":0.00013918402,"about_ca_topic_score_gemma":0.00023794874,"teacher_disagreement_score":0.6880539,"about_ca_system_score_codex":0.00013214714,"about_ca_system_score_gemma":0.00048531237,"threshold_uncertainty_score":0.99977463},"labels":[],"label_agreement":null},{"id":"W4361988195","doi":"10.1007/978-3-031-30122-3_5","title":"A New Class of Trapdoor Verifiable Delay Functions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Verifiable secret sharing; Computer science; Class (philosophy); Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.018783626299062644,"score_gpt":0.2298494070743131,"score_spread":0.21106578077525046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361988195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006263836,0.00018858112,0.9892224,0.00040345814,0.0026227771,0.00022082178,0.000007918766,0.00028403633,0.0069873836],"genre_scores_gemma":[0.135831,0.000117401694,0.8516567,0.00151757,0.0012398955,0.000016244081,0.000014546174,0.00013145655,0.009475189],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701947,0.000032012213,0.0004776704,0.0011532927,0.0007700888,0.0005474568],"domain_scores_gemma":[0.9974399,0.00053179235,0.00024090456,0.0014323997,0.00015605032,0.00019894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078987767,0.00039585505,0.00047910825,0.0011879831,0.0002170702,0.00025563993,0.0030056136,0.00026976975,0.000054396365],"category_scores_gemma":[0.000057100973,0.00037468402,0.0002509621,0.0016830944,0.00049480394,0.0004354005,0.000872993,0.0006155257,0.00009191591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012860322,0.00002349241,0.000020847909,0.000037037153,0.000028485734,0.000045106437,0.0006497491,0.013415415,0.0002859037,0.2777915,0.00034842276,0.7073412],"study_design_scores_gemma":[0.00036650614,0.00042261314,0.00009895024,0.0004645952,0.00002275497,0.000056339017,4.607378e-7,0.117876336,0.0014316424,0.87070054,0.007825976,0.0007332862],"about_ca_topic_score_codex":0.0000352237,"about_ca_topic_score_gemma":0.000068154295,"teacher_disagreement_score":0.70660794,"about_ca_system_score_codex":0.00008323553,"about_ca_system_score_gemma":0.00071250985,"threshold_uncertainty_score":0.99987054},"labels":[],"label_agreement":null},{"id":"W4365506037","doi":"10.1016/j.ffa.2023.102198","title":"Zigzag polynomials, Artin's conjecture and trinomials","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Defence Academy","keywords":"Mathematics; Trinomial; Divisibility rule; Finite field; Combinatorics; Fibonacci number; Lucas sequence; Sequence (biology); Recursion (computer science); Order (exchange); Binomial coefficient; Discrete mathematics; Prime (order theory); Galois group; Pure mathematics; Fibonacci polynomials; Difference polynomials; Orthogonal polynomials","score_opus":0.012760571223991579,"score_gpt":0.22200973988702838,"score_spread":0.2092491686630368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365506037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1304658,0.0007539966,0.8515383,0.008837642,0.00014890007,0.0005720246,0.00007369955,0.00068313803,0.00692651],"genre_scores_gemma":[0.9982547,0.00015673804,0.00071305374,0.00045794324,0.00008735556,0.00012282813,0.000009572818,0.0000049851055,0.00019283556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994203,0.000028814991,0.00011942855,0.00024492748,0.000037382706,0.00014915464],"domain_scores_gemma":[0.9991619,0.00038612637,0.000040188414,0.00032579995,0.000015095526,0.00007086897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019068488,0.0000936165,0.00011171783,0.00010377772,0.00023465001,0.00011130481,0.00022451876,0.000074497184,0.000013834956],"category_scores_gemma":[0.000012627804,0.00007558473,0.0000390973,0.00041159647,0.000052068546,0.000081662714,0.00015852453,0.00009893358,0.000028712644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004248638,0.000017627894,0.00026259274,0.0000127546355,0.000018314582,9.0388136e-7,0.0009756841,0.00000806194,0.0005607068,0.8719052,0.0014799462,0.12475393],"study_design_scores_gemma":[0.0004643616,0.00011729087,0.0053883055,0.000018034192,0.000012285056,0.00001456464,0.00019344036,0.003988028,0.0020954642,0.68133557,0.3060267,0.00034593092],"about_ca_topic_score_codex":0.0000073719793,"about_ca_topic_score_gemma":0.0000053228705,"teacher_disagreement_score":0.86778885,"about_ca_system_score_codex":0.0000018040588,"about_ca_system_score_gemma":0.000012548757,"threshold_uncertainty_score":0.30822557},"labels":[],"label_agreement":null},{"id":"W4365506139","doi":"10.1016/j.ffa.2023.102207","title":"Generalized Lucas polynomials over finite fields","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Finite field; Permutation (music); Prime (order theory); Lucas sequence; Combinatorics; Field (mathematics); Difference polynomials; Discrete mathematics; Pure mathematics; Algebra over a field; Orthogonal polynomials; Fibonacci polynomials","score_opus":0.02085775382021079,"score_gpt":0.25358558741738507,"score_spread":0.23272783359717428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365506139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034928944,0.00025691156,0.9536173,0.0034651787,0.00020092654,0.00032525463,0.000048242655,0.00051541923,0.0066418527],"genre_scores_gemma":[0.9948682,0.0002388082,0.00180967,0.0015891482,0.00018603883,0.0002837446,0.00003004646,0.000010397732,0.0009839085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991181,0.00004645375,0.00018881101,0.00033038954,0.00007724781,0.00023903609],"domain_scores_gemma":[0.99858963,0.00061004516,0.0000579632,0.00061943085,0.000030195284,0.000092713875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023176231,0.00013956199,0.00015118583,0.00016351622,0.0003075175,0.00014534501,0.00048025115,0.00012710798,0.0000965307],"category_scores_gemma":[0.000023176095,0.000118009106,0.000103148865,0.00076749385,0.00004691583,0.00013315116,0.00023966408,0.00015303327,0.000105568084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009424034,0.00004931025,0.00030864723,0.000018214749,0.000044854507,0.0000024176707,0.0015427517,0.00017697246,0.00034470105,0.9221196,0.0067928364,0.068590224],"study_design_scores_gemma":[0.000574975,0.00010796173,0.002578606,0.000022780374,0.000015529944,0.000006414792,0.00009219105,0.03398161,0.0011730806,0.55120194,0.4097767,0.00046821966],"about_ca_topic_score_codex":0.000022652628,"about_ca_topic_score_gemma":0.000013316014,"teacher_disagreement_score":0.9599393,"about_ca_system_score_codex":0.00000383184,"about_ca_system_score_gemma":0.000021015296,"threshold_uncertainty_score":0.48122716},"labels":[],"label_agreement":null},{"id":"W4366206987","doi":"10.48550/arxiv.2304.07126","title":"Decoding twisted permutation codes","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Permutation group; Cyclic permutation; Decoding methods; Class (philosophy); Bit-reversal permutation; Permutation matrix; Combinatorics; Partial permutation; Degree (music); Permutation graph; Mathematics; Discrete mathematics; Computer science; Symmetric group; Algorithm; Physics; Artificial intelligence","score_opus":0.12790636386705248,"score_gpt":0.20356607019112094,"score_spread":0.07565970632406846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366206987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2899104,0.00002234569,0.7065288,0.000091846196,0.00075708743,0.00014048253,0.000009627076,0.0008610843,0.0016783421],"genre_scores_gemma":[0.99692595,0.00007399063,0.0018139337,0.00006072571,0.000058634778,0.000001105048,0.000021806336,0.000017879016,0.0010259856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835914,0.0001707573,0.00016087324,0.0009288809,0.00008385097,0.00029650395],"domain_scores_gemma":[0.9984452,0.00021494691,0.00017753181,0.0009312463,0.00011461809,0.000116471354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037745197,0.00024033562,0.00023640456,0.0004460711,0.00022202656,0.00019578448,0.0015711644,0.00020228948,0.000020473028],"category_scores_gemma":[0.000046945035,0.00029507946,0.00025040624,0.0009762469,0.00008749871,0.00030402272,0.001514442,0.00040196662,0.00019482856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020683672,0.000040848456,0.002536848,0.00006870928,0.00009411559,0.0002815419,0.0005652202,0.06486,0.00007651276,0.92962134,0.00029713535,0.0015370506],"study_design_scores_gemma":[0.0002662128,0.00003674337,0.002680866,0.0001212255,0.00005641191,0.0000039142774,0.00012485098,0.48897395,0.00014130665,0.5068224,0.00031867097,0.00045343582],"about_ca_topic_score_codex":0.000051056064,"about_ca_topic_score_gemma":0.00004016417,"teacher_disagreement_score":0.7070155,"about_ca_system_score_codex":0.00009897855,"about_ca_system_score_gemma":0.000092999435,"threshold_uncertainty_score":0.9999501},"labels":[],"label_agreement":null},{"id":"W4366368346","doi":"10.1007/s11128-023-03919-0","title":"Cryptanalysis of three quantum money schemes","year":2023,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum computer; Quantum algorithm; Qubit; Cryptanalysis; Polynomial; Quantum state; Hash function; Discrete mathematics; Computer science; Time complexity; Mathematics; Quantum; Cryptography; Algorithm; Quantum mechanics; Physics","score_opus":0.022040859558914275,"score_gpt":0.2530147459980161,"score_spread":0.23097388643910183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366368346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18851145,0.00009789992,0.8088368,0.000380662,0.00013476975,0.00007542619,0.0000027074968,0.00054803916,0.0014122328],"genre_scores_gemma":[0.99517065,0.000015322097,0.0046187467,0.0001415642,0.000015745441,0.0000123067975,0.00001288344,0.0000048339384,0.000007947728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868214,0.000026048416,0.0005118741,0.00013779668,0.0003973368,0.0002448074],"domain_scores_gemma":[0.9989396,0.0000633157,0.00034669702,0.00036071916,0.00023045983,0.000059245645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006787305,0.00012470192,0.000184192,0.00067116495,0.00024514034,0.0002509329,0.0006365478,0.00005868477,0.000015788139],"category_scores_gemma":[0.00010843226,0.00011422697,0.00011425874,0.0029150953,0.00006288982,0.0037750108,0.00016008307,0.000103234095,0.00014199379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013726714,0.00002044087,0.0015331258,0.00022567192,0.000031626292,0.0000010872686,0.0027380644,0.0005122724,0.0004279029,0.8150922,0.00033847234,0.17906539],"study_design_scores_gemma":[0.00018526375,0.000042057796,0.0023824975,0.000070949834,0.0000149622,0.0000029789771,0.00038587966,0.85512805,0.0016162818,0.13690647,0.0030835064,0.00018111973],"about_ca_topic_score_codex":0.0000055462615,"about_ca_topic_score_gemma":0.000001369816,"teacher_disagreement_score":0.85461575,"about_ca_system_score_codex":0.000013122513,"about_ca_system_score_gemma":0.000081900675,"threshold_uncertainty_score":0.46580404},"labels":[],"label_agreement":null},{"id":"W4366980112","doi":"10.1016/j.jcta.2023.105763","title":"Nonexistence results of generalized bent functions from <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:msubsup><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msubsup></mml:math> to <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.svg\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:math>","year":2023,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Ministry of Education - Singapore; Pacific Institute for the Mathematical Sciences","keywords":"Bent molecular geometry; Function (biology); Scalable Vector Graphics; Mathematics; Combinatorics; Computer science; Algorithm; World Wide Web; Engineering","score_opus":0.021819176248565966,"score_gpt":0.24281523015548215,"score_spread":0.22099605390691618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366980112","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4175214,0.0022723582,0.0025124615,0.0018582845,0.015618746,0.00011950727,0.0012979173,0.0007172427,0.5580821],"genre_scores_gemma":[0.97079366,0.003611731,0.006375574,0.002894892,0.0075778663,0.0028576483,0.0026243655,0.0023579213,0.0009063423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9714503,0.0022971546,0.006683185,0.0048859464,0.007996079,0.0066873217],"domain_scores_gemma":[0.9737627,0.0056050573,0.008453357,0.007284153,0.0009230338,0.00397168],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.009504751,0.0027657025,0.0012691083,0.0024469586,0.005231469,0.005842481,0.009194947,0.00641708,0.72297955],"category_scores_gemma":[0.00499346,0.005489585,0.006984674,0.005372257,0.005349759,0.0059208446,0.0076372437,0.0056115063,0.0045202444],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011189711,0.0008035044,0.000011752381,0.0016577991,0.0055582924,0.0044305827,0.005216871,0.003406281,0.0036610386,0.59685224,0.36531997,0.0018919494],"study_design_scores_gemma":[0.009003526,0.0064477865,0.00013890746,0.003828565,0.006141646,0.006060873,0.0065795304,0.029396938,0.91232264,0.002259238,0.01296074,0.0048595825],"about_ca_topic_score_codex":0.0044082124,"about_ca_topic_score_gemma":0.0028453919,"teacher_disagreement_score":0.9086616,"about_ca_system_score_codex":0.000066486245,"about_ca_system_score_gemma":0.006271224,"threshold_uncertainty_score":0.9993623},"labels":[],"label_agreement":null},{"id":"W4367677358","doi":"10.1017/s0004972723000382","title":"TANGENT-FILLING PLANE CURVES OVER FINITE FIELDS","year":2023,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Tangent; Plane curve; Plane (geometry); Geometry; Tangent space; Mathematical analysis; Cover (algebra); Finite field; Pure mathematics; Combinatorics","score_opus":0.030438583829769834,"score_gpt":0.25765536855496873,"score_spread":0.2272167847251989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367677358","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31997934,0.000533144,0.31400666,0.33190978,0.0025015653,0.0024020139,0.00013205028,0.0028270888,0.025708359],"genre_scores_gemma":[0.92945904,0.00022193788,0.041136608,0.0053837965,0.0002048175,0.000051206895,0.000007953732,0.000038880225,0.02349574],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988382,0.00007249581,0.00026233087,0.00020992568,0.00033203562,0.0002850049],"domain_scores_gemma":[0.9986637,0.0005285368,0.00010422483,0.0006105083,0.000026766556,0.00006621795],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006769889,0.00012709669,0.00018913057,0.000017992932,0.00013669276,0.00004467643,0.0010858619,0.00009136182,0.00095612434],"category_scores_gemma":[0.00014679196,0.000087742366,0.0004292432,0.00044737113,0.00013214358,0.000029183098,0.0003800198,0.00019676842,0.00027110995],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042932425,0.00010836097,0.00035690021,0.0007598603,0.00010730656,0.000003269554,0.0014035151,0.00014959487,0.00033845328,0.18191528,0.8142014,0.0006517172],"study_design_scores_gemma":[0.0010000424,0.00019871356,0.0075001107,0.0027888855,0.00014917483,0.000027819497,0.0005357898,0.011335874,0.009744188,0.6915367,0.27416623,0.0010164315],"about_ca_topic_score_codex":0.000005706619,"about_ca_topic_score_gemma":1.8596361e-7,"teacher_disagreement_score":0.6094797,"about_ca_system_score_codex":0.000008444953,"about_ca_system_score_gemma":0.000011150273,"threshold_uncertainty_score":0.99995714},"labels":[],"label_agreement":null},{"id":"W4367677360","doi":"10.1515/forum-2022-0324","title":"On the number of rational points of certain algebraic varieties over finite fields","year":2023,"lang":"en","type":"article","venue":"Forum Mathematicum","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Exponent; Mathematics; Algebraic number; Algebra over a field; Mathematical analysis; Pure mathematics","score_opus":0.0166389987825122,"score_gpt":0.2532689212513245,"score_spread":0.2366299224688123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367677360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55345565,0.000011502293,0.42100042,0.007824722,0.00037378207,0.00028376773,0.000013845532,0.00018478572,0.016851492],"genre_scores_gemma":[0.99726576,0.0000013781117,0.0018988755,0.00031247627,0.00001045428,0.000014550912,0.0000017468274,0.0000052357286,0.0004895326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992096,0.00005869942,0.0002147332,0.00011396177,0.00025803325,0.00014499603],"domain_scores_gemma":[0.998041,0.0013834934,0.00011910093,0.0003995165,0.000038536346,0.000018381414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049717055,0.000079454054,0.00012847688,0.00007392092,0.000075896445,0.000027161801,0.00045934736,0.000039021103,0.00036394544],"category_scores_gemma":[0.00021181062,0.000052895277,0.00011166504,0.00044543852,0.00007802267,0.000098699085,0.00015611517,0.00007124386,0.00009712755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005774107,0.00003765782,0.00016625682,0.000039492294,0.000020403066,6.647778e-7,0.0013800225,0.00004287766,0.000059833234,0.99346757,0.0045839623,0.00019546984],"study_design_scores_gemma":[0.00009061571,0.00004122043,0.00046132828,0.00005754555,0.0000040903947,0.0000016662946,0.0001386599,0.01372111,0.0016886133,0.98358095,0.00015422012,0.000059964284],"about_ca_topic_score_codex":0.0000026037058,"about_ca_topic_score_gemma":0.0000011992619,"teacher_disagreement_score":0.44381008,"about_ca_system_score_codex":0.0000032241928,"about_ca_system_score_gemma":0.000018442426,"threshold_uncertainty_score":0.39849472},"labels":[],"label_agreement":null},{"id":"W4376111567","doi":"10.1016/j.disc.2023.113489","title":"On the equivalence of linear cyclic and constacyclic codes","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monomial; Discrete mathematics; Equivalence (formal languages); Finite field; Combinatorics; Equivalence relation; Equivalence class (music); Permutation (music); Linear code; Block code; Algorithm","score_opus":0.03003914856210125,"score_gpt":0.2742312853251732,"score_spread":0.24419213676307197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376111567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8546418,0.000043370077,0.13760218,0.0013878491,0.00008402516,0.00018025567,0.000011002211,0.00021012222,0.005839405],"genre_scores_gemma":[0.99338585,0.000060564635,0.0063221785,0.00013912635,0.000010522236,0.000009436507,8.381689e-7,0.0000067480514,0.000064754444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927926,0.00005144097,0.00017513215,0.00014945661,0.00018954235,0.00015513964],"domain_scores_gemma":[0.9981968,0.0011528857,0.00008789706,0.00050459756,0.000021674094,0.000036159152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005283081,0.000093033996,0.0001377141,0.00007903053,0.0001268972,0.00004647088,0.0005216246,0.000025814723,0.000011174109],"category_scores_gemma":[0.00018428868,0.00005821832,0.000059479047,0.0004774408,0.00019387073,0.000070829825,0.00022973874,0.00007807085,0.000040217557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017503521,0.000015688129,0.000057208777,0.0000513171,0.000012183656,0.000001973702,0.0017940211,0.000008839636,0.0008742394,0.9961124,0.00021738074,0.00085297093],"study_design_scores_gemma":[0.00011584357,0.000093850984,0.00024567998,0.00016125492,0.000011367074,0.0000062231047,0.00051911926,0.04358035,0.0051521957,0.949791,0.00019311052,0.00013001334],"about_ca_topic_score_codex":0.0000011565431,"about_ca_topic_score_gemma":5.373015e-7,"teacher_disagreement_score":0.13874404,"about_ca_system_score_codex":0.0000024320957,"about_ca_system_score_gemma":0.000008965194,"threshold_uncertainty_score":0.23740742},"labels":[],"label_agreement":null},{"id":"W4376622261","doi":"10.1007/978-3-031-31108-6_18","title":"Benchmark Performance of the Multivariate Polynomial Public Key Encapsulation Mechanism","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Quantropi (Canada)","funders":"","keywords":"NTRU; Key encapsulation; Computer science; Benchmarking; Cryptosystem; Public-key cryptography; Post-quantum cryptography; Cryptography; Theoretical computer science; Encapsulation (networking); NIST; McEliece cryptosystem; Univariate; Key (lock); Multivariate statistics; Computer engineering; Algorithm; Computer network; Computer security; Encryption; Key exchange; Machine learning","score_opus":0.01907435105049574,"score_gpt":0.22042164869522385,"score_spread":0.2013472976447281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376622261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040921597,0.00004337878,0.9891229,0.00065722683,0.003704806,0.0003558704,0.000006036544,0.00016013558,0.0018574648],"genre_scores_gemma":[0.94703156,0.00001952334,0.052122425,0.00031976518,0.00026200456,0.000007925145,0.0000026361472,0.000025512983,0.00020863082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969256,0.00007344707,0.0005083761,0.0009981721,0.0009588199,0.0005355732],"domain_scores_gemma":[0.99732816,0.00041928663,0.0004214138,0.0015173161,0.00021384751,0.00009996524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014528743,0.0003867476,0.00037472296,0.00080903585,0.00040927943,0.00030004588,0.0043130536,0.00026510903,0.000017000257],"category_scores_gemma":[0.00011344443,0.0002947218,0.00021911219,0.0014042672,0.00060422235,0.0006274576,0.0019560906,0.00064338924,0.000020092979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013034002,0.000033093656,0.00021922318,0.00005823714,0.000024272822,0.0000075229495,0.0013964701,0.007086729,0.0017373976,0.56197417,0.000015388934,0.42743447],"study_design_scores_gemma":[0.0002736386,0.00018547842,0.0019881416,0.00039356665,0.000010521291,0.000018783965,2.0543831e-7,0.5402364,0.005159395,0.4508433,0.00035881047,0.0005317073],"about_ca_topic_score_codex":0.00001551157,"about_ca_topic_score_gemma":0.000027459142,"teacher_disagreement_score":0.9429394,"about_ca_system_score_codex":0.0001111031,"about_ca_system_score_gemma":0.00041985698,"threshold_uncertainty_score":0.99995047},"labels":[],"label_agreement":null},{"id":"W4377020029","doi":"10.1016/j.jsc.2023.102231","title":"An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences","year":2023,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Mathematics; Inversion (geology); Tree (set theory); Set (abstract data type); Algorithm; Combinatorics; Computer science","score_opus":0.030516113599601567,"score_gpt":0.28566463479884335,"score_spread":0.2551485211992418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377020029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31746063,0.000013125898,0.6818257,0.00022660836,0.00028780336,0.000089465735,0.0000011826321,0.00006781277,0.000027673028],"genre_scores_gemma":[0.88661236,0.000002969351,0.112732425,0.00027219494,0.0003541799,0.0000061208843,0.0000090104,0.000009096993,0.0000016255353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986193,0.00023914129,0.00039366123,0.0002131322,0.00034097335,0.00019376141],"domain_scores_gemma":[0.99880403,0.00039053193,0.0003739866,0.00013286687,0.00021565585,0.00008292552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016384546,0.00012380198,0.00018728491,0.0005187179,0.00040972722,0.00026660386,0.00039652872,0.00004560501,0.0000011414551],"category_scores_gemma":[0.000085205946,0.000110178364,0.00013665188,0.0006436876,0.000019130428,0.0005681814,0.000029118435,0.00017539004,0.000001921371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015006861,0.00006684236,0.00040139304,0.000030600255,0.000018169178,0.000007860344,0.0024007808,0.58932745,0.009484686,0.0015129931,0.00018725973,0.39654696],"study_design_scores_gemma":[0.00045145795,0.00050357654,0.0006775712,0.000084426094,0.000009798779,0.000014698873,0.0005029913,0.9921962,0.0012855361,0.004130568,0.000020969752,0.00012218257],"about_ca_topic_score_codex":0.0000040145496,"about_ca_topic_score_gemma":7.417162e-7,"teacher_disagreement_score":0.56915176,"about_ca_system_score_codex":0.00003993703,"about_ca_system_score_gemma":0.00006911002,"threshold_uncertainty_score":0.44929433},"labels":[],"label_agreement":null},{"id":"W4377094810","doi":"10.1007/s00200-023-00608-4","title":"MWS and FWS codes for coordinate-wise weight functions","year":2023,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Hamming code; Upper and lower bounds; Code (set theory); Hamming weight; Hamming distance; Linear code; Discrete mathematics; Weight function; Set (abstract data type); Block code; Algorithm; Statistics; Computer science; Decoding methods; Mathematical analysis","score_opus":0.009493921149859972,"score_gpt":0.22316264146726725,"score_spread":0.21366872031740727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377094810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19365035,0.00076125294,0.8035695,0.0007447261,0.0000739693,0.000287567,0.000002080876,0.00058553845,0.00032505504],"genre_scores_gemma":[0.97544,0.00018252736,0.024138404,0.00007605825,0.000020138088,0.000084027204,0.000012277232,0.000012372643,0.000034154687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992246,0.000032611697,0.00019674085,0.0002510056,0.00006188211,0.00023313245],"domain_scores_gemma":[0.99874777,0.0006287652,0.00004501626,0.00048877683,0.000029376215,0.00006027463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009733,0.00011864914,0.00015119153,0.00021708892,0.00026591154,0.00013120164,0.00043295207,0.000049505717,0.0000010900121],"category_scores_gemma":[0.0000312899,0.0001309621,0.000031861913,0.0007745683,0.000037775677,0.00016028546,0.00044685425,0.00014642601,0.000004480011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074937952,0.000043372784,0.0025797721,0.000114142844,0.000028467986,9.71183e-7,0.00086018926,0.008626607,0.0014399141,0.88773537,0.00045321963,0.09811046],"study_design_scores_gemma":[0.0004358379,0.000031411342,0.005365145,0.000072538474,0.0000062103363,0.000007212618,0.000102107595,0.96155465,0.00026032358,0.017725073,0.014223784,0.00021572672],"about_ca_topic_score_codex":0.00001376215,"about_ca_topic_score_gemma":0.0000035785001,"teacher_disagreement_score":0.952928,"about_ca_system_score_codex":0.0000122435695,"about_ca_system_score_gemma":0.000007801915,"threshold_uncertainty_score":0.53404796},"labels":[],"label_agreement":null},{"id":"W4379470540","doi":"10.1515/jmc-2022-0002","title":"A code-based hybrid signcryption scheme","year":2023,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Signcryption; Code (set theory); Scheme (mathematics); Computer science; Programming language; Theoretical computer science; Mathematics; Computer network; Encryption; Public-key cryptography","score_opus":0.263201233724632,"score_gpt":0.5300503687771727,"score_spread":0.2668491350525407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379470540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81968564,0.0031138773,0.16920136,0.0010176811,0.0013827328,0.0005937832,0.000042811225,0.0006737028,0.004288425],"genre_scores_gemma":[0.994845,0.0009588458,0.0031662267,0.00061238377,0.00014153443,0.000057198344,0.000013651047,0.000038454895,0.00016673919],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99702114,0.00037905393,0.00060853333,0.0006298514,0.0008286652,0.00053272815],"domain_scores_gemma":[0.9973821,0.00052994763,0.00056648144,0.0009583937,0.00027784286,0.0002852182],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025708296,0.0003101166,0.00053422624,0.0015523913,0.0004151878,0.0022018,0.0061148377,0.000076981814,0.0021419942],"category_scores_gemma":[0.00023196003,0.0002987209,0.00032466266,0.0035513274,0.00013916088,0.0030567574,0.0014828607,0.00037732048,0.00015020306],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047812064,0.000758262,0.17363977,0.00026089646,0.00042519197,0.00043840663,0.00041186935,0.0027061412,0.42921612,0.041755117,0.22431897,0.12559111],"study_design_scores_gemma":[0.0024147572,0.00009134773,0.34019646,0.0011310049,0.000102131955,0.000048748978,0.00006536187,0.043170877,0.20072982,0.33870834,0.07135958,0.0019815795],"about_ca_topic_score_codex":0.00005634542,"about_ca_topic_score_gemma":0.0000067966444,"teacher_disagreement_score":0.29695323,"about_ca_system_score_codex":0.00005694473,"about_ca_system_score_gemma":0.00018349459,"threshold_uncertainty_score":0.9999465},"labels":[],"label_agreement":null},{"id":"W4381742080","doi":"10.1007/s10623-023-01264-y","title":"Plane curves giving rise to blocking sets over finite fields","year":2023,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quartic function; Blocking (statistics); Plane curve; Degree (music); Mathematics; Algebraic curve; Finite field; Plane (geometry); Quartic plane curve; Polynomial; Combinatorics; Pure mathematics; Geometry; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.028961879092178656,"score_gpt":0.26617802298129956,"score_spread":0.2372161438891209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381742080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.300857,0.0015604261,0.6922063,0.0015251463,0.00047477998,0.0004146688,0.000035642926,0.001189979,0.0017360332],"genre_scores_gemma":[0.98601365,0.00090095866,0.010809195,0.0020775958,0.00006702978,0.000054732274,0.000008826745,0.000020583608,0.00004742875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822485,0.00013574441,0.00025072478,0.00056278234,0.00030088917,0.000525018],"domain_scores_gemma":[0.998538,0.00056174037,0.00006874824,0.000542615,0.000048329068,0.00024053283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006836068,0.0002528269,0.00026139893,0.0007198134,0.00037914395,0.0002928801,0.00064289087,0.000094323055,0.000049993014],"category_scores_gemma":[0.000057096022,0.00024087036,0.00017975087,0.0025063753,0.00007410053,0.00028308053,0.00032489252,0.00018975823,0.000034561042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020613759,0.00036414134,0.07947303,0.0010650358,0.00062160514,0.00041216493,0.011086307,0.0016608573,0.008258538,0.528671,0.107073106,0.26110804],"study_design_scores_gemma":[0.0033836605,0.002988618,0.19158818,0.004118245,0.0002705519,0.00012627298,0.0009429182,0.065784976,0.0078553185,0.48294947,0.23419651,0.0057952856],"about_ca_topic_score_codex":0.000024968209,"about_ca_topic_score_gemma":0.00001877131,"teacher_disagreement_score":0.68515664,"about_ca_system_score_codex":0.0000045808442,"about_ca_system_score_gemma":0.000017396582,"threshold_uncertainty_score":0.9822408},"labels":[],"label_agreement":null},{"id":"W4385296592","doi":"10.1007/s00200-023-00614-6","title":"Linear label code of a root lattice using Gröbner bases","year":2023,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lambda; Lattice (music); Mathematics; Quotient; Binomial coefficient; Combinatorics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.025112864864790273,"score_gpt":0.26670254320078446,"score_spread":0.24158967833599418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385296592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6696146,0.00030776497,0.32939962,0.0001189816,0.000031824038,0.00009962431,9.191074e-7,0.00027441178,0.00015222507],"genre_scores_gemma":[0.90841174,0.000045447832,0.09145935,0.0000439437,0.000012409888,0.000007386782,0.000003379424,0.0000116119145,0.0000047083486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913144,0.000060250204,0.00027548015,0.00020715462,0.00010916292,0.00021648491],"domain_scores_gemma":[0.99866974,0.00052464026,0.00008107914,0.0006405174,0.000037917092,0.000046089444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007082429,0.00011337671,0.00017698926,0.00024361728,0.0001107025,0.000045323206,0.00066455005,0.00004724869,0.0000014895807],"category_scores_gemma":[0.000043686698,0.00012754812,0.00003138605,0.0013323186,0.00003649367,0.00015377607,0.00063226116,0.00017602369,0.0000037259122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001034947,0.00015116914,0.007859847,0.00026019991,0.00004919797,0.0000050993626,0.001657282,0.17471088,0.017828701,0.75378734,0.000032565425,0.043647394],"study_design_scores_gemma":[0.00024643398,0.000015096867,0.002499001,0.00012611784,0.0000045012757,0.000005533164,0.000042695956,0.9912647,0.0014627055,0.0037589474,0.00043653042,0.00013772317],"about_ca_topic_score_codex":0.00004457141,"about_ca_topic_score_gemma":0.000004545152,"teacher_disagreement_score":0.81655383,"about_ca_system_score_codex":0.00001359523,"about_ca_system_score_gemma":0.000013668452,"threshold_uncertainty_score":0.5201261},"labels":[],"label_agreement":null},{"id":"W4385457409","doi":"10.3934/amc.2023026","title":"Constacyclic and quasi-twisted codes over $ \\mathbb{Z}_{q}[u]/\\langle u^{2}-1\\rangle $ and new $ \\mathbb{Z}_4 $-linear codes","year":2023,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Ring (chemistry); Code (set theory); Combinatorics; Characterization (materials science); Algebraic number; Linear code; Discrete mathematics; Algorithm; Physics; Block code; Mathematical analysis; Computer science; Decoding methods","score_opus":0.04000628969610894,"score_gpt":0.33110270373278744,"score_spread":0.2910964140366785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385457409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69575334,0.0343218,0.24353068,0.0038068907,0.0002792044,0.0012927499,0.00012646952,0.001130877,0.01975798],"genre_scores_gemma":[0.7817125,0.011733827,0.20628695,0.00007100032,0.000011905821,0.000034512086,0.000017461918,0.000018549992,0.00011331771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873185,0.00012667241,0.00047869387,0.00023798646,0.00019332898,0.00023145937],"domain_scores_gemma":[0.99616355,0.0018754837,0.00022524195,0.0015827353,0.00005969037,0.00009331825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062261405,0.00017317157,0.00035835474,0.00029383626,0.00019057553,0.00006740272,0.0012517723,0.000064903186,0.000006909594],"category_scores_gemma":[0.00023300017,0.0001690057,0.00005753289,0.0009470367,0.00052237324,0.0007274487,0.00080740644,0.00017479013,0.000010827563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059575586,0.00023482728,0.0016150024,0.00017632953,0.000026204965,0.000002141877,0.0042921477,0.00006576837,0.0007696699,0.980657,0.00010890627,0.012046087],"study_design_scores_gemma":[0.0009379391,0.00014172631,0.0018364436,0.0005023121,0.0000351281,0.00002215678,0.0014211506,0.09575779,0.0007580281,0.886297,0.011888362,0.000401994],"about_ca_topic_score_codex":0.000026300382,"about_ca_topic_score_gemma":0.00018312079,"teacher_disagreement_score":0.095692016,"about_ca_system_score_codex":0.000011850058,"about_ca_system_score_gemma":0.00004025052,"threshold_uncertainty_score":0.6891852},"labels":[],"label_agreement":null},{"id":"W4385640144","doi":"10.1145/3614408.3614416","title":"FFCSA - Finite Field Constructions, Search, and Algorithms","year":2023,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Parameterized complexity; Finite field; Computer science; Field (mathematics); Algorithm; Implementation; Space (punctuation); Cryptography; Search algorithm; Theoretical computer science; Mathematics; Programming language; Discrete mathematics","score_opus":0.04537242768353807,"score_gpt":0.3067459312607776,"score_spread":0.26137350357723954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385640144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07241664,0.0006011996,0.9050314,0.019142069,0.000559901,0.00030259482,0.0000073195993,0.0009616822,0.0009772021],"genre_scores_gemma":[0.608657,0.00088179344,0.38945967,0.00086051814,0.000049087805,0.00004109054,0.000014780102,0.000009522267,0.000026547215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869794,0.00030519097,0.0002640722,0.00032148283,0.0001458865,0.00026544053],"domain_scores_gemma":[0.9940722,0.002432588,0.00003748581,0.0033263594,0.000055570104,0.00007579752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006826854,0.00012579949,0.00015603751,0.0005225704,0.00036539082,0.00020631921,0.0033602268,0.00006906451,0.000009714455],"category_scores_gemma":[0.00011516321,0.00013602043,0.00005656775,0.0017757332,0.00021126194,0.00036586847,0.004357109,0.0003539424,0.00006712582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026375526,0.00006448178,0.004861546,0.00001107987,0.000025482756,0.000008069927,0.0015381948,0.00016662302,0.000020446603,0.40514162,0.0013185274,0.5868413],"study_design_scores_gemma":[0.00061773096,0.00015022432,0.02130352,0.00010419317,0.000007864497,0.000064060136,0.0001351131,0.6243391,0.00014366384,0.34013078,0.012585887,0.000417864],"about_ca_topic_score_codex":0.000045469693,"about_ca_topic_score_gemma":0.000029205832,"teacher_disagreement_score":0.62417245,"about_ca_system_score_codex":0.00001522035,"about_ca_system_score_gemma":0.000037621485,"threshold_uncertainty_score":0.62441933},"labels":[],"label_agreement":null},{"id":"W4385688796","doi":"10.1109/bsc57238.2023.10201835","title":"A Novel Framework for Relating Quasi-Cyclic Codes and Quasi-Twisted Codes","year":2023,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Code (set theory); Computer science; Algorithm; Combinatorics; Discrete mathematics; Artificial intelligence; Mathematics; Programming language","score_opus":0.039559182160411356,"score_gpt":0.29236572642767655,"score_spread":0.2528065442672652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385688796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05866793,0.00006381344,0.9380012,0.0010185497,0.00020000215,0.00019075476,0.000007813696,0.0007740645,0.0010758804],"genre_scores_gemma":[0.73121965,0.000015394695,0.2680197,0.00036771412,0.000055847846,0.000042721542,0.000003954914,0.0000121644625,0.0002628519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988439,0.000049621136,0.00021574627,0.0004115144,0.00014934817,0.00032988118],"domain_scores_gemma":[0.9975679,0.0018235694,0.00007343538,0.00039963034,0.00004461675,0.00009084909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007319151,0.00014389138,0.00019059393,0.00017526628,0.00032262865,0.00021673983,0.0004303153,0.00010398507,0.000008223959],"category_scores_gemma":[0.00035212326,0.00012858656,0.00009562971,0.00092404935,0.00008044983,0.000239201,0.0002165066,0.00014620423,0.000021849186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012730807,0.00005763246,0.00084105786,0.000026658989,0.00002273501,0.0000015240252,0.00092556176,0.000010368418,0.0016572699,0.97666866,0.00026101398,0.019514797],"study_design_scores_gemma":[0.00060906296,0.00039491884,0.0040292125,0.0001433545,0.000018064946,0.000016740465,0.000517537,0.122712806,0.00097279076,0.8670098,0.0031634858,0.0004122004],"about_ca_topic_score_codex":0.00002388446,"about_ca_topic_score_gemma":0.000025097637,"teacher_disagreement_score":0.6725517,"about_ca_system_score_codex":0.000008452215,"about_ca_system_score_gemma":0.000018954193,"threshold_uncertainty_score":0.5243607},"labels":[],"label_agreement":null},{"id":"W4385820017","doi":"10.1109/tit.2023.3304712","title":"Constructions and Bounds for Codes With Restricted Overlaps","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Code word; Prefix; Parity-check matrix; Code (set theory); Mathematics; Discrete mathematics; Combinatorics; Linear code; Block code; Suffix; Binary code; Prefix code; Binary number; Computer science; Algorithm; Arithmetic; Decoding methods; Set (abstract data type)","score_opus":0.008990036429457308,"score_gpt":0.21692075491641294,"score_spread":0.20793071848695563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385820017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015286057,0.000003804073,0.9814489,0.00020113161,0.0003350568,0.00023408141,0.000056598,0.0005603732,0.0018739912],"genre_scores_gemma":[0.9906488,0.00002940651,0.008713964,0.00026714322,0.0000133061385,0.00015188425,0.000010011535,0.0000063223288,0.00015916313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999357,0.00004862404,0.00018014779,0.00011715539,0.00013178572,0.00016529571],"domain_scores_gemma":[0.9991354,0.0004026865,0.00006650109,0.0002468167,0.00008783952,0.000060768805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028767192,0.000103293074,0.00009078164,0.00047464343,0.00053572387,0.00019314337,0.00017246538,0.000050765822,0.000013420854],"category_scores_gemma":[0.000008894312,0.00008997108,0.000052507017,0.0008820544,0.0001332706,0.0013446785,0.0000018520471,0.0001043674,0.00003487341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000182235,0.00002160151,0.0000065277163,0.000028990022,0.000053686585,4.2449227e-7,0.001598295,0.0025982906,0.00008741001,0.8557175,0.00032614858,0.13937889],"study_design_scores_gemma":[0.0062587317,0.0022371388,0.0019989687,0.00022009497,0.00018068861,0.00026660686,0.0054803817,0.105153084,0.018153043,0.798769,0.059853896,0.0014283647],"about_ca_topic_score_codex":0.000002010116,"about_ca_topic_score_gemma":0.0000026221178,"teacher_disagreement_score":0.9753627,"about_ca_system_score_codex":0.000015778005,"about_ca_system_score_gemma":0.000045369812,"threshold_uncertainty_score":0.4120409},"labels":[],"label_agreement":null},{"id":"W4385891514","doi":"10.1007/s12095-023-00656-0","title":"The welch-gong stream cipher - evolutionary path","year":2023,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stream cipher; Computer science; Cipher; Transposition cipher; Block cipher mode of operation; Cryptography; Stream cipher attack; Path (computing); Encryption; Theoretical computer science; Permutation (music); Running key cipher; Algorithm; Computer security; Programming language","score_opus":0.02073569150712341,"score_gpt":0.25392970922735264,"score_spread":0.23319401772022924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385891514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.189124,0.07181745,0.42469436,0.10090214,0.002813987,0.0025345813,0.00016756229,0.009614113,0.19833179],"genre_scores_gemma":[0.983764,0.005589046,0.010134837,0.00021853946,0.000032461292,0.00014778005,0.00002218774,0.000010302202,0.0000808242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988843,0.00023547678,0.00019686164,0.00023678297,0.00015878891,0.00028777457],"domain_scores_gemma":[0.99667937,0.0007218672,0.00006818451,0.002364381,0.00007248748,0.0000937049],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00049009564,0.00012794776,0.00009527067,0.00019580899,0.0023517911,0.0002522054,0.0022592347,0.000053486296,0.000007796424],"category_scores_gemma":[0.000030081143,0.0000995224,0.00014554878,0.002128275,0.0005662414,0.00028753714,0.0010171619,0.00022319739,0.00004183905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003139764,0.00004009649,0.0026790474,0.0000029737437,0.00003493151,6.986698e-7,0.0005382544,0.0000032085156,0.00003582584,0.9341756,0.0039918744,0.05849436],"study_design_scores_gemma":[0.00022269196,0.00006749324,0.07723753,0.000032078726,0.000019187797,0.000009827845,0.0008092817,0.005603217,0.000019404997,0.6497075,0.26601186,0.00025994936],"about_ca_topic_score_codex":0.000013076784,"about_ca_topic_score_gemma":0.00002169494,"teacher_disagreement_score":0.79464,"about_ca_system_score_codex":0.000006027634,"about_ca_system_score_gemma":0.000029064067,"threshold_uncertainty_score":0.998947},"labels":[],"label_agreement":null},{"id":"W4386072004","doi":"10.1109/isit54713.2023.10206961","title":"A Novel Construction Technique for Some Classes of Quasi-Cyclic Codes","year":2023,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Generator (circuit theory); Combinatorics; Ideal (ethics); Matrix (chemical analysis); Discrete mathematics; Algorithm; Computer science; Mathematics; Physics","score_opus":0.02702305673443879,"score_gpt":0.27339360220181896,"score_spread":0.2463705454673802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386072004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015353897,0.000008551092,0.98289263,0.0003018754,0.00016252829,0.00020686575,0.0000062059075,0.00037035366,0.0006971041],"genre_scores_gemma":[0.7754984,0.000012385955,0.22416128,0.00008490655,0.000031688913,0.000104126506,0.0000022651,0.0000053272256,0.00009961738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994641,0.000016235235,0.00013684727,0.00016908855,0.000082198276,0.00013156532],"domain_scores_gemma":[0.99941605,0.0002257414,0.000053565902,0.00023690208,0.000042265707,0.00002547718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003050431,0.00006222224,0.000106479274,0.00019896093,0.00006428459,0.000027671365,0.00030598723,0.000034517234,0.000004821045],"category_scores_gemma":[0.000035853514,0.000055043758,0.00008440901,0.00058386574,0.000076434284,0.00021543841,0.00007831461,0.00003552361,0.000004880236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054509233,0.000030316327,0.00010983587,0.000020882757,0.000008279835,2.0883733e-7,0.000041920142,0.0000039212764,0.12622128,0.8659588,0.00025885575,0.0073402408],"study_design_scores_gemma":[0.00030567462,0.00024560938,0.0005279131,0.00003239762,0.0000068531444,0.000022679631,0.000119394725,0.004400469,0.3723867,0.61946946,0.002326904,0.00015594185],"about_ca_topic_score_codex":0.0000071170157,"about_ca_topic_score_gemma":0.0000034681602,"teacher_disagreement_score":0.76014453,"about_ca_system_score_codex":0.0000049576743,"about_ca_system_score_gemma":0.000024445733,"threshold_uncertainty_score":0.22446193},"labels":[],"label_agreement":null},{"id":"W4386075135","doi":"10.1109/isit54713.2023.10206458","title":"Constructing Quadratic and Cubic Negabent Functions over Finite Fields","year":2023,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Monomial; TRACE (psycholinguistics); Hadamard transform; Finite field; Function (biology); Quadratic equation; Mathematics; Combinatorics; Discrete mathematics; Walsh function; Boolean function; Algorithm; Mathematical analysis","score_opus":0.0160214151502778,"score_gpt":0.23341290011721585,"score_spread":0.21739148496693805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386075135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3184002,0.000039862975,0.6449441,0.0011996785,0.0007024328,0.00008271982,0.0000015015136,0.00069387705,0.033935674],"genre_scores_gemma":[0.9961577,0.000007099434,0.0025967967,0.00024196392,0.00003104023,0.0000056938525,0.0000011285812,0.0000026978748,0.0009558823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947155,0.000029828438,0.000094811054,0.00017881229,0.000079873476,0.00014515463],"domain_scores_gemma":[0.99939245,0.00030747495,0.000021103035,0.00021622963,0.000013885468,0.000048858594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012660706,0.00006188869,0.00006511364,0.000119950964,0.00015858535,0.00012652608,0.00014942481,0.000029489831,0.0001138416],"category_scores_gemma":[0.000034486387,0.000054167485,0.00003749181,0.0005770079,0.00003932181,0.00019095575,0.00015069227,0.00007571206,0.000070454655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002028756,0.000009363008,0.0042064367,0.000008603793,0.000016504791,0.0000068662066,0.00047068557,0.00006213872,0.00010840447,0.9224588,0.0023004299,0.070349716],"study_design_scores_gemma":[0.0011830856,0.00037745963,0.024227351,0.00009690598,0.000041318784,0.00007432135,0.004089154,0.5287477,0.0011597987,0.42606816,0.0130054625,0.0009293242],"about_ca_topic_score_codex":0.000011947573,"about_ca_topic_score_gemma":0.000027747046,"teacher_disagreement_score":0.6777575,"about_ca_system_score_codex":0.0000041723124,"about_ca_system_score_gemma":0.00001184712,"threshold_uncertainty_score":0.2208886},"labels":[],"label_agreement":null},{"id":"W4386812617","doi":"10.1016/j.phycom.2023.102194","title":"Neural layered min-sum decoders for cyclic codes","year":2023,"lang":"en","type":"article","venue":"Physical Communication","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National University's Basic Research Foundation of China; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"BCH code; Computer science; Decoding methods; Berlekamp–Welch algorithm; Algorithm; Artificial neural network; Quadratic equation; Binary number; Binary code; Block code; Linear code; Arithmetic; Mathematics; Artificial intelligence","score_opus":0.040927238321110476,"score_gpt":0.3116940082888786,"score_spread":0.27076676996776816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386812617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78432035,0.00013194935,0.20427442,0.0073562907,0.00017551659,0.0004419079,0.000010649972,0.0011722987,0.0021166205],"genre_scores_gemma":[0.99480647,0.000020027193,0.0047691525,0.00019101964,0.00003868092,0.000095599076,0.00003149857,0.000008266383,0.0000393019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926394,0.00013798021,0.000110780864,0.0001853728,0.00010916069,0.00019274457],"domain_scores_gemma":[0.99812716,0.00072808715,0.000055351353,0.0009934448,0.000048287435,0.000047669568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002487385,0.000086808155,0.000114215014,0.00007339382,0.00027141912,0.00009581513,0.0012348654,0.000024497967,0.0000012322192],"category_scores_gemma":[0.00005082977,0.000084555366,0.00012465606,0.00056148024,0.00006622089,0.0002744115,0.00031389514,0.00009806874,0.00005592276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029603894,0.00017065874,0.0001852673,0.000020292338,0.000029622239,3.6822107e-7,0.0021530946,0.00047968465,0.009146371,0.89077413,0.003119932,0.09389095],"study_design_scores_gemma":[0.00034229303,0.000092753864,0.003782246,0.000014879971,0.0000105194085,7.580795e-7,0.00008269421,0.5410086,0.0033044291,0.44515902,0.0060059484,0.0001958658],"about_ca_topic_score_codex":0.000007434781,"about_ca_topic_score_gemma":0.000009299025,"teacher_disagreement_score":0.5405289,"about_ca_system_score_codex":0.000011946945,"about_ca_system_score_gemma":0.000009400294,"threshold_uncertainty_score":0.34480676},"labels":[],"label_agreement":null},{"id":"W4386825137","doi":"10.1007/s44007-023-00062-1","title":"New Estimates and Existence Results About Irreducible Polynomials and Self-Reciprocal Irreducible Polynomials with Prescribed Coefficients Over a Finite Field","year":2023,"lang":"en","type":"article","venue":"La Matematica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Carleton University","keywords":"Monic polynomial; Mathematics; Reciprocal; Irreducible polynomial; Degree (music); Polynomial; Field (mathematics); Finite field; Combinatorics; Pure mathematics; Mathematical analysis; Matrix polynomial; Physics","score_opus":0.012849181796090533,"score_gpt":0.2545236785330037,"score_spread":0.24167449673691319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386825137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8409175,0.0011326326,0.13023743,0.0040049762,0.00079530687,0.0018715255,0.00007576088,0.00256572,0.0183991],"genre_scores_gemma":[0.9353412,0.000111103385,0.06298883,0.00031248268,0.00007154642,0.000060109734,0.000009700695,0.00003237198,0.0010727028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785376,0.0001393676,0.00046275128,0.0007338706,0.0003196143,0.0004906553],"domain_scores_gemma":[0.9970538,0.0016956447,0.0001764883,0.0007603408,0.000047448462,0.0002663035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009454118,0.00028801235,0.0004234989,0.00025321497,0.00024455544,0.00073202094,0.00055872236,0.00011713034,0.000024030554],"category_scores_gemma":[0.00039219754,0.00022946676,0.00005384872,0.0008285041,0.00011330249,0.0004702711,0.0004367808,0.00014699767,0.000048965605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004175917,0.0021500138,0.008275652,0.008142033,0.001725801,0.0009981303,0.09423846,0.0016452727,0.021479001,0.6526029,0.108999446,0.09556737],"study_design_scores_gemma":[0.026478786,0.007860711,0.11000442,0.015216962,0.0012532559,0.0012212924,0.0020642695,0.39365137,0.092221916,0.28625706,0.05512704,0.00864294],"about_ca_topic_score_codex":0.00008387753,"about_ca_topic_score_gemma":0.0000067629267,"teacher_disagreement_score":0.39200607,"about_ca_system_score_codex":0.000011713872,"about_ca_system_score_gemma":0.000098005774,"threshold_uncertainty_score":0.93573827},"labels":[],"label_agreement":null},{"id":"W4386863539","doi":"10.1007/s12095-023-00674-y","title":"Some classes of permutation binomials and trinomials of index $$q-1$$ over $${\\mathbb {F}_{q^n}}$$","year":2023,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Trinomial; Combinatorics; Permutation (music); Prime (order theory); Mathematics; Prime power; Degree (music); Discrete mathematics; Polynomial; Physics","score_opus":0.02931724793707374,"score_gpt":0.2847397981237077,"score_spread":0.25542255018663396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386863539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9803625,0.0036392855,0.013947933,0.0006587358,0.000084625724,0.00024378923,0.000034205932,0.00016442772,0.00086451555],"genre_scores_gemma":[0.9909927,0.0043258313,0.0045569967,0.000052722164,0.000014056277,0.000034513483,0.00001142043,0.000006989407,0.000004738657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989036,0.00020277675,0.0003855467,0.0002170013,0.00013661652,0.00015447396],"domain_scores_gemma":[0.9977389,0.0007037638,0.00022378344,0.0011782957,0.00008938746,0.00006589952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005552877,0.00012225007,0.0002580975,0.0006768204,0.00023298377,0.00005875604,0.0008422335,0.00007604923,0.000004657974],"category_scores_gemma":[0.00004511351,0.00012115184,0.00012285383,0.0014362998,0.0005448265,0.00044042122,0.0005554542,0.00010899745,0.0000013371139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014298317,0.00008462808,0.018951548,0.000056806493,0.000062836116,2.5882346e-7,0.0015031993,0.000007383936,0.0057714507,0.9521762,0.00011105611,0.021260303],"study_design_scores_gemma":[0.0009867077,0.0002088512,0.3957283,0.00012065488,0.000060819893,0.0000062225436,0.00076763483,0.003347294,0.004418517,0.59088683,0.0031390102,0.00032917233],"about_ca_topic_score_codex":0.000028870045,"about_ca_topic_score_gemma":0.000008906547,"teacher_disagreement_score":0.37677675,"about_ca_system_score_codex":0.0000030611354,"about_ca_system_score_gemma":0.00003215339,"threshold_uncertainty_score":0.49404287},"labels":[],"label_agreement":null},{"id":"W4386875350","doi":"10.48550/arxiv.2309.09124","title":"Multiplicative structure of shifted multiplicative subgroups and its applications to Diophantine tuples","year":2023,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science","keywords":"Mathematics; Multiplicative function; Diophantine equation; Combinatorics; Conjecture; Product (mathematics); Square number; Finite field; Upper and lower bounds; Diophantine approximation; Multiplicative group; Discrete mathematics; Mathematical analysis","score_opus":0.05128684009991128,"score_gpt":0.2942028820027344,"score_spread":0.24291604190282315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386875350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8835739,0.00044075437,0.11272468,0.00091784797,0.00015930206,0.0014220562,0.00029079313,0.00042308346,0.000047576785],"genre_scores_gemma":[0.98700374,0.000113280454,0.011996224,0.00012997081,0.000113416885,0.00046868835,0.000058788515,0.00003910652,0.00007679766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9974378,0.00013392506,0.0004982256,0.0013098439,0.00025998047,0.0003602543],"domain_scores_gemma":[0.9969317,0.0005500976,0.00041949723,0.001549505,0.0003349264,0.0002142857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024539913,0.00041980576,0.00053946587,0.00037741486,0.00019638879,0.00007245287,0.0018853777,0.00026048612,0.000008539077],"category_scores_gemma":[0.00019504159,0.00040447773,0.00017173147,0.0011599145,0.00014833822,0.00014875414,0.0030288205,0.0005358073,0.000054873035],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020916255,0.00061532104,0.26230606,0.001256678,0.0010572441,0.000016210115,0.021409936,0.00075613405,0.31286976,0.3746847,0.00032006396,0.024498744],"study_design_scores_gemma":[0.00066031277,0.0001470916,0.83024937,0.00036257968,0.00009534788,0.000006047269,0.00022655558,0.0044699716,0.10054486,0.060736954,0.0014122308,0.0010886645],"about_ca_topic_score_codex":0.000039507184,"about_ca_topic_score_gemma":0.000038928018,"teacher_disagreement_score":0.56794333,"about_ca_system_score_codex":0.00002815779,"about_ca_system_score_gemma":0.000062288855,"threshold_uncertainty_score":0.99984074},"labels":[],"label_agreement":null},{"id":"W4387149210","doi":"10.1109/cita58204.2023.10262713","title":"Post Quantum Code-Based Cryptosystems with Dual Inverse Matrix","year":2023,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"McEliece cryptosystem; Cryptosystem; Computer science; Hybrid cryptosystem; Transpose; Cryptography; Theoretical computer science; Code (set theory); Algorithm; Physics; Quantum mechanics; Programming language","score_opus":0.016119782013749133,"score_gpt":0.24157429302885278,"score_spread":0.22545451101510364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387149210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53692836,0.00001885247,0.4514528,0.0028412729,0.0006172071,0.000284714,0.000016066393,0.002751427,0.005089348],"genre_scores_gemma":[0.9934002,0.0000013336187,0.0053358064,0.00054803846,0.000046412282,0.000018267096,0.0000071337568,0.00001293044,0.0006298366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879616,0.00009176155,0.00015708775,0.00034477445,0.00029140865,0.00031879195],"domain_scores_gemma":[0.9990178,0.00015640292,0.000052624113,0.0005724165,0.00008496469,0.00011582042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043997713,0.00014114531,0.00014044964,0.00028108078,0.00016342486,0.00017485129,0.0005312203,0.000046622456,0.000054121698],"category_scores_gemma":[0.00001644868,0.00010535685,0.00007880901,0.0013957841,0.0000611803,0.0002573216,0.0001224595,0.00009405936,0.0006563575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059767404,0.000050700666,0.0016438788,0.00003709047,0.000026738324,0.00012926664,0.00036987604,0.00055195665,0.0026345083,0.98753774,0.006199249,0.0007592197],"study_design_scores_gemma":[0.0038827932,0.00226937,0.00535875,0.00022651686,0.0000462858,0.00012864932,0.0014753024,0.882206,0.01010993,0.04156423,0.051020797,0.0017113797],"about_ca_topic_score_codex":0.000043983524,"about_ca_topic_score_gemma":0.00007929652,"teacher_disagreement_score":0.9459735,"about_ca_system_score_codex":0.000012319853,"about_ca_system_score_gemma":0.00008614697,"threshold_uncertainty_score":0.8436367},"labels":[],"label_agreement":null},{"id":"W4387703346","doi":"10.12688/f1000research.133031.1","title":"A novel homomorphic polynomial public key encapsulation algorithm","year":2023,"lang":"en","type":"preprint","venue":"F1000Research","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quantropi (Canada)","funders":"","keywords":"Open peer review; Homomorphic encryption; Plant biology; Computer science; Algorithm; Key (lock); Encapsulation (networking); Medicine; Biology; Computer security; Botany","score_opus":0.13445829665325448,"score_gpt":0.3258276826811684,"score_spread":0.19136938602791392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387703346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050779483,0.0002689291,0.98059267,0.0069377334,0.0024243027,0.0008071128,0.000110302506,0.0022075623,0.0015734128],"genre_scores_gemma":[0.73356944,0.00044873302,0.25354078,0.0004369747,0.0034906273,0.0011685971,0.00037984754,0.0003910509,0.006573922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554366,0.00038661828,0.0004464227,0.0012392573,0.0014204863,0.0009635632],"domain_scores_gemma":[0.9966108,0.00046481268,0.00015197173,0.001998122,0.00041838677,0.00035586502],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029401688,0.00035484676,0.00037103402,0.0014620138,0.00040435678,0.0015327336,0.0043023857,0.000427197,0.00011004419],"category_scores_gemma":[0.00031976006,0.00037051694,0.00032880995,0.0020819465,0.0002347572,0.00042735596,0.0069079637,0.0016262559,0.000940156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059300586,0.0008340983,0.0011075323,0.00036855045,0.00046737396,0.00025928672,0.0027456288,0.00065433676,0.005987075,0.31815016,0.051014833,0.6183518],"study_design_scores_gemma":[0.001544951,0.00036597613,0.02082758,0.0003591604,0.000033866043,0.000079427096,0.0001026573,0.66749114,0.0011261974,0.2484052,0.05783388,0.0018299407],"about_ca_topic_score_codex":0.00027309847,"about_ca_topic_score_gemma":0.000032247153,"teacher_disagreement_score":0.7284915,"about_ca_system_score_codex":0.00014334041,"about_ca_system_score_gemma":0.00076542643,"threshold_uncertainty_score":0.99987465},"labels":[],"label_agreement":null},{"id":"W4387772410","doi":"10.1007/978-3-031-37238-4_4","title":"Some Further Properties of the Lucas Sequences","year":2023,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Lucas sequence; Lucas number; Mathematics; Modulo; Factorization; Integer (computer science); Sequence (biology); Section (typography); Sine; Discrete mathematics; Integer sequence; Combinatorics; Arithmetic; Fibonacci polynomials; Algorithm; Computer science; Fibonacci number; Generating function; Classical orthogonal polynomials; Orthogonal polynomials","score_opus":0.054992082819469705,"score_gpt":0.23134471022071418,"score_spread":0.17635262740124447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387772410","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00595375,0.004627102,0.0062467107,0.002338952,0.004440175,0.0027445792,0.00004611376,0.0011792844,0.9724233],"genre_scores_gemma":[0.044575084,0.00073296536,0.011502869,0.0005382605,0.00046033433,0.000119997094,0.0000022263782,0.00024822843,0.94182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981058,0.0000474789,0.0006356889,0.0003892049,0.0005340655,0.0002877573],"domain_scores_gemma":[0.9978514,0.00018483927,0.00043910046,0.0013995875,0.00007900337,0.000046091445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007100931,0.0003609334,0.0005140976,0.00026365215,0.00009822898,0.00010317344,0.002213019,0.0002431972,0.000021681482],"category_scores_gemma":[0.000064392705,0.0002369586,0.00032218063,0.00013512974,0.00046865336,0.0001742394,0.00073134823,0.00044177828,0.00009949383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024108049,0.000023758279,0.000005433606,0.0003646822,0.000047552076,0.000010018532,0.0043546287,0.000013694722,0.0002452382,0.99367756,0.00026109148,0.000993937],"study_design_scores_gemma":[0.00009385494,0.00003667756,0.0000052798155,0.0019267035,0.00002708657,0.000012531792,0.00010953208,0.00067664956,0.0013442344,0.9926116,0.0028498452,0.00030602617],"about_ca_topic_score_codex":0.0000049578166,"about_ca_topic_score_gemma":0.000018627348,"teacher_disagreement_score":0.038621336,"about_ca_system_score_codex":0.000039067112,"about_ca_system_score_gemma":0.00013352213,"threshold_uncertainty_score":0.9662891},"labels":[],"label_agreement":null},{"id":"W4388579442","doi":"10.1515/spma-2023-0105","title":"Legendre pairs of lengths<i>ℓ</i>≡ 0 (mod 5)","year":2023,"lang":"en","type":"article","venue":"Special Matrices","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Austrian Science Fund; U.S. Department of Defense","keywords":"Mathematics; Conjecture; Combinatorics","score_opus":0.013745096507448965,"score_gpt":0.23347397089837096,"score_spread":0.219728874390922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388579442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7275676,0.0008578883,0.026518654,0.0020361433,0.006169325,0.0004168265,0.000043506232,0.0019904186,0.23439965],"genre_scores_gemma":[0.9960413,0.00012023571,0.002124646,0.000053564905,0.0013437521,0.0000060719767,0.0000024615908,0.000008553881,0.0002994232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991189,0.000047221693,0.00017197977,0.00021747818,0.00023248102,0.0002119445],"domain_scores_gemma":[0.99937654,0.0001268421,0.000079630365,0.00033211856,0.000036559493,0.000048321275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030467604,0.00008766152,0.00013339505,0.00027866944,0.000092952985,0.000056192588,0.0007550438,0.0000400774,0.00010840351],"category_scores_gemma":[0.000023010274,0.00008208235,0.0001157456,0.0017272588,0.000047317193,0.00026068452,0.00021324944,0.00006835422,0.000242928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012631302,0.00003495396,0.0011436174,0.00003437279,0.000018732233,0.00002087773,0.0009848259,0.000029259969,0.0004929837,0.91054106,0.015096312,0.071590394],"study_design_scores_gemma":[0.00092081225,0.00048627742,0.03596377,0.00008704461,0.00004004648,0.000018197581,0.0008918938,0.0019391959,0.0152542135,0.5255711,0.41796178,0.00086563005],"about_ca_topic_score_codex":0.0000116458905,"about_ca_topic_score_gemma":0.000009658944,"teacher_disagreement_score":0.40286547,"about_ca_system_score_codex":0.000006569002,"about_ca_system_score_gemma":0.00002678729,"threshold_uncertainty_score":0.3347221},"labels":[],"label_agreement":null},{"id":"W4389087156","doi":"10.1016/j.jcta.2023.105834","title":"The second-order football-pool problem and the optimal rate of generalized-covering codes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Order (exchange); Mathematics; Code (set theory); Property (philosophy); Function (biology); Football; Combinatorics; Discrete mathematics; Computer science; Law","score_opus":0.00764930142739302,"score_gpt":0.2229173974703567,"score_spread":0.21526809604296368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389087156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9651912,0.0013518883,0.02047717,0.0034910305,0.006418256,0.0004141178,0.000005903986,0.00010207874,0.0025483684],"genre_scores_gemma":[0.99704844,0.0005255577,0.00144626,0.000117731455,0.00030385525,0.000010995562,2.6031242e-7,0.000014947054,0.0005319846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979597,0.0008604289,0.0005262203,0.00013657253,0.00026374226,0.00025337658],"domain_scores_gemma":[0.9971603,0.0016098891,0.0005310578,0.000349032,0.00028820036,0.000061484134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063620145,0.00015467856,0.00033967916,0.00010430883,0.00044940368,0.00030815415,0.0010544903,0.000054781318,0.000013599582],"category_scores_gemma":[0.0002684452,0.000084099855,0.00019369106,0.00064062607,0.00051859,0.00057166925,0.00037621497,0.00027300633,0.0000014843642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015877351,0.000018746014,0.000018737446,0.000019086014,0.00015582357,0.000009869715,0.0014092749,0.00018658493,0.0010955831,0.99328214,0.0003181551,0.0018982553],"study_design_scores_gemma":[0.0020663121,0.00036991705,0.00008399878,0.000040574458,0.000027199421,0.00007134095,0.00040607317,0.00041407338,0.004197837,0.97891957,0.013292293,0.00011083013],"about_ca_topic_score_codex":0.0000017726214,"about_ca_topic_score_gemma":0.0000016059045,"teacher_disagreement_score":0.031857222,"about_ca_system_score_codex":0.000011181323,"about_ca_system_score_gemma":0.00009427888,"threshold_uncertainty_score":0.3456495},"labels":[],"label_agreement":null},{"id":"W4389147223","doi":"10.54254/2753-8818/13/20240801","title":"Discrete logarithms and primitive roots: Algorithms, properties, and typical solution methods","year":2023,"lang":"en","type":"article","venue":"Theoretical and Natural Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Logarithm; Mathematics; Iterated logarithm; Integer (computer science); Binary logarithm; Discrete mathematics; Root (linguistics); Analytic number theory; Value (mathematics); Prime (order theory); Combinatorics; Field (mathematics); Pure mathematics; Computer science; Mathematical analysis","score_opus":0.019475613507888602,"score_gpt":0.29277019236077895,"score_spread":0.2732945788528903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389147223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6606847,0.0024336989,0.32672027,0.0074484763,0.00055865064,0.00036204665,0.0000046908526,0.0005022783,0.0012851969],"genre_scores_gemma":[0.9642788,0.0001420223,0.03533873,0.0001738723,0.000029676796,0.000005778739,5.017648e-7,0.000003223357,0.00002739256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985655,0.00016043762,0.00012009854,0.0005231384,0.0002445576,0.00038627014],"domain_scores_gemma":[0.9992951,0.00024837683,0.000025273603,0.0001741435,0.000054158812,0.00020294318],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017402091,0.00012659056,0.00014050807,0.00013208395,0.0005028882,0.00025534385,0.00036959062,0.000052014264,0.000003979968],"category_scores_gemma":[0.00027549593,0.00008058858,0.000023437864,0.00095551345,0.0041869353,0.00050076155,0.0008490946,0.0002074177,0.0000035232265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025125239,0.000005442182,0.00006224343,0.000006295803,0.000002657265,0.000003058685,0.00026457844,1.2967593e-7,0.00828057,0.7996204,0.00000593947,0.19172356],"study_design_scores_gemma":[0.00028486716,0.00024456598,0.040134054,0.00005426975,0.000012857021,0.000090218695,0.00009508911,0.21404769,0.006493456,0.73785424,0.000384642,0.0003040191],"about_ca_topic_score_codex":0.0000045444617,"about_ca_topic_score_gemma":7.468375e-7,"teacher_disagreement_score":0.3035941,"about_ca_system_score_codex":0.000011862339,"about_ca_system_score_gemma":0.00003700347,"threshold_uncertainty_score":0.9985231},"labels":[],"label_agreement":null},{"id":"W4389192997","doi":"10.22215/etd/2023-15755","title":"A Comparative Study on Post-Quantum Cryptographic Digital Signature Algorithms: Network Performance, Key Robustness, and Energy Consumption.","year":2023,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cryptography; Digital signature; Post-quantum cryptography; Digital Signature Algorithm; NIST; Algorithm; Public-key cryptography; Computer engineering; Theoretical computer science; Key (lock); Quantum cryptography; Robustness (evolution); Energy consumption; Hash function; Distributed computing; Computer security; Quantum; Encryption; Quantum information; Engineering","score_opus":0.01987942196517221,"score_gpt":0.25749121083770465,"score_spread":0.23761178887253245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389192997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.973223,0.00097049976,0.014046435,0.000052418836,0.0028796925,0.0006498927,0.00003641179,0.0012614136,0.006880244],"genre_scores_gemma":[0.99625355,0.00026463752,0.0005602531,0.00011498272,0.00020986925,0.00014915029,0.00043556315,0.000046496094,0.0019655013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99725354,0.00015459354,0.00044861925,0.0010435513,0.0005750454,0.0005246441],"domain_scores_gemma":[0.9982603,0.000379433,0.0002606078,0.0006550261,0.00027792694,0.00016668715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002991623,0.000621996,0.00065942196,0.00069244497,0.000566637,0.0008125138,0.0009033147,0.00032851443,0.00003107704],"category_scores_gemma":[0.000012776515,0.0005388793,0.00020464383,0.0015119942,0.0001063887,0.0006572678,0.00017686999,0.0006227429,0.000038291946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023734893,0.0040450157,0.014462583,0.0007134787,0.003764759,0.00036744555,0.029314695,0.012706942,0.000080010665,0.76143795,0.021791851,0.14894179],"study_design_scores_gemma":[0.006534055,0.015889402,0.54442513,0.0030991351,0.0007463689,0.00008757845,0.027484342,0.34686002,0.00018054752,0.038721483,0.0072300783,0.008741841],"about_ca_topic_score_codex":0.000012233534,"about_ca_topic_score_gemma":0.00010711442,"teacher_disagreement_score":0.72271645,"about_ca_system_score_codex":0.000018231638,"about_ca_system_score_gemma":0.000080383,"threshold_uncertainty_score":0.99970627},"labels":[],"label_agreement":null},{"id":"W4390973014","doi":"10.1007/s00200-023-00642-2","title":"On the classification of non-exceptional APN functions","year":2024,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Medicine","score_opus":0.010759470734211237,"score_gpt":0.22430183092138856,"score_spread":0.21354236018717732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390973014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16994962,0.00039366903,0.82638556,0.001013112,0.00006989978,0.00012891625,6.907764e-7,0.0001530413,0.0019054995],"genre_scores_gemma":[0.99462074,0.000034589983,0.005213438,0.00006556953,0.000016151505,0.000028850145,0.0000038480434,0.000006561434,0.000010242638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999396,0.000038068025,0.0001878894,0.00017235507,0.00009828481,0.00010738694],"domain_scores_gemma":[0.99859476,0.0007961918,0.00003463445,0.0005299601,0.00002184056,0.000022623764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005509692,0.00008139031,0.00008098106,0.00015420104,0.000115610914,0.00009859955,0.0004918445,0.000034365126,0.0000064848355],"category_scores_gemma":[0.000019258585,0.00006908122,0.0000371451,0.000680741,0.000039245722,0.000108847235,0.00017546714,0.00022482585,0.000010122881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012442991,0.000023247423,0.00008737997,0.000025687683,0.000009515974,1.4593991e-7,0.00031036686,0.0056949286,0.0022690617,0.95608455,0.00009079169,0.03540311],"study_design_scores_gemma":[0.000064733926,0.000020129566,0.010731195,0.00014548117,0.0000030585757,0.0000035853548,0.00006106954,0.967128,0.00020307681,0.020370182,0.001183678,0.00008583739],"about_ca_topic_score_codex":0.0000069818084,"about_ca_topic_score_gemma":8.222179e-7,"teacher_disagreement_score":0.96143305,"about_ca_system_score_codex":0.000016856635,"about_ca_system_score_gemma":0.000012847655,"threshold_uncertainty_score":0.28170505},"labels":[],"label_agreement":null},{"id":"W4391453430","doi":"10.4064/aa230804-2-9","title":"On sequences of integers with small prime factors","year":2024,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Prime (order theory); Prime factor; Combinatorics; Discrete mathematics","score_opus":0.017897390609651145,"score_gpt":0.22567275838901593,"score_spread":0.20777536777936478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391453430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73674333,0.00017415904,0.25042906,0.0011183991,0.00038194354,0.00012303927,0.000005180226,0.00036664165,0.010658246],"genre_scores_gemma":[0.9866451,0.0000059728636,0.013202742,0.00006268174,0.000012280755,0.0000037114892,8.150266e-7,0.0000069501652,0.000059745624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992181,0.000045938097,0.00011554176,0.0002821229,0.00017372012,0.00016455528],"domain_scores_gemma":[0.9991222,0.00040783544,0.00002901779,0.0003526768,0.000029761622,0.000058477683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017500864,0.00011541769,0.00012341514,0.00018024039,0.000043104552,0.00011866266,0.0005578665,0.000036418634,0.000039924686],"category_scores_gemma":[0.000029723977,0.000076416974,0.000071415285,0.00051086565,0.00013772167,0.00015470473,0.00007576502,0.00014565724,0.000013739125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017755272,0.00007780324,0.0001908449,0.000034753608,0.000065127075,0.00002728822,0.0012511676,0.000012304309,0.0057410006,0.97110134,0.00013265724,0.02134794],"study_design_scores_gemma":[0.0006133725,0.006355451,0.003631596,0.0015135997,0.00015520667,0.0000895271,0.0005444202,0.012005187,0.5110608,0.43622732,0.026373964,0.0014295933],"about_ca_topic_score_codex":0.000013426372,"about_ca_topic_score_gemma":0.000003349012,"teacher_disagreement_score":0.534874,"about_ca_system_score_codex":0.000011976978,"about_ca_system_score_gemma":0.000059410075,"threshold_uncertainty_score":0.31161937},"labels":[],"label_agreement":null},{"id":"W4391567123","doi":"10.1007/s10623-023-01351-0","title":"Using alternating de Bruijn sequences to construct de Bruijn tori","year":2024,"lang":"nl","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Construct (python library); De Bruijn graph; Computer science; Combinatorics; Mathematics; Computer network","score_opus":0.06200113887942141,"score_gpt":0.3207197266561806,"score_spread":0.25871858777675916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391567123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33767754,0.008981817,0.6495634,0.00039318146,0.0011444947,0.00033599677,0.000053773343,0.00038103684,0.0014687683],"genre_scores_gemma":[0.8379303,0.0007425018,0.15981725,0.0008577388,0.00053329224,0.000029211156,0.0000028700763,0.00005355581,0.00003324182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551463,0.00059082906,0.0006425065,0.0013302345,0.000527074,0.0013947093],"domain_scores_gemma":[0.9975922,0.000719013,0.00015288794,0.0006516837,0.00013972433,0.00074446],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002007364,0.0006670302,0.00057957263,0.0011446531,0.0008751497,0.0029451048,0.0011473293,0.00027357903,0.00011984857],"category_scores_gemma":[0.00007069656,0.0006755201,0.0005223452,0.0030523164,0.00057730335,0.0007123376,0.00040151176,0.0005789751,0.000031540763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009773832,0.00011245849,0.015845839,0.00054693146,0.00061516126,0.0005950434,0.008549654,0.001072662,0.052068233,0.8245098,0.0011089904,0.09487746],"study_design_scores_gemma":[0.0013241075,0.0023134812,0.0034116318,0.00605786,0.0009978062,0.0028111765,0.0038661237,0.3318592,0.022011282,0.58524436,0.03564492,0.0044580675],"about_ca_topic_score_codex":0.00060455897,"about_ca_topic_score_gemma":0.000048665665,"teacher_disagreement_score":0.5002528,"about_ca_system_score_codex":0.000111825895,"about_ca_system_score_gemma":0.00044980732,"threshold_uncertainty_score":0.9995696},"labels":[],"label_agreement":null},{"id":"W4392003966","doi":"10.3842/sigma.2024.016","title":"Color-Dressed Generalized Biadjoint Scalar Amplitudes: Local Planarity","year":2024,"lang":"en","type":"article","venue":"Symmetry Integrability and Geometry Methods and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; European Commission; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Planarity testing; Feynman diagram; Scalar (mathematics); Amplitude; Propagator; Mathematics; Mathematical physics; Pure mathematics; Combinatorics; Physics; Quantum mechanics; Geometry","score_opus":0.02325770731853105,"score_gpt":0.34477211347793113,"score_spread":0.3215144061594001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392003966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020121671,0.003898617,0.9726499,0.0015433051,0.0001940537,0.00041583905,0.000052123654,0.00037751903,0.0007469895],"genre_scores_gemma":[0.60852724,0.00032810392,0.39031592,0.000370784,0.00009646691,0.0002743632,0.000014599763,0.000013011278,0.000059524464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976307,0.0005093001,0.00040258607,0.0009485699,0.00018117159,0.00032766318],"domain_scores_gemma":[0.99725896,0.0015727472,0.000055139462,0.00076725415,0.000091723436,0.00025415234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030643572,0.0002609732,0.0003648592,0.00042001225,0.00041193547,0.0005227488,0.00048638802,0.00017614399,0.00004930931],"category_scores_gemma":[0.00016333745,0.00021451493,0.00016518844,0.0021415497,0.000557797,0.0002901435,0.0003181476,0.00045382424,0.000013313236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007630564,0.00007137887,0.00035075383,0.00012496213,0.000043375047,0.0000011543522,0.000105092346,0.0000018322664,0.00080527633,0.6429379,0.000083989944,0.35546666],"study_design_scores_gemma":[0.00022432786,0.00013081191,0.0032804688,0.00006157562,0.000061585924,0.000049168753,0.00025897892,0.020159332,0.0020768687,0.8641842,0.10910536,0.00040729588],"about_ca_topic_score_codex":0.00009663289,"about_ca_topic_score_gemma":0.000010372543,"teacher_disagreement_score":0.58840555,"about_ca_system_score_codex":0.000037750226,"about_ca_system_score_gemma":0.00005427474,"threshold_uncertainty_score":0.87476647},"labels":[],"label_agreement":null},{"id":"W4392919062","doi":"10.1016/j.disc.2024.113968","title":"On extremal and near-extremal self-dual ternary codes","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Ternary operation; Combinatorics; Dual (grammatical number); Discrete mathematics; Computer science","score_opus":0.012475497688923032,"score_gpt":0.24352448114496758,"score_spread":0.23104898345604455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392919062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50599307,0.0008160005,0.46934265,0.0011891833,0.0006306646,0.0002979379,0.000021528946,0.0016464347,0.020062497],"genre_scores_gemma":[0.90839714,0.000030988827,0.090987936,0.0001801955,0.00008272143,0.000013290777,0.0000025665606,0.00002426059,0.00028091983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988763,0.000046539924,0.00020737936,0.00035755723,0.00026295084,0.00024930967],"domain_scores_gemma":[0.99901867,0.0003797494,0.000039136547,0.00044938773,0.000016662285,0.00009639736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034253745,0.00019371732,0.00018202035,0.000101468846,0.0001598295,0.0007107386,0.00036369503,0.0000584572,0.00003476377],"category_scores_gemma":[0.000026256288,0.00015193548,0.00010421037,0.00027574273,0.00009163993,0.00027778346,0.00024099255,0.00016851851,0.00008936961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000491743,0.000065730324,0.00003789503,0.00020036027,0.00005132151,0.00010967831,0.0042762132,0.000012173825,0.00015525476,0.9889518,0.00062254973,0.0055120983],"study_design_scores_gemma":[0.0001883019,0.00026293093,0.00018422668,0.00039448866,0.00004709822,0.00021070857,0.00017441611,0.41659772,0.00034649647,0.57821214,0.002990234,0.00039121436],"about_ca_topic_score_codex":0.0000015532864,"about_ca_topic_score_gemma":0.0000010406364,"teacher_disagreement_score":0.41658553,"about_ca_system_score_codex":0.000012896246,"about_ca_system_score_gemma":0.000028381884,"threshold_uncertainty_score":0.68536687},"labels":[],"label_agreement":null},{"id":"W4392947762","doi":"10.1016/j.jcta.2024.105887","title":"Extremal Peisert-type graphs without the strict-EKR property","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Type (biology); Property (philosophy); Combinatorics; Mathematics; Philosophy; Geology; Epistemology; Paleontology","score_opus":0.01369679362650714,"score_gpt":0.23965393686259145,"score_spread":0.22595714323608432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392947762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6457387,0.020381995,0.106117666,0.015564479,0.1686109,0.0015008468,0.000011210232,0.0013572726,0.0407169],"genre_scores_gemma":[0.9974547,0.00017596927,0.0007126275,0.00013822805,0.00077500026,0.0000038423027,2.6167405e-7,0.000020099556,0.00071924547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772155,0.00072929956,0.00048717955,0.0002289263,0.0005338332,0.0002991961],"domain_scores_gemma":[0.9982501,0.00057263375,0.00021948543,0.00050935,0.00031827236,0.00013011969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033594568,0.00022352929,0.00031093333,0.0002459102,0.00030747108,0.00069241814,0.001615484,0.00008673769,0.00007825563],"category_scores_gemma":[0.00026028318,0.00010974592,0.0003432516,0.0012211335,0.00022964556,0.0013060436,0.000231777,0.00057736196,0.000015154063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007779743,0.00007053662,0.000102105405,0.000022585518,0.00014420057,0.000093533105,0.0012243512,0.000007654913,0.0006110376,0.98349553,0.001957929,0.011492535],"study_design_scores_gemma":[0.00037037657,0.0010125535,0.000116826195,0.00011750947,0.000054069962,0.00033560424,0.00020899698,0.0001337541,0.0009092675,0.8817655,0.114799924,0.0001756283],"about_ca_topic_score_codex":0.0000019446204,"about_ca_topic_score_gemma":4.4524037e-7,"teacher_disagreement_score":0.351716,"about_ca_system_score_codex":0.000034570276,"about_ca_system_score_gemma":0.00026695812,"threshold_uncertainty_score":0.6677004},"labels":[],"label_agreement":null},{"id":"W4393028178","doi":"10.1109/gcwkshps58843.2023.10465005","title":"Generalized Spatially-Coupled Product-Like Codes Using Zipper Codes with Irregular Degree","year":2023,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Zipper; Degree (music); Product (mathematics); Computer science; Mathematics; Algorithm; Physics; Geometry","score_opus":0.04225229409151661,"score_gpt":0.25582524645420196,"score_spread":0.21357295236268536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393028178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6080546,0.00008007407,0.38912448,0.0005358389,0.00029947946,0.00023553632,0.0000018991386,0.0009314257,0.0007367043],"genre_scores_gemma":[0.86754745,0.00001768592,0.13092667,0.00040203315,0.00012666783,0.000024078616,0.0000084134035,0.000026240226,0.0009207509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981923,0.000118871525,0.00021742325,0.00061679404,0.00038864033,0.00046594586],"domain_scores_gemma":[0.99873704,0.000081739025,0.0000758684,0.00086722284,0.0001242712,0.00011385709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006014856,0.00023183691,0.0002625539,0.00025652593,0.00030599965,0.00025445095,0.0008048049,0.00004780573,0.00008169464],"category_scores_gemma":[0.00002253407,0.00017176944,0.00009976571,0.0015413177,0.00013453644,0.00039315957,0.00028030682,0.000104586186,0.00006400027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029063935,0.00028091908,0.011572218,0.000118965625,0.00043306345,0.0002318343,0.0024375762,0.013835258,0.14133042,0.792342,0.003550764,0.033576317],"study_design_scores_gemma":[0.0025594153,0.0004143805,0.009554486,0.00015130144,0.000108901695,0.00012984377,0.00014617511,0.8888946,0.043629292,0.043998715,0.008774573,0.0016382692],"about_ca_topic_score_codex":0.00014822336,"about_ca_topic_score_gemma":0.00015312058,"teacher_disagreement_score":0.87505937,"about_ca_system_score_codex":0.000019175483,"about_ca_system_score_gemma":0.00008939623,"threshold_uncertainty_score":0.7004554},"labels":[],"label_agreement":null},{"id":"W4393179419","doi":"10.1017/9781009283403.013","title":"Rank-Metric and Subspace Codes","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Subspace topology; Rank (graph theory); Metric (unit); Computer science; Content (measure theory); Information retrieval; Mathematics; Combinatorics; Artificial intelligence; Engineering; Operations management","score_opus":0.015197975533359971,"score_gpt":0.1884363852016741,"score_spread":0.17323840966831414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393179419","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008251129,0.0012777115,0.01480945,0.00004348954,0.00036359538,0.00019096439,0.00006163306,0.000410769,0.9827599],"genre_scores_gemma":[0.0037287085,0.00027838643,0.0005888148,0.00005086728,0.000068493115,3.7716094e-7,0.0000050075264,0.000025017562,0.99525434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998709,0.00003162439,0.00011694061,0.000674985,0.00022575227,0.00024167335],"domain_scores_gemma":[0.9988648,0.00014512359,0.00009270824,0.00065377465,0.00007537732,0.00016819517],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016310049,0.00032374763,0.0003176493,0.00060592016,0.00018895773,0.00021384773,0.0009001694,0.00024140495,0.000001924407],"category_scores_gemma":[0.000005284865,0.00036315512,0.0002080521,0.00004761512,0.00024055157,0.00014641747,0.0009996714,0.00043966738,0.000022259574],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020101017,0.0000034900074,0.0000013402284,0.00008869479,0.00011391953,0.00034257543,0.000072895586,5.706633e-7,0.000015749689,0.9880777,0.00756703,0.0036959434],"study_design_scores_gemma":[0.00026521145,0.00006497394,0.000010914055,0.00018090729,0.00016343877,0.000045312707,0.000012373006,0.00041019556,0.00011536891,0.0019356637,0.996325,0.00047061648],"about_ca_topic_score_codex":0.0000244665,"about_ca_topic_score_gemma":0.0000010832048,"teacher_disagreement_score":0.98875797,"about_ca_system_score_codex":0.00005244946,"about_ca_system_score_gemma":0.000047283094,"threshold_uncertainty_score":0.99988204},"labels":[],"label_agreement":null},{"id":"W4393305872","doi":"10.1016/j.ffa.2024.102415","title":"Constructing permutation polynomials from permutation polynomials of subfields","year":2024,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Pró-Reitoria de Pesquisa, Universidade Federal de Minas Gerais; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Permutation (music); Finite field; Combinatorics; Discrete mathematics; Polynomial; Field (mathematics); Pure mathematics; Mathematical analysis","score_opus":0.010885680740948258,"score_gpt":0.23387814785765237,"score_spread":0.22299246711670412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393305872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09997293,0.0008505319,0.8939076,0.0009550425,0.00016385029,0.0002025107,0.000113345006,0.0001467394,0.0036874488],"genre_scores_gemma":[0.9948229,0.0000404169,0.004703444,0.00012125696,0.00013144911,0.000073478615,0.000040692394,0.000006986587,0.000059381422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992115,0.000048904323,0.00025925788,0.00029305063,0.00006895917,0.000118323704],"domain_scores_gemma":[0.9986354,0.0008982399,0.000077333025,0.00029535562,0.00004571497,0.000047932117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019512519,0.00011151553,0.0001493552,0.00014103268,0.0001334426,0.00015873776,0.00024205152,0.00010645584,0.00008614255],"category_scores_gemma":[0.000021827027,0.00009798867,0.00008296439,0.00035384184,0.00006922,0.0002267802,0.000075610646,0.00013044821,0.0000109947405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059632857,0.000022001474,0.00029053574,0.00004089342,0.000048986494,7.173779e-7,0.0034677563,0.000012777709,0.004474009,0.75806874,0.00013933446,0.23342825],"study_design_scores_gemma":[0.00045590798,0.0001869975,0.0020085706,0.00020051924,0.000068642126,0.000026879377,0.0024959566,0.04700802,0.043876853,0.88258827,0.020485176,0.0005982144],"about_ca_topic_score_codex":0.000046878446,"about_ca_topic_score_gemma":0.000021295033,"teacher_disagreement_score":0.89484996,"about_ca_system_score_codex":0.000008375072,"about_ca_system_score_gemma":0.00003999567,"threshold_uncertainty_score":0.3995862},"labels":[],"label_agreement":null},{"id":"W4393486369","doi":"10.5281/zenodo.825339","title":"Enumeration Of Williamson Sequences Of Even Order","year":2017,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Enumeration; Order (exchange); Combinatorics; Mathematics; Economics","score_opus":0.0339572623554256,"score_gpt":0.2704479077943061,"score_spread":0.23649064543888051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393486369","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005783497,0.0003098045,0.033116564,0.000362069,0.00046686048,0.0005589762,0.95675683,0.00037731093,0.0074732075],"genre_scores_gemma":[0.015586759,0.0003575914,0.0013358572,0.00004815569,0.00014691673,5.5271748e-8,0.9819649,0.0003976437,0.00016213804],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99828905,0.0003655247,0.00031307375,0.00038680618,0.00043941077,0.00020612954],"domain_scores_gemma":[0.9974564,0.000034564375,0.0004934382,0.0012582621,0.0006817849,0.000075570104],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008545326,0.00015377701,0.00024141381,0.00031184143,0.001037246,0.00048097633,0.003604676,0.00011543575,0.0021588427],"category_scores_gemma":[0.0005262922,0.00015576353,0.00008161699,0.00043068524,0.00025707498,0.000400005,0.0015472154,0.0002448001,0.00082310295],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001810312,0.00008294637,3.419532e-7,0.0001505113,0.000039434533,0.0000040645014,0.00020977385,0.000018047458,0.0010472907,0.003868128,0.96203417,0.03252719],"study_design_scores_gemma":[0.00015447203,0.00026745404,0.000029833725,0.00010769836,0.000018008046,0.000019285906,0.00001580943,0.000085959655,0.0008954686,0.0010757543,0.997181,0.00014927902],"about_ca_topic_score_codex":0.00003509702,"about_ca_topic_score_gemma":7.1511556e-7,"teacher_disagreement_score":0.03514681,"about_ca_system_score_codex":0.000030574556,"about_ca_system_score_gemma":0.000012000135,"threshold_uncertainty_score":0.9999549},"labels":[],"label_agreement":null},{"id":"W4394838676","doi":"10.4230/lipics.approx/random.2024.34","title":"Matrix Multiplication Reductions","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matrix multiplication; Reduction (mathematics); Matrix (chemical analysis); Mathematics; Multiplication (music); Algorithm; Random matrix; Overhead (engineering); Product (mathematics); Discrete mathematics; Combinatorics; Computer science; Physics; Eigenvalues and eigenvectors","score_opus":0.05783141494549967,"score_gpt":0.20199178987491692,"score_spread":0.14416037492941725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394838676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17182615,0.00026654272,0.81647104,0.0005908388,0.0019061378,0.00028060153,0.00001819914,0.0012093574,0.0074311215],"genre_scores_gemma":[0.9939394,0.00009357247,0.00277009,0.000026541315,0.00011694555,0.0000019303434,0.000009044315,0.000012702065,0.0030297665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985969,0.000085108804,0.00012656153,0.0009359543,0.00005369537,0.0002017609],"domain_scores_gemma":[0.9984199,0.00005559083,0.00009551112,0.0012474246,0.00008198536,0.00009958846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019289409,0.00019707473,0.0001523211,0.00038360234,0.0001568437,0.00017391989,0.0013330783,0.00018853697,0.000025804768],"category_scores_gemma":[0.000012926096,0.00023261365,0.00026021388,0.00093483046,0.0000841745,0.00016700992,0.0021261012,0.0005646212,0.00038612366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006418125,0.000042248368,0.000066441055,0.00005121585,0.000059062604,0.000044179713,0.0001997072,0.019888025,0.00010538734,0.977441,0.00076992286,0.001326358],"study_design_scores_gemma":[0.00009314886,0.000018521105,0.00014126321,0.00007091235,0.000069143534,0.0000070997357,0.000043058655,0.2034137,0.0001423941,0.7928267,0.002890415,0.00028364375],"about_ca_topic_score_codex":0.00003460389,"about_ca_topic_score_gemma":0.000006735816,"teacher_disagreement_score":0.8221133,"about_ca_system_score_codex":0.00009259064,"about_ca_system_score_gemma":0.00010000328,"threshold_uncertainty_score":0.9485709},"labels":[],"label_agreement":null},{"id":"W4395099387","doi":"10.1007/978-3-031-48679-1_14","title":"On a Class of Optimal Constant Weight Codes","year":2023,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Constant (computer programming); Class (philosophy); Mathematics; Computer science; Programming language; Artificial intelligence","score_opus":0.06101310244959245,"score_gpt":0.2808782458193701,"score_spread":0.21986514336977764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395099387","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017998958,0.00036700073,0.07936661,0.0023894461,0.0006798774,0.00022406313,0.000120439145,0.000297268,0.9165373],"genre_scores_gemma":[0.3370002,0.015842095,0.14825611,0.003102935,0.00034547757,0.00027496385,0.00084944605,0.00019902624,0.49412975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885863,0.000047649755,0.00040160422,0.00029726027,0.0002302449,0.00016460684],"domain_scores_gemma":[0.9948934,0.00063711964,0.00024781306,0.0040192,0.00013413277,0.00006836274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025162718,0.00023025495,0.0003306554,0.0003279123,0.00029216014,0.000056177847,0.003713589,0.0003110184,0.00006524504],"category_scores_gemma":[0.00005888172,0.00023101264,0.00024114386,0.00016611729,0.00061116193,0.00015983525,0.0013143292,0.0007027952,0.00014753349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007023152,0.00003677229,0.0000010220828,0.000017264385,0.00008560791,0.000005954904,0.00023013171,0.000070853115,0.000005596918,0.9897576,0.004176871,0.0056052757],"study_design_scores_gemma":[0.00017096002,0.00014193647,0.0000034652971,0.0004641167,0.000038673752,0.00000689909,0.000008210917,0.0016582884,0.000042212054,0.5318455,0.46532452,0.00029523647],"about_ca_topic_score_codex":0.000013715303,"about_ca_topic_score_gemma":0.00015192993,"teacher_disagreement_score":0.46114764,"about_ca_system_score_codex":0.000025302646,"about_ca_system_score_gemma":0.00016341846,"threshold_uncertainty_score":0.94204223},"labels":[],"label_agreement":null},{"id":"W4395099399","doi":"10.1007/978-3-031-48679-1_12","title":"Group Rings and Character Sums: Tricks of the Trade","year":2023,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Character (mathematics); Group (periodic table); Mathematics; Chemistry; Geometry; Organic chemistry","score_opus":0.05506792985972499,"score_gpt":0.2504341640557827,"score_spread":0.19536623419605775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395099399","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003842025,0.002415367,0.04133613,0.024204157,0.002523388,0.00095942523,0.0001331456,0.0005652588,0.9274789],"genre_scores_gemma":[0.7252536,0.018879918,0.020155726,0.00399695,0.00040589186,0.00020442434,0.00020241654,0.00013451626,0.23076656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919134,0.000041383824,0.00028486684,0.00021690824,0.00014881496,0.00011669309],"domain_scores_gemma":[0.99645984,0.0002533198,0.00020314757,0.0030124355,0.000029711606,0.00004156962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002274665,0.00016220492,0.00020770878,0.00014932232,0.00033425514,0.000059575457,0.0031534827,0.00022588861,0.000011945824],"category_scores_gemma":[0.00003246778,0.00013247866,0.0001750804,0.00015817054,0.0004389471,0.00021066942,0.0017433597,0.0006167813,0.000011219847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013084555,0.0000137256,0.000021743292,0.00001808935,0.000036769896,6.471542e-7,0.00052056514,3.697394e-7,0.000010015655,0.9792585,0.0006192013,0.019499097],"study_design_scores_gemma":[0.00013671839,0.000034205583,0.00094551104,0.00027773072,0.000043832122,0.000009476172,0.000008881483,0.00016945195,0.000017815206,0.24219885,0.75594306,0.00021446595],"about_ca_topic_score_codex":0.000021189848,"about_ca_topic_score_gemma":0.00017797959,"teacher_disagreement_score":0.7553238,"about_ca_system_score_codex":0.000010955236,"about_ca_system_score_gemma":0.00004320644,"threshold_uncertainty_score":0.5860008},"labels":[],"label_agreement":null},{"id":"W4395667498","doi":"10.4064/aa230330-21-2","title":"Additive decompositions of large multiplicative subgroups in finite fields","year":2024,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multiplicative function; Mathematics; Finite field; Multiplicative group; Combinatorics; Field (mathematics); Pure mathematics; Multiplicative inverse; Inverse; Mathematical analysis; Geometry","score_opus":0.009240028293323056,"score_gpt":0.2672007845938596,"score_spread":0.25796075630053655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395667498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06601489,0.00038079993,0.91464543,0.0035293153,0.00035198912,0.0002679452,0.00013212973,0.0002738663,0.014403604],"genre_scores_gemma":[0.9849992,0.00002989223,0.014709552,0.00015923726,0.000021933265,0.000031969244,0.000007822942,0.0000055764,0.00003482654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991417,0.00008252216,0.00018077622,0.00028238946,0.00011246391,0.00020017006],"domain_scores_gemma":[0.9985152,0.001031659,0.00002823616,0.00033627494,0.000040814284,0.000047846097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024299807,0.00009394696,0.00012992027,0.0002656274,0.000052887466,0.000062736006,0.0004425039,0.000059387385,0.00008023853],"category_scores_gemma":[0.00006776136,0.00008891788,0.00009430922,0.0008500168,0.00006464912,0.00024824502,0.00018145588,0.00019837604,0.000026713538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105051795,0.0002637793,0.00018368116,0.000023662078,0.00004264157,0.000032994998,0.0032472238,0.000007708715,0.0010473316,0.9796088,0.0006652575,0.014866449],"study_design_scores_gemma":[0.0015318312,0.0010538056,0.026882438,0.00092329166,0.00008392544,0.00005108941,0.0005996246,0.31793365,0.044915263,0.53264207,0.07223451,0.0011485314],"about_ca_topic_score_codex":0.000010640268,"about_ca_topic_score_gemma":0.00002661542,"teacher_disagreement_score":0.9189843,"about_ca_system_score_codex":0.000013563108,"about_ca_system_score_gemma":0.000031005176,"threshold_uncertainty_score":0.3625966},"labels":[],"label_agreement":null},{"id":"W4396243126","doi":"10.5802/alco.344","title":"Bivariate <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>P</mml:mi> </mml:math> -polynomial association schemes","year":2024,"lang":"en","type":"article","venue":"Algebraic Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; American Heart Association","keywords":"Association scheme; Bivariate analysis; Generalization; Mathematics; Polynomial; Intersection (aeronautics); Association (psychology); Discrete mathematics; Combinatorics; Statistics; Mathematical analysis; Cartography; Psychology","score_opus":0.012333815138695157,"score_gpt":0.2275865630329706,"score_spread":0.21525274789427543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396243126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982823,0.000689632,0.006439337,0.0008634024,0.004522429,0.000048737977,0.000011607015,0.00061269104,0.0039891624],"genre_scores_gemma":[0.998004,0.00010696284,0.0007843835,0.0003953558,0.00033902025,0.00007021384,0.000023107463,0.000055899127,0.0002210617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758667,0.00011604231,0.00041597633,0.00062099367,0.00068573066,0.00057460007],"domain_scores_gemma":[0.9980697,0.0006615449,0.00025999092,0.0007662131,0.00007101813,0.00017154927],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011186746,0.00026419558,0.00017354556,0.00020629901,0.0004570188,0.00081759825,0.0009926832,0.00036963963,0.000036618698],"category_scores_gemma":[0.0003098023,0.00032705945,0.00038239014,0.0010918835,0.00009127714,0.0007018477,0.00066906924,0.0005225892,0.0009129826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018432409,0.00009889314,0.000035392863,0.00009335417,0.00018313229,0.00008088851,0.0008229435,0.0000100560765,0.0002761418,0.9916641,0.003093323,0.003623349],"study_design_scores_gemma":[0.0009536061,0.0006302515,0.0002958708,0.00032304347,0.00025628315,0.00010127438,0.00015562128,0.5696452,0.010694282,0.34260666,0.07342984,0.0009080449],"about_ca_topic_score_codex":0.000047872345,"about_ca_topic_score_gemma":0.000008078431,"teacher_disagreement_score":0.64905745,"about_ca_system_score_codex":0.000051128758,"about_ca_system_score_gemma":0.0002868325,"threshold_uncertainty_score":0.99991816},"labels":[],"label_agreement":null},{"id":"W4396584860","doi":"10.1007/s00373-024-02788-3","title":"Ternary Extremal Four-Negacirculant Self-Dual Codes","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Dual (grammatical number); Ternary operation; Discrete mathematics; Computer science","score_opus":0.013059801209253449,"score_gpt":0.21164270032346905,"score_spread":0.1985828991142156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396584860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8786006,0.013079791,0.08956346,0.0010048121,0.004623813,0.0002899636,0.0000140275615,0.0031740114,0.009649532],"genre_scores_gemma":[0.9982506,0.0003557999,0.001145499,0.000108690525,0.00002960311,0.000011675017,0.0000014547068,0.0000112380085,0.00008540934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988728,0.000057116427,0.00015611088,0.00041147557,0.00022907347,0.00027340563],"domain_scores_gemma":[0.9993512,0.000122615,0.00002608202,0.0003428294,0.00003333782,0.00012394738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029549116,0.00017007532,0.00015181767,0.00023076811,0.00019509457,0.00046273018,0.0003632931,0.000069106674,0.000006521048],"category_scores_gemma":[0.00000557537,0.00014853835,0.00012391184,0.0008114488,0.000054486867,0.00033405225,0.00020887212,0.00018820186,0.000013889032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026353628,0.00006004164,0.0019398403,0.000049432954,0.000048737904,0.00023110583,0.00044200252,7.239377e-7,0.0000901596,0.9852845,0.0006480929,0.011202694],"study_design_scores_gemma":[0.00020645806,0.00016846322,0.0025042442,0.00005458988,0.000027324577,0.00026381877,0.000032180542,0.011893154,0.00012193292,0.9685391,0.015909173,0.00027952975],"about_ca_topic_score_codex":0.0000073594483,"about_ca_topic_score_gemma":8.2388283e-7,"teacher_disagreement_score":0.11965004,"about_ca_system_score_codex":0.000013325292,"about_ca_system_score_gemma":0.000033583867,"threshold_uncertainty_score":0.60572183},"labels":[],"label_agreement":null},{"id":"W4396691412","doi":"10.3390/math12101429","title":"Secure Key Exchange in Tropical Cryptography: Leveraging Efficiency with Advanced Block Matrix Protocols","year":2024,"lang":"en","type":"article","venue":"Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key exchange; Block (permutation group theory); Cryptography; Theoretical computer science; Cryptographic protocol; Implementation; Distributed computing; Key (lock); Protocol (science); Algorithm; Mathematics; Computer network; Public-key cryptography; Encryption; Computer security","score_opus":0.015025953523157843,"score_gpt":0.27593166329989566,"score_spread":0.2609057097767378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396691412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12504674,0.00036720632,0.8661325,0.00050723675,0.00014024496,0.004592641,0.0000028293202,0.0007361862,0.0024744226],"genre_scores_gemma":[0.6879109,0.000017013308,0.30861735,0.00011174635,0.0000814823,0.0031232997,0.0000010504081,0.000044317687,0.00009281276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998475,0.00005679421,0.00029846083,0.00042844677,0.0003533674,0.00038792935],"domain_scores_gemma":[0.99909794,0.000170836,0.00005787181,0.00055648,0.000035854075,0.00008099138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030529537,0.0002246914,0.0002513331,0.0003820364,0.00009029888,0.00032277976,0.0006927495,0.00006596874,0.0000257129],"category_scores_gemma":[0.00002069836,0.00017135341,0.000110356654,0.0015744431,0.000066449255,0.0002935213,0.00015672932,0.00027767784,0.000032229935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025589456,0.0004295746,0.0007524169,0.0015270563,0.000037330417,0.00021860414,0.016277082,0.00038240151,0.00044566358,0.96980995,0.0002229332,0.009871421],"study_design_scores_gemma":[0.0027474149,0.0018004916,0.0016574563,0.006948719,0.00006571299,0.00044757302,0.0010546548,0.29957703,0.0030909202,0.6459371,0.034677442,0.0019955079],"about_ca_topic_score_codex":0.0000012778446,"about_ca_topic_score_gemma":0.000005600782,"teacher_disagreement_score":0.5628642,"about_ca_system_score_codex":0.000028693152,"about_ca_system_score_gemma":0.000050073235,"threshold_uncertainty_score":0.69875896},"labels":[],"label_agreement":null},{"id":"W4396758762","doi":"10.1016/j.ffa.2024.102442","title":"Nilpotent linearized polynomials over finite fields, revisited","year":2024,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Nilpotent; Finite field; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.013120139164921706,"score_gpt":0.24181829841122354,"score_spread":0.22869815924630182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396758762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014061386,0.0020199632,0.988697,0.002538851,0.0001498365,0.0002801759,0.000045127355,0.0003278699,0.0045350245],"genre_scores_gemma":[0.99377877,0.0004113016,0.0032926425,0.0013920479,0.00026008204,0.00017678547,0.000027095006,0.000011593989,0.0006496986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905676,0.0000457367,0.0002240192,0.00039950784,0.00007911823,0.00019483788],"domain_scores_gemma":[0.9985059,0.00075143535,0.000039996346,0.00057815155,0.000033180113,0.00009137485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024384631,0.00015462944,0.00016275705,0.0001502304,0.00021316134,0.0003449959,0.00040612835,0.00013238407,0.000120449615],"category_scores_gemma":[0.000024635177,0.00012278743,0.00013073983,0.00058006914,0.00004357314,0.00016763584,0.00018645918,0.00024641267,0.00006518346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012190407,0.00006632439,0.000062407766,0.00007824331,0.000084536114,0.000004770264,0.0012285686,0.00005844908,0.00044028732,0.8245704,0.00426554,0.16912827],"study_design_scores_gemma":[0.00027491132,0.00010719367,0.00027208586,0.000111457404,0.00002730184,0.0000110256215,0.00003590747,0.07404081,0.00066935783,0.27616057,0.6479151,0.00037423888],"about_ca_topic_score_codex":0.0000129521395,"about_ca_topic_score_gemma":0.0000036554566,"teacher_disagreement_score":0.99237263,"about_ca_system_score_codex":0.0000056970166,"about_ca_system_score_gemma":0.000028457322,"threshold_uncertainty_score":0.50071263},"labels":[],"label_agreement":null},{"id":"W4396773962","doi":"10.1007/s12095-024-00720-3","title":"Additive codes with few weights","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.013635971077980277,"score_gpt":0.2440361152280393,"score_spread":0.23040014415005902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396773962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013913054,0.02716504,0.8896034,0.0057550673,0.00020016858,0.0003362016,0.00006116031,0.0014023135,0.06156362],"genre_scores_gemma":[0.9299183,0.002171465,0.067533284,0.00021197327,0.00002282828,0.00008775474,0.000018750075,0.000009581116,0.000026062984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991796,0.00012115597,0.00012623417,0.00028462568,0.00011285785,0.00017553473],"domain_scores_gemma":[0.9980598,0.0004130025,0.000027836835,0.0013492561,0.000057875972,0.00009219634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017944003,0.000136995,0.00011504942,0.00031847364,0.0005342501,0.00042753047,0.0011535401,0.000043797063,0.000020316495],"category_scores_gemma":[0.0000046366636,0.00010682293,0.0000961799,0.0013718251,0.00046904004,0.00046736712,0.00032654608,0.00022693476,0.000016017186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037611208,0.000040805677,0.00023574814,0.0000104688015,0.00007313075,0.0000029459213,0.0010712647,2.6147887e-7,0.000029911665,0.93192506,0.0003955767,0.06621107],"study_design_scores_gemma":[0.00021886904,0.00023070231,0.003888412,0.00030091807,0.00006670609,0.000066366905,0.00039113997,0.0028091518,0.00035503347,0.66156226,0.32969067,0.00041978387],"about_ca_topic_score_codex":0.000009436538,"about_ca_topic_score_gemma":0.00002872648,"teacher_disagreement_score":0.91600525,"about_ca_system_score_codex":0.000004758372,"about_ca_system_score_gemma":0.000035786605,"threshold_uncertainty_score":0.43561128},"labels":[],"label_agreement":null},{"id":"W4396786710","doi":"10.48550/arxiv.2405.03681","title":"Low complexity among principal fully irreducible elements of Out($F_3$)","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; National Science Foundation","keywords":"Principal (computer security); Computer science; Mathematics; Computer security","score_opus":0.09778688757724818,"score_gpt":0.21011341495262886,"score_spread":0.11232652737538068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396786710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8527647,0.000052333016,0.13529487,0.00004120407,0.001418169,0.0003144576,0.000047706046,0.00034099785,0.0097255325],"genre_scores_gemma":[0.99680203,0.000026594404,0.0018058865,0.000024955825,0.000068738205,0.0000014174403,0.000014518312,0.000019018085,0.0012368433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759036,0.00018168802,0.00035063393,0.0012878735,0.00016633642,0.00042309426],"domain_scores_gemma":[0.99760336,0.00007632971,0.00032551846,0.0016519111,0.00015484985,0.00018800917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005497966,0.00036754383,0.0004310304,0.0005026321,0.00012916425,0.00014043524,0.002574879,0.00023207447,0.000098973476],"category_scores_gemma":[0.000017957576,0.00041839178,0.00046018077,0.00081131933,0.00037282147,0.00023465848,0.0053300573,0.0007349733,0.00010762686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005142275,0.00028196195,0.006267637,0.000547627,0.0002565241,0.00023292859,0.0008606414,0.0078976,0.00012127003,0.98145014,0.00038625966,0.001645966],"study_design_scores_gemma":[0.00049510086,0.00014774327,0.0040622307,0.0005153916,0.00017110113,0.000005110513,0.00011888408,0.10969942,0.0019848552,0.8815971,0.000434789,0.00076826604],"about_ca_topic_score_codex":0.00008419609,"about_ca_topic_score_gemma":0.00009440799,"teacher_disagreement_score":0.14403729,"about_ca_system_score_codex":0.00011245817,"about_ca_system_score_gemma":0.00020370817,"threshold_uncertainty_score":0.9998268},"labels":[],"label_agreement":null},{"id":"W4396896613","doi":"10.3390/app14104085","title":"Enhancing Field Multiplication in IoT Nodes with Limited Resources: A Low-Complexity Systolic Array Solution","year":2024,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Prince Sattam bin Abdulaziz University","keywords":"Computer science; Cryptography; Multiplier (economics); Distributed computing; Multiplication (music); Internet of Things; Field-programmable gate array; Embedded system; Computer security; Mathematics","score_opus":0.023769059919736137,"score_gpt":0.24822382730306583,"score_spread":0.2244547673833297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396896613","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5151038,0.00013743012,0.4793574,0.00066392473,0.00009376747,0.00016562817,4.5459808e-7,0.0002746263,0.0042029647],"genre_scores_gemma":[0.97436905,0.000003648484,0.025292467,0.00022050172,0.000043173928,0.000055287477,5.8036454e-7,0.000004076335,0.000011241151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986098,0.000049726234,0.00018635146,0.000566156,0.00029149427,0.0002964818],"domain_scores_gemma":[0.99925274,0.00032835905,0.00004944677,0.0002994494,0.000019336512,0.000050646235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091508037,0.00012149884,0.00011989616,0.00033911946,0.00030901143,0.0003872832,0.00073290226,0.00004770938,0.0000070170568],"category_scores_gemma":[0.000022998525,0.00009347057,0.000035067136,0.0021638402,0.0002537524,0.00024873664,0.000080831065,0.00015043175,0.000025655065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036100777,0.00008306345,0.0007473109,0.0001320626,0.000010187417,0.000006821585,0.008750541,0.0005125823,0.2061995,0.74787855,0.000039919225,0.035603352],"study_design_scores_gemma":[0.0010200824,0.0007575186,0.016021179,0.0019727855,0.000034451146,0.00007155555,0.0027698039,0.2764994,0.42512617,0.27100855,0.0029846816,0.0017338468],"about_ca_topic_score_codex":0.00007733965,"about_ca_topic_score_gemma":0.00024822904,"teacher_disagreement_score":0.47687,"about_ca_system_score_codex":0.00003061116,"about_ca_system_score_gemma":0.000059635946,"threshold_uncertainty_score":0.38116193},"labels":[],"label_agreement":null},{"id":"W4397028602","doi":"10.48550/arxiv.2405.10159","title":"Artin-Schreier towers of finite fields","year":2024,"lang":"en","type":"preprint","venue":"Conicet","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fondo para la Investigación Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Finite field; Mathematics; Pure mathematics; Discrete mathematics","score_opus":0.01942421436895959,"score_gpt":0.2554171752170396,"score_spread":0.23599296084808002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4397028602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105710834,0.010543733,0.68116266,0.0064107543,0.013653702,0.000692032,0.0000890283,0.0011664113,0.18057084],"genre_scores_gemma":[0.99372464,0.00008246358,0.005086398,0.00039967944,0.00011933814,0.00002065584,0.0000049436585,0.000011281234,0.0005506189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882954,0.000048341783,0.00027946255,0.0004635967,0.00017559461,0.00020343214],"domain_scores_gemma":[0.99846536,0.00020021203,0.00012253615,0.0010855113,0.00006408139,0.000062275205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003933216,0.00017781107,0.000265577,0.00017316404,0.000032212767,0.00014459473,0.0012590629,0.00021740985,0.00012841569],"category_scores_gemma":[0.00005140132,0.00016961702,0.00028395889,0.00025920875,0.000074454794,0.000050149192,0.0024638595,0.00065712846,0.000098204015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016393607,0.000052887888,0.000080678976,0.00049271446,0.00018852658,0.000047997248,0.0020822699,0.0008522267,0.00011077711,0.9014482,0.009846904,0.08478042],"study_design_scores_gemma":[0.00016878977,0.00010035201,0.000098954464,0.00050805387,0.000059222606,0.000005067479,0.000026285197,0.013364395,0.0031790342,0.9225069,0.05956848,0.00041442068],"about_ca_topic_score_codex":0.000009331602,"about_ca_topic_score_gemma":0.0000032364167,"teacher_disagreement_score":0.8880138,"about_ca_system_score_codex":0.000011669765,"about_ca_system_score_gemma":0.00015725452,"threshold_uncertainty_score":0.6916781},"labels":[],"label_agreement":null},{"id":"W4398262841","doi":"10.1007/jhep05(2024)256","title":"Basis decompositions of genus-one string integrals","year":2024,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Institut Périmètre de physique théorique; Knut och Alice Wallenbergs Stiftelse; Government of Canada; Ministry of Colleges and Universities; Innovation, Science and Economic Development Canada","keywords":"Genus; Basis (linear algebra); String (physics); Mathematics; Pure mathematics; Zoology; Biology; Mathematical physics; Geometry","score_opus":0.015432382776057624,"score_gpt":0.23863621922833292,"score_spread":0.2232038364522753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398262841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09730484,0.0006282172,0.90091956,0.0002404389,0.0005321278,0.000008797913,0.0000031438674,0.000029929583,0.0003329428],"genre_scores_gemma":[0.97634315,0.00011188475,0.023173107,0.000055304736,0.00028563247,7.6175144e-7,6.332548e-7,0.0000070519673,0.000022480468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919343,0.00005712367,0.0003001197,0.00010528938,0.00022786045,0.00011620629],"domain_scores_gemma":[0.99929494,0.00016157681,0.00015562058,0.00019966128,0.00012878042,0.000059438426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019885974,0.0000864894,0.00019525911,0.00017171874,0.000051352854,0.00009167219,0.00048664963,0.00002825926,0.000010007401],"category_scores_gemma":[0.0000061788064,0.000073508236,0.0002471157,0.00060140475,0.0000359356,0.0004749043,0.00008338407,0.00014776092,0.0000018394877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062854047,0.00007357861,0.000010451624,0.000013394452,0.00011321324,0.000015963733,0.00013015472,0.00058404636,0.0025364275,0.9263519,0.00023440235,0.06993017],"study_design_scores_gemma":[0.00012948459,0.00019267251,0.0002041588,0.00026439386,0.000051602754,0.00004281099,0.000014985255,0.0013249122,0.090967715,0.9050294,0.0016731843,0.000104634884],"about_ca_topic_score_codex":0.000014993413,"about_ca_topic_score_gemma":0.0000015499335,"teacher_disagreement_score":0.8790383,"about_ca_system_score_codex":0.000021333673,"about_ca_system_score_gemma":0.00006019599,"threshold_uncertainty_score":0.29975787},"labels":[],"label_agreement":null},{"id":"W4399051511","doi":"10.1112/jlms.12938","title":"Blocking sets, minimal codes and trifferent codes","year":2024,"lang":"en","type":"article","venue":"Journal of the London Mathematical Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Fonds Wetenschappelijk Onderzoek","keywords":"Blocking (statistics); Block code; Computer science; Algorithm; Computer network; Decoding methods","score_opus":0.0169197979942907,"score_gpt":0.2593375928641306,"score_spread":0.24241779486983991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399051511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6612947,0.0028677657,0.328243,0.0064573297,0.0005342147,0.00011581245,0.0000032993755,0.00007777141,0.00040614922],"genre_scores_gemma":[0.96727955,0.00010504107,0.032165207,0.00023761597,0.000113690185,0.0000014782037,5.626807e-8,0.000008219398,0.00008913827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988843,0.00010428793,0.00034421604,0.0001331082,0.00035550958,0.00017856403],"domain_scores_gemma":[0.99883676,0.00068827847,0.00012363978,0.00021303183,0.000049766557,0.00008850629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011668092,0.00012010949,0.00024274434,0.000032412263,0.00015397146,0.00035877645,0.00063529133,0.00006068028,0.000023712419],"category_scores_gemma":[0.0000777396,0.00006484909,0.00050353346,0.0002719273,0.00013161542,0.00019808448,0.0002531285,0.00035540838,0.000004041573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025544678,0.00020711805,0.00043333424,0.00056988525,0.00045115795,0.000029019133,0.008417077,0.000020283009,0.0044930866,0.94655305,0.010050267,0.028750196],"study_design_scores_gemma":[0.00040558513,0.00017544992,0.0008294696,0.00088701164,0.00014056887,0.0007029801,0.00029742927,0.05349388,0.0030665908,0.9358628,0.0039328495,0.000205423],"about_ca_topic_score_codex":2.8016214e-7,"about_ca_topic_score_gemma":1.9197095e-7,"teacher_disagreement_score":0.30598488,"about_ca_system_score_codex":0.000026362024,"about_ca_system_score_gemma":0.000040020455,"threshold_uncertainty_score":0.34596896},"labels":[],"label_agreement":null},{"id":"W4399695835","doi":"10.48550/arxiv.2406.09302","title":"The reflection complexity of sequences over finite alphabets","year":2024,"lang":"en","type":"preprint","venue":"Open Repository and Bibliography (University of Liège)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts; Fonds De La Recherche Scientifique - FNRS","keywords":"Reflection (computer programming); Computer science; Mathematics; Theoretical computer science; Programming language","score_opus":0.043960474005396315,"score_gpt":0.26988739621173546,"score_spread":0.22592692220633914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399695835","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9153151,0.009046484,0.018145168,0.0021061113,0.003129215,0.0011488344,0.00009837548,0.00026527958,0.050745424],"genre_scores_gemma":[0.9929716,0.0026029309,0.0041421484,0.000019075082,0.000032506032,0.0000011768973,0.0000034348734,0.000005729074,0.00022139144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838966,0.00031134163,0.00023788356,0.0005721924,0.00030745665,0.00018146735],"domain_scores_gemma":[0.9983111,0.00025167663,0.00041255992,0.00077316456,0.00016674257,0.000084742846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008330317,0.00020241266,0.0003428919,0.003745787,0.0007415158,0.0005839322,0.0023184118,0.00018074141,0.000008676162],"category_scores_gemma":[4.4420878e-7,0.00017903555,0.00038820977,0.007259155,0.0010654668,0.0004387273,0.004445201,0.00043873995,9.921698e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092964526,0.0005694011,0.15536603,0.002050397,0.0030354795,0.0003010763,0.0064409473,0.00016215359,0.010342594,0.7842343,0.026441861,0.010126102],"study_design_scores_gemma":[0.0006798477,0.0007495796,0.15105078,0.0014920948,0.00045483487,0.000057854628,0.0013114412,0.0037580945,0.0036934167,0.8323296,0.0035155753,0.0009069197],"about_ca_topic_score_codex":0.0018843383,"about_ca_topic_score_gemma":0.00006025056,"teacher_disagreement_score":0.0776565,"about_ca_system_score_codex":0.0000074228697,"about_ca_system_score_gemma":0.000083320185,"threshold_uncertainty_score":0.73008573},"labels":[],"label_agreement":null},{"id":"W4400035848","doi":"10.1109/tit.2024.3417894","title":"A New Version of q-Ary Varshamov-Tenengolts Codes With More Efficient Encoders: The Differential VT Codes and The Differential Shifted VT Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Advanced Education and Technology","keywords":"Differential coding; Block code; Luby transform code; Encoder; Turbo code; Linear code; Computer science; Differential (mechanical device); Raptor code; Concatenated error correction code; Algorithm; Mathematics; Discrete mathematics; Decoding methods; Physics","score_opus":0.005042429923905955,"score_gpt":0.20200954126550688,"score_spread":0.19696711134160091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400035848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115050755,0.000103612176,0.8826541,0.0005927149,0.0005795077,0.0003857829,0.000082307626,0.00024662705,0.00030460206],"genre_scores_gemma":[0.99884534,0.000071989016,0.00072586513,0.00019721573,0.000035948375,0.00004506394,0.000011968479,0.000011569804,0.000055037435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831283,0.00033282847,0.0004008462,0.00023041193,0.0004819027,0.00024120176],"domain_scores_gemma":[0.9981233,0.0010423842,0.00013640491,0.000510518,0.000085120846,0.000102290025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062431896,0.00025848747,0.0002482321,0.00032834648,0.0005599892,0.00043380284,0.00061584165,0.000092874776,0.00012442318],"category_scores_gemma":[0.000011888275,0.00014035474,0.00019867494,0.00062116823,0.0005295029,0.0007788166,0.00001743074,0.00036081742,0.000018157934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040389798,0.00023597643,0.0000067141523,0.00030069955,0.00069825473,0.0000037589316,0.052791208,0.018930772,0.00071542914,0.77924556,0.00050835434,0.14252427],"study_design_scores_gemma":[0.008842259,0.0011620747,0.0011578555,0.0013815814,0.0009486071,0.00015392472,0.008910935,0.8478415,0.048565745,0.07782682,0.0019601004,0.0012485874],"about_ca_topic_score_codex":0.000033034186,"about_ca_topic_score_gemma":0.000011384716,"teacher_disagreement_score":0.8837946,"about_ca_system_score_codex":0.000029281367,"about_ca_system_score_gemma":0.0001080569,"threshold_uncertainty_score":0.57235},"labels":[],"label_agreement":null},{"id":"W4400078434","doi":"10.1007/s10623-024-01436-4","title":"A survey of compositional inverses of permutation polynomials over finite fields","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Permutation (music); Finite field; Commutative property; Permutation matrix; Field (mathematics); Diagram; Pure mathematics; Algebra over a field; Combinatorics; Discrete mathematics; Statistics","score_opus":0.03562764391565341,"score_gpt":0.2733777045295219,"score_spread":0.23775006061386852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400078434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36327496,0.0016515903,0.63417387,0.000059773793,0.00016039315,0.00009723924,0.00008841607,0.00006692758,0.0004267923],"genre_scores_gemma":[0.9933497,0.00013325186,0.006379994,0.00008509836,0.000016133992,0.0000070024153,0.000019719426,0.0000060668985,0.000003050812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989665,0.00018853132,0.000272197,0.0002504509,0.00018737321,0.00013492955],"domain_scores_gemma":[0.99870664,0.00086228095,0.00007800675,0.00020221471,0.0000965568,0.000054321466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005478851,0.00012322576,0.00021036486,0.00043614503,0.00006812193,0.00009337637,0.00023652181,0.000069391186,0.00003856091],"category_scores_gemma":[0.000024564613,0.000112606336,0.00015359368,0.0009764211,0.00015235602,0.00024604474,0.00006511618,0.00008268312,0.0000011030625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121675206,0.00016550862,0.031018008,0.0002992113,0.00029929547,0.000011248513,0.0020926667,0.00019144274,0.017786998,0.9214264,0.0010909876,0.025496535],"study_design_scores_gemma":[0.0014129361,0.0019137902,0.5821881,0.0008647419,0.00019313721,0.00003463543,0.00022758516,0.09305204,0.03308009,0.28402424,0.0018778954,0.0011307832],"about_ca_topic_score_codex":0.00013754434,"about_ca_topic_score_gemma":0.000025225581,"teacher_disagreement_score":0.6374022,"about_ca_system_score_codex":0.000002969038,"about_ca_system_score_gemma":0.000042496344,"threshold_uncertainty_score":0.45919532},"labels":[],"label_agreement":null},{"id":"W4400484767","doi":"10.61091/jcmcc120-040","title":"The Domination Number of C n □ P m for n ≡ 2 ( mod 5 )","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; Combinatorics","score_opus":0.011969324701241036,"score_gpt":0.2727788284367423,"score_spread":0.26080950373550127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400484767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.248709,0.0016577854,0.70569545,0.00076028705,0.041197803,0.00047008696,0.000002667205,0.00009430314,0.0014126328],"genre_scores_gemma":[0.9832771,0.000049693128,0.015865158,0.000007378961,0.00077518646,0.000002860054,2.2900839e-7,0.000015391366,0.0000070296655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982478,0.00008658291,0.00084130437,0.00016053094,0.0004438232,0.00021996],"domain_scores_gemma":[0.99581957,0.0028037545,0.00054529886,0.00024722872,0.00050386554,0.00008027577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003030594,0.00016392411,0.0003797596,0.00012753662,0.0003109131,0.00049722433,0.00073120365,0.00008609854,0.0000012090475],"category_scores_gemma":[0.00037719545,0.000114731294,0.0002731933,0.0004189444,0.00009228185,0.00031268748,0.00019256488,0.00024322548,9.198916e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003991491,0.000106455525,0.00001111241,0.00017843442,0.00009110289,0.0000035193914,0.00088082947,0.0000071548297,0.0002560094,0.98108745,0.00026500865,0.017073035],"study_design_scores_gemma":[0.0010825619,0.00037302045,0.000010781854,0.0002985188,0.000052140684,0.0000767314,0.00010561784,0.03435326,0.0010643477,0.9589607,0.0034975186,0.0001248152],"about_ca_topic_score_codex":9.732456e-7,"about_ca_topic_score_gemma":5.991772e-8,"teacher_disagreement_score":0.73456806,"about_ca_system_score_codex":0.000031460986,"about_ca_system_score_gemma":0.000118852906,"threshold_uncertainty_score":0.47947457},"labels":[],"label_agreement":null},{"id":"W4400499032","doi":"10.1007/978-3-031-64171-8_23","title":"SmmPack: Obfuscation for SMM Modules with TPM Sealed Key","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Systems, Applications & Products in Data Processing (Canada)","funders":"","keywords":"Computer science; Obfuscation; Key (lock); Programming language; Computer security","score_opus":0.013910048823303605,"score_gpt":0.23443216042550555,"score_spread":0.22052211160220195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400499032","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015739235,0.00054101076,0.99170154,0.0013729768,0.0012291233,0.0006143123,0.000012761843,0.00034805387,0.0040228423],"genre_scores_gemma":[0.20569217,0.000042610696,0.7903318,0.0016256318,0.000931427,0.00007888212,0.000019260173,0.000088639266,0.0011895902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966857,0.000022235374,0.0003640213,0.0016208182,0.00070098933,0.0006062359],"domain_scores_gemma":[0.9975625,0.00051678915,0.00018416556,0.001312428,0.00026710503,0.0001569933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085572386,0.00052272656,0.00043211455,0.0009638017,0.0003027034,0.00088233553,0.0026424767,0.00024283881,0.00001119068],"category_scores_gemma":[0.000035381745,0.0004198536,0.00019534871,0.00086819555,0.0006053846,0.00053413893,0.0006352376,0.0005417993,0.000034860426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023674289,0.000022388336,0.0000126828645,0.00011596268,0.000027000897,0.000023588007,0.00091499917,0.007022963,0.00012397564,0.6463792,0.000045073863,0.34528852],"study_design_scores_gemma":[0.00021959428,0.00034037977,0.00003771231,0.00063729635,0.00001839831,0.000047480204,2.385963e-7,0.23868579,0.0008884201,0.75538886,0.0031870056,0.0005488632],"about_ca_topic_score_codex":0.0000061279766,"about_ca_topic_score_gemma":0.00006096885,"teacher_disagreement_score":0.34473965,"about_ca_system_score_codex":0.00015560452,"about_ca_system_score_gemma":0.00033425193,"threshold_uncertainty_score":0.99982536},"labels":[],"label_agreement":null},{"id":"W4400543041","doi":"10.1007/s00493-024-00112-4","title":"Unavoidable Flats in Matroids Representable over Prime Fields","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Prime (order theory); Graphic matroid; Discrete mathematics","score_opus":0.007505440034048896,"score_gpt":0.24720173998075382,"score_spread":0.2396962999467049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400543041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4207992,0.017207863,0.33149725,0.0057929214,0.012228469,0.0010102086,0.0000040153645,0.0035331897,0.20792687],"genre_scores_gemma":[0.9971579,0.000029787192,0.00082195067,0.00011820444,0.00003652202,0.00002258432,7.0738474e-7,0.000010077475,0.0018023127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988232,0.00007087827,0.00017841836,0.00042343957,0.00019353918,0.00031047544],"domain_scores_gemma":[0.99908024,0.00016105275,0.000020451818,0.0006458752,0.000018753506,0.000073596784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034924515,0.000121526864,0.00014491557,0.00023039283,0.000077912766,0.00028056398,0.0007086271,0.00008106556,0.00007796384],"category_scores_gemma":[0.000024125973,0.00011583299,0.0000915019,0.0014036248,0.00002486773,0.00046225992,0.0003324952,0.00026441432,0.00012263465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000526607,0.00006904736,0.0013206728,0.000037113237,0.000012998082,0.00010186811,0.00035141586,0.000015234445,0.00042013885,0.98145664,0.009561863,0.0066477596],"study_design_scores_gemma":[0.0003172665,0.00012310481,0.0026619865,0.000116698466,0.000006077099,0.0000148931695,0.0000123669115,0.012468072,0.003396743,0.91024137,0.07037164,0.00026976952],"about_ca_topic_score_codex":0.000050089617,"about_ca_topic_score_gemma":0.0000029420753,"teacher_disagreement_score":0.5763587,"about_ca_system_score_codex":0.00006898443,"about_ca_system_score_gemma":0.000060331266,"threshold_uncertainty_score":0.47235322},"labels":[],"label_agreement":null},{"id":"W4400596744","doi":"10.55016/ojs/cdm.v15i1.62718","title":"An elementary, geometric proof of the non-existence of a projective plane of order 6","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Narodowym Centrum Nauki","keywords":"Projective plane; Mathematics; Elementary proof; Projective test; Order (exchange); Combinatorics; Plane (geometry); Collineation; Blocking set; Binary number; Line at infinity; Pure mathematics; Discrete mathematics; Projective space; Geometry; Arithmetic","score_opus":0.014683256317517292,"score_gpt":0.2749188379889225,"score_spread":0.26023558167140526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103223324,0.000022516257,0.8941367,0.0010363907,0.000040004415,0.0007532507,0.00027968816,0.000022654349,0.00048542192],"genre_scores_gemma":[0.96189517,0.0000019125562,0.037963238,0.000086527965,0.000012192283,0.000026044727,0.00000468946,0.000004826416,0.0000053957056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99886537,0.00006498095,0.00042150173,0.00018648218,0.0002963574,0.00016533179],"domain_scores_gemma":[0.99840224,0.00015557928,0.00031175173,0.0006205591,0.00043115966,0.00007868712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037065244,0.00010933619,0.0002866778,0.00014019698,0.00007372008,0.000016782624,0.0010545835,0.000033531138,0.00001114212],"category_scores_gemma":[0.0004676119,0.00007725944,0.000109080225,0.0026840765,0.0001215226,0.00013333265,0.00028209592,0.000083394014,0.0000014105556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009791536,0.0011696176,0.0018188175,0.0007724591,0.00025679273,0.0000019030064,0.019128934,0.000716185,0.028482262,0.9424297,0.00051431614,0.0046110954],"study_design_scores_gemma":[0.0022686834,0.0040717465,0.0041349474,0.0006672821,0.00029125772,0.000010217678,0.002890622,0.0961175,0.72564256,0.16272728,0.0005055587,0.0006723624],"about_ca_topic_score_codex":0.000011685114,"about_ca_topic_score_gemma":0.000003972758,"teacher_disagreement_score":0.85867184,"about_ca_system_score_codex":0.000016964193,"about_ca_system_score_gemma":0.0000975958,"threshold_uncertainty_score":0.3150549},"labels":[],"label_agreement":null},{"id":"W4400956666","doi":"10.1016/j.disc.2024.114179","title":"m-Distance-regular graphs and their relation to multivariate P-polynomial association schemes","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; American Heart Association","keywords":"Mathematics; Association scheme; Combinatorics; Relation (database); Multivariate statistics; Discrete mathematics; Polynomial; Statistics; Computer science","score_opus":0.010421698671277943,"score_gpt":0.23907503008408365,"score_spread":0.2286533314128057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400956666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12089371,0.00028536117,0.8751308,0.0011362685,0.00034674964,0.00020887512,0.000011159567,0.000415307,0.0015717949],"genre_scores_gemma":[0.946942,0.000014448878,0.052560966,0.00009152736,0.000046127014,0.000022826614,0.000004461838,0.000016560823,0.0003011217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907786,0.000047825084,0.00021615154,0.00028647363,0.00017302009,0.00019865877],"domain_scores_gemma":[0.9992479,0.00026171483,0.00006792907,0.00031238032,0.00003553687,0.00007454623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057001057,0.0001488571,0.00015561527,0.00015352623,0.00013162034,0.00040589337,0.0002586842,0.00007178123,0.000007281817],"category_scores_gemma":[0.00009620306,0.00011787903,0.000094481955,0.0005008869,0.000022426146,0.0003576476,0.00013451169,0.00011526632,0.00003064374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038879175,0.00001803006,0.0001350482,0.00007793106,0.00005657054,0.0000020259356,0.007127754,0.000012055566,0.0022427305,0.98188466,0.0005689861,0.007870332],"study_design_scores_gemma":[0.00022115662,0.00007544753,0.00066969014,0.00030606013,0.000032062584,0.000006343905,0.00030814993,0.1461729,0.0033233904,0.82761633,0.020890819,0.00037767057],"about_ca_topic_score_codex":0.0000029192308,"about_ca_topic_score_gemma":0.0000022528404,"teacher_disagreement_score":0.82604825,"about_ca_system_score_codex":0.000043592536,"about_ca_system_score_gemma":0.00001692451,"threshold_uncertainty_score":0.48069674},"labels":[],"label_agreement":null},{"id":"W4401159343","doi":"10.1007/978-981-96-0944-4_11","title":"On the Semidirect Discrete Logarithm Problem in Finite Groups","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa; University of Waterloo","funders":"","keywords":"Discrete logarithm; Logarithm; Computer science; Algebra over a field; Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.012888119266516262,"score_gpt":0.22533632136950263,"score_spread":0.21244820210298637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401159343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000074805524,0.0005415321,0.9678462,0.0037527096,0.0014568733,0.00045778102,0.000007897377,0.00023302952,0.025629146],"genre_scores_gemma":[0.8077915,0.00019553037,0.1781323,0.010529536,0.0011090819,0.00010996194,0.00001100018,0.0001428482,0.001978261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622685,0.00008470471,0.00046459318,0.0016464246,0.00088519795,0.0006922044],"domain_scores_gemma":[0.9957623,0.0023711654,0.00015430956,0.0015256095,0.00007716849,0.00010944212],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002085797,0.0005604653,0.00042934448,0.001175691,0.00025282448,0.001280192,0.0042924355,0.00029210123,0.000030790296],"category_scores_gemma":[0.00011820918,0.00038010074,0.00021764835,0.0015572915,0.0007581605,0.00047075938,0.0016829482,0.0018004831,0.000107251864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008148556,0.000017169627,0.000011352553,0.000032816355,0.000010365646,0.00014790251,0.0010478459,0.010343023,0.000015122222,0.80453634,0.000045284796,0.18378463],"study_design_scores_gemma":[0.000097883676,0.00015830103,0.000020010064,0.00094926736,0.0000050336434,0.00002514768,2.1689317e-7,0.17401825,0.00017702642,0.8223167,0.0018164429,0.0004157184],"about_ca_topic_score_codex":0.000015610865,"about_ca_topic_score_gemma":0.0001036451,"teacher_disagreement_score":0.80771667,"about_ca_system_score_codex":0.0001864599,"about_ca_system_score_gemma":0.00021696153,"threshold_uncertainty_score":0.9998651},"labels":[],"label_agreement":null},{"id":"W4401454217","doi":"10.1007/s10623-024-01462-2","title":"Towards a classification of permutation binomials of the form $$x^i+ax$$ over $${\\mathbb {F}}_{2^n}$$","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Combinatorics; Mathematics; Integer (computer science); Cyclic permutation; Permutation group; Discrete mathematics; Symmetric group; Physics; Computer science","score_opus":0.028964156805887153,"score_gpt":0.2662369917211128,"score_spread":0.23727283491522566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401454217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49299106,0.0013719302,0.5029769,0.0002802621,0.00031153747,0.00026596052,0.000023308416,0.00011399661,0.0016650545],"genre_scores_gemma":[0.99364007,0.0001538979,0.0060787094,0.00005414515,0.00002937191,0.000024719668,0.0000026133744,0.000009888167,0.0000066007296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998763,0.00012118109,0.00035010508,0.0003124424,0.0002775738,0.00017567795],"domain_scores_gemma":[0.9990947,0.00017419466,0.00014098694,0.00044985279,0.000089897076,0.000050359045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005698968,0.00015438673,0.00021090047,0.00036770376,0.00012223546,0.00013464654,0.00050008966,0.00008149561,0.000015197089],"category_scores_gemma":[0.000020079471,0.0001070268,0.0003013895,0.001432174,0.00023179957,0.0003427163,0.0001095917,0.0001033184,0.0000011293542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017667298,0.00004941038,0.0017239344,0.00014790786,0.00006794985,8.6253016e-7,0.0017876847,0.000006208562,0.049433645,0.89647126,0.00022219715,0.050071273],"study_design_scores_gemma":[0.0006605429,0.00053896575,0.1634441,0.00054517883,0.00019370172,0.000031018175,0.0005231463,0.030889168,0.0596763,0.7371724,0.0057521253,0.0005733172],"about_ca_topic_score_codex":0.000021968328,"about_ca_topic_score_gemma":0.000005267513,"teacher_disagreement_score":0.500649,"about_ca_system_score_codex":0.000008270611,"about_ca_system_score_gemma":0.00006229738,"threshold_uncertainty_score":0.4364426},"labels":[],"label_agreement":null},{"id":"W4401541962","doi":"10.1117/12.3026738","title":"Circuit implementation of Shor's algorithm for the factorization of small integers in Qiskit","year":2024,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Factorization; Algorithm; Parallel computing","score_opus":0.0289716943697705,"score_gpt":0.2877319611699004,"score_spread":0.2587602668001299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401541962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037854922,0.000081181155,0.9953106,0.00013741432,0.0002465068,0.00017701495,0.0000064777278,0.00003071117,0.00022462496],"genre_scores_gemma":[0.9885115,0.0000111776135,0.011398802,0.000021616599,0.000015452553,0.00001751514,0.0000029508576,0.00000284741,0.000018151915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954575,0.000022191616,0.00018122593,0.00011399417,0.000063364656,0.000073472205],"domain_scores_gemma":[0.9995357,0.00024884118,0.000034033015,0.00013500109,0.00003715635,0.000009282598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003658858,0.000043560565,0.000059928858,0.00012279444,0.00001757787,0.00003165206,0.00025433052,0.000017122491,0.000025975594],"category_scores_gemma":[0.000007039993,0.000030357092,0.000058479687,0.0004453907,0.000019601217,0.00012712469,0.00003502688,0.000031782558,4.8301337e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.949584e-7,0.000007455066,0.0002576748,0.000016370486,0.000012320149,9.3649206e-8,0.0012589924,0.000018306797,0.000928193,0.42269683,0.000029250883,0.5747737],"study_design_scores_gemma":[0.0006331845,0.00046946426,0.0076678167,0.000114933064,0.000043450727,0.0000026643747,0.0035549584,0.45121297,0.10566359,0.42646334,0.003907674,0.00026594906],"about_ca_topic_score_codex":0.000071102,"about_ca_topic_score_gemma":0.000060102284,"teacher_disagreement_score":0.984726,"about_ca_system_score_codex":0.000010523532,"about_ca_system_score_gemma":0.000028849801,"threshold_uncertainty_score":0.123792626},"labels":[],"label_agreement":null},{"id":"W4401693525","doi":"10.1109/isit57864.2024.10619580","title":"Unequal Message Protection: One-Shot analysis via Poisson Matching Lemma","year":2024,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Qualcomm (Canada); University of Toronto","funders":"","keywords":"Poisson distribution; Shot (pellet); Lemma (botany); Computer science; Matching (statistics); Mathematics; Statistics","score_opus":0.04926335140884894,"score_gpt":0.27585601238633956,"score_spread":0.22659266097749062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401693525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029117621,0.0001346817,0.95874476,0.0014016775,0.0002877969,0.00010392075,0.0000010476579,0.0008637088,0.009344796],"genre_scores_gemma":[0.98858654,0.0000035348303,0.010499323,0.00014190598,0.00008209263,0.00001992032,0.0000016970782,0.0000072377616,0.0006577166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987894,0.00010439407,0.00018310356,0.00044986594,0.0002530668,0.00022015993],"domain_scores_gemma":[0.9993504,0.00006720654,0.000027253402,0.00045568516,0.000027331176,0.00007208903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060592836,0.00012628555,0.00015991286,0.00049177057,0.00017483067,0.0005188286,0.00048605812,0.000053257067,0.00032219276],"category_scores_gemma":[0.0000052043847,0.000109766515,0.00025745717,0.002998359,0.000023749973,0.0005338024,0.000160186,0.00018540307,0.00010226568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009346576,0.000059876424,0.0000859413,0.000043296357,0.00056518085,0.00004177494,0.0014321032,0.00052144274,0.0046397825,0.898715,0.000110104105,0.093776114],"study_design_scores_gemma":[0.00025017606,0.00030332233,0.0021157153,0.00011107164,0.00051247573,0.000034943856,0.00018519243,0.43709496,0.0125315,0.5349792,0.010970904,0.00091049017],"about_ca_topic_score_codex":0.000119545,"about_ca_topic_score_gemma":0.000051829265,"teacher_disagreement_score":0.95946896,"about_ca_system_score_codex":0.000022767637,"about_ca_system_score_gemma":0.000020209356,"threshold_uncertainty_score":0.50030756},"labels":[],"label_agreement":null},{"id":"W4401989792","doi":"10.1109/ojcoms.2024.3452040","title":"A Simpler Proof on the Existence of Good Nested Lattice Codes Over Imaginary Quadratic Integers for AWGN Channel","year":2024,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Science and Technology Council","keywords":"Quadratic equation; Mathematics; Lattice (music); Additive white Gaussian noise; Channel (broadcasting); Combinatorics; Discrete mathematics; Computer science; Physics; Telecommunications","score_opus":0.08755874170739679,"score_gpt":0.35183127727660596,"score_spread":0.26427253556920915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401989792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089001454,0.00820477,0.5896765,0.29107302,0.003288365,0.004637319,0.00011359413,0.00014259155,0.013862409],"genre_scores_gemma":[0.9792998,0.00013689538,0.019325808,0.0009851672,0.000034662695,0.000044504075,5.681369e-7,0.000011183539,0.00016145103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986659,0.00045507023,0.0003908565,0.00012677019,0.00021867311,0.00014273034],"domain_scores_gemma":[0.9953554,0.00220119,0.00034658646,0.0017944365,0.00026300742,0.000039368148],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0023752654,0.000115017654,0.00019246076,0.000039905175,0.00051803706,0.00037313622,0.0077440324,0.00003798212,0.0000058633696],"category_scores_gemma":[0.000113707894,0.00006425946,0.00046749937,0.0007033432,0.0003527434,0.0005753252,0.000862431,0.0004463029,0.0000016089161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000677251,0.0005036747,0.000073294075,0.00013259046,0.00061759644,0.0000012454695,0.023805697,0.00046883567,0.0032781307,0.9342835,0.030934907,0.0058328025],"study_design_scores_gemma":[0.0010786598,0.00083549897,0.00074635365,0.0027658374,0.00035815808,0.00018588325,0.005415479,0.25707424,0.008369328,0.6982695,0.024415093,0.00048599587],"about_ca_topic_score_codex":0.00001049917,"about_ca_topic_score_gemma":0.0000072536463,"teacher_disagreement_score":0.8902983,"about_ca_system_score_codex":0.000047918395,"about_ca_system_score_gemma":0.00021029369,"threshold_uncertainty_score":0.9976246},"labels":[],"label_agreement":null},{"id":"W4402099575","doi":"10.1007/s10623-024-01475-x","title":"Frequency distance sequences for packet detection in physical-layer security","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Physical layer; Network packet; Layer (electronics); Cryptography; Algorithm; Computer network; Computer science; Telecommunications; Wireless","score_opus":0.02300675260800494,"score_gpt":0.27151274400503,"score_spread":0.24850599139702506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402099575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24232669,0.0018896535,0.75434417,0.00016642842,0.00025531216,0.00028144705,0.000022828339,0.00027784292,0.0004356137],"genre_scores_gemma":[0.9907913,0.0001730752,0.008669285,0.00008714391,0.00009421501,0.00016465588,0.0000034447955,0.0000134261045,0.0000034114248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985322,0.000110070636,0.0002082795,0.00061670516,0.00017066131,0.00036212846],"domain_scores_gemma":[0.99916357,0.00034761854,0.000042692078,0.0003057708,0.000046076748,0.00009424983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047182498,0.00022461421,0.00022605891,0.0004048203,0.00019373331,0.00044280966,0.00036342218,0.00007661362,0.0000042040024],"category_scores_gemma":[0.00001652287,0.00019585153,0.00022651824,0.0015059608,0.00015978135,0.00060117187,0.0000498376,0.00018323863,0.0000028604543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021186295,0.00007753737,0.001242267,0.00014113299,0.000041350937,0.00001726866,0.001997615,0.0000051898505,0.012374606,0.9279641,0.000083367486,0.056034382],"study_design_scores_gemma":[0.0002134535,0.00025948236,0.000987963,0.00011726102,0.000020538324,0.000011147058,0.00012179844,0.022370316,0.0081694545,0.9651557,0.0022363022,0.0003365444],"about_ca_topic_score_codex":0.000034163553,"about_ca_topic_score_gemma":0.00011221328,"teacher_disagreement_score":0.74846464,"about_ca_system_score_codex":0.000016142421,"about_ca_system_score_gemma":0.000027021817,"threshold_uncertainty_score":0.7986594},"labels":[],"label_agreement":null},{"id":"W4402766525","doi":"10.1080/00150517.2019.12427663","title":"A Class of Exponential Sequences with Shift-Invariant Discriminators","year":2019,"lang":"en","type":"article","venue":"˜The œFibonacci quarterly","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Exponential function; Invariant (physics); Class (philosophy); Pure mathematics; Artificial intelligence; Computer science; Mathematical analysis; Mathematical physics","score_opus":0.007380506141431615,"score_gpt":0.20403577098095924,"score_spread":0.1966552648395276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402766525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.908991,0.000061361534,0.0864031,0.0006691862,0.0004763559,0.00028872702,0.00000468523,0.00012652042,0.0029791028],"genre_scores_gemma":[0.998306,9.207907e-7,0.0013774167,0.00012918108,0.000047861296,0.00001949935,0.0000016518561,0.000011706503,0.00010578587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984158,0.00018109557,0.00027091807,0.00040640964,0.000396507,0.00032923737],"domain_scores_gemma":[0.998597,0.00016440741,0.00017721001,0.00093488477,0.000049289083,0.00007717599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044584734,0.00019467057,0.00023399648,0.0001239879,0.00012528535,0.00015099255,0.0013499516,0.000056478097,0.00005628733],"category_scores_gemma":[0.0000015474834,0.00012059472,0.00014122862,0.000501536,0.00015604681,0.0004548632,0.00006910532,0.00016079872,0.00007531959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016554426,0.00015535558,0.0045860405,0.00005287004,0.00010752647,0.000026075873,0.015119608,0.000022915632,0.0037418026,0.9508448,0.00014007172,0.025037337],"study_design_scores_gemma":[0.006201402,0.020535536,0.13580267,0.00070505374,0.0003259176,0.00035235385,0.013833605,0.021443646,0.0078078853,0.77866113,0.011080907,0.0032498983],"about_ca_topic_score_codex":0.00010060617,"about_ca_topic_score_gemma":0.00013404526,"teacher_disagreement_score":0.17218374,"about_ca_system_score_codex":0.000014022163,"about_ca_system_score_gemma":0.000077217286,"threshold_uncertainty_score":0.491771},"labels":[],"label_agreement":null},{"id":"W4402768742","doi":"10.3934/amc.2024039","title":"An RSA cryptosystem based on Lehmer sequences in Some classes of groups","year":2024,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cryptosystem; Pure mathematics; Arithmetic; Algebra over a field; Cryptography; Algorithm","score_opus":0.02368202647637344,"score_gpt":0.3274646391995649,"score_spread":0.30378261272319146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402768742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18260522,0.029008092,0.7515184,0.0028724745,0.0006600054,0.00107142,0.000052157255,0.0004472255,0.03176498],"genre_scores_gemma":[0.8615847,0.0006131603,0.13772728,0.000022358887,0.000004600175,0.00003575428,0.000002866697,0.0000059837853,0.0000032732664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887085,0.00018886889,0.0004750153,0.0001576679,0.00018972934,0.000117862066],"domain_scores_gemma":[0.9964663,0.0015301915,0.00013594632,0.0017986236,0.000044888966,0.000024077512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007651615,0.00009853065,0.00022209334,0.00042112664,0.00004126903,0.00003835852,0.0021134398,0.000038095168,0.0000048571164],"category_scores_gemma":[0.00006472752,0.00008889027,0.000063201194,0.0008882897,0.00019734727,0.0009096257,0.00013874,0.00015906591,0.0000030899432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022697202,0.0003291744,0.00034277892,0.00029657665,0.0000043177415,8.7192757e-7,0.0014472761,0.0024596292,0.0005729327,0.99107903,0.0000027758783,0.0034623719],"study_design_scores_gemma":[0.000096479394,0.00010807858,0.000115948365,0.0011342574,0.000004831144,0.0000010959269,0.0004812599,0.26708364,0.0012343084,0.72912806,0.000512927,0.000099115176],"about_ca_topic_score_codex":0.000006736333,"about_ca_topic_score_gemma":0.000090264904,"teacher_disagreement_score":0.6789795,"about_ca_system_score_codex":0.000022277422,"about_ca_system_score_gemma":0.000055681307,"threshold_uncertainty_score":0.39273322},"labels":[],"label_agreement":null},{"id":"W4402811173","doi":"10.1109/tit.2024.3467194","title":"The Mean and Variance of the Reciprocal Merit Factor of Four Classes of Binary Sequences","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reciprocal; Binary number; Variance (accounting); Mathematics; Statistics; Factor (programming language); Combinatorics; Computer science; Arithmetic; Linguistics","score_opus":0.013838930947939402,"score_gpt":0.22778885495100865,"score_spread":0.21394992400306925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402811173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061483413,0.00014837841,0.936444,0.00029147908,0.00067892304,0.00013518115,0.000033048604,0.00004795538,0.00073764834],"genre_scores_gemma":[0.9991852,0.00010296103,0.00061967445,0.000038081314,0.0000055311657,0.000010299674,1.4871196e-7,0.0000022854194,0.0000358029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991964,0.00014925378,0.0003076032,0.00007182168,0.00019533005,0.00007958343],"domain_scores_gemma":[0.99880636,0.00068645674,0.00012637218,0.00028775036,0.00007410726,0.000018985727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058452337,0.00007406052,0.00009286768,0.00011926645,0.00016327441,0.0000498289,0.0004052361,0.000042017768,0.000012465593],"category_scores_gemma":[0.000013063671,0.000042928117,0.00010058867,0.0004944132,0.00029544454,0.00082926796,0.0000050841613,0.00013525526,0.0000021685698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103922896,0.000032742995,0.00000724316,0.00021046029,0.000099630925,2.1899226e-7,0.009598513,0.0016724331,0.0042907214,0.7659304,0.00003138711,0.21802229],"study_design_scores_gemma":[0.0007080915,0.0010930893,0.0019440276,0.0011624916,0.00013974399,0.000065330125,0.0050844117,0.064463615,0.49540055,0.4225612,0.006858296,0.00051915785],"about_ca_topic_score_codex":0.0000045738584,"about_ca_topic_score_gemma":0.0000031522052,"teacher_disagreement_score":0.9377018,"about_ca_system_score_codex":0.000008563911,"about_ca_system_score_gemma":0.000065306696,"threshold_uncertainty_score":0.17505579},"labels":[],"label_agreement":null},{"id":"W4402955314","doi":"10.48550/arxiv.2409.01929","title":"On the gcd graphs over polynomial rings","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Foundation for Science and Technology Development","keywords":"Mathematics; Combinatorics; Polynomial; Polynomial ring; Discrete mathematics","score_opus":0.04367791074753419,"score_gpt":0.1731613111773378,"score_spread":0.1294834004298036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402955314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.935982,0.00009667771,0.03517421,0.00061757106,0.002153182,0.00027931746,0.00001715278,0.0005966948,0.025083177],"genre_scores_gemma":[0.997999,0.000041843505,0.00007951074,0.00047376662,0.000087860266,0.0000013007178,0.0000019598115,0.000017831786,0.0012969113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982064,0.00016203559,0.00013662671,0.0010503471,0.0001111468,0.00033344975],"domain_scores_gemma":[0.9979125,0.0003098362,0.000112123766,0.0015110312,0.000041711497,0.00011274167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038329914,0.00032141092,0.00021505448,0.00040006192,0.00024152812,0.00030952285,0.00261276,0.0002111691,0.000102623686],"category_scores_gemma":[0.00002277768,0.0002702196,0.0004887846,0.0009390757,0.0001781564,0.0001235486,0.0033541275,0.0010616083,0.00030035764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031908352,0.000039358172,0.0001543599,0.00002575284,0.00010122621,0.00015737329,0.0002203169,0.0029929338,0.000020024336,0.99105823,0.0048145885,0.00038391547],"study_design_scores_gemma":[0.00015938607,0.00006040964,0.00044145397,0.00012971445,0.00006141022,0.0000028608051,0.00002495878,0.036438584,0.000111928326,0.95984715,0.0023490475,0.00037309082],"about_ca_topic_score_codex":0.000060819053,"about_ca_topic_score_gemma":0.000013271157,"teacher_disagreement_score":0.062016997,"about_ca_system_score_codex":0.000077329314,"about_ca_system_score_gemma":0.000096633186,"threshold_uncertainty_score":0.999975},"labels":[],"label_agreement":null},{"id":"W4403165328","doi":"10.61091/jcmcc122-29","title":"On Negacyclic Codes of Length 8 p s over F p m + u F p m","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Biology; Mathematics; Physics; Horticulture","score_opus":0.011746528716764532,"score_gpt":0.25635946195902387,"score_spread":0.24461293324225933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8940455,0.0011429448,0.0771944,0.00019695608,0.024882369,0.00018842492,0.0000021957098,0.00012281931,0.0022243983],"genre_scores_gemma":[0.9942865,0.000046182824,0.0049313135,0.00002653187,0.00068211876,7.5251313e-7,2.5025656e-7,0.000022150243,0.0000042090796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997634,0.00013209194,0.0009890251,0.0002545871,0.0007131024,0.00027721038],"domain_scores_gemma":[0.99669087,0.0019600808,0.00058193324,0.00035922715,0.00025448596,0.00015341608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018646814,0.00026301885,0.0006583401,0.00044522935,0.00015690037,0.0004264423,0.00083701796,0.0001260732,0.000007638982],"category_scores_gemma":[0.00031390003,0.00021727876,0.0003123248,0.000678095,0.00010192971,0.00040051513,0.0002833526,0.00050592073,0.0000027642789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044665303,0.00032558898,0.000023090415,0.00022501747,0.00013049388,0.00003564956,0.0010977362,0.000025113248,0.00059981004,0.99077964,0.0003270784,0.0063861455],"study_design_scores_gemma":[0.0013356414,0.001265692,0.000049675644,0.0009075782,0.000059675716,0.00007721544,0.000061245664,0.015799578,0.0016981862,0.9775731,0.00094717334,0.00022523775],"about_ca_topic_score_codex":0.0000028516945,"about_ca_topic_score_gemma":7.3525996e-8,"teacher_disagreement_score":0.100241,"about_ca_system_score_codex":0.000041465155,"about_ca_system_score_gemma":0.00012637874,"threshold_uncertainty_score":0.88603705},"labels":[],"label_agreement":null},{"id":"W4403165702","doi":"10.61091/ars-160-10","title":"A Note on Complete Classification of Repeated-Root σ -Constacyclic Codes of Prime Power Length over F p m [ u ] / ⟨ u 3 ⟩ and their Hamming Distances","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamming distance; Prime (order theory); Combinatorics; Hamming code; Root (linguistics); Prime power; Discrete mathematics; Statistics; Block code","score_opus":0.014657195662445307,"score_gpt":0.248646103392119,"score_spread":0.2339889077296737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403165702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98811126,0.0007862982,0.00808063,0.00016459732,0.00074506155,0.00012298068,0.000014146038,0.00012187892,0.001853136],"genre_scores_gemma":[0.9996026,0.000025911988,0.00032023346,0.000018286133,0.0000034607783,0.000005595129,0.0000024788199,0.000008918854,0.000012520385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989511,0.000101615806,0.00027858533,0.00034316716,0.0001740094,0.0001515412],"domain_scores_gemma":[0.99881244,0.0004849059,0.00012577612,0.00047405166,0.000057432742,0.000045384775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039536573,0.00014063375,0.00022128223,0.00016097922,0.00007669757,0.00008252566,0.0003653064,0.000051180104,0.000005146456],"category_scores_gemma":[0.00003968713,0.0001150362,0.0000870311,0.00046807673,0.00018472906,0.00024410326,0.00010190381,0.00012827753,0.0000024175374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024230567,0.000065038155,0.0026382003,0.00004499693,0.000037493654,0.000002361014,0.0015432247,8.3768043e-7,0.01698522,0.971041,0.000051004718,0.007566395],"study_design_scores_gemma":[0.00054083916,0.00045341352,0.032224208,0.00053268956,0.00002139644,0.0000064546107,0.00013630402,0.005715406,0.03356099,0.922154,0.00435629,0.00029798292],"about_ca_topic_score_codex":0.000008323097,"about_ca_topic_score_gemma":0.000004879452,"teacher_disagreement_score":0.048886973,"about_ca_system_score_codex":0.000015440934,"about_ca_system_score_gemma":0.00003573826,"threshold_uncertainty_score":0.469104},"labels":[],"label_agreement":null},{"id":"W4403537073","doi":"10.1016/j.ffa.2024.102520","title":"Stable binomials over finite fields","year":2024,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Finite field; Pure mathematics; Algebra over a field; Combinatorics","score_opus":0.014667909028146828,"score_gpt":0.2384795716512006,"score_spread":0.22381166262305377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403537073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027899467,0.0012285686,0.98140436,0.0015756504,0.00017328339,0.00018444331,0.000036530142,0.00027719245,0.012329992],"genre_scores_gemma":[0.99601835,0.00020133275,0.0018323839,0.00077642,0.00015378841,0.0001779351,0.0000107399965,0.000008424236,0.00082060735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992389,0.000027615399,0.0001558825,0.0003311616,0.00006282052,0.00018361842],"domain_scores_gemma":[0.9987047,0.00068836566,0.000025523852,0.0004858858,0.000023196975,0.00007235775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019358011,0.000123438,0.00011465866,0.00012495888,0.00020428684,0.00032054973,0.000372661,0.000107279426,0.00014597952],"category_scores_gemma":[0.00001173425,0.00009930574,0.000084642685,0.00049068313,0.000040284915,0.00021399242,0.00016298449,0.00019045483,0.000066782486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002530864,0.000029107387,0.000055436838,0.0000327719,0.000029691575,0.0000016816119,0.00086986757,0.000052237527,0.00010949957,0.917572,0.0023966846,0.07884849],"study_design_scores_gemma":[0.000099062665,0.00006143136,0.0001870709,0.00003699128,0.000010035709,0.000004794821,0.000038250466,0.02663424,0.00058955455,0.425203,0.54692304,0.00021251444],"about_ca_topic_score_codex":0.000016170205,"about_ca_topic_score_gemma":0.000009644186,"teacher_disagreement_score":0.99322844,"about_ca_system_score_codex":0.0000048812194,"about_ca_system_score_gemma":0.000029516686,"threshold_uncertainty_score":0.40495706},"labels":[],"label_agreement":null},{"id":"W4403964093","doi":"10.1016/j.ffa.2024.102536","title":"Quasi-polycyclic and skew quasi-polycyclic codes over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:msub></mml:math>","year":2024,"lang":"lv","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Carleton University","keywords":"Skew; Mathematics; Computer science","score_opus":0.01852373439247834,"score_gpt":0.24274089607668084,"score_spread":0.2242171616842025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403964093","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3448591,0.004399036,0.043265868,0.0021843982,0.0021355026,0.00008600784,0.00045083344,0.00043457007,0.60218465],"genre_scores_gemma":[0.99035096,0.0021729437,0.0022300188,0.0015365769,0.001286646,0.0013767664,0.00042845632,0.00030448547,0.0003131477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.994551,0.00025675612,0.0011503136,0.0015900836,0.0009859519,0.0014659006],"domain_scores_gemma":[0.99427074,0.0019344494,0.00081365847,0.0021574865,0.00006381191,0.0007598631],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012716504,0.0006364525,0.0002615555,0.0004936169,0.0016889034,0.0020800917,0.0017852584,0.0015257781,0.13682336],"category_scores_gemma":[0.0002631232,0.0011010725,0.0010280728,0.0013882073,0.0011910237,0.0010336968,0.0015440345,0.0013137134,0.00095457555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039170246,0.0002767424,0.0000135649225,0.00066234334,0.00081768906,0.0002110548,0.0034713568,0.00009432959,0.00077324663,0.90282434,0.07914996,0.011313685],"study_design_scores_gemma":[0.0019067641,0.0021709339,0.00022170036,0.001578012,0.0012656524,0.0013348003,0.0021154897,0.11602342,0.8301251,0.009152325,0.031891793,0.002214038],"about_ca_topic_score_codex":0.0010303055,"about_ca_topic_score_gemma":0.0007931135,"teacher_disagreement_score":0.893672,"about_ca_system_score_codex":0.0000063620896,"about_ca_system_score_gemma":0.0006580577,"threshold_uncertainty_score":0.9998233},"labels":[],"label_agreement":null},{"id":"W4404192098","doi":"10.1137/24m1633376","title":"Shape Enumerators of Self-Dual NRT Codes over Finite Fields","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton; University of Saskatchewan","funders":"Algoma University","keywords":"Mathematics; Finite field; Dual (grammatical number); Combinatorics; Discrete mathematics","score_opus":0.013323530558958904,"score_gpt":0.25979826793906785,"score_spread":0.24647473738010894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404192098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33303368,0.0010338924,0.64833975,0.001375264,0.0018822226,0.0002156546,0.00002522446,0.0004950577,0.0135992905],"genre_scores_gemma":[0.97101974,0.00014050203,0.028324667,0.0002162754,0.00015582322,0.0000028980537,6.921678e-7,0.000018795841,0.00012057578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986092,0.00007983964,0.0004349022,0.00019241187,0.00044503127,0.00023862132],"domain_scores_gemma":[0.998735,0.00057305896,0.0001504506,0.00036682741,0.000055907814,0.000118731376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073477306,0.00018148114,0.00025227197,0.00024812328,0.00012411783,0.00039074608,0.0005698411,0.000081036786,0.00018474548],"category_scores_gemma":[0.00007179791,0.00013424686,0.00027154587,0.0004667571,0.00004799988,0.00033001954,0.00012641474,0.00041401322,0.000042604013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001120719,0.00015348775,0.000058934376,0.0002867002,0.0002212589,0.00014662683,0.00607497,0.00016376417,0.00028346374,0.98397565,0.0022430841,0.006380864],"study_design_scores_gemma":[0.00047786892,0.0010002821,0.0001598297,0.0015820235,0.00012651154,0.00043507398,0.00035136467,0.3188389,0.004105939,0.66115767,0.011153866,0.0006106872],"about_ca_topic_score_codex":4.2540225e-7,"about_ca_topic_score_gemma":4.9667347e-7,"teacher_disagreement_score":0.6379861,"about_ca_system_score_codex":0.000020465233,"about_ca_system_score_gemma":0.00006887344,"threshold_uncertainty_score":0.5474428},"labels":[],"label_agreement":null},{"id":"W4404597517","doi":"10.1007/s12095-024-00756-5","title":"On the counting of involutory MDS matrices","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Complex Hadamard matrix; Circulant matrix; Hadamard transform; Hadamard matrix; Mathematics; Hadamard's maximal determinant problem; Hadamard's inequality; Matrix (chemical analysis); Hadamard three-lines theorem; Order (exchange); Combinatorics; Discrete mathematics","score_opus":0.02329012407093261,"score_gpt":0.25297691125141764,"score_spread":0.22968678718048502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404597517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27632362,0.118518606,0.47955897,0.02051835,0.000849308,0.0007174952,0.00004459971,0.0013360544,0.102133006],"genre_scores_gemma":[0.99253994,0.001362159,0.005788088,0.00025437897,0.000012243285,0.000029668694,0.0000016779944,0.000005036412,0.000006813092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993117,0.00014456856,0.00016057065,0.00015550673,0.000117239375,0.000110442066],"domain_scores_gemma":[0.9972633,0.0012710359,0.00004803556,0.0013451776,0.000042356867,0.000030091931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052794203,0.000085200656,0.00008250042,0.000253201,0.0004062824,0.00019054348,0.0014754003,0.00003374065,0.000012745697],"category_scores_gemma":[0.000023586153,0.00006042261,0.000115983865,0.0012469427,0.0003673465,0.0001978422,0.0003586463,0.00020250924,0.0000063376906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013798759,0.000030932988,0.00021653566,0.000019055711,0.000032298645,2.3543632e-7,0.0009196722,0.0000012555122,0.00016991833,0.9806874,0.0006224297,0.01729888],"study_design_scores_gemma":[0.00006696711,0.00008429687,0.0017156757,0.00022629983,0.0000292334,0.0000052615896,0.00037755386,0.0058441022,0.00026460298,0.9417987,0.049428113,0.00015917583],"about_ca_topic_score_codex":0.000011066125,"about_ca_topic_score_gemma":0.0000050821764,"teacher_disagreement_score":0.7162163,"about_ca_system_score_codex":0.0000031649276,"about_ca_system_score_gemma":0.000022125418,"threshold_uncertainty_score":0.3124837},"labels":[],"label_agreement":null},{"id":"W4404788977","doi":"10.1109/tit.2024.3503770","title":"Linearized Reed-Solomon Codes With Support-Constrained Generator Matrix and Applications in Multi-Source Network Coding","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Engineering and Physical Sciences Research Council; Deutsche Forschungsgemeinschaft; Peng Cheng Laboratory","keywords":"Reed–Solomon error correction; Generator matrix; Computer science; Coding (social sciences); Block code; Linear code; Algorithm; Decoding methods; Theoretical computer science; Mathematics; Statistics","score_opus":0.010043670841173455,"score_gpt":0.23847043933896916,"score_spread":0.2284267684977957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404788977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029636584,0.00010105046,0.99539477,0.00008345597,0.00019236672,0.00037165658,0.000023700135,0.00046590422,0.00040341547],"genre_scores_gemma":[0.98244673,0.000045892033,0.016964264,0.00017981675,0.000026758158,0.00016545273,0.000011196754,0.000011002146,0.00014885838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989529,0.0001104644,0.0003443744,0.00021044831,0.00014960891,0.00023217824],"domain_scores_gemma":[0.99918544,0.00033848675,0.00006835429,0.00028894978,0.000047265075,0.0000714992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007333669,0.00016659156,0.00015449588,0.00040871304,0.00029410733,0.00036683065,0.00023695405,0.00008694013,0.000031067964],"category_scores_gemma":[0.0000037794161,0.00014828485,0.00006519588,0.00089790014,0.00012336018,0.0012506518,0.00000418895,0.00028057912,0.00003902763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022529704,0.00011759751,0.00004022307,0.00017599716,0.00011934477,0.0000056414287,0.0077507314,0.08525985,0.00048282507,0.61609083,0.000050748742,0.2896809],"study_design_scores_gemma":[0.0033209573,0.0006336041,0.00019256295,0.000517042,0.00014024696,0.00019541707,0.0023548987,0.9358459,0.007970394,0.026038202,0.021516334,0.0012744183],"about_ca_topic_score_codex":0.000005635861,"about_ca_topic_score_gemma":0.000013189875,"teacher_disagreement_score":0.9794831,"about_ca_system_score_codex":0.0000322892,"about_ca_system_score_gemma":0.00007015464,"threshold_uncertainty_score":0.60468805},"labels":[],"label_agreement":null},{"id":"W4405098767","doi":"10.22215/etd/2024-16165","title":"A Collection of New Algorithms in Post-Quantum Cryptography","year":2024,"lang":"en","type":"dissertation","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Cryptography; Cryptosystem; Computer science; Algorithm; Theoretical computer science; Cryptanalysis; Block cipher","score_opus":0.010873164270546994,"score_gpt":0.259110136686574,"score_spread":0.24823697241602702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405098767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3999769,0.009330292,0.3376552,0.001080463,0.01979954,0.002167158,0.000027568567,0.002107494,0.2278554],"genre_scores_gemma":[0.8659411,0.0007465938,0.09959233,0.00047052646,0.000534699,0.00019043092,0.00053140434,0.00018184952,0.031811066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985205,0.000054973094,0.00040115888,0.00050555577,0.00029545656,0.00022238903],"domain_scores_gemma":[0.99920297,0.00007069529,0.00012897109,0.00040727804,0.00011522209,0.00007489382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026127638,0.00024113739,0.00031176413,0.0016780691,0.000044435197,0.00011321431,0.000660153,0.00023471197,0.000091241964],"category_scores_gemma":[0.000021129124,0.00022772583,0.00032038838,0.0032785488,0.000018870403,0.00020461595,0.000055639448,0.000323597,0.000029504963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011829128,0.00016139247,0.000090294765,0.00030420983,0.00014665163,0.000031735093,0.009168644,0.000008972749,0.001514634,0.8776823,0.0062210364,0.1045518],"study_design_scores_gemma":[0.00075344293,0.0008838519,0.007839767,0.0009545433,0.00010194045,0.000024712414,0.0019338467,0.012713053,0.010983499,0.95864135,0.0041535585,0.0010164379],"about_ca_topic_score_codex":0.0005176059,"about_ca_topic_score_gemma":0.00067215925,"teacher_disagreement_score":0.4659642,"about_ca_system_score_codex":0.00002150537,"about_ca_system_score_gemma":0.00028947752,"threshold_uncertainty_score":0.928639},"labels":[],"label_agreement":null},{"id":"W4405256772","doi":"10.4153/s0008439524000547","title":"<i>p</i>-Adic quotient sets: Linear recurrence sequences with reducible characteristic polynomials","year":2024,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quotient; Mathematics; Combinatorics; Order (exchange); Polynomial; Sequence (biology); Prime (order theory); Mathematical analysis","score_opus":0.014363401098204795,"score_gpt":0.2325155924357643,"score_spread":0.2181521913375595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405256772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38069826,0.0047288486,0.41182306,0.10180453,0.003651044,0.0024091888,0.00030856623,0.0026161508,0.09196036],"genre_scores_gemma":[0.9820732,0.000022895592,0.015620186,0.0011701591,0.00013043755,0.00006391418,0.000007888578,0.00002615197,0.0008851795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982301,0.00009829779,0.00029821217,0.0005650922,0.000250455,0.00055783615],"domain_scores_gemma":[0.9983979,0.0002976879,0.000045318466,0.00059426686,0.000050231578,0.000614588],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006352963,0.00022428433,0.0002515339,0.00028887877,0.00018209661,0.0004408549,0.00080406666,0.00008014261,0.0023677864],"category_scores_gemma":[0.0001394104,0.00017610729,0.00009069358,0.00064784475,0.00020078538,0.00013077307,0.00006395029,0.00026162376,0.0055675465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014410924,0.000063736385,0.000028756205,0.00042968855,0.00007239964,0.0006757944,0.0017759773,0.000010823426,0.00024156838,0.94414943,0.024357345,0.028180087],"study_design_scores_gemma":[0.0003537753,0.0007660498,0.0001562483,0.00335032,0.00009884026,0.0009003146,0.00022951943,0.016246285,0.00134679,0.2557672,0.7192282,0.0015564775],"about_ca_topic_score_codex":0.00029223197,"about_ca_topic_score_gemma":0.00014892341,"teacher_disagreement_score":0.6948708,"about_ca_system_score_codex":0.000104091734,"about_ca_system_score_gemma":0.00051191635,"threshold_uncertainty_score":0.99854416},"labels":[],"label_agreement":null},{"id":"W4405262838","doi":"10.1007/s12095-024-00761-8","title":"On the stability of $$b^q(x+a)^{q+1}+x$$ from the perspective of periodic sequences","year":2024,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Perspective (graphical); Stability (learning theory); Crystallography; Mathematics; Computer science; Chemistry; Geometry","score_opus":0.03811957096684519,"score_gpt":0.274348788150973,"score_spread":0.23622921718412782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405262838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7912571,0.04840897,0.0919528,0.044489764,0.00028800516,0.0006481319,0.00021668836,0.00024215646,0.022496384],"genre_scores_gemma":[0.9965073,0.00072837534,0.002566842,0.00015099162,0.000008913381,0.000031437765,0.0000021587164,0.0000032443545,7.5678355e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989738,0.00039936075,0.00019166329,0.00019711119,0.00014548955,0.00009257638],"domain_scores_gemma":[0.994527,0.0032707988,0.000068286245,0.002005716,0.00010286087,0.000025369649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059742143,0.00009306654,0.00011569311,0.00008455421,0.0004053766,0.00011088803,0.0019862065,0.00003211148,0.00003835772],"category_scores_gemma":[0.00007443615,0.000051471015,0.00017832589,0.0010480976,0.0014908592,0.00013523253,0.0003574272,0.00023462591,0.0000016148426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005169851,0.000052867716,0.0008308547,0.000006121209,0.0000674574,9.8367806e-8,0.0102682775,8.318598e-7,0.0004642419,0.98449427,0.000082737926,0.0037270894],"study_design_scores_gemma":[0.00004707807,0.0000896924,0.0060345666,0.00009705075,0.000029454943,9.750464e-7,0.0055683577,0.00079493964,0.0012238432,0.9846226,0.0014161114,0.000075354284],"about_ca_topic_score_codex":0.00022631638,"about_ca_topic_score_gemma":0.00004893485,"teacher_disagreement_score":0.20525017,"about_ca_system_score_codex":0.0000060761686,"about_ca_system_score_gemma":0.000050392377,"threshold_uncertainty_score":0.5493133},"labels":[],"label_agreement":null},{"id":"W4405269950","doi":"10.1007/978-981-96-0891-1_11","title":"SQIsign2D–West","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Capital Commission","funders":"Agence Nationale de la Recherche","keywords":"Computer science","score_opus":0.014104254749029582,"score_gpt":0.23489427583538686,"score_spread":0.22079002108635729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405269950","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022747301,0.0012980456,0.9576766,0.0009113358,0.0036919103,0.00022353433,0.0000044545914,0.00046537523,0.035706013],"genre_scores_gemma":[0.40051448,0.00019151272,0.58567584,0.0055660764,0.0026666522,0.000033561297,0.000010051983,0.00017292255,0.0051688813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620414,0.000024002033,0.00043004652,0.0017925807,0.0008750305,0.00067419204],"domain_scores_gemma":[0.997418,0.0004297976,0.00013586156,0.0016921556,0.00013141507,0.0001927852],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010016776,0.0005549524,0.0004482097,0.0013397394,0.00024000855,0.0010886727,0.0043956516,0.00030461655,0.00007797885],"category_scores_gemma":[0.000035856952,0.000493902,0.00025000743,0.0011468864,0.0007742424,0.00052677805,0.0019367208,0.001047247,0.00047169588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023007217,0.000011724346,0.0000069232124,0.000032587006,0.000010636361,0.00015736152,0.00039487702,0.0013616438,0.000061106424,0.5500394,0.000036453454,0.44788495],"study_design_scores_gemma":[0.00008974734,0.00014581683,0.000019018828,0.0004420133,0.000010017691,0.00009211327,7.024479e-8,0.07302329,0.00048067883,0.914859,0.010228203,0.00061005715],"about_ca_topic_score_codex":0.000006820746,"about_ca_topic_score_gemma":0.000028242119,"teacher_disagreement_score":0.4472749,"about_ca_system_score_codex":0.00015607265,"about_ca_system_score_gemma":0.00033600995,"threshold_uncertainty_score":0.99994826},"labels":[],"label_agreement":null},{"id":"W4405324345","doi":"10.1515/jmc-2024-0010","title":"Revisiting linearly extended discrete functions","year":2024,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algebra over a field; Computer science; Pure mathematics","score_opus":0.017181849297748342,"score_gpt":0.2836623500587121,"score_spread":0.26648050076096375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405324345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008500132,0.0008307436,0.9804484,0.0059917285,0.0006982708,0.00003945354,7.3274833e-7,0.000095914496,0.0033946221],"genre_scores_gemma":[0.8532384,0.000021242464,0.14585273,0.00017289954,0.00058778166,0.0000026920811,2.3565828e-7,0.00001207496,0.00011191892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998714,0.00014212483,0.00054077554,0.00016073181,0.00022565859,0.00021670472],"domain_scores_gemma":[0.99887615,0.00051146577,0.00013729626,0.00024876307,0.00010723017,0.00011908364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010506713,0.000112544425,0.00029281556,0.0002598861,0.000081111204,0.00020770301,0.0005232118,0.00007322474,0.00010014151],"category_scores_gemma":[0.0003270662,0.00007931113,0.00028460065,0.00042397605,0.00004955216,0.00041458005,0.000111368405,0.00039777425,0.0001607874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010499383,0.000032046897,0.000011069174,0.00008518669,0.000063224834,0.00018698168,0.0002902811,0.0000053388194,0.0005031667,0.9724413,0.0008680485,0.025502829],"study_design_scores_gemma":[0.00015848971,0.0002903633,0.000106620835,0.00032662388,0.00005979824,0.0026893488,0.0001591672,0.010252598,0.00016930929,0.9785846,0.0070705945,0.00013249561],"about_ca_topic_score_codex":1.0414752e-7,"about_ca_topic_score_gemma":5.5068337e-8,"teacher_disagreement_score":0.8447383,"about_ca_system_score_codex":0.00001734474,"about_ca_system_score_gemma":0.000061021234,"threshold_uncertainty_score":0.32342142},"labels":[],"label_agreement":null},{"id":"W4405564320","doi":"","title":"Some New Non-binary Quantum Codes from One-generator Quasi-cyclic Codes","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Generator (circuit theory); Quantum; Binary number; Computer science; Mathematics; Physics; Arithmetic; Quantum mechanics; Power (physics)","score_opus":0.062464857201931706,"score_gpt":0.19695075927704078,"score_spread":0.13448590207510908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405564320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7424761,0.0014775296,0.25105253,0.0004587738,0.002572048,0.0003016853,0.00012991595,0.00087213755,0.00065927993],"genre_scores_gemma":[0.9947436,0.00076933106,0.0022170518,0.00031198637,0.0007042792,0.0000019912675,0.00007121542,0.00004546802,0.0011350978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967054,0.00025265964,0.00032237647,0.001979331,0.00018401729,0.0005561974],"domain_scores_gemma":[0.9969648,0.00027974445,0.00023192778,0.0020218296,0.00008842772,0.00041322838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003255715,0.000587809,0.00064657273,0.00057505677,0.00027193036,0.00046532988,0.0031565882,0.00046440918,0.00006559823],"category_scores_gemma":[0.00002314439,0.0006842239,0.00058570964,0.0009889202,0.00019808141,0.00044180267,0.0044440343,0.0011029621,0.00050430757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008330361,0.00028579243,0.00053763716,0.00012823362,0.00048646296,0.00069128117,0.0008155409,0.010612131,0.0012959242,0.98054785,0.0036671625,0.00084866356],"study_design_scores_gemma":[0.00036153867,0.00013535267,0.00036676938,0.00033045077,0.0002018549,0.0000022147553,0.00008821772,0.21413939,0.00083745713,0.78158396,0.0011825999,0.00077017985],"about_ca_topic_score_codex":0.0010377497,"about_ca_topic_score_gemma":0.00009761987,"teacher_disagreement_score":0.25226748,"about_ca_system_score_codex":0.00015934803,"about_ca_system_score_gemma":0.00046244965,"threshold_uncertainty_score":0.9995609},"labels":[],"label_agreement":null},{"id":"W4405665600","doi":"10.1007/s40993-024-00606-6","title":"Solving norm equations in global function fields","year":2024,"lang":"en","type":"article","venue":"Research in Number Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Norm (philosophy); Implementation; Mathematics; Function (biology); Applied mathematics; Computer science; Mathematical optimization; Field (mathematics); Algorithm; Theoretical computer science; Calculus (dental); Pure mathematics","score_opus":0.061304192240290635,"score_gpt":0.38097454176670853,"score_spread":0.3196703495264179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405665600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038145844,0.00093606045,0.74261254,0.0020546077,0.0009780056,0.00030532968,0.000012963228,0.00033130456,0.21462335],"genre_scores_gemma":[0.9987721,0.000021763357,0.00065131334,0.00007125033,0.00008396466,0.00005559883,0.0000029419757,0.000005207364,0.00033589613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980247,0.00068055606,0.00016616209,0.00033950785,0.00036414023,0.00042495545],"domain_scores_gemma":[0.9976153,0.0019005719,0.000008931583,0.00036644653,0.000044853292,0.00006391485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004661424,0.0000763561,0.00008001258,0.000317118,0.00010749365,0.0002862017,0.00054981397,0.00008036221,0.00058792246],"category_scores_gemma":[0.0002383152,0.000073320094,0.000056678335,0.0026318363,0.000089155576,0.00046978914,0.000297372,0.0005135763,0.00044599353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018957879,0.000039149025,0.0011436032,0.00002542053,0.0000061123988,0.00005112778,0.00043796777,0.000044025248,0.000017197995,0.8978533,0.00087869196,0.09948444],"study_design_scores_gemma":[0.00009354967,0.000034969416,0.0017724513,0.00016973879,8.7580645e-7,0.0000064414417,0.0001264149,0.015809655,0.000016853824,0.9773175,0.004567408,0.000084111394],"about_ca_topic_score_codex":0.00006906111,"about_ca_topic_score_gemma":0.00021401352,"teacher_disagreement_score":0.96062624,"about_ca_system_score_codex":0.0001457973,"about_ca_system_score_gemma":0.00013543156,"threshold_uncertainty_score":0.6437339},"labels":[],"label_agreement":null},{"id":"W4406163648","doi":"10.61091/um121-03","title":"Disproof of a Conjecture on the Edge Mostar Index","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Conjecture; Index (typography); Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Statistics; Computer science; Artificial intelligence","score_opus":0.016446326568152852,"score_gpt":0.24469439071936436,"score_spread":0.22824806415121152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406163648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15816571,0.0019541977,0.6982049,0.015483589,0.0008654602,0.00076771405,0.000039234754,0.00095333334,0.123565875],"genre_scores_gemma":[0.9978344,0.0000024603903,0.0017750425,0.00016919777,0.000022271404,0.000019345982,4.312609e-7,0.0000078350495,0.00016903126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912953,0.00007223579,0.00018604047,0.00022512388,0.00022605293,0.00016103669],"domain_scores_gemma":[0.9983407,0.000828167,0.00003344781,0.0007385354,0.00002162622,0.00003751326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005305001,0.000117527525,0.00014229723,0.00011848503,0.000069545495,0.00009047164,0.0007021903,0.000041376275,0.0002463717],"category_scores_gemma":[0.00008545822,0.00006581995,0.0001427696,0.00062351354,0.00012054248,0.000091110676,0.00014083648,0.00015635708,0.000082640174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004324186,0.000050424056,0.0000070687192,0.0001132355,0.000033567892,0.000004792198,0.002157975,0.0000027119074,0.000078036624,0.982412,0.0025125844,0.012623283],"study_design_scores_gemma":[0.000054220352,0.00011482514,0.00014056591,0.00025809254,0.000013360186,0.000010416259,0.00010728117,0.027296908,0.0013376251,0.9641279,0.006436927,0.00010190666],"about_ca_topic_score_codex":0.0000011591105,"about_ca_topic_score_gemma":5.6247956e-7,"teacher_disagreement_score":0.8396687,"about_ca_system_score_codex":0.000007971003,"about_ca_system_score_gemma":0.000024335503,"threshold_uncertainty_score":0.2697597},"labels":[],"label_agreement":null},{"id":"W4406164271","doi":"10.61091/ars161-09","title":"On Hermitian Cones in \\(pG(3,q^2\\)","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Hermitian matrix; Mathematics; Characterization (materials science); Pure mathematics; Combinatorics; Physics; Optics","score_opus":0.009287498487718702,"score_gpt":0.237330348251289,"score_spread":0.22804284976357028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.963827,0.00060696824,0.00078562956,0.0011360524,0.004575944,0.00012841097,9.84853e-7,0.0005837684,0.028355215],"genre_scores_gemma":[0.99940175,0.000012857808,0.00012838331,0.00026964193,0.0000067057886,0.000013170956,7.043991e-7,0.000008741308,0.00015806152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991044,0.00007584762,0.00013212259,0.00032116595,0.00015237901,0.00021409498],"domain_scores_gemma":[0.999287,0.0002494064,0.000014192946,0.00037804028,0.000014541962,0.000056818473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030157538,0.00011015604,0.00010843025,0.00022616408,0.000052106974,0.0001869048,0.00051201996,0.000050076258,0.000034589408],"category_scores_gemma":[0.000023305845,0.000104365776,0.00006945215,0.00075366703,0.000035567165,0.00024523903,0.00009840587,0.00018557474,0.00024440364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004568219,0.000052268144,0.00025481556,0.000010343708,0.000007596534,0.00010981162,0.00034399112,0.0000042037523,0.000049719263,0.98350614,0.0016342046,0.014022314],"study_design_scores_gemma":[0.00025957852,0.00014470935,0.0012808305,0.000095694006,0.0000018830701,0.000006727401,0.000009977951,0.0016629027,0.0004892936,0.9910048,0.0049068313,0.00013673631],"about_ca_topic_score_codex":0.000008403829,"about_ca_topic_score_gemma":0.0000036812226,"teacher_disagreement_score":0.035574708,"about_ca_system_score_codex":0.000027104894,"about_ca_system_score_gemma":0.00003321727,"threshold_uncertainty_score":0.4255913},"labels":[],"label_agreement":null},{"id":"W4406261782","doi":"10.1109/qce60285.2024.10410","title":"Efficient Training of Layerwise-Commuting PQCs with Parallel Gradient Estimation","year":2024,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Training (meteorology); Computer science; Estimation; Engineering; Geography","score_opus":0.020563959661628193,"score_gpt":0.24079308891214343,"score_spread":0.22022912925051524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406261782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16720995,0.0001115956,0.826111,0.00019267084,0.00011025816,0.00006606951,3.8578918e-7,0.00026797937,0.005930054],"genre_scores_gemma":[0.850063,8.9094516e-7,0.14985321,0.00003628504,0.000009865515,0.0000055619516,5.5813706e-7,0.0000045212078,0.000026042382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992717,0.000035669564,0.00015173777,0.00020653302,0.0001716674,0.00016271905],"domain_scores_gemma":[0.99948466,0.00015844636,0.00003376818,0.0002564722,0.000025448946,0.00004117704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004212456,0.00008528347,0.00009848178,0.00013997665,0.00007592231,0.000100536345,0.00029696373,0.000019463638,0.000012982159],"category_scores_gemma":[0.0000113172255,0.000061646104,0.00005746353,0.0005725354,0.0000427268,0.000087338085,0.00007013776,0.00008071782,0.000008405999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005389863,0.000027261614,0.00005161043,0.000032641696,0.000018537352,0.0000069095904,0.0048069195,0.05263015,0.00020613002,0.87422085,0.000022313341,0.0679713],"study_design_scores_gemma":[0.000109153014,0.00012232168,0.00027966042,0.00014514115,0.000008438657,0.000019602754,0.00018385045,0.98432726,0.00054588047,0.013975016,0.00018085618,0.00010282247],"about_ca_topic_score_codex":0.000006862783,"about_ca_topic_score_gemma":0.0000029614364,"teacher_disagreement_score":0.93169713,"about_ca_system_score_codex":0.000010951712,"about_ca_system_score_gemma":0.000033156626,"threshold_uncertainty_score":0.2513855},"labels":[],"label_agreement":null},{"id":"W4406510177","doi":"10.1016/j.jcta.2025.106009","title":"There are no good infinite families of toric codes","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.00604794033340711,"score_gpt":0.22289110269807988,"score_spread":0.21684316236467277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406510177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7661598,0.0061236178,0.06662445,0.001512481,0.04965857,0.0004420092,0.000020840554,0.00023305228,0.1092252],"genre_scores_gemma":[0.9977208,0.00025034082,0.0012524573,0.0000965509,0.0002734817,0.0000023117395,2.131762e-7,0.0000076011534,0.00039624717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983541,0.00040443405,0.0005828853,0.00014336349,0.00031936873,0.00019588222],"domain_scores_gemma":[0.99759716,0.0006480746,0.00065574335,0.00042913712,0.00060330384,0.00006658844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014605151,0.00017328032,0.0004725375,0.00032951336,0.00013740791,0.00010705314,0.0012012395,0.00009570107,0.000032673386],"category_scores_gemma":[0.0003815034,0.00013977676,0.00028507662,0.0006787894,0.00018281498,0.00067780446,0.0002337776,0.00027454772,0.000003551899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006607595,0.00014183206,0.0011049935,0.000052546424,0.0001534913,0.000015029333,0.00056547136,0.000011933758,0.0007247348,0.9930941,0.00048969575,0.0029854039],"study_design_scores_gemma":[0.0009145516,0.00072955794,0.001188162,0.00025534,0.000038381546,0.00001758108,0.000519427,0.000009498413,0.0048859008,0.9476683,0.043636102,0.00013717638],"about_ca_topic_score_codex":0.0000026506368,"about_ca_topic_score_gemma":9.4812765e-7,"teacher_disagreement_score":0.23156102,"about_ca_system_score_codex":0.000029729556,"about_ca_system_score_gemma":0.00015551422,"threshold_uncertainty_score":0.5699931},"labels":[],"label_agreement":null},{"id":"W4406655904","doi":"10.1016/b978-044488002-4/50018-x","title":"10.1016/b978-044488002-4/50018-x","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.008502868985910426,"score_gpt":0.1668347251275831,"score_spread":0.15833185614167267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406655904","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8018616e-7,0.0002284451,0.00024172736,0.00018534804,0.000011384332,0.00024149996,0.00002374638,0.00055066106,0.99851704],"genre_scores_gemma":[0.0000014908771,7.815206e-7,0.0009785587,0.00012528969,0.00027441795,0.000009488004,0.00001626689,0.000056741796,0.99853694],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980592,0.000035854882,0.00032844665,0.00076198624,0.0003989328,0.00041558492],"domain_scores_gemma":[0.998093,0.00011237135,0.000116797906,0.0013441659,0.000070784336,0.00026288247],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002607537,0.00046406375,0.00042427445,0.00042219818,0.00015705528,0.00021329394,0.0018514753,0.0002781756,0.9903622],"category_scores_gemma":[0.00001039178,0.0004811156,0.00033448017,0.00015815799,0.000083061175,0.000190449,0.00042176116,0.00038872403,0.9941008],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034025787,0.000019035884,1.936496e-9,0.000008347915,0.000054057506,0.000031808584,0.000021728492,0.00000603774,0.0000032502453,0.028242074,0.11423797,0.85734165],"study_design_scores_gemma":[0.00012048811,0.0002241395,3.3611417e-7,0.00010821279,0.000029359047,0.00002372823,6.315788e-8,0.000065154854,0.000013498116,0.025974225,0.9728629,0.0005778925],"about_ca_topic_score_codex":0.0000030985248,"about_ca_topic_score_gemma":1.1892913e-7,"teacher_disagreement_score":0.85862494,"about_ca_system_score_codex":0.00003995897,"about_ca_system_score_gemma":0.000063563726,"threshold_uncertainty_score":0.999764},"labels":[],"label_agreement":null},{"id":"W4406949003","doi":"10.1109/tcomm.2025.3535882","title":"Constituent Automorphism Decoding of Reed-Muller Codes","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Reed–Muller code; List decoding; Computer science; Mathematics; Concatenated error correction code; Telecommunications; Block code","score_opus":0.026309699697830938,"score_gpt":0.2870004848657971,"score_spread":0.2606907851679662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406949003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012335764,0.0002166592,0.9760909,0.0025935816,0.0003763618,0.00015648498,0.00001914087,0.00021436496,0.019098949],"genre_scores_gemma":[0.9499385,0.00026468435,0.049094748,0.00030162843,0.0000028910863,0.000055580498,0.0000017337092,0.000004514319,0.00033573198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990672,0.00016899087,0.00030455764,0.00019401936,0.000120817764,0.00014444062],"domain_scores_gemma":[0.99687296,0.0006322687,0.00008094622,0.002248802,0.00011858728,0.000046437093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029806458,0.00011265979,0.00016525819,0.0003883779,0.00054228876,0.00005116129,0.0017987371,0.000060098035,0.00004231655],"category_scores_gemma":[0.000009576409,0.00011909612,0.0001517244,0.00094015966,0.0003438195,0.00018192802,0.000020661591,0.00025866195,0.000020495641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012643557,0.00045149296,0.00003522983,0.000015208541,0.00010774802,5.0376815e-7,0.00048165148,0.0011396607,0.0026433389,0.94773006,0.00046950372,0.046912953],"study_design_scores_gemma":[0.0042886958,0.00061313907,0.0015453651,0.0018086812,0.000554459,0.000053930245,0.0010296858,0.31092578,0.23235533,0.29269606,0.15232721,0.0018016681],"about_ca_topic_score_codex":0.000036551,"about_ca_topic_score_gemma":0.00007570709,"teacher_disagreement_score":0.9487049,"about_ca_system_score_codex":0.00004084392,"about_ca_system_score_gemma":0.000115932315,"threshold_uncertainty_score":0.4856599},"labels":[],"label_agreement":null},{"id":"W4407055362","doi":"10.1007/s10623-025-01580-5","title":"Efficient generation of odd order de Bruijn sequence with the same complement and reverse sequences","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"De Bruijn sequence; Mathematics; Sequence (biology); Complement (music); Combinatorics; Order (exchange); Cryptography; Discrete mathematics; Arithmetic; Algorithm","score_opus":0.04157842895571131,"score_gpt":0.2690578260839228,"score_spread":0.2274793971282115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407055362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30576122,0.0006898225,0.6917479,0.0011299722,0.000039981307,0.00021579332,0.000006484722,0.0000415096,0.00036735012],"genre_scores_gemma":[0.94313085,0.00011565092,0.05588678,0.0008043518,0.000013417021,0.00003004323,0.000001957951,0.000003962471,0.000012983924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989135,0.00018848423,0.00017804012,0.00032225376,0.00017429242,0.00022340975],"domain_scores_gemma":[0.99924105,0.0001784182,0.000092466005,0.00031891468,0.00011273392,0.000056413148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006482577,0.00015301976,0.00016920772,0.00026086404,0.0003500205,0.00015410228,0.00033130948,0.000032497148,0.000006909168],"category_scores_gemma":[0.00000877924,0.0001006213,0.000052413543,0.0013470948,0.00043805328,0.00007806618,0.00010048109,0.00009370875,2.1546518e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003806128,0.000060315695,0.006197224,0.000052033083,0.00009469819,0.000004508183,0.0014007662,0.0011105794,0.020794561,0.95863986,0.0006055561,0.011001847],"study_design_scores_gemma":[0.005617502,0.0036116522,0.04948612,0.0013030152,0.000787919,0.00020394442,0.0062667434,0.53088814,0.062053453,0.30290562,0.03408754,0.002788323],"about_ca_topic_score_codex":0.00009122149,"about_ca_topic_score_gemma":0.000101738246,"teacher_disagreement_score":0.65573424,"about_ca_system_score_codex":0.000008686015,"about_ca_system_score_gemma":0.000065723885,"threshold_uncertainty_score":0.41032177},"labels":[],"label_agreement":null},{"id":"W4408138048","doi":"10.18280/mmep.120235","title":"Design and Implementation of Low Power Generic Reversible Binary-Coded Decimal Adder on Artix-7 FPGA","year":2025,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Field-programmable gate array; Adder; Decimal; Binary number; Arithmetic; Computer science; Computer hardware; Mathematics; Telecommunications","score_opus":0.01936665366118238,"score_gpt":0.22810981810873965,"score_spread":0.20874316444755728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408138048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095401354,0.00015390609,0.9039802,0.00009116335,0.00004014771,0.00015262548,4.7264376e-7,0.000076649456,0.000103487655],"genre_scores_gemma":[0.7912823,0.000027483213,0.20861843,0.000024577128,0.0000036704832,0.00001806036,3.8804126e-7,0.000006362559,0.000018741634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927485,0.000021022075,0.00021132156,0.0002150951,0.000103349834,0.00017436357],"domain_scores_gemma":[0.99953485,0.00017319435,0.00003341787,0.00018468814,0.000025054462,0.000048797883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003541546,0.00011969414,0.00016195032,0.00016169687,0.00005865899,0.000057657868,0.00013169192,0.000043274613,0.0000065338136],"category_scores_gemma":[0.000008364665,0.000107441156,0.000032537493,0.00026109008,0.000022914111,0.00010681448,0.00006724473,0.00008064628,0.0000014982186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010523438,0.000054712124,0.000007637136,0.00039344747,0.000033034037,0.0000011517909,0.0010038988,0.7373273,0.0031118037,0.2558444,0.000035869052,0.0021762077],"study_design_scores_gemma":[0.00022195198,0.000119088545,0.0000151222,0.00025793785,0.000011159239,0.0000024873623,0.000022045986,0.9229092,0.0051986743,0.07110488,0.00002827595,0.00010920323],"about_ca_topic_score_codex":0.0000012892444,"about_ca_topic_score_gemma":4.1571923e-8,"teacher_disagreement_score":0.69588095,"about_ca_system_score_codex":0.000007840873,"about_ca_system_score_gemma":0.000011308681,"threshold_uncertainty_score":0.43813232},"labels":[],"label_agreement":null},{"id":"W4408207844","doi":"10.1007/s00208-024-03084-4","title":"Abelian varieties of prescribed order over finite fields","year":2025,"lang":"lv","type":"article","venue":"Mathematische Annalen","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Division of Mathematical Sciences; Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Institut des Sciences Mathématiques, Université du Québec à Montréal; Centre de Recherches Mathématiques; Simons Foundation","keywords":"Algorithm; Computer science","score_opus":0.01715553903969254,"score_gpt":0.26288330988389746,"score_spread":0.24572777084420494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408207844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041963417,0.0053133806,0.85133034,0.004351293,0.0012986099,0.0006154781,0.000056199544,0.00024455923,0.0948267],"genre_scores_gemma":[0.955021,0.00030003843,0.019046318,0.0013376762,0.00009674983,0.000042772088,0.000005833349,0.000026080572,0.024123494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795365,0.000195341,0.0005992081,0.00048209383,0.0003528406,0.00041685172],"domain_scores_gemma":[0.99763757,0.0006013392,0.0002505228,0.0011745292,0.00025546574,0.00008054628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007590484,0.0003109589,0.0004896866,0.0003510583,0.00018934463,0.00021216914,0.0012871056,0.00024345217,0.0006889021],"category_scores_gemma":[0.0002703857,0.0002902628,0.00027259038,0.0014150176,0.00022363602,0.00037136523,0.00065253524,0.0003365235,0.0000841623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006168581,0.00036004785,0.000666164,0.0010742455,0.00037212032,0.000010412803,0.006854735,0.00008814801,0.0003093728,0.9429618,0.029109573,0.018131705],"study_design_scores_gemma":[0.0011313001,0.00041005842,0.0037796118,0.0018661829,0.00026587077,0.000006928475,0.00031406668,0.02733004,0.0072526913,0.87923187,0.07764497,0.0007664454],"about_ca_topic_score_codex":0.000050944538,"about_ca_topic_score_gemma":0.000015792399,"teacher_disagreement_score":0.9130576,"about_ca_system_score_codex":0.000008757369,"about_ca_system_score_gemma":0.00015545796,"threshold_uncertainty_score":0.99995494},"labels":[],"label_agreement":null},{"id":"W4408408500","doi":"10.1016/j.ffa.2025.102606","title":"Artin-Schreier towers of finite fields","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Fondo para la Investigación Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Mathematics; Finite field; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.008855253006169935,"score_gpt":0.22812650273654952,"score_spread":0.2192712497303796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408408500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029926337,0.00034767666,0.9661714,0.0018441466,0.000076055214,0.00015539548,0.000010544584,0.000065647735,0.028336545],"genre_scores_gemma":[0.99520344,0.00008851371,0.0031553993,0.00088946364,0.000025438603,0.0000972688,0.0000042438214,0.000002826185,0.0005334007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939877,0.000024131565,0.00018210674,0.00021854865,0.000047854264,0.00012858605],"domain_scores_gemma":[0.9988381,0.0004978195,0.000056278663,0.0005171967,0.000050023937,0.000040566734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014547417,0.00009368798,0.00012406093,0.0001233525,0.00014316963,0.00004558979,0.0004018306,0.00009165315,0.00003698267],"category_scores_gemma":[0.000022527931,0.00007946291,0.00007759818,0.000523159,0.00006232587,0.00008208599,0.00015825575,0.00013536941,0.000006580944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051757597,0.00004798451,0.00025311127,0.000021155924,0.000026170464,2.0131657e-7,0.0005472759,0.00005719816,0.000106864725,0.8833839,0.0005947051,0.114956215],"study_design_scores_gemma":[0.00031135583,0.00010225822,0.00095679594,0.000057920137,0.000017386645,0.0000014916639,0.00015635708,0.009450849,0.003933389,0.7251725,0.25961646,0.00022322359],"about_ca_topic_score_codex":0.0000080589725,"about_ca_topic_score_gemma":0.0000056106464,"teacher_disagreement_score":0.9922108,"about_ca_system_score_codex":0.000002366551,"about_ca_system_score_gemma":0.0000257594,"threshold_uncertainty_score":0.32404032},"labels":[],"label_agreement":null},{"id":"W4408490912","doi":"10.61091/jcmcc124-07","title":"Group Codes over Algebra of Wreath Products","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Wreath product; Group (periodic table); Algebra over a field; Group algebra; Mathematics; Pure mathematics; Chemistry; Geometry","score_opus":0.009685897510156652,"score_gpt":0.24366118912376966,"score_spread":0.23397529161361302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408490912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86552155,0.00093358,0.11268863,0.000246881,0.018294113,0.00029789194,0.0000014265686,0.00007425569,0.0019416778],"genre_scores_gemma":[0.98204625,0.000037588707,0.017431675,0.00003449571,0.0004291007,0.0000011515855,3.7894546e-7,0.00001289606,0.000006467803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754786,0.00016127151,0.0011506366,0.00027130786,0.00057037774,0.00029857078],"domain_scores_gemma":[0.9968638,0.00084747723,0.0010744516,0.0004718147,0.00063030265,0.00011216455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022246107,0.00026775594,0.00081287033,0.0004314595,0.00022174633,0.0002298922,0.0010614353,0.0001325721,0.0000027124042],"category_scores_gemma":[0.00049284846,0.0002343448,0.0002246086,0.0010052108,0.00013362108,0.00036869955,0.0005213338,0.00038298167,5.2541856e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000628008,0.00057649764,0.00028767958,0.00027694632,0.00014634643,0.000010058307,0.00068695046,0.000004864846,0.00214434,0.9920578,0.0002651144,0.0034805718],"study_design_scores_gemma":[0.0027460111,0.00069891143,0.00034955042,0.00061145006,0.00008739475,0.000035400946,0.000095887524,0.0020779704,0.004977186,0.9873558,0.0007411093,0.00022328914],"about_ca_topic_score_codex":0.0000049469286,"about_ca_topic_score_gemma":1.3619605e-7,"teacher_disagreement_score":0.116524704,"about_ca_system_score_codex":0.00004123219,"about_ca_system_score_gemma":0.00017029389,"threshold_uncertainty_score":0.95563036},"labels":[],"label_agreement":null},{"id":"W4408490938","doi":"10.61091/jcmcc124-08","title":"A class of constacyclic codes over \\(\\frac{\\mathbb{F}_{p^m}[u, v]}{\\left\\langle u^k, v^2, u v-v u\\right\\rangle}\\)","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Class (philosophy); Combinatorics; Physics; Mathematics; Computer science","score_opus":0.008560200244819571,"score_gpt":0.24957331413538608,"score_spread":0.2410131138905665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408490938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85677445,0.0014588534,0.113654114,0.00039016805,0.020092435,0.00041830738,0.0000052354526,0.0001246386,0.007081784],"genre_scores_gemma":[0.98833776,0.000058818903,0.011110887,0.00007861737,0.00037822095,0.000001009134,6.7281246e-7,0.000019874136,0.000014164974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663264,0.00024222856,0.0015974414,0.0003384447,0.0007533872,0.00043589188],"domain_scores_gemma":[0.9954649,0.0016536299,0.0014022007,0.00059244403,0.0006932177,0.00019355715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022556728,0.00037847817,0.0011570058,0.00063808414,0.00033052368,0.00033681988,0.0013806198,0.00022494885,0.000012449191],"category_scores_gemma":[0.00047260406,0.00033244872,0.0004185012,0.00094466313,0.00025571193,0.0004491246,0.0006061429,0.00055107643,0.0000016822792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008475793,0.000681976,0.00038713607,0.00027472503,0.00021777104,0.00002664999,0.00094068394,0.000014395335,0.0014675859,0.9929071,0.0006120284,0.0023851641],"study_design_scores_gemma":[0.0043972144,0.0006757345,0.00020378124,0.0008767502,0.00013401035,0.000085766675,0.00018735569,0.007947022,0.005074206,0.97726256,0.0028095758,0.00034600767],"about_ca_topic_score_codex":0.000008434061,"about_ca_topic_score_gemma":6.8925965e-7,"teacher_disagreement_score":0.13156328,"about_ca_system_score_codex":0.00006927458,"about_ca_system_score_gemma":0.00028790932,"threshold_uncertainty_score":0.99991274},"labels":[],"label_agreement":null},{"id":"W4409115157","doi":"10.1016/j.disc.2025.114500","title":"The graph of a family of functions over quadratic extensions of finite fields","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Quadratic equation; Combinatorics; Graph; Discrete mathematics; Finite graph","score_opus":0.0159986512985675,"score_gpt":0.26208359964935496,"score_spread":0.24608494835078745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409115157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092671536,0.00021623485,0.8993612,0.00022873352,0.00017629181,0.00012800391,0.000009951072,0.000024685956,0.0071833576],"genre_scores_gemma":[0.9885593,0.000043416607,0.0110942535,0.00005453501,0.000003891138,0.000008648298,7.2616933e-7,0.0000033921528,0.00023182083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991744,0.000049339073,0.00039876185,0.00010446992,0.00016675027,0.00010627966],"domain_scores_gemma":[0.99784297,0.0011103301,0.00020067857,0.00071886275,0.00010762359,0.000019519131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033725123,0.00008210375,0.0002022773,0.00012922719,0.000102222584,0.000017826484,0.00050842704,0.00004081071,0.000006460079],"category_scores_gemma":[0.00018610327,0.000054628716,0.00018927864,0.00072886836,0.00017174697,0.00006366154,0.0001574446,0.00007621345,0.0000010465745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006094487,0.00007730763,0.00011256557,0.00015056944,0.000063271145,2.7136113e-7,0.0012611165,0.00010812415,0.0013932887,0.9950852,0.0005118681,0.0012303444],"study_design_scores_gemma":[0.0002405257,0.00013672441,0.0018440612,0.00039772113,0.0000864931,9.108661e-7,0.0013412939,0.031544853,0.0031004716,0.96082455,0.0003695528,0.00011284174],"about_ca_topic_score_codex":0.000008128338,"about_ca_topic_score_gemma":0.000008158566,"teacher_disagreement_score":0.8958878,"about_ca_system_score_codex":0.000002327217,"about_ca_system_score_gemma":0.000038370177,"threshold_uncertainty_score":0.22276942},"labels":[],"label_agreement":null},{"id":"W4409685573","doi":"10.1109/lascas64004.2025.10966289","title":"A Novel and Efficient Large Integer Number Theoretic Transform Multiplier Based on Unified Blocks","year":2025,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Computer science; Integer (computer science); Mathematics; Algorithm; Arithmetic","score_opus":0.0060730478338142735,"score_gpt":0.2307963007107455,"score_spread":0.22472325287693123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409685573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024249025,0.000008676507,0.8622089,0.0011674849,0.00015830073,0.00016552933,0.0000029475036,0.00015727062,0.11188188],"genre_scores_gemma":[0.99078465,0.0000013052643,0.0065719024,0.001969672,0.0000073292645,0.000015561132,8.3504347e-7,0.0000046413343,0.00064413226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990789,0.000035044057,0.0001435639,0.00035046454,0.00014067828,0.00025132424],"domain_scores_gemma":[0.99920356,0.00026387832,0.000018856837,0.00041322387,0.000036917703,0.000063536594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044257526,0.00014369164,0.00012588095,0.0001529741,0.00014744587,0.000099420344,0.00037394805,0.00006107688,0.00014082345],"category_scores_gemma":[0.000020676898,0.000108305285,0.000085862375,0.00052765844,0.000080693484,0.000045758545,0.00007960676,0.00014315263,0.000015032257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000483011,0.00026982152,0.000201264,0.000012572777,0.0000117612335,0.0000016669635,0.0003416191,0.0001887513,0.0002860919,0.9922359,0.00011070861,0.006291539],"study_design_scores_gemma":[0.0027118204,0.00011020978,0.0012094327,0.00012515091,0.00002265994,0.000004579472,0.00012403728,0.9292605,0.006558141,0.053355265,0.0061742114,0.00034396793],"about_ca_topic_score_codex":0.000005906422,"about_ca_topic_score_gemma":0.000006460627,"teacher_disagreement_score":0.96653557,"about_ca_system_score_codex":0.000013467708,"about_ca_system_score_gemma":0.000033250115,"threshold_uncertainty_score":0.44165614},"labels":[],"label_agreement":null},{"id":"W4410193200","doi":"10.1016/j.ffa.2025.102648","title":"The second generalized covering radius of binary primitive double-error-correcting BCH codes","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"BCH code; Mathematics; Binary number; RADIUS; Discrete mathematics; Arithmetic; Combinatorics; Error detection and correction; Algorithm; Computer science","score_opus":0.014762619647715433,"score_gpt":0.2518076760788961,"score_spread":0.23704505643118065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410193200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13956144,0.0010133757,0.8429506,0.00078534713,0.00015168764,0.00033733906,0.000016750095,0.00008203948,0.015101454],"genre_scores_gemma":[0.99760336,0.00007147747,0.00141073,0.00020321982,0.000022715549,0.00015236088,0.000003209448,0.0000031781597,0.0005297439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994358,0.000037875303,0.00016612066,0.00019240593,0.000041185027,0.00012663334],"domain_scores_gemma":[0.9988401,0.00062494964,0.000075468444,0.0003825032,0.000050760395,0.000026202766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023114176,0.00008809974,0.00011343076,0.000069179565,0.00046109964,0.00008104357,0.0003896215,0.000051589395,0.000009603389],"category_scores_gemma":[0.000009666929,0.00006307807,0.0000628275,0.00041331648,0.000077550554,0.0000785968,0.0001810497,0.00012430096,0.0000011895185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002816744,0.000034173045,0.00026380416,0.000027580587,0.00004424347,2.0777259e-7,0.0011867516,0.00006690437,0.0017804906,0.944116,0.00019491267,0.05225675],"study_design_scores_gemma":[0.002405096,0.00026405993,0.006178455,0.0002135268,0.00005600749,0.000019549256,0.0020558669,0.04560538,0.07027468,0.5714737,0.300749,0.00070468924],"about_ca_topic_score_codex":0.000011845741,"about_ca_topic_score_gemma":0.000024863557,"teacher_disagreement_score":0.85804194,"about_ca_system_score_codex":0.0000050246344,"about_ca_system_score_gemma":0.000029482324,"threshold_uncertainty_score":0.35464522},"labels":[],"label_agreement":null},{"id":"W4410706585","doi":"10.1007/978-3-031-90229-1_5","title":"Increasing Index Sizes for Information Set Decoding Algorithms","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Decoding methods; Index (typography); Algorithm; Set (abstract data type); World Wide Web","score_opus":0.014154261852111117,"score_gpt":0.2513658610471208,"score_spread":0.23721159919500967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410706585","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005912344,0.00015103466,0.99302185,0.00036530415,0.001810174,0.0004935488,0.000015751373,0.00022911548,0.003854121],"genre_scores_gemma":[0.09690046,0.000031903484,0.8999377,0.0025813316,0.00038423506,0.00003129256,0.000020954978,0.000019015359,0.00009309438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741995,0.000042029253,0.0005429857,0.00083371426,0.00058934756,0.00057198707],"domain_scores_gemma":[0.9968464,0.0014943457,0.0002988581,0.0009319367,0.00031137327,0.00011710628],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017965923,0.00043433448,0.00043203117,0.0015740275,0.0004780239,0.0010378312,0.002708433,0.0003003254,0.000006146236],"category_scores_gemma":[0.00029954084,0.00042285363,0.00019810048,0.00088511995,0.0003472683,0.0016244235,0.0011075541,0.0005138767,0.000008386697],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015755022,0.0000065655836,0.000062609666,0.00006287902,0.000011842067,0.0000036959534,0.00056888844,0.003051366,0.0000134917655,0.12027535,0.00003134248,0.8758962],"study_design_scores_gemma":[0.00029799464,0.000098653116,0.0000520415,0.0004841863,0.000009321562,0.000030396077,4.1186755e-7,0.5639397,0.00030992532,0.42810673,0.0061907563,0.00047990758],"about_ca_topic_score_codex":0.00001813936,"about_ca_topic_score_gemma":0.000018728428,"teacher_disagreement_score":0.8754163,"about_ca_system_score_codex":0.00018991831,"about_ca_system_score_gemma":0.00048296977,"threshold_uncertainty_score":0.99999917},"labels":[],"label_agreement":null},{"id":"W4410813117","doi":"10.1016/j.ffa.2025.102660","title":"Linear codes with few weights from vectorial dual-bent functions","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Qufu Normal University","keywords":"Bent molecular geometry; Mathematics; Dual (grammatical number); Combinatorics; Bent function; Discrete mathematics; Algebra over a field; Boolean function; Pure mathematics","score_opus":0.0072687133727059395,"score_gpt":0.21116720648958442,"score_spread":0.2038984931168785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410813117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007820034,0.00020835607,0.983868,0.0013873596,0.00019457104,0.00018327057,0.000047366266,0.00013553721,0.0061554797],"genre_scores_gemma":[0.99235576,0.00004702023,0.0062328842,0.00044893863,0.00024926473,0.00022812217,0.000036688616,0.0000044857184,0.00039680733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994332,0.000025756563,0.00010992309,0.00026720527,0.000051914267,0.000111961745],"domain_scores_gemma":[0.9990542,0.00037659946,0.000033664626,0.0004420407,0.00004613847,0.000047356003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006299687,0.00010163197,0.00010398742,0.000082734594,0.00034012456,0.00009068879,0.0002197577,0.00006590502,0.00002845757],"category_scores_gemma":[0.0000050654753,0.000073472635,0.000044138196,0.00043345074,0.0000482316,0.00008470914,0.00009568662,0.00012874774,0.000016116168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017765846,0.0000819253,0.0003569998,0.0000064019,0.00006843231,4.5097494e-7,0.0004618372,0.00002955664,0.00009826359,0.97940785,0.0008357323,0.01863479],"study_design_scores_gemma":[0.0005309682,0.0001363933,0.0020193039,0.000053102216,0.000039094837,0.0000021191934,0.00012765927,0.0058921687,0.0010857295,0.52149063,0.46836555,0.00025727483],"about_ca_topic_score_codex":0.000039372157,"about_ca_topic_score_gemma":0.000051919025,"teacher_disagreement_score":0.98453575,"about_ca_system_score_codex":0.000004587077,"about_ca_system_score_gemma":0.000032348176,"threshold_uncertainty_score":0.2996127},"labels":[],"label_agreement":null},{"id":"W4411146828","doi":"10.1016/j.tcs.2025.115392","title":"Full domain functional bootstrapping using the prime cyclotomic ring","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Chinese Academy of Sciences; Canadian Anesthesiologists' Society","keywords":"Bootstrapping (finance); Prime (order theory); Ring (chemistry); Domain (mathematical analysis); Mathematics; Computer science; Arithmetic; Discrete mathematics; Combinatorics; Econometrics","score_opus":0.01338887354693723,"score_gpt":0.24919515177760657,"score_spread":0.23580627823066933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411146828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14479387,0.000043224118,0.84870815,0.0009857358,0.0010156314,0.00015213055,3.7835994e-7,0.00021020522,0.0040906826],"genre_scores_gemma":[0.9206312,0.0000012460356,0.078334786,0.0008944689,0.000121638885,0.0000060096604,1.6523353e-7,0.0000046576606,0.000005842933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977053,0.00019570124,0.0002782658,0.000699069,0.0005296489,0.0005920085],"domain_scores_gemma":[0.99830353,0.0004163891,0.00006631416,0.00097048905,0.00011731328,0.00012594047],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0023987768,0.00019374522,0.0001694589,0.00031906788,0.0013726506,0.00071236707,0.0027929996,0.00004860063,0.000026171985],"category_scores_gemma":[0.00004372176,0.00013844018,0.00012601171,0.0023436358,0.0029614575,0.0005200262,0.0014638689,0.00029599806,0.00001732266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018176826,0.000026678019,0.000051306568,0.000004244335,0.000009263004,0.0000033461106,0.00020182086,0.0006238272,0.00914171,0.98027784,0.000012567561,0.0096292365],"study_design_scores_gemma":[0.00014733359,0.000048073867,0.0007082563,0.00004775344,0.0000059207023,0.00003740364,0.000013010235,0.42102185,0.0028472824,0.57479244,0.00018525452,0.00014542318],"about_ca_topic_score_codex":0.000002076132,"about_ca_topic_score_gemma":3.5406686e-7,"teacher_disagreement_score":0.7758373,"about_ca_system_score_codex":0.00007838392,"about_ca_system_score_gemma":0.00022560524,"threshold_uncertainty_score":0.9999274},"labels":[],"label_agreement":null},{"id":"W4411319887","doi":"10.1145/3717823.3718106","title":"High Rate Multivariate Polynomial Evaluation Codes","year":2025,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multivariate statistics; Computer science; Polynomial; Algorithm; Mathematics; Machine learning","score_opus":0.015814278145214505,"score_gpt":0.28121949894585924,"score_spread":0.2654052208006447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411319887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08667632,0.000039205388,0.88903284,0.00166188,0.0010171821,0.00016421272,8.563765e-7,0.00025149397,0.021156013],"genre_scores_gemma":[0.9815066,0.0000016929606,0.017113337,0.00062275893,0.000030272447,0.000015372336,0.0000014578558,0.0000016485012,0.00070689555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992442,0.00019480148,0.000112820526,0.00021754218,0.00010662609,0.00012398859],"domain_scores_gemma":[0.99942243,0.0001370496,0.000027417547,0.0003161553,0.00007225755,0.000024671257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009709723,0.00006895394,0.00007713699,0.00012781858,0.0001170135,0.00011939327,0.00039542472,0.000031059237,0.000090563444],"category_scores_gemma":[0.000056826382,0.00005881762,0.00004699901,0.0004279694,0.000023254306,0.00020801189,0.00012938677,0.000050672123,0.000037944163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014997956,0.000027410195,0.00011626792,0.0000023477219,0.000019424211,5.002205e-7,0.00008831997,0.00015237191,0.004219685,0.9200653,0.0021885913,0.073104806],"study_design_scores_gemma":[0.0021939336,0.000094985066,0.037312087,0.00004314565,0.0000508594,0.0000013763241,0.000040851955,0.31105232,0.04881601,0.5905792,0.009445163,0.000370072],"about_ca_topic_score_codex":0.0000705049,"about_ca_topic_score_gemma":0.000012084467,"teacher_disagreement_score":0.8948302,"about_ca_system_score_codex":0.000018090026,"about_ca_system_score_gemma":0.00006226563,"threshold_uncertainty_score":0.2398513},"labels":[],"label_agreement":null},{"id":"W4411599115","doi":"10.61091/jcmcc126-21","title":"On negacyclic codes of length \\(5p^s\\) over \\(\\mathbb{F}_{p^m}+u \\mathbb{F}_{p^m}\\)","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics; Combinatorics; Mathematics","score_opus":0.009586833770709654,"score_gpt":0.25546216318416476,"score_spread":0.2458753294134551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411599115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88064116,0.0005654684,0.09390065,0.00028763793,0.018844562,0.00034637787,0.0000029950204,0.00011379948,0.0052973325],"genre_scores_gemma":[0.99152005,0.00005218129,0.0078982385,0.000098483186,0.0003920895,0.0000020775421,4.907496e-7,0.00002358974,0.000012787494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644893,0.0002457534,0.0016207407,0.00037181104,0.0008664891,0.00044624825],"domain_scores_gemma":[0.99471515,0.0023434192,0.0014882603,0.0006878624,0.0005722384,0.00019304606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024531737,0.00042251855,0.001168736,0.00072208856,0.00034457055,0.0003460771,0.0015037722,0.00022373238,0.000007465144],"category_scores_gemma":[0.0007594561,0.00037241462,0.00043524365,0.0010783919,0.0001863154,0.000423634,0.0005917359,0.0006592619,0.0000022941704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012567625,0.00090341474,0.0001347097,0.0002311164,0.00020085843,0.000017059796,0.000847109,0.00004508228,0.00072682,0.9918223,0.00054306583,0.00440278],"study_design_scores_gemma":[0.004003625,0.0011924981,0.00025466218,0.0009975175,0.00010299317,0.000035273584,0.00013817343,0.0077279215,0.002841895,0.9814649,0.000906377,0.00033413988],"about_ca_topic_score_codex":0.0000066910907,"about_ca_topic_score_gemma":2.4284134e-7,"teacher_disagreement_score":0.110878885,"about_ca_system_score_codex":0.00007554132,"about_ca_system_score_gemma":0.00022819305,"threshold_uncertainty_score":0.9998728},"labels":[],"label_agreement":null},{"id":"W4411599128","doi":"10.61091/jcmcc126-17","title":"Perfect truncated-metric codes in lattice graphs and superlattice graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lattice (music); Mathematics; Combinatorics; Discrete mathematics; Computer science; Physics","score_opus":0.009980412928587685,"score_gpt":0.25002859726437976,"score_spread":0.2400481843357921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411599128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9782731,0.0017274364,0.010010635,0.00024805032,0.008090825,0.00024785,8.1624006e-7,0.000074803575,0.0013265115],"genre_scores_gemma":[0.9922904,0.00017065577,0.0073443544,0.00006418186,0.00010780431,0.0000021403807,3.5259566e-7,0.000015698562,0.0000044519807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726826,0.00029731807,0.0011333477,0.00036472437,0.000511627,0.00042474526],"domain_scores_gemma":[0.99578565,0.0027012443,0.000571902,0.0003727968,0.00039009808,0.0001783345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033390059,0.00034157265,0.0008673986,0.0013683733,0.00034040917,0.0005266269,0.00088183634,0.000188517,0.0000018708597],"category_scores_gemma":[0.0008839593,0.0003122012,0.00020693328,0.00243262,0.00015654525,0.0004965072,0.00048387356,0.00068091456,7.0409624e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006322617,0.0004109377,0.002725383,0.00017859838,0.00009846332,0.00003062559,0.0010740344,0.000013324014,0.00019529725,0.9905431,0.000056848574,0.0046101236],"study_design_scores_gemma":[0.0038237597,0.00058930274,0.002022515,0.0006419278,0.000092651615,0.00007505901,0.00027260612,0.008087393,0.00029592786,0.9835914,0.00020108522,0.0003063764],"about_ca_topic_score_codex":0.000015072405,"about_ca_topic_score_gemma":0.000001071508,"teacher_disagreement_score":0.014017288,"about_ca_system_score_codex":0.00005391248,"about_ca_system_score_gemma":0.00014063864,"threshold_uncertainty_score":0.999933},"labels":[],"label_agreement":null},{"id":"W4411643374","doi":"10.1103/bq28-r2r7","title":"Classical and Quantum Algorithms for Characters of the Symmetric Group","year":2025,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"Institut Périmètre de physique théorique; Government of Canada; Canadian Institute for Advanced Research; International Business Machines Corporation","keywords":"Group (periodic table); Quantum; Algorithm; Computer science; Algebra over a field; Mathematics; Pure mathematics; Quantum mechanics; Physics","score_opus":0.018705742008315887,"score_gpt":0.2574392845268054,"score_spread":0.23873354251848955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411643374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43116754,0.00067129184,0.5603385,0.0048759296,0.001838335,0.00052687665,0.000012714205,0.00012648817,0.0004423488],"genre_scores_gemma":[0.9978959,0.00002655869,0.0016182703,0.00033551062,0.000030028503,0.000029187247,9.107129e-7,0.000004398939,0.000059240352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991463,0.000076788674,0.00018924472,0.0002620838,0.0001284294,0.00019715054],"domain_scores_gemma":[0.99900216,0.00043383916,0.000082984705,0.00039697715,0.000044879704,0.00003916064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036658812,0.0001009379,0.00016045602,0.00019196678,0.00015046848,0.000059197497,0.0006705296,0.00004580249,8.7440696e-7],"category_scores_gemma":[0.00011153219,0.000070728536,0.00012824767,0.0010697561,0.00012183379,0.00013776834,0.0002534256,0.000107423904,0.0000010470337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014446828,0.000055374792,0.0014507242,0.000042008443,0.000021051215,3.1728337e-7,0.00010288743,4.0894494e-7,0.00033048488,0.96861374,0.00038016212,0.028988373],"study_design_scores_gemma":[0.0009215023,0.00032945495,0.17708533,0.0001242341,0.0000544274,0.000005899306,0.000058729358,0.15949257,0.0015449836,0.64120716,0.018895367,0.00028036823],"about_ca_topic_score_codex":0.0000043682694,"about_ca_topic_score_gemma":0.0000020496605,"teacher_disagreement_score":0.56672835,"about_ca_system_score_codex":0.000009848246,"about_ca_system_score_gemma":0.000028515395,"threshold_uncertainty_score":0.28842258},"labels":[],"label_agreement":null},{"id":"W4411720738","doi":"10.61091/ars163-08","title":"Type I and type II codes over the ring \\({\\mathbb F}_2+u{\\mathbb F}_2+u^2{\\mathbb F}_2+u^3{\\mathbb F}_2\\)","year":2025,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Ring (chemistry); Chemistry; Geology","score_opus":0.009220630435054828,"score_gpt":0.24031467567472292,"score_spread":0.2310940452396681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411720738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9577033,0.0038727138,0.0018359339,0.0022184572,0.010208533,0.00094783143,0.000020706919,0.0011444503,0.022048095],"genre_scores_gemma":[0.9942008,0.0005471323,0.0015478008,0.0017110201,0.000102244405,0.00006705775,0.000015392978,0.00008376806,0.0017247361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948955,0.00051196857,0.00093597936,0.0014849077,0.00088166044,0.0012899699],"domain_scores_gemma":[0.9951551,0.0010026558,0.00040102116,0.0025544795,0.0005271864,0.0003595762],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018983741,0.00088532164,0.0009204373,0.0005565499,0.0018086529,0.00093132484,0.003029808,0.00042867556,0.00013756801],"category_scores_gemma":[0.0004682245,0.0007505654,0.00033279933,0.003522944,0.00053368433,0.0010376353,0.0024263542,0.0010098994,0.00020490693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119377786,0.00033678603,0.0029054424,0.000118290845,0.0002458185,0.000049465965,0.0018780263,0.000023822144,0.0013329115,0.9721035,0.014883591,0.0060029873],"study_design_scores_gemma":[0.0028408312,0.00078561687,0.01670592,0.00059825013,0.000250886,0.00009114638,0.00040169974,0.0067027793,0.0030955332,0.8658115,0.10111876,0.0015970425],"about_ca_topic_score_codex":0.000091392416,"about_ca_topic_score_gemma":0.00003594525,"teacher_disagreement_score":0.10629194,"about_ca_system_score_codex":0.00015689159,"about_ca_system_score_gemma":0.00036454684,"threshold_uncertainty_score":0.99949455},"labels":[],"label_agreement":null},{"id":"W4411745093","doi":"10.1007/s10623-025-01676-y","title":"Unbiased weighing matrices of weight 9","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; Soochow University","keywords":"Mathematics; Combinatorics; Statistics; Discrete mathematics","score_opus":0.011682567934865775,"score_gpt":0.23939038540040455,"score_spread":0.22770781746553878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411745093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0846725,0.0036500865,0.90546227,0.0002176117,0.0002718305,0.00015193922,0.0000054719976,0.00018868102,0.0053796316],"genre_scores_gemma":[0.94597644,0.0006574281,0.053006314,0.00029301638,0.000022602064,0.000016794656,0.000001831834,0.0000067365886,0.000018819539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875236,0.00012650105,0.00029510714,0.00038334134,0.0001756065,0.0002670603],"domain_scores_gemma":[0.99895054,0.0003144047,0.00011487477,0.00047022104,0.0000724979,0.00007745259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043698327,0.00018697877,0.00027327889,0.00076537323,0.0002184421,0.00014652406,0.00065329706,0.00007952212,0.00001782371],"category_scores_gemma":[0.00001345717,0.00016626138,0.00020088926,0.0017257534,0.00017591844,0.00028133305,0.0001624456,0.00011681652,0.0000020412847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027955879,0.00007509018,0.013135632,0.00008958002,0.00009527808,0.0000045296256,0.00024994495,0.0000051513907,0.0037887592,0.95231265,0.0006510156,0.029564397],"study_design_scores_gemma":[0.0017320943,0.00050829217,0.02429808,0.00055616844,0.00018502554,0.000012211322,0.00021896134,0.005469001,0.039823633,0.8970885,0.029202612,0.00090536755],"about_ca_topic_score_codex":0.00001494937,"about_ca_topic_score_gemma":0.0000033610495,"teacher_disagreement_score":0.8613039,"about_ca_system_score_codex":0.0000043058812,"about_ca_system_score_gemma":0.000028411516,"threshold_uncertainty_score":0.67799425},"labels":[],"label_agreement":null},{"id":"W4411790448","doi":"10.1007/s12095-025-00823-5","title":"New successor rules to efficiently produce exponentially many binary de Bruijn sequences","year":2025,"lang":"en","type":"article","venue":"Cryptography and Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Fujian Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Nanyang Technological University","keywords":"De Bruijn sequence; Successor cardinal; Binary number; Computer science; Sequence (biology); Arithmetic; Combinatorics; Mathematics; Biology; Genetics","score_opus":0.014948405639395227,"score_gpt":0.2771713694160146,"score_spread":0.2622229637766194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411790448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.132479,0.005256612,0.83662444,0.014993727,0.00022292254,0.00040897573,0.000009513085,0.00038871667,0.009616083],"genre_scores_gemma":[0.77617747,0.00053627644,0.22205529,0.0009878807,0.000023857014,0.00009285515,0.000008020277,0.0000070913893,0.00011123425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986041,0.00023859709,0.0002631892,0.0004240421,0.00014319483,0.00032685866],"domain_scores_gemma":[0.9971925,0.0002543263,0.0000707984,0.0021991518,0.00009318632,0.000190007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004962498,0.00017992638,0.00017425662,0.0006466857,0.0008728638,0.00039744686,0.0031194584,0.00006814965,0.0000134967595],"category_scores_gemma":[0.000043229487,0.00018119907,0.0001401165,0.0021751712,0.0002396756,0.00032065585,0.0011384869,0.00020903556,0.000013012646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015770265,0.00013460836,0.0025971846,0.000018206703,0.0000505753,0.0000011380562,0.001391101,0.000026684418,0.0030328631,0.93212456,0.0016709873,0.058936305],"study_design_scores_gemma":[0.0009458884,0.00039141404,0.09504763,0.0005237332,0.00013735359,0.000023209328,0.00087574683,0.0026333649,0.0060889185,0.7627465,0.12956908,0.0010171421],"about_ca_topic_score_codex":0.00010840746,"about_ca_topic_score_gemma":0.00004586039,"teacher_disagreement_score":0.6436985,"about_ca_system_score_codex":0.000013743957,"about_ca_system_score_gemma":0.00016385077,"threshold_uncertainty_score":0.73890835},"labels":[],"label_agreement":null},{"id":"W4412058423","doi":"10.1007/s10623-025-01687-9","title":"Mutual position of two smooth quadrics over finite fields","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Santa Clara University","keywords":"Mathematics; Position (finance); Finite field; Combinatorics; Cryptography; Pure mathematics; Algorithm","score_opus":0.014639486479421707,"score_gpt":0.26284444155451014,"score_spread":0.24820495507508844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412058423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10201504,0.0006108263,0.89268976,0.00018171113,0.00018743727,0.00012161688,0.000008021767,0.00010647938,0.0040790727],"genre_scores_gemma":[0.97612506,0.00014498248,0.02299987,0.00066251424,0.000022499587,0.000014041242,0.0000042623005,0.000005639977,0.000021101963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885976,0.00012424024,0.00026282415,0.00034211573,0.00017303826,0.00023800788],"domain_scores_gemma":[0.9989754,0.00035942317,0.00009263056,0.00042662956,0.00007737742,0.00006857236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033234607,0.00017377667,0.00022722749,0.00055188284,0.00017825025,0.00012548109,0.00043228103,0.00009141475,0.000020918367],"category_scores_gemma":[0.000017272929,0.00016378051,0.00019777239,0.0014016943,0.00015727866,0.00023503414,0.0001358316,0.00014100652,0.0000014939972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003907389,0.00009459509,0.0063354736,0.0000394616,0.000065523804,0.0000047526273,0.00038858724,0.0000512584,0.0018982642,0.96603364,0.0006503887,0.024398964],"study_design_scores_gemma":[0.0016106542,0.00065397593,0.01981184,0.0002226256,0.000111727844,0.0000073016477,0.00013158518,0.01610446,0.007652305,0.9473763,0.005733043,0.0005841969],"about_ca_topic_score_codex":0.0000306289,"about_ca_topic_score_gemma":0.000013517686,"teacher_disagreement_score":0.87411004,"about_ca_system_score_codex":0.0000049663927,"about_ca_system_score_gemma":0.000030875464,"threshold_uncertainty_score":0.66787755},"labels":[],"label_agreement":null},{"id":"W4412623673","doi":"10.1109/tit.2025.3592490","title":"Improved Constructions of Skew-Tolerant Gray Codes","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Skew; Computer science; Gray code; Gray (unit); Mathematics; Algorithm; Telecommunications","score_opus":0.004925184053069241,"score_gpt":0.21465684968382953,"score_spread":0.2097316656307603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412623673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035990034,0.000014158551,0.98578763,0.00013700852,0.0013037224,0.00017804079,0.00003119026,0.00020580173,0.008743426],"genre_scores_gemma":[0.99112433,0.000014615819,0.008329082,0.00033638242,0.000006551124,0.00004227989,0.0000019979382,0.0000027286178,0.00014204087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910206,0.00010751279,0.00039960063,0.00011484621,0.00012868669,0.00014728044],"domain_scores_gemma":[0.9989765,0.0002674994,0.00012601216,0.00044473747,0.00014297356,0.000042247208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004450413,0.00012261915,0.00015024301,0.00059668336,0.00029075274,0.00007803546,0.00040497846,0.000072888426,0.00007138009],"category_scores_gemma":[0.000009531423,0.00011515899,0.00015802124,0.00078020646,0.00016675048,0.0011165232,0.0000031666536,0.00017556161,0.000025558427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006452586,0.000058604823,0.0000032702733,0.000040966443,0.00006198697,6.599452e-8,0.0009933389,0.0011785572,0.00054102094,0.86038774,0.00006880647,0.13660109],"study_design_scores_gemma":[0.0021307343,0.00034932385,0.00022853726,0.0002739942,0.00011514411,0.000026125397,0.0014218322,0.049742967,0.22702117,0.71048963,0.0076269316,0.0005736098],"about_ca_topic_score_codex":0.000006804127,"about_ca_topic_score_gemma":0.0000025227187,"teacher_disagreement_score":0.98752534,"about_ca_system_score_codex":0.000024198564,"about_ca_system_score_gemma":0.00008565378,"threshold_uncertainty_score":0.46960473},"labels":[],"label_agreement":null},{"id":"W4412647240","doi":"10.55016/ojs/cdm.v3i1.61969","title":"The transitive and co-transitive blocking sets in P^2(F_q)","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transitive relation; Mathematics; Combinatorics; Blocking (statistics); Transitive reduction; Transitive closure; Graph; Statistics; Line graph; Voltage graph","score_opus":0.012679004613922034,"score_gpt":0.27959254246855,"score_spread":0.26691353785462796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1302344,0.00019325005,0.8637031,0.003717229,0.00006452772,0.00044316443,0.000087852,0.000103276805,0.0014532323],"genre_scores_gemma":[0.9941904,0.00007159415,0.005445284,0.00019226104,0.000017021603,0.000047039957,0.0000036791853,0.000007249738,0.000025458285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883574,0.00011501541,0.0002709817,0.00024529686,0.00018318373,0.00034976262],"domain_scores_gemma":[0.9986689,0.00067697087,0.000053928175,0.00037052136,0.00011387377,0.000115802526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006061404,0.00015110582,0.00020319878,0.00011627831,0.00073951867,0.000111674206,0.00039394078,0.000052834544,0.000002962558],"category_scores_gemma":[0.00017754237,0.00011472545,0.00007948657,0.0005596591,0.00021313799,0.00018105061,0.00007714847,0.00016899857,0.00001565577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018271227,0.00007593029,0.00020754848,0.000014390213,0.000042400905,0.00004525596,0.02323129,0.000040769628,0.00068243314,0.9728527,0.00020549423,0.0025835235],"study_design_scores_gemma":[0.0041040056,0.0006874841,0.024649063,0.0008207682,0.00012785755,0.00085546146,0.006218737,0.13437757,0.013615012,0.80223614,0.0103822155,0.0019256948],"about_ca_topic_score_codex":0.0000054716293,"about_ca_topic_score_gemma":0.00002456546,"teacher_disagreement_score":0.86395603,"about_ca_system_score_codex":0.00004117411,"about_ca_system_score_gemma":0.000050704824,"threshold_uncertainty_score":0.5687854},"labels":[],"label_agreement":null},{"id":"W4412647898","doi":"10.55016/ojs/cdm.v2i1.61875","title":"Classes of codes from quadratic surfaces of PG(3,q)","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Quadratic equation; Geometry","score_opus":0.013079741330489067,"score_gpt":0.2896136453142532,"score_spread":0.27653390398376415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27376083,0.00012100021,0.7244659,0.00022210495,0.00007732726,0.00015486874,0.00017099734,0.000055482986,0.0009714537],"genre_scores_gemma":[0.9069672,0.000007828322,0.09293527,0.000030592026,0.000016864406,0.000005029649,0.000008165466,0.0000054798265,0.0000235384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987242,0.00005378317,0.0005490063,0.00018273576,0.00025199965,0.00023823563],"domain_scores_gemma":[0.99757266,0.0011524544,0.00024175552,0.0006419348,0.00028881838,0.00010235542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085467816,0.00013017176,0.00035103937,0.0001536384,0.000092365815,0.000040954103,0.00068052876,0.00006157457,0.000027739008],"category_scores_gemma":[0.0005366555,0.00011295485,0.00013659583,0.00066451484,0.00012938541,0.000160136,0.00017751026,0.00007470874,0.000015803122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011522167,0.00014687904,0.00044784916,0.000049772916,0.00006578947,0.0000017299055,0.0018166959,0.00007191756,0.016611302,0.9798384,0.0001765045,0.0007616798],"study_design_scores_gemma":[0.00060810376,0.0003144052,0.005445216,0.00043163353,0.00012027068,0.0000046404307,0.0012621885,0.011405412,0.23743883,0.7415714,0.0009808361,0.00041702227],"about_ca_topic_score_codex":0.000024710991,"about_ca_topic_score_gemma":0.000040673858,"teacher_disagreement_score":0.6332064,"about_ca_system_score_codex":0.00002095932,"about_ca_system_score_gemma":0.000048249112,"threshold_uncertainty_score":0.4606165},"labels":[],"label_agreement":null},{"id":"W4412648042","doi":"10.55016/ojs/cdm.v1i1.61901","title":"Classification of linear codes exploiting an invariant","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Invariant (physics); Combinatorics; Discrete mathematics","score_opus":0.024009442177748672,"score_gpt":0.28978886986806357,"score_spread":0.2657794276903149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083763115,0.00001837286,0.91363966,0.00059101457,0.00004930374,0.00019485442,0.000067275,0.00014756732,0.0015288322],"genre_scores_gemma":[0.881436,0.0000015310266,0.11837548,0.00003678415,0.000058693106,0.000030438365,0.000026278127,0.0000067647534,0.000028039654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989296,0.0000741936,0.00039217828,0.00020963016,0.00018460312,0.00020975011],"domain_scores_gemma":[0.99867314,0.00018532597,0.00016440112,0.00063622603,0.00025867872,0.0000822517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060780253,0.000111479756,0.00019211805,0.0001423756,0.00021418362,0.0000868862,0.00055029575,0.000049904407,0.000009653867],"category_scores_gemma":[0.00023817619,0.00010242678,0.000080388854,0.000564783,0.000057103458,0.0003021934,0.000117279495,0.00007135615,0.000023504655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024143483,0.0001171882,0.00008351104,0.00001661219,0.00000759427,8.260124e-7,0.0004616302,0.00013813934,0.014635364,0.98397136,0.00009978743,0.00046555608],"study_design_scores_gemma":[0.00046473852,0.00022012554,0.0035468522,0.00016795952,0.000048670365,0.000014592309,0.00059390813,0.22112952,0.031991977,0.7402251,0.0011873916,0.0004091779],"about_ca_topic_score_codex":0.000014904519,"about_ca_topic_score_gemma":0.000013465089,"teacher_disagreement_score":0.79767287,"about_ca_system_score_codex":0.000029023082,"about_ca_system_score_gemma":0.000039676524,"threshold_uncertainty_score":0.41768426},"labels":[],"label_agreement":null},{"id":"W4412710571","doi":"10.1016/j.jalgebra.2025.07.016","title":"Positivity preservers over finite fields","year":2025,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Defence Science and Technology Group; Directorate for Mathematical and Physical Sciences; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; Plymouth University; Pacific Institute for the Mathematical Sciences; Indian Institute of Science; Simons Foundation; American Institute of Mathematics; Science and Engineering Research Board; National Science Foundation","keywords":"Mathematics; Pure mathematics","score_opus":0.006301348979913577,"score_gpt":0.24062356465520532,"score_spread":0.23432221567529174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412710571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35914457,0.0003336248,0.6252687,0.0031279959,0.0010061652,0.00003942062,6.3581484e-7,0.000030278952,0.011048586],"genre_scores_gemma":[0.99591357,0.000018324337,0.0028677904,0.00091334415,0.00005700481,3.5413166e-7,5.965635e-8,0.0000016476205,0.00022792921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999375,0.00007956995,0.00018907727,0.000085180545,0.00015739788,0.000113789356],"domain_scores_gemma":[0.9992614,0.00027061862,0.000117721764,0.00022435859,0.00007717147,0.000048772166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044857606,0.00006200845,0.00011885942,0.00019059367,0.000064740576,0.00009874956,0.0006336163,0.00004427101,0.00003828423],"category_scores_gemma":[0.00008533303,0.000051650964,0.000165485,0.00038210285,0.00001907732,0.00046204063,0.00013978573,0.00020152348,0.0000032697296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082235885,0.00015495287,0.0064900345,0.000022999058,0.00015644972,0.000090171416,0.00045904948,0.0001811414,0.0005556661,0.94760275,0.014987745,0.029216817],"study_design_scores_gemma":[0.0013714853,0.0005823631,0.09481487,0.000272847,0.000059793205,0.0000611374,0.000038336588,0.0040791337,0.007865217,0.8633483,0.027231246,0.0002752983],"about_ca_topic_score_codex":0.0000030686908,"about_ca_topic_score_gemma":0.0000021597066,"teacher_disagreement_score":0.63676894,"about_ca_system_score_codex":0.000012652782,"about_ca_system_score_gemma":0.00006341682,"threshold_uncertainty_score":0.21062651},"labels":[],"label_agreement":null},{"id":"W4412809371","doi":"10.1016/j.ffa.2025.102710","title":"Construction of (n,n)-functions with low differential-linear uniformity","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Hubei Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Differential (mechanical device); Pure mathematics; Linear differential equation; Discrete mathematics; Mathematical analysis; Combinatorics; Differential equation; Physics","score_opus":0.005076776265270787,"score_gpt":0.20212316995202365,"score_spread":0.19704639368675286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412809371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028181693,0.000032458156,0.96649504,0.0003942226,0.000046298952,0.00013389208,0.000015216061,0.000058549802,0.004642651],"genre_scores_gemma":[0.9939807,0.000021415497,0.005701976,0.00006901274,0.000016028034,0.00006561433,0.000007839076,0.0000018584481,0.0001355769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961305,0.000015674728,0.00010924971,0.00015321154,0.00003503994,0.000073788484],"domain_scores_gemma":[0.99941236,0.00013284267,0.00004646922,0.00032560137,0.000057094076,0.000025611602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048152928,0.00006856854,0.000088516936,0.00009847759,0.00017327494,0.000024305877,0.00017322958,0.000046876306,0.000014154096],"category_scores_gemma":[0.000003986962,0.000050638882,0.000035967998,0.00044922045,0.00009736239,0.00007612915,0.00006431717,0.000086102074,0.000001856241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007968762,0.00005118328,0.0009635282,0.000021426216,0.000028339071,4.5737746e-8,0.00011406149,0.000024263694,0.000106409985,0.95653474,0.00002936539,0.04211864],"study_design_scores_gemma":[0.0012237334,0.0003637668,0.012834524,0.00018621769,0.00008409343,0.00001842125,0.00065084704,0.033134032,0.011567411,0.89971656,0.039723247,0.00049717235],"about_ca_topic_score_codex":0.000007594375,"about_ca_topic_score_gemma":0.000009793251,"teacher_disagreement_score":0.965799,"about_ca_system_score_codex":0.0000025656252,"about_ca_system_score_gemma":0.000025188552,"threshold_uncertainty_score":0.20649937},"labels":[],"label_agreement":null},{"id":"W4413267765","doi":"10.1109/ojcoms.2025.3593140","title":"Fact-Checking 5G Security: Bridging the Gap Between Expectations and Reality","year":2025,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Spanish National Plan for Scientific and Technical Research and Innovation; Institució Catalana de Recerca i Estudis Avançats; European Commission","keywords":"Bridging (networking); Computer security; Computer science; Business","score_opus":0.08491558144744353,"score_gpt":0.3602592592662317,"score_spread":0.27534367781878816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413267765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18061991,0.0060338504,0.49504274,0.29429737,0.0011231479,0.0010823497,0.000028933486,0.000092198796,0.02167951],"genre_scores_gemma":[0.99115413,0.00024180378,0.007876997,0.00061535375,0.000037957456,0.000007300947,4.6149933e-7,0.0000036227818,0.000062356194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864376,0.0006223365,0.000344556,0.000107585984,0.00015720166,0.00012454629],"domain_scores_gemma":[0.99673754,0.00087306043,0.0003527771,0.0018195957,0.00017744495,0.00003955649],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019901434,0.00008628152,0.00016110134,0.000035408564,0.0017722447,0.0006061035,0.0071423906,0.00003860952,0.0000015714235],"category_scores_gemma":[0.00008654369,0.000055050794,0.0002445771,0.0006998386,0.00030361474,0.0005293901,0.0017024991,0.0005348697,6.70056e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017876482,0.00032353576,0.02016136,0.000050610837,0.0013259716,9.0746147e-7,0.1076363,0.00017602218,0.0014818137,0.71492785,0.06322094,0.090676814],"study_design_scores_gemma":[0.0015511056,0.000084950785,0.04284648,0.0009330989,0.0004425527,0.00008908519,0.019391503,0.015443385,0.0039968686,0.8588825,0.05579964,0.0005388628],"about_ca_topic_score_codex":0.00003585979,"about_ca_topic_score_gemma":0.000019575176,"teacher_disagreement_score":0.81053424,"about_ca_system_score_codex":0.00004593032,"about_ca_system_score_gemma":0.00014317466,"threshold_uncertainty_score":0.99952734},"labels":[],"label_agreement":null},{"id":"W4413395728","doi":"10.1080/00927872.2025.2541931","title":"Existence and nonexistence of permutation trinomials in odd characteristics","year":2025,"lang":"en","type":"article","venue":"Communications in Algebra","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"University Grants Commission of Bangladesh","keywords":"Trinomial; Mathematics; Permutation (music); Combinatorics; Pure mathematics; Physics","score_opus":0.026333597666429384,"score_gpt":0.3057598996862343,"score_spread":0.2794263020198049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413395728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94834316,0.0015093002,0.03619724,0.0018849181,0.00011327702,0.00028446343,0.0000036147505,0.00008467145,0.011579326],"genre_scores_gemma":[0.97362554,0.00049796025,0.02572509,0.00009730547,0.0000019044913,0.000030027315,0.0000024441804,0.0000025666748,0.000017158072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991703,0.0001821615,0.00034479355,0.00015303468,0.00005506601,0.00009466498],"domain_scores_gemma":[0.9981965,0.0004574629,0.000096107695,0.0011902718,0.000043345095,0.000016320348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005542529,0.00006364012,0.00014593915,0.00033078107,0.00005325092,0.000038304064,0.0012680114,0.000038578877,0.0000011658125],"category_scores_gemma":[0.00015737675,0.00007108183,0.000023353663,0.00089975493,0.00019138439,0.00017192434,0.00042635514,0.00013177017,0.0000010841403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054578627,0.000085809166,0.021402435,0.00002107485,0.0000027872475,5.2565645e-7,0.0010081643,0.0000011860958,0.00045731183,0.94068336,0.0000030349408,0.036328845],"study_design_scores_gemma":[0.0006038102,0.00004548955,0.5991133,0.0004027865,0.000007525716,0.000004048329,0.00029302135,0.012577546,0.0012997949,0.3845225,0.00094171293,0.00018844477],"about_ca_topic_score_codex":0.000021471185,"about_ca_topic_score_gemma":0.000047465568,"teacher_disagreement_score":0.57771087,"about_ca_system_score_codex":0.000023295563,"about_ca_system_score_gemma":0.000048639075,"threshold_uncertainty_score":0.2898633},"labels":[],"label_agreement":null},{"id":"W4413608238","doi":"10.3390/jsan14050086","title":"Efficient and Low-Cost Modular Polynomial Multiplier for WSN Security","year":2025,"lang":"en","type":"article","venue":"Journal of Sensor and Actuator Networks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Modular design; Multiplier (economics); Polynomial; Computer security; Mathematics; Programming language; Economics","score_opus":0.004999587297650567,"score_gpt":0.22610221801728347,"score_spread":0.2211026307196329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413608238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64056545,0.00063755625,0.35764146,0.00035944092,0.00057478197,0.00013497607,0.000002379021,0.00001382719,0.00007008657],"genre_scores_gemma":[0.99477667,0.00008202975,0.0045246757,0.000327004,0.0002647105,0.0000021378246,2.5394544e-7,0.000004886066,0.00001763866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919915,0.00004381786,0.000266846,0.00017553853,0.00010439522,0.00021024235],"domain_scores_gemma":[0.99920034,0.0002809232,0.00014802275,0.00015182108,0.000096519456,0.00012238034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004769195,0.00012245493,0.00022699616,0.00014329907,0.00018037617,0.00015079064,0.00021780163,0.00008177743,0.0000019565089],"category_scores_gemma":[0.000042469102,0.00009852498,0.00012203294,0.00017812512,0.00006804303,0.00009387428,0.000094652496,0.00020985029,1.8400627e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028902015,0.0011294188,0.0073109297,0.00039067902,0.0009674058,0.00015690057,0.0057789097,0.058473606,0.008549462,0.0794549,0.015700212,0.81919736],"study_design_scores_gemma":[0.0025407588,0.00019723573,0.0040638754,0.00020686853,0.000074161035,0.0000875798,0.00013214203,0.9770295,0.00074826815,0.0053298906,0.009321572,0.00026814357],"about_ca_topic_score_codex":8.7087835e-7,"about_ca_topic_score_gemma":5.748392e-7,"teacher_disagreement_score":0.9185559,"about_ca_system_score_codex":0.000013462,"about_ca_system_score_gemma":0.000026069556,"threshold_uncertainty_score":0.4017732},"labels":[],"label_agreement":null},{"id":"W4415350706","doi":"10.46298/dmtcs.15939","title":"Low complexity binary words avoiding $(5/2)^+$-powers","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Binary number; Cover (algebra); Word (group theory); Structured program theorem; Feature (linguistics)","score_opus":0.016745601426225484,"score_gpt":0.2703264039003534,"score_spread":0.2535808024741279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415350706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026981963,0.000039472117,0.94791144,0.001319325,0.0009939121,0.00028887732,0.0000032469245,0.0005035047,0.021958267],"genre_scores_gemma":[0.71945244,0.000004130384,0.27980512,0.000644903,0.000045576744,0.000012748936,0.0000011371438,0.000010372696,0.000023544006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628997,0.00023495458,0.00058326975,0.0010624179,0.0008860467,0.00094332686],"domain_scores_gemma":[0.9966617,0.0008618185,0.00014652056,0.0018047366,0.00020642394,0.00031878767],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.0034219185,0.0003943636,0.00045254463,0.0006220944,0.001375538,0.0011428754,0.0048916275,0.00009412567,0.00008004031],"category_scores_gemma":[0.00026124794,0.00033048622,0.00025267052,0.0035630313,0.0049480456,0.0008242896,0.00268765,0.00049610436,0.0000732859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008466028,0.00015928039,0.000023933853,0.00008373463,0.000014830157,0.000012719399,0.0016279478,0.000046480236,0.00091894384,0.98966616,0.00011163016,0.0073258528],"study_design_scores_gemma":[0.00017092786,0.000095598574,0.00008024965,0.0002030782,0.00001164148,0.0000113078995,0.00009089436,0.35450047,0.0023346292,0.6421557,0.00006849211,0.0002770237],"about_ca_topic_score_codex":0.0000013224385,"about_ca_topic_score_gemma":4.7096563e-7,"teacher_disagreement_score":0.6924705,"about_ca_system_score_codex":0.00007653423,"about_ca_system_score_gemma":0.00018373063,"threshold_uncertainty_score":0.99992454},"labels":[],"label_agreement":null},{"id":"W4415367806","doi":"10.1109/isit63088.2025.11195625","title":"Improved Constructions of Skew-Tolerant Gray Codes","year":2025,"lang":"","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Gray (unit); Gray code; Exponential function","score_opus":0.007889438034966365,"score_gpt":0.238796188712744,"score_spread":0.23090675067777763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415367806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026535146,0.0006163984,0.9230032,0.00084989506,0.0032291063,0.0002605506,0.000017417862,0.00013365928,0.04535461],"genre_scores_gemma":[0.9679611,0.00007854647,0.03004179,0.0002522874,0.000039133938,0.000010908537,8.6073635e-7,0.0000051644834,0.001610215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981352,0.00017329001,0.0006153227,0.0005373511,0.00016937051,0.00036945692],"domain_scores_gemma":[0.9982214,0.00029766068,0.00017398792,0.0009430327,0.00026429116,0.000099613404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000477004,0.0002452193,0.0004090689,0.00044939364,0.0003688524,0.00016820089,0.0009906632,0.00013068684,0.00041413892],"category_scores_gemma":[0.000048747515,0.00022845241,0.00035360543,0.0018641945,0.0007494403,0.00026589548,0.00039975764,0.00023010885,0.000010578277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031556192,0.00016363806,0.00083434983,0.00009336451,0.00014961143,8.3940046e-7,0.00042047497,0.000010026831,0.0065635126,0.91093886,0.00047746842,0.08031629],"study_design_scores_gemma":[0.0020782968,0.0005613429,0.0028445555,0.0006761369,0.00028321758,0.000030442743,0.0007353944,0.13839258,0.081273496,0.7592457,0.01303946,0.0008393895],"about_ca_topic_score_codex":0.00009342422,"about_ca_topic_score_gemma":0.000035187764,"teacher_disagreement_score":0.9414259,"about_ca_system_score_codex":0.000017563272,"about_ca_system_score_gemma":0.0002925671,"threshold_uncertainty_score":0.9316019},"labels":[],"label_agreement":null},{"id":"W4415954489","doi":"10.3390/appliedmath5040156","title":"Application of a New Iterative Formula for Computing π and Nested Radicals with Roots of 2","year":2025,"lang":"en","type":"article","venue":"AppliedMath","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thoth Technology (Canada); York University","funders":"National Research Council Canada; York University","keywords":"Iterative method; Iterative refinement; Algebra over a field; Iterative and incremental development; Computation; Set (abstract data type)","score_opus":0.006826968357424119,"score_gpt":0.25727211449781584,"score_spread":0.2504451461403917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415954489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094266616,0.000066236666,0.9045809,0.00010618352,0.000011244083,0.00033659005,0.0000013377563,0.00003072544,0.000600174],"genre_scores_gemma":[0.9188668,0.0000013509416,0.08101704,0.00006928847,0.000008458111,0.00001714243,0.0000016048384,0.0000025891475,0.00001573717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950105,0.0000103338425,0.00016029653,0.00017313691,0.00006680593,0.000088374356],"domain_scores_gemma":[0.9994254,0.00018625951,0.00011123785,0.00020600892,0.00004264464,0.000028424642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001675422,0.00006888769,0.00015751855,0.00008200195,0.000049490478,0.000019625575,0.00020307658,0.000027354277,2.938593e-7],"category_scores_gemma":[0.000006232548,0.00005592994,0.000027683132,0.0003358975,0.00004962957,0.00006569119,0.00006926093,0.000031010753,1.5045275e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037546593,0.000028037208,0.0005383262,0.00006791747,0.000020863255,6.700679e-8,0.0006035561,0.00004430108,0.0033995965,0.88913447,0.000054921096,0.10607043],"study_design_scores_gemma":[0.0038153476,0.0006218758,0.020924332,0.00038251124,0.000087152584,0.000008633557,0.00025656944,0.21789542,0.065442845,0.68335694,0.006805134,0.00040321006],"about_ca_topic_score_codex":0.000007308467,"about_ca_topic_score_gemma":0.0000021004162,"teacher_disagreement_score":0.82460016,"about_ca_system_score_codex":0.0000037021202,"about_ca_system_score_gemma":0.000035246878,"threshold_uncertainty_score":0.22807568},"labels":[],"label_agreement":null},{"id":"W4416023954","doi":"10.48550/arxiv.2511.04113","title":"On an analogue of BRK-type sets in finite fields","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degree (music); Upper and lower bounds; Homogeneous; Homogeneous polynomial; Dilation (metric space); Polynomial; Hypersphere","score_opus":0.05184821192318932,"score_gpt":0.3012877040333555,"score_spread":0.24943949211016614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416023954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9731552,0.00023660596,0.018151289,0.0005025938,0.0027089433,0.0003690309,0.000035025703,0.00008649798,0.0047548166],"genre_scores_gemma":[0.9974263,0.0002770245,0.00084121217,0.0010226902,0.00008474077,0.000018914765,0.00003477999,0.000014305104,0.00028004544],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99590564,0.0007246401,0.00094317977,0.0014506069,0.00038392068,0.00059203326],"domain_scores_gemma":[0.995516,0.0010391783,0.0004254237,0.0025977476,0.0002391219,0.00018253142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013047841,0.0005553225,0.0007987384,0.0009824766,0.00015944232,0.00010106639,0.0027925784,0.0006708619,0.00021246047],"category_scores_gemma":[0.0003503612,0.0005978468,0.000386755,0.002071249,0.00023665183,0.0002778327,0.001668289,0.0015133577,0.000075213844],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084959884,0.0021759993,0.7235174,0.0008209984,0.00034427206,0.00019917177,0.011118194,0.032019675,0.00028065097,0.16607094,0.00042084375,0.062182218],"study_design_scores_gemma":[0.0016231949,0.002865465,0.70692223,0.00362518,0.0001377172,0.0000069891203,0.00020219786,0.044347912,0.0032600518,0.23342822,0.0017274327,0.0018533864],"about_ca_topic_score_codex":0.0002836089,"about_ca_topic_score_gemma":0.0003347902,"teacher_disagreement_score":0.06735728,"about_ca_system_score_codex":0.00005128443,"about_ca_system_score_gemma":0.00038343773,"threshold_uncertainty_score":0.9996473},"labels":[],"label_agreement":null},{"id":"W4416139549","doi":"10.4064/aa250108-11-3","title":"Existence of normal elements with prescribed norms","year":2025,"lang":"","type":"article","venue":"Acta Arithmetica","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Multiplicative group; Prime (order theory); Extension (predicate logic); Primitive element; Multiplicative function; Finite field; Galois group; Generator (circuit theory); Group (periodic table)","score_opus":0.00905378361818915,"score_gpt":0.235147966041236,"score_spread":0.22609418242304685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416139549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3483634,0.0014364336,0.47548035,0.0048686704,0.0021586518,0.0016251585,0.00006636706,0.0002910122,0.16570996],"genre_scores_gemma":[0.95260435,0.000078146586,0.04572611,0.0003769239,0.000035622375,0.00002789969,0.0000026732048,0.000013497073,0.0011347859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686617,0.00020020855,0.000770668,0.000814914,0.00061840366,0.00072966365],"domain_scores_gemma":[0.997315,0.0002989832,0.00032254079,0.0015413301,0.00034657857,0.00017554882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007357982,0.00039291254,0.00051534415,0.00046010033,0.00030548748,0.0002494564,0.0021809551,0.00013791934,0.00020332154],"category_scores_gemma":[0.000115378,0.00033633932,0.00020778226,0.002286499,0.0006882641,0.000634925,0.0009357505,0.0003797132,0.000016615537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007543293,0.0017239301,0.015387691,0.0005177975,0.0007566836,0.000048347643,0.0025218925,0.000015636137,0.002570351,0.8294827,0.0009089405,0.14531173],"study_design_scores_gemma":[0.018466167,0.018754557,0.16591236,0.009081566,0.0029566255,0.00017065389,0.0015971623,0.11109647,0.19032693,0.29776406,0.1775519,0.0063215694],"about_ca_topic_score_codex":0.00003589064,"about_ca_topic_score_gemma":0.000018477287,"teacher_disagreement_score":0.60424095,"about_ca_system_score_codex":0.00003357668,"about_ca_system_score_gemma":0.0003348024,"threshold_uncertainty_score":0.99990886},"labels":[],"label_agreement":null},{"id":"W4416176599","doi":"10.48550/arxiv.2508.06695","title":"When isometry and equivalence for skew constacyclic codes coincide","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Isometry (Riemannian geometry); Skew; Commutative property; Equivalence (formal languages); Base (topology); Commutative ring","score_opus":0.06761650630616854,"score_gpt":0.20719122511680382,"score_spread":0.13957471881063527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416176599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08852885,0.0003603817,0.9062391,0.00017195124,0.00045477136,0.00037886764,0.00008113567,0.00025778805,0.003527147],"genre_scores_gemma":[0.98538935,0.0003694973,0.01239834,0.0002790083,0.000037522732,0.0000030347253,0.000008710644,0.000008097767,0.0015064344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819607,0.00012742917,0.00017880442,0.0010853541,0.000065215,0.00034712415],"domain_scores_gemma":[0.9978903,0.0006483158,0.0001755613,0.0010087279,0.00013210972,0.00014497171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040006175,0.0002904291,0.00036380734,0.00046064216,0.00025565395,0.00016875354,0.0016698618,0.00022458585,0.000015092254],"category_scores_gemma":[0.00007753598,0.00034376752,0.00023516543,0.00051983073,0.0002769788,0.00027681727,0.0023945586,0.00034274827,0.0000064231167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047130477,0.000047022677,0.0028353333,0.00026428388,0.00010604295,0.00003881886,0.00022703578,0.0006665636,0.00003157028,0.99224544,0.00054949813,0.0029412403],"study_design_scores_gemma":[0.00058894925,0.000085379696,0.0004154879,0.0003053192,0.00012142068,0.0000051664197,0.00007057762,0.054739848,0.0002445638,0.93866336,0.0042547495,0.00050519465],"about_ca_topic_score_codex":0.000044711946,"about_ca_topic_score_gemma":0.000019668216,"teacher_disagreement_score":0.8968605,"about_ca_system_score_codex":0.00006241403,"about_ca_system_score_gemma":0.00018236374,"threshold_uncertainty_score":0.9999014},"labels":[],"label_agreement":null},{"id":"W4416300436","doi":"10.4153/s000843952510146x","title":"Rational Delsarte designs and Galois fusions of association schemes","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Canterbury; National Science Foundation","keywords":"Association scheme; Finite field; Scheme (mathematics); Galois theory; Hamming code; Commutative property; Association (psychology); Eigenvalues and eigenvectors","score_opus":0.010825324948958428,"score_gpt":0.22137062539269423,"score_spread":0.2105453004437358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416300436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084549904,0.00020194531,0.8365169,0.03226853,0.00013319927,0.0002777791,0.000016465548,0.00007839693,0.04595683],"genre_scores_gemma":[0.9758551,0.000005553783,0.021739071,0.00088241947,0.000012176951,0.000013959202,0.0000017123905,0.000003250421,0.0014867499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937636,0.000055086213,0.00016148514,0.00013730131,0.00010810006,0.0001616579],"domain_scores_gemma":[0.9991662,0.0004128475,0.00004359691,0.00017198395,0.00007352383,0.00013183657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040741597,0.00006423383,0.000116173,0.00016028706,0.00012184529,0.00005671438,0.00021202643,0.000057988902,0.0007088939],"category_scores_gemma":[0.00039551867,0.000062831175,0.0000414358,0.00024994244,0.000042427124,0.000036165904,0.00004587897,0.00006942369,0.00012154437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.670233e-7,0.000013776137,0.00030848864,0.000022220316,0.000015322752,0.000001270045,0.00010775156,0.0000010079898,0.00019969587,0.99004114,0.0077754846,0.0015129006],"study_design_scores_gemma":[0.00027425482,0.000033299286,0.0021693653,0.000141034,0.000025853547,0.0000041683084,0.000054645905,0.0033276123,0.0011478595,0.9086358,0.0840135,0.00017262784],"about_ca_topic_score_codex":0.00006815387,"about_ca_topic_score_gemma":0.00017456766,"teacher_disagreement_score":0.8913052,"about_ca_system_score_codex":0.000054765896,"about_ca_system_score_gemma":0.00016660271,"threshold_uncertainty_score":0.776189},"labels":[],"label_agreement":null},{"id":"W4417054196","doi":"10.1109/ecoc66593.2025.11263268","title":"Hybrid Soft/Hard-Decision Iterative Decoding of Concatenated RS-BCH Codes","year":2025,"lang":"","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decoding methods; Concatenated error correction code; BCH code; Code (set theory); Serial concatenated convolutional codes; Sequential decoding; Convolutional code","score_opus":0.01770583419132134,"score_gpt":0.27699960010346436,"score_spread":0.25929376591214304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417054196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16806102,0.0010776425,0.808721,0.00053732516,0.0016798347,0.00037083693,0.000025732066,0.00017314154,0.019353455],"genre_scores_gemma":[0.9775866,0.00017435338,0.019661255,0.00075246644,0.000041707415,0.000013366055,0.000004846653,0.000014408744,0.0017509417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99618393,0.00042835838,0.0011500355,0.0010883587,0.00050297694,0.0006463265],"domain_scores_gemma":[0.99574655,0.0019210723,0.00036362116,0.0011290595,0.0006645078,0.00017516346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015911639,0.00048454868,0.0007849148,0.0008645572,0.0005461708,0.0005573923,0.0018249749,0.00015422946,0.00069074746],"category_scores_gemma":[0.00039058775,0.0004382139,0.00046104062,0.0021849056,0.00047564425,0.0008076142,0.0010600558,0.0003889843,0.000069789254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035114432,0.00032748884,0.0016806718,0.000111505775,0.00029511462,0.000030361965,0.0014693994,0.00019018515,0.007472723,0.6278328,0.0033039495,0.35693467],"study_design_scores_gemma":[0.0026535627,0.00069399306,0.0030225075,0.0021151353,0.0001824109,0.000027338052,0.00037281093,0.3211745,0.26972684,0.39442948,0.0046102153,0.0009911782],"about_ca_topic_score_codex":0.000026505846,"about_ca_topic_score_gemma":0.00000770284,"teacher_disagreement_score":0.80952567,"about_ca_system_score_codex":0.00007412824,"about_ca_system_score_gemma":0.00027263717,"threshold_uncertainty_score":0.99980694},"labels":[],"label_agreement":null},{"id":"W4417529622","doi":"10.48550/arxiv.2512.16118","title":"Equidistribution of polynomial sequences in function fields: resolution of a conjecture","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Equidistributed sequence; Conjecture; Resolution (logic); Polynomial; Finite field; Laurent series; Function field; Integer (computer science)","score_opus":0.03629586369635444,"score_gpt":0.2698655428394987,"score_spread":0.23356967914314428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417529622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7641453,0.0010781429,0.23027478,0.0004559428,0.0028395175,0.00041811398,0.000086140455,0.0000443797,0.0006576465],"genre_scores_gemma":[0.9988841,0.00027741594,0.0004430707,0.00007150656,0.0001504552,0.000031262953,0.000048760594,0.0000057908023,0.00008763031],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9964647,0.00058997964,0.0012149558,0.00092711014,0.0003746587,0.00042857346],"domain_scores_gemma":[0.99733573,0.00034042003,0.00091874925,0.001046597,0.0002860297,0.000072474824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013918454,0.00039389508,0.00072678394,0.0006003152,0.00013617153,0.000042780914,0.001142542,0.0007500997,0.000080393635],"category_scores_gemma":[0.00023966325,0.0004208219,0.0004536914,0.0014814954,0.0004073363,0.00030746972,0.0010128955,0.00088340853,0.000005551697],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004843757,0.0017173263,0.69189835,0.0041121105,0.0008694786,0.000037903177,0.012462879,0.031649966,0.034219448,0.15724121,0.0012792553,0.059668303],"study_design_scores_gemma":[0.0050186785,0.004660526,0.66783303,0.010253206,0.0007800814,0.000027779886,0.0013015362,0.040016674,0.13627134,0.12658677,0.004700163,0.0025502264],"about_ca_topic_score_codex":0.00078942574,"about_ca_topic_score_gemma":0.00019740574,"teacher_disagreement_score":0.23473878,"about_ca_system_score_codex":0.00013797746,"about_ca_system_score_gemma":0.0005499786,"threshold_uncertainty_score":0.99982435},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015154963320527964,"score_gpt":0.23521725077379532,"score_spread":0.22006228745326736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45261477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2251569,0.00006463238,0.76993686,0.00021472902,0.00016721952,0.0001459834,0.000017610517,0.00016656258,0.0041294727],"genre_scores_gemma":[0.96561235,0.000055013865,0.034031726,0.00020672679,0.00003953243,0.00002568488,0.000007941887,0.000012004822,0.000009022745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863064,0.00012783808,0.0003067148,0.00039480694,0.0002582774,0.00028170834],"domain_scores_gemma":[0.99874973,0.00029488068,0.00014559511,0.00054935255,0.00011303777,0.00014740383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022810671,0.00022593117,0.00028106183,0.00054898445,0.00037014097,0.00014462047,0.00048409696,0.00008569346,0.000028673281],"category_scores_gemma":[0.000027492295,0.00020009739,0.00023823726,0.00084540556,0.00040073707,0.00022320016,0.00009032301,0.00014788273,0.0000046298856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018582818,0.00011100877,0.0015444524,0.000024920771,0.00005870753,0.0000011783692,0.00066893484,0.000044715758,0.002948781,0.97069526,0.0001162456,0.02376722],"study_design_scores_gemma":[0.0020731452,0.0019979104,0.052381985,0.00023664451,0.0001890259,0.00009782224,0.0010375987,0.019595731,0.0097317,0.9046546,0.0067689824,0.001234821],"about_ca_topic_score_codex":0.000010122937,"about_ca_topic_score_gemma":0.000006305783,"teacher_disagreement_score":0.74045545,"about_ca_system_score_codex":0.000004817429,"about_ca_system_score_gemma":0.000022805383,"threshold_uncertainty_score":0.81597346},"labels":[],"label_agreement":null},{"id":"W526827","doi":"10.1136/bmj.2.6203.1507","title":"On weight distributions of codes of planes of order 9.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Order (exchange); Business","score_opus":0.010940128916950304,"score_gpt":0.2132957907862825,"score_spread":0.20235566186933218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W526827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99094653,0.00019526824,0.0036911482,0.00012602677,0.0005815122,0.00007009694,0.0000311521,0.000037992584,0.004320257],"genre_scores_gemma":[0.99938387,0.000021881711,0.00055280584,0.000009359844,0.0000015785241,0.0000023092725,0.0000025605957,0.0000027071544,0.000022905842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934876,0.000053219537,0.00020408977,0.00012435,0.00016519359,0.00010440427],"domain_scores_gemma":[0.99910134,0.00023541135,0.00012976985,0.00039431234,0.0001087149,0.00003045015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013159018,0.00007162952,0.00017119553,0.00008566652,0.000038888546,0.000005413593,0.00044489125,0.00003733009,0.000058728252],"category_scores_gemma":[0.000053335112,0.00006484773,0.000067022134,0.00054263824,0.000111216825,0.00007695819,0.000068835616,0.000056687113,0.0000054398583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072721496,0.00028478977,0.0013719175,0.00001608926,0.000020721227,0.0000010091246,0.0001969343,0.000006466069,0.00074172305,0.9956464,0.0007690158,0.00093762996],"study_design_scores_gemma":[0.00044326804,0.00032874348,0.0024755916,0.000056228047,0.000010816465,0.0000019316612,0.000010671434,0.0007231836,0.038318906,0.95694894,0.0005919996,0.00008972949],"about_ca_topic_score_codex":0.000007468714,"about_ca_topic_score_gemma":7.008974e-7,"teacher_disagreement_score":0.0386975,"about_ca_system_score_codex":0.0000049606924,"about_ca_system_score_gemma":0.0000090961985,"threshold_uncertainty_score":0.26444137},"labels":[],"label_agreement":null},{"id":"W560384006","doi":"10.1007/s13389-015-0101-6","title":"Some new results on binary polynomial multiplication","year":2015,"lang":"en","type":"article","venue":"Journal of Cryptographic Engineering","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Multiplication (music); Mathematics; Finite field; Binary number; Multiplication algorithm; Polynomial; Logarithm; Binary operation; Field (mathematics); Algorithm; Strassen algorithm; Arithmetic; Discrete mathematics; Combinatorics; Matrix multiplication; Pure mathematics","score_opus":0.021652763300848785,"score_gpt":0.23424336271828586,"score_spread":0.21259059941743708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W560384006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27704817,0.0017022148,0.71261567,0.0040681735,0.0035737704,0.00016573779,0.0000028556121,0.00032044644,0.00050295953],"genre_scores_gemma":[0.9497874,0.000068971436,0.048868276,0.00017093093,0.001073749,0.0000015097688,5.8606395e-7,0.000015371008,0.000013221934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986817,0.00003978923,0.00047094942,0.00018131438,0.00039722293,0.0002289922],"domain_scores_gemma":[0.99870205,0.0001462088,0.00026848988,0.000392111,0.00012798769,0.0003631362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086300034,0.00015998355,0.00020880815,0.0008888774,0.000043335258,0.000101284604,0.00075315294,0.000075063086,8.270412e-7],"category_scores_gemma":[0.00021153649,0.00014308245,0.00021934563,0.00082903064,0.000025958789,0.0007262162,0.000070468006,0.0003300141,0.0000073228775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015426665,0.00059822854,0.00074187334,0.00005399159,0.00040286436,0.0002457787,0.003708559,0.17114192,0.046629068,0.67102665,0.050224595,0.05368378],"study_design_scores_gemma":[0.03439883,0.015798375,0.045566928,0.0018749145,0.00027197643,0.0016736132,0.0003410783,0.1779082,0.03434215,0.18962605,0.4939566,0.0042412854],"about_ca_topic_score_codex":0.0000027903263,"about_ca_topic_score_gemma":1.9714554e-7,"teacher_disagreement_score":0.6727392,"about_ca_system_score_codex":0.000033224456,"about_ca_system_score_gemma":0.00009393778,"threshold_uncertainty_score":0.58347327},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017081597093007328,"score_gpt":0.21419716338702652,"score_spread":0.1971155662940192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W639887749","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053694057,0.001591793,0.4543028,0.00014807643,0.0008977054,0.00026082795,0.000008502481,0.00009860898,0.542638],"genre_scores_gemma":[0.017116856,0.0008188655,0.018412516,0.0012032562,0.00033848212,0.000030651434,0.000016088925,0.000039432955,0.96202385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776715,0.00012568188,0.0006253272,0.0006421484,0.00041777355,0.00042193173],"domain_scores_gemma":[0.9969701,0.00084017834,0.00037109188,0.0014185187,0.00023107149,0.00016900866],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00038252524,0.00042891563,0.000620578,0.0003621998,0.0001354636,0.00017316024,0.0019249446,0.00053945306,0.006394196],"category_scores_gemma":[0.000047932896,0.00038223865,0.0005556946,0.0002899883,0.00032192995,0.00028798965,0.00068659795,0.0005133942,0.0011924685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012579144,0.00009408887,0.00004688996,0.0002253124,0.00015643929,0.0000107578335,0.0007507061,0.000032152002,0.000055201595,0.84696925,0.06977401,0.08187259],"study_design_scores_gemma":[0.00075343053,0.0011905087,0.000097359545,0.0028660253,0.00014397864,0.000011039988,0.00003059068,0.009725525,0.0031689792,0.5877333,0.39289197,0.0013872425],"about_ca_topic_score_codex":0.000041564217,"about_ca_topic_score_gemma":0.000009054381,"teacher_disagreement_score":0.4358903,"about_ca_system_score_codex":0.000020615036,"about_ca_system_score_gemma":0.0002821328,"threshold_uncertainty_score":0.99986297},"labels":[],"label_agreement":null},{"id":"W67599134","doi":"","title":"On the Quaternary Projection of Binary Linear Block Codes.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Quaternary; Binary number; Projection (relational algebra); Block (permutation group theory); Arithmetic; Combinatorics; Algorithm; Geology; Paleontology","score_opus":0.01500699985465057,"score_gpt":0.24732202664166197,"score_spread":0.2323150267870114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67599134","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930675,0.00004590328,0.0018552121,0.00034466418,0.001435904,0.00015600245,6.3490614e-7,0.00011821938,0.002975936],"genre_scores_gemma":[0.99931884,0.000007706508,0.00042742677,0.00016352379,0.000010283307,0.000005291267,5.3519506e-7,0.0000067736646,0.00005962813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990707,0.000091798596,0.00019348963,0.00020862496,0.00024147175,0.0001938838],"domain_scores_gemma":[0.99876684,0.0004895972,0.000100946585,0.0005342156,0.000066930785,0.000041485477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010440674,0.00010438968,0.00010943975,0.00012700396,0.00014074358,0.000024174267,0.00065568724,0.00005307812,0.0000075844687],"category_scores_gemma":[0.000058516976,0.0000752965,0.00008589134,0.0006077891,0.00007294803,0.000115694886,0.00013255983,0.00016157795,0.000026109365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043089633,0.00016259936,0.0008024414,0.0000055430305,0.000016656117,0.000009528768,0.00037229309,0.000011264791,0.0020320818,0.9943688,0.0006590398,0.0015166803],"study_design_scores_gemma":[0.00048363835,0.0008814396,0.0043681157,0.000060204682,0.000009357161,0.000014304731,0.00006873813,0.004824568,0.033148333,0.9544402,0.001503905,0.00019720955],"about_ca_topic_score_codex":0.000020021102,"about_ca_topic_score_gemma":0.0000013522032,"teacher_disagreement_score":0.039928596,"about_ca_system_score_codex":0.000018117255,"about_ca_system_score_gemma":0.00002441022,"threshold_uncertainty_score":0.30705023},"labels":[],"label_agreement":null},{"id":"W6910447097","doi":"10.4230/lipics.itcs.2025.93","title":"Polynomials, Divided Differences, and Codes","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Environment and Climate Change Canada; Israel Science Foundation; European Commission","keywords":"Multiplicity (mathematics); Decodes; Finite field; List decoding; Reed–Muller code; Decoding methods; Degree (music); Finite set; Linear code","score_opus":0.009595065195354174,"score_gpt":0.23929865331196112,"score_spread":0.22970358811660696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910447097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40395406,0.00030373858,0.5813714,0.0011646587,0.0013440446,0.0008722714,0.000183092,0.00045710284,0.010349608],"genre_scores_gemma":[0.9833385,0.000074557865,0.014481781,0.0015809304,0.000053337862,0.00007735491,0.00003207629,0.000011733789,0.00034977376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981861,0.000053152347,0.00068151526,0.00029057544,0.000241931,0.0005467027],"domain_scores_gemma":[0.99850285,0.00031307776,0.00020711805,0.0007095416,0.000118412114,0.00014899315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056984846,0.00031422882,0.00041041616,0.0003818655,0.00047130042,0.0006968969,0.0011887294,0.0001556218,0.00001130786],"category_scores_gemma":[0.00008727923,0.00027171857,0.0001801205,0.00048175632,0.00018826104,0.0010975901,0.0006938182,0.00025640192,0.000019863308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012146435,0.0002607015,0.039703418,0.0005738404,0.00029018003,0.0000030859558,0.005984576,0.000007081177,0.00013339674,0.8587711,0.0066064363,0.087544754],"study_design_scores_gemma":[0.01573507,0.0015141749,0.11107689,0.0017641592,0.00034245226,0.00013772237,0.0035776075,0.12545548,0.0055718725,0.33063436,0.40041733,0.003772899],"about_ca_topic_score_codex":0.000013065469,"about_ca_topic_score_gemma":0.000014152149,"teacher_disagreement_score":0.5793844,"about_ca_system_score_codex":0.00003642027,"about_ca_system_score_gemma":0.000065902386,"threshold_uncertainty_score":0.9999735},"labels":[],"label_agreement":null},{"id":"W6925137329","doi":"10.17605/osf.io/36pfh","title":"Systematic Review of Interventions for Trauma-Related Symptoms in Public Service Personnel","year":2023,"lang":"en","type":"article","venue":"OSF Preprints (OSF Preprints)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Psychological intervention; Public service; Service (business); Public health; Public sector; Context (archaeology)","score_opus":0.03268112356539941,"score_gpt":0.28244157595526054,"score_spread":0.24976045238986114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925137329","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31347892,0.00091239845,0.28468525,0.013370279,0.002877869,0.025715852,0.00012594604,0.003944451,0.35488904],"genre_scores_gemma":[0.9741026,0.0011107251,0.0029936873,0.00066772127,0.000024560717,0.002795052,0.000044595912,0.000060030558,0.018201001],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9960775,0.00085863983,0.0011583865,0.0011927406,0.00031106418,0.00040168414],"domain_scores_gemma":[0.99517626,0.0009322401,0.00044547388,0.0030627465,0.0002573385,0.0001259225],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.010511344,0.00021988909,0.00069143676,0.00053443364,0.00012666338,0.00010178793,0.0024913815,0.00011866009,0.013390841],"category_scores_gemma":[0.0030889944,0.00022663629,0.0006347606,0.0023161673,0.000061934705,0.0004604311,0.0011297836,0.00023238298,0.08594111],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003087063,0.0008551267,0.0014771576,0.6581693,0.0007395366,0.000017175977,0.009076002,0.00028289307,0.0005813004,0.318174,0.002378311,0.008218283],"study_design_scores_gemma":[0.004299297,0.000025478248,0.011000703,0.6993669,0.00095071574,0.00015636062,0.0022905627,0.074682176,0.0022928237,0.20048839,0.0022567096,0.0021898353],"about_ca_topic_score_codex":0.000025542748,"about_ca_topic_score_gemma":0.00003298865,"teacher_disagreement_score":0.6606237,"about_ca_system_score_codex":0.00007846717,"about_ca_system_score_gemma":0.00006904976,"threshold_uncertainty_score":0.98751104},"labels":[],"label_agreement":null},{"id":"W69266142","doi":"","title":"New Binary Sequences of Length 4p with Optimal Autocorrelation Magnitude.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Autocorrelation; Binary number; Magnitude (astronomy); Statistics; Arithmetic; Astrophysics; Physics","score_opus":0.01346012957703902,"score_gpt":0.2181718340643522,"score_spread":0.20471170448731318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69266142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96759915,0.00020083958,0.028662125,0.00016812631,0.0006391183,0.0001592363,6.449924e-7,0.0001925078,0.0023782614],"genre_scores_gemma":[0.9697002,0.000020433752,0.030059224,0.000030897376,0.000007304444,0.000007633619,0.0000014990676,0.0000075081953,0.00016525296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900734,0.0000697394,0.00018127792,0.0002674809,0.0002822804,0.00019188733],"domain_scores_gemma":[0.9992015,0.00009888025,0.00011722995,0.00040939427,0.00008145779,0.00009157648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017280699,0.00013264715,0.00016180046,0.00012544707,0.0001540251,0.000027985565,0.00059471396,0.000055267723,0.000030382922],"category_scores_gemma":[0.000012729448,0.00011421492,0.00006359681,0.0006089805,0.00010690374,0.00052944245,0.00011053334,0.00013118098,0.000021775253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037557056,0.000093416864,0.007779927,0.000007413967,0.000022560322,0.000040906663,0.0010130929,0.0004200901,0.00060904806,0.98542035,0.00075626664,0.0037994005],"study_design_scores_gemma":[0.0038714956,0.0042738123,0.08572692,0.0002083593,0.000060458693,0.00031822393,0.0001531833,0.013189307,0.01564047,0.8722585,0.0032308884,0.0010684216],"about_ca_topic_score_codex":0.000030493291,"about_ca_topic_score_gemma":9.329494e-7,"teacher_disagreement_score":0.113161854,"about_ca_system_score_codex":0.000016310412,"about_ca_system_score_gemma":0.00016045547,"threshold_uncertainty_score":0.46575493},"labels":[],"label_agreement":null},{"id":"W6931498520","doi":"10.5281/zenodo.4700946","title":"FIGURE 2 in Endogean beetles (Coleoptera) of Madagascar: deep soil sampling and illustrated overview","year":2021,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Sampling (signal processing); Hydrology (agriculture); Distance sampling; Vegetation (pathology); Exclosure","score_opus":0.05359348776241104,"score_gpt":0.2563982468288499,"score_spread":0.20280475906643883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931498520","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023941281,0.007914499,0.024695145,0.00028983413,0.00021983437,0.00062037754,0.0001782584,0.0010475544,0.96264035],"genre_scores_gemma":[0.76185423,0.022756448,0.034046452,0.0014433147,0.001415018,9.2954645e-7,0.00881113,0.025399193,0.1442733],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983517,0.00037783638,0.00024673456,0.0004966954,0.00025984258,0.00026719065],"domain_scores_gemma":[0.99900806,0.00003292469,0.00015991343,0.00054964697,0.00015025625,0.000099219],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004606726,0.00018415174,0.00026539437,0.00046969941,0.00029660127,0.0004374348,0.001117186,0.00016261017,0.0082095275],"category_scores_gemma":[0.00012355598,0.00020272343,0.00006554491,0.0008866004,0.00012614022,0.00010269578,0.0012369065,0.0003452895,0.00014821431],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007154797,0.0005316174,0.00006403706,0.0024196715,0.00036074134,0.00019248492,0.0038454859,0.00017562142,0.0050922045,0.20512465,0.1932799,0.58884203],"study_design_scores_gemma":[0.00039131337,0.000104561324,0.0005380425,0.0005802847,0.000011726381,0.00004999383,0.00010648602,0.00047343227,0.00014697122,0.000962074,0.9963783,0.00025679255],"about_ca_topic_score_codex":0.000055505927,"about_ca_topic_score_gemma":0.0000116066885,"teacher_disagreement_score":0.81836706,"about_ca_system_score_codex":0.000031360734,"about_ca_system_score_gemma":0.000005966777,"threshold_uncertainty_score":0.9926971},"labels":[],"label_agreement":null},{"id":"W6939190082","doi":"10.6084/m9.figshare.11998437.v1","title":"Additional file 6 of Transcriptome analysis of metabolic pathways associated with oil accumulation in developing seed kernels of Styrax tonkinensis, a woody biodiesel species","year":2020,"lang":"en","type":"dataset","venue":"Figshare","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Transcriptome; Metabolic pathway; Biodiesel; Primer (cosmetics); Pathway analysis; Bioenergy","score_opus":0.06436006396920159,"score_gpt":0.2475318861981247,"score_spread":0.1831718222289231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939190082","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033070264,0.00007000558,0.000024179133,0.00001400975,0.000014434807,0.00008608669,0.9996822,0.00002794064,0.000048079095],"genre_scores_gemma":[0.00071162597,0.000011817301,0.00082624087,0.00005252481,0.00001773493,0.00014081497,0.9982219,0.000007813399,0.000009567886],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980717,0.00015628996,0.0006042219,0.00041361913,0.0005487086,0.00020549452],"domain_scores_gemma":[0.9968164,0.0014061154,0.0008935832,0.00043600093,0.00039876864,0.000049154172],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009021778,0.0002676983,0.0009262956,0.0011050601,0.000039415685,0.00003454727,0.00086794095,0.00018368331,0.4754479],"category_scores_gemma":[0.0013722113,0.00025344206,0.00033745417,0.004728624,0.00003208191,0.00021416397,0.00016942465,0.00020625151,0.000029361221],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020087673,0.000073325195,0.0000073818787,0.00024996095,0.0009325207,0.000006320496,0.00020149755,0.00010738776,0.000024651326,0.00010196582,0.9981226,0.00015233822],"study_design_scores_gemma":[0.0003057899,0.000080070735,0.034925073,0.0048447545,0.00030861492,6.061403e-7,0.00003455962,0.0008918355,0.00024003122,0.00007218943,0.9579095,0.00038696616],"about_ca_topic_score_codex":0.000016914406,"about_ca_topic_score_gemma":0.00020996053,"teacher_disagreement_score":0.47541854,"about_ca_system_score_codex":0.00002587644,"about_ca_system_score_gemma":0.00029367738,"threshold_uncertainty_score":0.9999918},"labels":[],"label_agreement":null},{"id":"W6996107501","doi":"","title":"Reed-Solomon encoder VLST implementation","year":2015,"lang":"en","type":"dissertation","venue":"CSUN ScholarWorks (California State University, Northridge)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"International Development Research Centre","keywords":"Encoder; Block (permutation group theory); Scale (ratio); CMOS; Encoding (memory); Integrated circuit","score_opus":0.01113769750515896,"score_gpt":0.25292080124280547,"score_spread":0.2417831037376465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996107501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75631785,0.0019982771,0.17952645,0.00053233013,0.0059585846,0.0022028317,0.001778724,0.0021812753,0.049503658],"genre_scores_gemma":[0.95788944,0.0015414306,0.0116165215,0.00056900695,0.0004900388,0.00002149221,0.009834651,0.00023630264,0.017801097],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99583083,0.00046783863,0.00057458074,0.0012776189,0.000990296,0.00085884874],"domain_scores_gemma":[0.9966438,0.000112074835,0.0006511095,0.0012273429,0.0008244496,0.0005412223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011586819,0.0007008904,0.0006056064,0.0013988044,0.0008574014,0.00065828196,0.0024795872,0.00049791444,0.00020000283],"category_scores_gemma":[0.000046435787,0.00081615604,0.00043006387,0.002213635,0.000103306535,0.0017420923,0.00054939766,0.0013360452,0.00055507314],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002224415,0.00088500424,0.021562913,0.0005580528,0.0012249857,0.0014483846,0.016253365,0.0013867469,0.0006790699,0.047034092,0.045889203,0.8608538],"study_design_scores_gemma":[0.012439328,0.0022036682,0.025148349,0.0012777626,0.0012793462,0.0001229699,0.024799397,0.003445526,0.0027077612,0.12277076,0.79442203,0.009383086],"about_ca_topic_score_codex":0.00020621628,"about_ca_topic_score_gemma":0.002775059,"teacher_disagreement_score":0.85147065,"about_ca_system_score_codex":0.00038460875,"about_ca_system_score_gemma":0.00057952077,"threshold_uncertainty_score":0.9994289},"labels":[],"label_agreement":null},{"id":"W7023699737","doi":"","title":"Oral History Interview with Wayne Miller, August 8, 2001","year":2001,"lang":"en","type":"article","venue":"The Portal to Texas History (University of North Texas)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Navy; Submarine; German; Oral history; Crew; Miller; Albatross; George (robot)","score_opus":0.030837661817993536,"score_gpt":0.19676033237721277,"score_spread":0.16592267055921922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023699737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7876756,0.0029546462,0.092241645,0.0027629717,0.0015022311,0.000733335,0.000015725334,0.0006565905,0.11145723],"genre_scores_gemma":[0.93347955,0.00020047172,0.0067390422,0.0018815883,0.00006628545,0.0000010471907,0.000012145023,0.000035393536,0.057584498],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833727,0.00018280135,0.00019029199,0.0004884106,0.0003828598,0.00041836864],"domain_scores_gemma":[0.99824566,0.000058962934,0.00023125457,0.0010642217,0.00013750154,0.00026242284],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004968577,0.0002523122,0.0003481696,0.0003164162,0.00019148433,0.000009918281,0.0021999688,0.00005837694,0.0023888361],"category_scores_gemma":[0.000010636245,0.00023015267,0.00021944028,0.000568243,0.00048555952,0.00048138373,0.00043357228,0.00025851882,0.000237867],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005918993,0.00079057383,0.076440424,0.00010625153,0.00037792345,0.0012509888,0.005923789,0.00021971251,0.00002398768,0.038521405,0.80369896,0.0720541],"study_design_scores_gemma":[0.00041710565,0.00034537874,0.12427534,0.000039570416,0.000060324877,0.00006322273,0.00006928139,0.00013917255,0.0000018602562,0.00013354201,0.8741346,0.00032057878],"about_ca_topic_score_codex":0.00043174456,"about_ca_topic_score_gemma":0.0042226696,"teacher_disagreement_score":0.1458039,"about_ca_system_score_codex":0.0004579793,"about_ca_system_score_gemma":0.00022107449,"threshold_uncertainty_score":0.9985231},"labels":[],"label_agreement":null},{"id":"W7026976970","doi":"","title":"Balchem Corporation Reports Record Second Quarter Sales of $147.1 Million with Second Quarter Net Earnings of $16.5 Million and Adjusted Net Earnings of $20.5 Million","year":2017,"lang":"en","type":"other","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Earnings; Quarter (Canadian coin); Corporation; Net income; Net worth","score_opus":0.011450314561274,"score_gpt":0.21187969277097465,"score_spread":0.20042937820970066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7026976970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6891424,0.002110209,0.08819993,0.00024103708,0.001682604,0.0022287464,0.00016379023,0.00055836304,0.21567291],"genre_scores_gemma":[0.87805164,0.00023020267,0.012823312,0.00008913512,0.00019265017,0.000038029866,0.00033378805,0.00024086493,0.10800037],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967077,0.00026862498,0.0010109106,0.0010566278,0.0005643201,0.00039182295],"domain_scores_gemma":[0.99372387,0.00014646839,0.004112576,0.001536139,0.00032210303,0.00015883983],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008820514,0.00060582114,0.0011345377,0.0010117645,0.000120563294,0.00010650778,0.0006518444,0.00057217537,0.0012518441],"category_scores_gemma":[0.000035569796,0.000514162,0.00024994803,0.00051942555,0.0004636499,0.0005363983,0.00017343869,0.00038750385,0.000006668018],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012738424,0.00074310356,0.066500075,0.0052871113,0.0014357334,0.00017550527,0.008700522,0.000034518813,0.051875975,0.0059189647,0.82122797,0.036826685],"study_design_scores_gemma":[0.006532758,0.011160999,0.06837449,0.009881352,0.0007681098,0.0007945648,0.0014249432,0.002927391,0.050529934,0.006365911,0.83653826,0.004701281],"about_ca_topic_score_codex":0.00037259233,"about_ca_topic_score_gemma":0.0018359559,"teacher_disagreement_score":0.18890925,"about_ca_system_score_codex":0.000024452247,"about_ca_system_score_gemma":0.00011198843,"threshold_uncertainty_score":0.999731},"labels":[],"label_agreement":null},{"id":"W7027563031","doi":"","title":"Constructions of APN permutations","year":2021,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dimension (graph theory); Construct (python library); Block (permutation group theory); Differential (mechanical device); Permutation (music); Function (biology); Finite field","score_opus":0.009420094323796844,"score_gpt":0.210666094699641,"score_spread":0.20124600037584417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027563031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4559074,0.00065448286,0.08454327,0.00022178293,0.0038206233,0.0004639353,0.00019090153,0.0005494342,0.45364818],"genre_scores_gemma":[0.97752994,0.00016440522,0.0065257456,0.000038349015,0.000058151145,0.0000016721672,0.0005721404,0.000022594053,0.015087008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988911,0.000110324836,0.00018217361,0.00041754366,0.0002170003,0.00018183388],"domain_scores_gemma":[0.998729,0.00010831556,0.00020333531,0.00055583025,0.0003123619,0.000091170215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000690425,0.00019043255,0.00026301647,0.0007679935,0.00024046443,0.000055961427,0.00084009825,0.00020043092,0.00018012969],"category_scores_gemma":[0.000026137812,0.00024360654,0.00028820866,0.0018248648,0.00008879576,0.0003456451,0.00008823608,0.00026634888,0.000016444543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045776884,0.00017917006,0.01511195,0.00015913018,0.00028386438,0.0001737355,0.00040450096,0.000078864774,0.00006483985,0.959149,0.0033513994,0.020997781],"study_design_scores_gemma":[0.0033363604,0.00046978288,0.0077940337,0.0012696156,0.0012708736,2.4539077e-7,0.37359202,0.0012484541,0.0290115,0.0682758,0.5105604,0.0031709257],"about_ca_topic_score_codex":0.00004047572,"about_ca_topic_score_gemma":0.010743831,"teacher_disagreement_score":0.8908732,"about_ca_system_score_codex":0.00003979944,"about_ca_system_score_gemma":0.00028079384,"threshold_uncertainty_score":0.99339867},"labels":[],"label_agreement":null},{"id":"W70284720","doi":"","title":"K-dominating sets of P[2k+2]xP[n] and P[m]xP[n].","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.010486811885346777,"score_gpt":0.23344293085394574,"score_spread":0.22295611896859896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70284720","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9904334,0.00035393515,0.0022456476,0.00024866083,0.0007758798,0.0000942891,8.766405e-7,0.000111288326,0.0057360013],"genre_scores_gemma":[0.9969633,0.00006079043,0.002815995,0.00008715589,0.000005019998,0.000005777267,6.547884e-7,0.000007972999,0.000053289852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989668,0.00008848431,0.00021784654,0.00028846227,0.00019781472,0.00024056833],"domain_scores_gemma":[0.99905795,0.00021843203,0.00011143136,0.00044768993,0.00007440516,0.000090073176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048902805,0.00012911597,0.00019092087,0.00013220316,0.00013051958,0.00006557343,0.00053441135,0.000057302612,0.000015218625],"category_scores_gemma":[0.000069357346,0.00012805196,0.00006666668,0.00055694894,0.00009159725,0.00031742832,0.00027233164,0.00011835209,0.0000090070525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009629285,0.00006760217,0.00811339,0.000011865929,0.0000151817885,0.000014908362,0.00071520056,0.0000014532051,0.00096974405,0.9553386,0.00019717596,0.034545276],"study_design_scores_gemma":[0.0008123119,0.00018565678,0.010757964,0.00005995328,0.000010192024,0.00004033752,0.000080767204,0.0016335318,0.0027711194,0.9819343,0.0015021913,0.00021163639],"about_ca_topic_score_codex":0.000013297415,"about_ca_topic_score_gemma":0.0000015467253,"teacher_disagreement_score":0.03433364,"about_ca_system_score_codex":0.000010885867,"about_ca_system_score_gemma":0.000021920678,"threshold_uncertainty_score":0.5221808},"labels":[],"label_agreement":null},{"id":"W7036129718","doi":"","title":"AVANGRID : REPORTS THIRD QUARTER 2024 FINANCIAL RESULTS Form 8 K","year":2024,"lang":"en","type":"other","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Term (time); Payment; Financial management","score_opus":0.008436000869264009,"score_gpt":0.2259268784277057,"score_spread":0.21749087755844168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036129718","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001401126,0.0007249693,0.027696274,0.0006948687,0.0075638406,0.00018689134,0.000018996707,0.0012890915,0.96182364],"genre_scores_gemma":[0.00019623675,0.00003244451,0.0059438786,0.0004530589,0.0009565818,0.000022676075,0.000009000318,0.00011054961,0.9922756],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808526,0.000031370335,0.00037488763,0.0008750671,0.00030316884,0.00033024952],"domain_scores_gemma":[0.99838793,0.000033115157,0.00016474232,0.0012986206,0.000022770473,0.00009281452],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043570527,0.00030670478,0.0002811988,0.00044465755,0.000042066225,0.00026230613,0.000641841,0.00029768437,0.0006005255],"category_scores_gemma":[0.00003757901,0.00024178336,0.00027878172,0.00048351873,0.000046558023,0.00011423933,0.00030848893,0.0003442974,0.0019771776],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052853557,0.000017141141,0.0000016577109,0.000046956317,0.00002532628,0.0003600977,0.00019534849,5.3219203e-8,0.0000014182931,0.09976732,0.8965992,0.0029802455],"study_design_scores_gemma":[0.00007576251,0.000069783506,0.000007362079,0.00022403945,0.000015975342,0.00007161608,0.000005690658,0.000027999795,0.000017366092,0.118506625,0.88067365,0.00030415034],"about_ca_topic_score_codex":0.000050533374,"about_ca_topic_score_gemma":0.00019657286,"teacher_disagreement_score":0.030451907,"about_ca_system_score_codex":0.00001707791,"about_ca_system_score_gemma":0.00008945709,"threshold_uncertainty_score":0.9987999},"labels":[],"label_agreement":null},{"id":"W7066184690","doi":"","title":"The graph structure of Chebyshev polynomials over finite fields and applications","year":2019,"lang":"en","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Chebyshev polynomials; Finite field; Graph; Algebra over a field; Field (mathematics); Orthogonal polynomials","score_opus":0.010261419036127845,"score_gpt":0.22348653192962592,"score_spread":0.21322511289349808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7066184690","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60214645,0.0033358925,0.28024504,0.02175713,0.002658414,0.0027243902,0.0001414883,0.00088720256,0.08610399],"genre_scores_gemma":[0.9972191,0.0001132097,0.00219427,0.00016608128,0.00014885108,0.000053687723,0.000011045193,0.000012618434,0.000081133956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982314,0.00018901736,0.0003987565,0.00046412612,0.00036855508,0.00034815373],"domain_scores_gemma":[0.99801767,0.00057868485,0.0002606684,0.0008079405,0.00016856159,0.00016645993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038601187,0.00022084895,0.0002494663,0.00021884298,0.0005036121,0.00022049916,0.00094332354,0.00023167167,0.000016685332],"category_scores_gemma":[0.00010415279,0.00017225284,0.00014796207,0.00068194035,0.000032148702,0.00034030643,0.00031730137,0.000331679,0.0000031182649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038566428,0.00005687825,0.0007476783,0.00003191989,0.000058112426,0.0000024543212,0.00049147435,0.000050387986,0.00389874,0.989805,0.000111072666,0.004707749],"study_design_scores_gemma":[0.00074878713,0.00009292485,0.010787174,0.000055539516,0.000033767068,0.00017073445,0.0001413475,0.0008786702,0.0034826137,0.03839121,0.94483745,0.00037979436],"about_ca_topic_score_codex":5.856028e-7,"about_ca_topic_score_gemma":0.00003865222,"teacher_disagreement_score":0.95141375,"about_ca_system_score_codex":0.00004679048,"about_ca_system_score_gemma":0.00014733493,"threshold_uncertainty_score":0.7024267},"labels":[],"label_agreement":null},{"id":"W7097667488","doi":"","title":"Joint work with Jonathan Dixon Canadian Mathematical Society Winter Meeting 2008 Distance enumerators","year":2015,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hamming distance; Joint (building); Work (physics); Code (set theory); Hamming code; Word (group theory)","score_opus":0.019554664958432236,"score_gpt":0.2033176837151474,"score_spread":0.1837630187567152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097667488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056707148,0.00012417087,0.88030344,0.0026251373,0.00022518897,0.00017013423,0.0000019985057,0.00027892864,0.059563853],"genre_scores_gemma":[0.9395418,0.000001216755,0.059162002,0.000778929,0.000052215877,0.000010820558,8.3478136e-7,0.000010793738,0.00044138232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880534,0.00005171404,0.00016743869,0.00031146547,0.00026623014,0.00039782454],"domain_scores_gemma":[0.99892783,0.000046939917,0.000045341483,0.0004317563,0.00008207773,0.00046602776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000546061,0.00015237891,0.00015414684,0.0000577152,0.00015440921,0.00020183074,0.00047410803,0.000050695257,0.00006195922],"category_scores_gemma":[0.00002641528,0.00011056386,0.00010067622,0.00055352604,0.00009082079,0.00026398653,0.00009600874,0.0001480628,0.00009126629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029574729,0.00011010248,0.0113305235,0.000031587948,0.000110521,0.00006591107,0.012138396,0.000086212094,0.00004818589,0.9233541,0.044785403,0.007909512],"study_design_scores_gemma":[0.004603485,0.0015692967,0.009170687,0.0021360538,0.00014388662,0.00031299356,0.008238847,0.053690307,0.007266954,0.64292794,0.26425028,0.0056892526],"about_ca_topic_score_codex":0.0005457056,"about_ca_topic_score_gemma":0.0035348008,"teacher_disagreement_score":0.8828347,"about_ca_system_score_codex":0.00008007128,"about_ca_system_score_gemma":0.00015888484,"threshold_uncertainty_score":0.45086634},"labels":[],"label_agreement":null},{"id":"W7100628069","doi":"","title":"University of Alberta Customized Raptor Code Designs for Finite Lengths and Practical Settings","year":2016,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Permission; Code (set theory); Block (permutation group theory); Decoding methods; Extension (predicate logic); Raptor code","score_opus":0.02561581926195506,"score_gpt":0.24790652488437645,"score_spread":0.2222907056224214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100628069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013433797,0.00000617677,0.97960126,0.0051401663,0.000043794753,0.00012387798,0.0000038517787,0.000043968685,0.0016030915],"genre_scores_gemma":[0.81810814,0.000019987963,0.17994668,0.00021588862,0.000013619574,0.0000011632948,3.4190043e-7,0.000004316445,0.0016898742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994542,0.00007138929,0.000078419995,0.00020277085,0.00006325308,0.00012995182],"domain_scores_gemma":[0.9965431,0.0030715745,0.000059132853,0.0002099505,0.000053948836,0.00006230992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038202683,0.00006262794,0.00011285589,0.000051604227,0.0000828599,0.000017341128,0.00018497276,0.00003901618,0.00005397337],"category_scores_gemma":[0.00026513968,0.00004495301,0.00006103934,0.00009973887,0.0000932661,0.00029835736,0.00011134383,0.000027937775,0.0000072632747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004354634,0.00006762744,0.00029821022,0.000018754705,0.000046032557,0.000002988479,0.0007577013,7.5785306e-7,0.008068874,0.9631122,0.0064590373,0.020732366],"study_design_scores_gemma":[0.022236394,0.0016134828,0.0010768598,0.0002705353,0.00021569437,0.000062880295,0.0008071961,0.039234027,0.050488524,0.22265533,0.659974,0.0013650813],"about_ca_topic_score_codex":0.000014856408,"about_ca_topic_score_gemma":0.000021647735,"teacher_disagreement_score":0.8046743,"about_ca_system_score_codex":0.0000057143247,"about_ca_system_score_gemma":0.00003523622,"threshold_uncertainty_score":0.18331306},"labels":[],"label_agreement":null},{"id":"W7120289752","doi":"","title":"A family of error-correcting codes to eficient cryptosystems based on syndrome decoding.","year":2010,"lang":"pt","type":"dissertation","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cryptosystem; Hierarchy; Public key cryptosystem; Class (philosophy)","score_opus":0.0262533683709543,"score_gpt":0.2658196923045793,"score_spread":0.239566323933625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7120289752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7867467,0.00048115582,0.142455,0.004360366,0.014086598,0.0029344014,0.00028525578,0.0010244754,0.047626063],"genre_scores_gemma":[0.9900155,0.000020732889,0.008011093,0.0003859268,0.0003417582,0.0004905235,0.00033880904,0.00014224046,0.00025342338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9903458,0.0011521822,0.0021509726,0.0023745003,0.002417447,0.001559115],"domain_scores_gemma":[0.9919842,0.0013599934,0.0018228928,0.0021917098,0.00151329,0.001127911],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0027236566,0.0014259182,0.001677963,0.0028723276,0.0016179503,0.00079224,0.0031357843,0.001671661,0.00004667372],"category_scores_gemma":[0.0014306627,0.0014812738,0.0010357262,0.0034358762,0.000051321564,0.0005233931,0.00044609938,0.0023144633,0.0000519061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015640812,0.0025716787,0.00062178576,0.0012687405,0.0004226963,0.0005070116,0.010526941,0.004431319,0.028403604,0.9340383,0.00031457355,0.015329282],"study_design_scores_gemma":[0.007789868,0.0053113224,0.025234595,0.01662745,0.0012719169,0.0050155143,0.009889183,0.16484688,0.037785646,0.0019821275,0.7150257,0.009219802],"about_ca_topic_score_codex":0.000009018798,"about_ca_topic_score_gemma":0.00026569312,"teacher_disagreement_score":0.9320562,"about_ca_system_score_codex":0.00068136834,"about_ca_system_score_gemma":0.0016767671,"threshold_uncertainty_score":0.99998724},"labels":[],"label_agreement":null},{"id":"W71254070","doi":"","title":"Combinatorial properties of the divisibilty of mn by am + bn + c.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.016232122160847007,"score_gpt":0.1975913502918124,"score_spread":0.1813592281309654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71254070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914164,0.00081369345,0.00016393224,0.0003398372,0.004162976,0.0002186037,0.0000062840554,0.000083553125,0.0027947451],"genre_scores_gemma":[0.999747,0.00002014681,0.000062124156,0.00005045529,0.0000071685317,0.000009442273,4.054892e-7,0.000009234206,0.000094059564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998568,0.0001911657,0.000332488,0.00025972424,0.00041771756,0.00023089848],"domain_scores_gemma":[0.99857056,0.000086454755,0.000216837,0.00094280456,0.00012665277,0.000056691286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034611678,0.0001506618,0.00024932311,0.0000596365,0.00013840751,0.000039534734,0.0016276733,0.00007491543,0.00002305562],"category_scores_gemma":[0.00008874232,0.00010681144,0.00017866831,0.0007003061,0.00025587765,0.0002401556,0.00043862252,0.00015948497,0.000008442045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009274281,0.00036053173,0.001745008,0.000025376801,0.000029623521,4.8291093e-7,0.0007721251,0.0000012304134,0.008076813,0.98245966,0.0048600016,0.0016598409],"study_design_scores_gemma":[0.001211393,0.00030163722,0.0008171925,0.00010342215,0.000019764988,0.0000027717435,0.00003536645,0.00070317875,0.1912461,0.8014313,0.0038917358,0.00023613848],"about_ca_topic_score_codex":0.000017085444,"about_ca_topic_score_gemma":5.3929733e-7,"teacher_disagreement_score":0.18316929,"about_ca_system_score_codex":0.000016522168,"about_ca_system_score_gemma":0.000020417237,"threshold_uncertainty_score":0.43556443},"labels":[],"label_agreement":null},{"id":"W71375510","doi":"","title":"Application of Computer Algebra in List Decoding","year":2013,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Decoding methods; Algebra over a field; List decoding; Arithmetic; Mathematics; Algorithm; Pure mathematics","score_opus":0.04636306062092578,"score_gpt":0.2759508251952433,"score_spread":0.2295877645743175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W71375510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73574746,0.000019967429,0.26354024,0.000121488076,0.0001032002,0.00020720893,0.0000013813052,0.00011047964,0.0001485782],"genre_scores_gemma":[0.99753165,0.000008771795,0.0020825167,0.00019093382,0.00003593558,0.000002654451,0.0000035815676,0.000012022139,0.00013193228],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998471,0.00020300361,0.0002673336,0.0004939011,0.00023414574,0.00033059838],"domain_scores_gemma":[0.9987358,0.00013176548,0.0001812548,0.0006945863,0.000118951146,0.00013765371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034649257,0.00019368759,0.00024758006,0.0006904773,0.000104739214,0.00021826406,0.0015474474,0.000118864875,0.000014237214],"category_scores_gemma":[0.000009389902,0.00022220532,0.000116039904,0.0010968676,0.00008993262,0.002402934,0.00056199316,0.00028674642,0.00011790957],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010862601,0.00009049426,0.9679305,0.000027703069,0.000015934129,0.00001840373,0.00035373346,0.000041514602,0.0014274933,0.015037218,5.7052546e-7,0.015045581],"study_design_scores_gemma":[0.00061116705,0.00009507498,0.99043626,0.000098181525,0.000010355183,0.0000112687985,0.000046549463,0.00017639525,0.0023734577,0.005452997,0.0003865241,0.0003017467],"about_ca_topic_score_codex":0.000014788721,"about_ca_topic_score_gemma":0.00026766886,"teacher_disagreement_score":0.2617842,"about_ca_system_score_codex":0.00007082856,"about_ca_system_score_gemma":0.000032156848,"threshold_uncertainty_score":0.906127},"labels":[],"label_agreement":null},{"id":"W765697922","doi":"10.1007/s10623-015-0170-7","title":"Index bounds for character sums of polynomials over finite fields","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Character (mathematics); Mathematics; Finite field; Index (typography); Difference polynomials; Cyclotomic polynomial; Degree (music); Upper and lower bounds; Discrete mathematics; Macdonald polynomials; Pure mathematics; Combinatorics; Orthogonal polynomials; Algebra over a field; Polynomial; Mathematical analysis; Computer science; Geometry","score_opus":0.04693752892397369,"score_gpt":0.2710255018595483,"score_spread":0.22408797293557464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W765697922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15819941,0.0004928304,0.83968335,0.00018006808,0.00029635648,0.00025096096,0.000024577443,0.00008937656,0.00078308466],"genre_scores_gemma":[0.9841391,0.000055762306,0.015104445,0.00051730766,0.000092599286,0.000048436366,0.0000067060314,0.000012570222,0.00002310601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870515,0.00008907874,0.0003080856,0.0003654042,0.00020924454,0.0003230604],"domain_scores_gemma":[0.9987005,0.00036631737,0.00015218918,0.0004523402,0.000138994,0.00018966082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070258335,0.00020206322,0.0003155504,0.00038242154,0.00012623075,0.00017990208,0.0004929229,0.00013618857,0.0000128808415],"category_scores_gemma":[0.00004540113,0.00018065491,0.00024696573,0.0005972771,0.00016505785,0.00035751905,0.00011733281,0.00010479719,0.0000013635273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048628208,0.00022657281,0.04501018,0.000115004776,0.0002655711,0.000007026166,0.0029789659,0.000039132803,0.0042715915,0.89933634,0.006295042,0.040968318],"study_design_scores_gemma":[0.0058992845,0.0033202255,0.034957282,0.00019739546,0.00016183536,0.000028601586,0.00042201023,0.017608562,0.015700348,0.82396287,0.09601268,0.0017288969],"about_ca_topic_score_codex":0.000026795966,"about_ca_topic_score_gemma":0.0000091658585,"teacher_disagreement_score":0.82593966,"about_ca_system_score_codex":0.0000051881852,"about_ca_system_score_gemma":0.00004966472,"threshold_uncertainty_score":0.7366893},"labels":[],"label_agreement":null},{"id":"W813408335","doi":"","title":"Optimized Baby Step-Giant Step Methods","year":2005,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Group (periodic table); Homogeneous space; Interval (graph theory); Logarithm; Computation; Mathematics; Abelian group; Computer science; Mathematical optimization; Combinatorics; Geometry","score_opus":0.021671581640086698,"score_gpt":0.3057153022000379,"score_spread":0.2840437205599512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W813408335","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002784833,0.00014314138,0.9440819,0.0012224335,0.000236051,0.000087777225,4.320048e-7,0.00039392262,0.05355583],"genre_scores_gemma":[0.010067418,0.000012946621,0.9868247,0.0012593721,0.0000770972,0.000009592137,4.2743693e-7,0.0000067109227,0.0017417563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877506,0.00026812917,0.00019473972,0.0003323754,0.00015445653,0.000275223],"domain_scores_gemma":[0.9989116,0.00023243697,0.00004615307,0.000655718,0.000039913913,0.00011415407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010669016,0.00012862262,0.00016310683,0.00011977016,0.00011374663,0.00014879958,0.00089119363,0.00005049546,0.00044505944],"category_scores_gemma":[0.00002033482,0.00010350797,0.00013860043,0.00042638252,0.000040183928,0.00038917258,0.00025703342,0.00011240165,0.00014849746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010126832,0.000042992164,0.00000488346,0.0000018605508,0.000015473732,0.0000022726501,0.00012069393,0.00013168571,0.0006734923,0.4656915,0.0023548938,0.5309501],"study_design_scores_gemma":[0.0013854792,0.00015171352,0.00024629995,0.000016184798,0.000019065079,0.000033150915,0.00008131874,0.55305415,0.009066293,0.0189039,0.4164872,0.0005552588],"about_ca_topic_score_codex":0.0000071758395,"about_ca_topic_score_gemma":0.0000032660828,"teacher_disagreement_score":0.5529225,"about_ca_system_score_codex":0.000015141662,"about_ca_system_score_gemma":0.000023306859,"threshold_uncertainty_score":0.4873089},"labels":[],"label_agreement":null},{"id":"W81760815","doi":"","title":"A bit-serial word-parallel finite field multiplier using redundant basis in F 2 M","year":2007,"lang":"en","type":"article","venue":"Communication Systems and Networks","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Multiplier (economics); Computer science; Finite field; Basis (linear algebra); Word (group theory); Parallel architecture; Arithmetic; Bit (key); Architecture; Parallel computing; Word length; Algorithm; Mathematics; Discrete mathematics","score_opus":0.030023732731777882,"score_gpt":0.2716742679876745,"score_spread":0.24165053525589664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81760815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12667482,0.0045877923,0.86686206,0.00014741857,0.00041389998,0.0002160145,4.0648143e-7,0.00007435262,0.0010232697],"genre_scores_gemma":[0.98488903,0.00035126993,0.014481192,0.00013367613,0.00008954575,0.000011651468,0.0000021335904,0.0000067399124,0.000034757235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890363,0.00021710276,0.0003496572,0.00020629841,0.000093848554,0.0002294673],"domain_scores_gemma":[0.99819756,0.0006920368,0.00012994521,0.0008708333,0.00004087012,0.000068739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015109251,0.00010878301,0.000172422,0.00015765846,0.00022482741,0.00018350824,0.0006253908,0.00011684012,0.000003263506],"category_scores_gemma":[0.000030599513,0.000104931634,0.000044688168,0.0005197359,0.00004703956,0.00022277872,0.00032847995,0.00022159998,0.0000015221462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006386846,0.0004057064,0.03607842,0.000095525524,0.00013651338,0.000035097855,0.013034895,0.1407715,0.0006777215,0.5002974,0.0013166707,0.30651182],"study_design_scores_gemma":[0.00077025447,0.00004976307,0.005325925,0.00034390335,0.000007212439,0.00001974691,0.00034518904,0.98343277,0.000028174161,0.0016298394,0.0077637006,0.00028349287],"about_ca_topic_score_codex":0.00020153749,"about_ca_topic_score_gemma":0.00013786317,"teacher_disagreement_score":0.8582142,"about_ca_system_score_codex":0.000022088305,"about_ca_system_score_gemma":0.000013161134,"threshold_uncertainty_score":0.4278988},"labels":[],"label_agreement":null},{"id":"W81892204","doi":"10.4153/cmb-2004-056-7","title":"A Generalization of the Turán Theorem and Its Applications","year":2004,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Mathematical Society","keywords":"Mathematics; Generalization; Order (exchange); Context (archaeology); Function field; Field (mathematics); Pure mathematics; Function (biology); Algebra over a field; Mathematical analysis","score_opus":0.007399357207807976,"score_gpt":0.19276489342862435,"score_spread":0.18536553622081636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81892204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08255355,0.0004134008,0.8692971,0.02519315,0.00007549654,0.0007566858,0.000012821527,0.00008512706,0.021612667],"genre_scores_gemma":[0.994429,0.000004702268,0.0047737723,0.000640093,0.000016195807,0.000029212484,4.4320285e-7,0.000004391845,0.000102191865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995164,0.000030525982,0.00011692042,0.0001239093,0.00008317465,0.00012904657],"domain_scores_gemma":[0.99945396,0.000059482947,0.00003467758,0.0002841212,0.00003595787,0.00013181599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016997085,0.000059258393,0.00007232548,0.000052612213,0.000117181,0.000034742272,0.0003877815,0.00003459516,0.00018121485],"category_scores_gemma":[0.000068071575,0.00004241076,0.000038133054,0.0002481431,0.00006969773,0.00002289716,0.00005220475,0.00005131918,0.00014727861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.5950536e-7,0.000009318949,0.0000057887605,0.000016905411,0.000003056506,4.189987e-7,0.0002066329,0.000020389425,0.00013990996,0.9987037,0.00009820119,0.00079541025],"study_design_scores_gemma":[0.000106590334,0.000011263346,0.0001410608,0.00003800033,0.000006277489,0.000016073374,0.000016822789,0.00046709116,0.0014048069,0.9818424,0.01587255,0.000077046825],"about_ca_topic_score_codex":0.00005330206,"about_ca_topic_score_gemma":0.00010929444,"teacher_disagreement_score":0.9118754,"about_ca_system_score_codex":0.000020490397,"about_ca_system_score_gemma":0.00007239825,"threshold_uncertainty_score":0.19841756},"labels":[],"label_agreement":null},{"id":"W88187898","doi":"","title":"New Quasi-Cyclic Codes over GF(8) with Improved Minimum Distance.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Minimum distance; Arithmetic","score_opus":0.006523910088930377,"score_gpt":0.21579717158636735,"score_spread":0.20927326149743697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88187898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72651476,0.00038944397,0.26583248,0.00089220953,0.0021229282,0.00030403156,0.0000033243075,0.0005786843,0.0033621453],"genre_scores_gemma":[0.9907076,0.000013627024,0.0087822275,0.00024765093,0.000018597362,0.000013598671,0.000002113754,0.000018255925,0.00019636545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985874,0.0000468672,0.00020259923,0.00048362336,0.00027372048,0.0004057715],"domain_scores_gemma":[0.99871457,0.00009135191,0.00010550539,0.0008243418,0.00005098438,0.00021327964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018810523,0.0002304643,0.00023229816,0.00009833219,0.00018787323,0.00020615122,0.00094399706,0.000074275675,0.000022836726],"category_scores_gemma":[0.000019372368,0.00019743347,0.00010255409,0.00072419335,0.00008376325,0.000486719,0.00015370446,0.00018371589,0.00003120517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049877544,0.00015529543,0.00084521563,0.0000073695796,0.00003392978,0.00001808786,0.0005137363,0.000007177125,0.0009879827,0.99194485,0.00042089762,0.0050156037],"study_design_scores_gemma":[0.002431789,0.00059660827,0.0022678226,0.000057844143,0.00001567407,0.0000116785495,0.000030671243,0.00021108487,0.0037414692,0.9864553,0.003811903,0.00036812254],"about_ca_topic_score_codex":0.000088636254,"about_ca_topic_score_gemma":0.000051104475,"teacher_disagreement_score":0.26419282,"about_ca_system_score_codex":0.00006088688,"about_ca_system_score_gemma":0.0001547188,"threshold_uncertainty_score":0.80511034},"labels":[],"label_agreement":null},{"id":"W95819301","doi":"10.1007/3-540-44983-3_20","title":"Towards Practical Non-interactive Public Key Cryptosystems Using Non-maximal Imaginary Quadratic Orders (Extended Abstract)","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete logarithm; Prime (order theory); Cryptosystem; Factorization; Quadratic equation; Embedding; Discrete mathematics; Class (philosophy); Group (periodic table); Logarithm; Cyclic group; Mathematics; Computer science; Algebra over a field; Theoretical computer science; Pure mathematics; Combinatorics; Algorithm; Public-key cryptography; Cryptography; Encryption; Artificial intelligence","score_opus":0.026177758402865958,"score_gpt":0.28772726128539006,"score_spread":0.2615495028825241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95819301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007187383,0.00013251623,0.97292143,0.0016813547,0.003218564,0.00072773715,0.0000067040273,0.0002246537,0.020368295],"genre_scores_gemma":[0.6992788,0.000021184369,0.29894528,0.00095942896,0.00065533596,0.000018326471,0.0000065015083,0.00006848862,0.000046699057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931935,0.000118878284,0.0010195142,0.0025286078,0.0016845639,0.0014548996],"domain_scores_gemma":[0.99494654,0.0010196717,0.0007807819,0.0020825558,0.00067827274,0.00049215474],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001907264,0.0010725579,0.0010416374,0.0019015404,0.0006662861,0.0021429455,0.004007238,0.0005204907,0.000104633335],"category_scores_gemma":[0.00024227098,0.0010102335,0.0004186955,0.0016934903,0.0013177353,0.0032156974,0.0018481739,0.0020909496,0.00008670923],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022049207,0.00078990124,0.00018118718,0.0003832788,0.00030074382,0.0037310696,0.0068916604,0.010488888,0.002985363,0.16991983,0.00020341041,0.8039042],"study_design_scores_gemma":[0.0006507501,0.0005321614,0.00022301027,0.0009821252,0.000042704243,0.0013166462,0.0000055156247,0.67672294,0.00072268385,0.3150578,0.0020488515,0.0016948071],"about_ca_topic_score_codex":0.00013422607,"about_ca_topic_score_gemma":0.00007341025,"teacher_disagreement_score":0.8022094,"about_ca_system_score_codex":0.0006254784,"about_ca_system_score_gemma":0.0021284658,"threshold_uncertainty_score":0.9992348},"labels":[],"label_agreement":null}]}