{"meta":{"query_hash":"841f66641ad2","filters":{"venue":"Designs Codes and Cryptography"},"cohort_total":159,"direct_labels_cover":0,"predictions_cover":159,"exported":159,"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/841f66641ad2","api":"https://metacan.xera.ac/api/v1/cohort?venue=Designs+Codes+and+Cryptography"},"results":[{"id":"W117039097","doi":"10.1023/a:1011275205253","title":"$$(C_k \\oplus G,k,\\lambda )$$ Difference Families","year":2001,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Concordia University","funders":"National Research Council Canada; Beijing Institute For Brain Disorders; National Science Council","keywords":"Lambda; Mathematics; Combinatorics; Modulo; Physics; Quantum mechanics","score_opus":0.01434313926246763,"score_gpt":0.1962404041754294,"score_spread":0.18189726491296176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117039097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9301978,0.003382453,0.051467046,0.000015392281,0.00028684444,0.0001726362,0.000013865501,0.0004781323,0.013985865],"genre_scores_gemma":[0.99694103,0.0022957067,0.0005016647,0.00005425844,0.000066646746,0.000043136977,0.000006968334,0.000028810588,0.00006179848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990541,0.00005106719,0.00020657612,0.00021623421,0.00013415779,0.0003378797],"domain_scores_gemma":[0.9995082,0.00007377474,0.000024053337,0.00024046304,0.000025776502,0.00012774701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013585862,0.00023656621,0.00024858397,0.00024607257,0.00014728864,0.000089202964,0.00015100907,0.000099236866,0.000047040325],"category_scores_gemma":[0.0000046276755,0.00021093864,0.00011703166,0.00051511364,0.000121670775,0.000092316135,0.000018367864,0.0001319282,0.000015591033],"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.00025627448,0.00027523242,0.20706916,0.0008042072,0.0009900173,0.0002459415,0.0065015745,0.0019890151,0.16198875,0.43424776,0.005691437,0.17994064],"study_design_scores_gemma":[0.0057629733,0.0014269211,0.41621986,0.00096574094,0.0005438522,0.0008900027,0.01336746,0.03380084,0.020456214,0.2792646,0.22062522,0.0066763344],"about_ca_topic_score_codex":0.00002225363,"about_ca_topic_score_gemma":0.000024848714,"teacher_disagreement_score":0.21493378,"about_ca_system_score_codex":0.0000059520967,"about_ca_system_score_gemma":0.0000041200246,"threshold_uncertainty_score":0.86018276},"labels":[],"label_agreement":null},{"id":"W128047091","doi":"10.1007/s10623-015-0045-y","title":"Unreal $$BH(n,6)$$ B H ( n , 6 ) ’s and Hadamard matrices","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"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","funders":"Natural Sciences and Engineering Research Council of Canada; University of Warwick","keywords":"Hadamard transform; Hadamard matrix; Combinatorics; Order (exchange); Mathematics; Matrix (chemical analysis); Integer (computer science); Root of unity; Complex Hadamard matrix; Physics; Computer science; Chemistry; Mathematical analysis; Quantum mechanics","score_opus":0.02497924002193775,"score_gpt":0.20941996251118505,"score_spread":0.1844407224892473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128047091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9522865,0.014327983,0.019397983,0.000040101575,0.0004087235,0.00022720786,0.00002470153,0.00045794042,0.012828903],"genre_scores_gemma":[0.9979124,0.0006439687,0.0012758865,0.000038059552,0.00006485907,0.000020694828,0.000005073845,0.000022913786,0.000016112988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926883,0.000050992778,0.00015929979,0.00017158964,0.0001217038,0.0002275949],"domain_scores_gemma":[0.99953324,0.0000587289,0.000022755501,0.00013869542,0.000029755654,0.00021680996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027674803,0.00017436645,0.00020022239,0.00018708144,0.00007764312,0.000104701256,0.00008062599,0.000086046166,0.000008485213],"category_scores_gemma":[0.000006022511,0.00015489839,0.00005401614,0.00028472036,0.00009585499,0.00013223424,0.000019152641,0.000092326125,0.0000061057644],"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.00045235574,0.00022778173,0.20474316,0.0015314765,0.0014113788,0.0001901891,0.012754936,0.001886738,0.019058011,0.6039054,0.070605054,0.083233565],"study_design_scores_gemma":[0.009868149,0.002362487,0.07616283,0.0008290734,0.00087494566,0.00095289934,0.019207152,0.03087945,0.009980381,0.39617977,0.44664156,0.0060612843],"about_ca_topic_score_codex":0.000029656578,"about_ca_topic_score_gemma":0.000012905095,"teacher_disagreement_score":0.37603652,"about_ca_system_score_codex":0.0000048298,"about_ca_system_score_gemma":0.0000060287766,"threshold_uncertainty_score":0.6316573},"labels":[],"label_agreement":null},{"id":"W134742427","doi":"10.1023/a:1025729310932","title":"Construction of Symmetric Balanced Squares with Blocksize More than One","year":2003,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Correctness; Generalization; Combinatorics; Element (criminal law); Mathematics; Order (exchange); Square (algebra); Latin square; Computer science; Algorithm; Geometry; Mathematical analysis; Chemistry","score_opus":0.009850491808335369,"score_gpt":0.1851121763869151,"score_spread":0.17526168457857974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134742427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95932364,0.0018203281,0.03421866,0.000004378919,0.00009302946,0.00018666117,0.000015505506,0.0001294589,0.0042083496],"genre_scores_gemma":[0.99371856,0.00020085683,0.006012114,0.0000071109016,0.000012951476,0.000022282306,0.0000032796715,0.00001928441,0.0000035342355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929994,0.000053841326,0.00018048682,0.00014698751,0.00013329324,0.00018547666],"domain_scores_gemma":[0.9996111,0.00006320386,0.000047486414,0.00016432912,0.000044357934,0.00006955583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013688626,0.00015456618,0.00024669824,0.0003123445,0.00006392374,0.00002421483,0.000059198075,0.000069827154,0.000018926892],"category_scores_gemma":[0.0000070082096,0.00013195362,0.00006992273,0.00088444183,0.00016107157,0.00006708387,0.000003420081,0.000080387086,7.0975136e-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.00014236104,0.00013003059,0.15338795,0.0006693805,0.00071107334,0.000009730926,0.0009037863,0.0014374526,0.04070285,0.7959793,0.00011623866,0.00580982],"study_design_scores_gemma":[0.012768023,0.0040482217,0.22755757,0.0022103516,0.0014050386,0.0008405619,0.021305393,0.006690793,0.53478324,0.17477317,0.0085981805,0.0050194524],"about_ca_topic_score_codex":0.000009868483,"about_ca_topic_score_gemma":0.0000044887893,"teacher_disagreement_score":0.62120616,"about_ca_system_score_codex":0.000003867933,"about_ca_system_score_gemma":0.0000059153767,"threshold_uncertainty_score":0.53809124},"labels":[],"label_agreement":null},{"id":"W1430209699","doi":"10.1007/s10623-015-0110-6","title":"Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland","keywords":"Combinatorics; Mathematics; Lambda; Vertex (graph theory); Graph; Block (permutation group theory); Discrete mathematics; Physics","score_opus":0.029505932804844065,"score_gpt":0.22644484818791555,"score_spread":0.19693891538307148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1430209699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887506,0.0014977092,0.008330244,0.000009256023,0.00017413928,0.00025056585,0.000019120967,0.00012614463,0.00084222],"genre_scores_gemma":[0.99857014,0.0002375461,0.0010947026,0.000021536493,0.000016254591,0.000030124911,0.00000423763,0.000023385455,0.0000020753491],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9988963,0.0001243341,0.00033241074,0.00024068334,0.00013657444,0.00026968605],"domain_scores_gemma":[0.9994239,0.00008836664,0.00005642844,0.000206712,0.000060760234,0.0001638087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004014462,0.00021382587,0.00035479607,0.00043401337,0.00007226587,0.00003202198,0.00009386654,0.00011270336,0.0000031579348],"category_scores_gemma":[0.000015002861,0.00020650444,0.00009283017,0.00059376936,0.00016228136,0.00012021446,0.000028415545,0.00015547457,0.0000010422713],"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.00088122033,0.00060368143,0.25898156,0.0011694077,0.0008609715,0.00009886241,0.012766349,0.038379323,0.57307476,0.104536235,0.0021725683,0.0064750514],"study_design_scores_gemma":[0.013778277,0.0030617686,0.34001836,0.0022442727,0.000505235,0.0006877143,0.016609974,0.2517943,0.04200855,0.32243404,0.002694365,0.004163152],"about_ca_topic_score_codex":0.0001291982,"about_ca_topic_score_gemma":0.00013627634,"teacher_disagreement_score":0.53106624,"about_ca_system_score_codex":0.000012702881,"about_ca_system_score_gemma":0.0000096811655,"threshold_uncertainty_score":0.8421007},"labels":[],"label_agreement":null},{"id":"W1466287087","doi":"10.1007/s10623-015-0122-2","title":"Normal forms of hyperelliptic curves of genus 3","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Moduli space; Mathematics; Hyperelliptic curve; Genus; Degree (music); Isomorphism (crystallography); Projective line; Dimension (graph theory); Pure mathematics; Combinatorics; Ramification; Projective space","score_opus":0.06891871914007838,"score_gpt":0.28649168510801215,"score_spread":0.21757296596793377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1466287087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9696596,0.003127332,0.021221722,0.000023503979,0.00004815902,0.00015837178,0.00001881518,0.00002704065,0.005715456],"genre_scores_gemma":[0.99108547,0.0003555076,0.008443081,0.0000441329,0.000018148947,0.0000072213065,0.000004103208,0.000012954946,0.0000294059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991363,0.00005915709,0.0003041691,0.00012432729,0.00020800933,0.00016803548],"domain_scores_gemma":[0.9991588,0.00023443546,0.00016249761,0.00022018337,0.000118428536,0.00010566219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056937727,0.00012471211,0.0003182159,0.00014908885,0.000031973308,0.0000061165147,0.0001297318,0.00006596812,0.00005025856],"category_scores_gemma":[0.000100256155,0.00009850757,0.00012127677,0.00035215524,0.00020832756,0.000091054506,0.000038390193,0.00007079405,0.0000021810324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029428734,0.00055178197,0.027816052,0.0022691246,0.00039473624,0.000008448077,0.0022694608,0.0000051168445,0.0036376894,0.9529996,0.003965586,0.0057881065],"study_design_scores_gemma":[0.000947566,0.00063570094,0.001670756,0.00031598276,0.00020977337,0.000036065558,0.001593062,0.000047489208,0.021624973,0.97183645,0.0007958846,0.0002863046],"about_ca_topic_score_codex":0.000010175267,"about_ca_topic_score_gemma":0.0000020402024,"teacher_disagreement_score":0.026145296,"about_ca_system_score_codex":0.0000026009368,"about_ca_system_score_gemma":0.00002237322,"threshold_uncertainty_score":0.4017022},"labels":[],"label_agreement":null},{"id":"W1485965721","doi":"10.1023/a:1012504516447","title":"Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":148,"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; Crosslight Software (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Institute For Brain Disorders","keywords":"Visual cryptography; Computer science; Cryptography; Pixel; Computation; Theoretical computer science; Transparency (behavior); Integer (computer science); Algorithm; Steganography; Discrete mathematics; Mathematics; Image (mathematics); Secret sharing; Artificial intelligence; Computer security","score_opus":0.02859812944527219,"score_gpt":0.20674045132377347,"score_spread":0.1781423218785013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485965721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9522416,0.0029711556,0.037652247,0.000008819899,0.00017100215,0.00033332914,0.000065792476,0.0003267962,0.0062292647],"genre_scores_gemma":[0.99538535,0.00039184687,0.0040323674,0.000020669699,0.000057237656,0.00004090739,0.000006420953,0.000057679397,0.0000075105636],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984323,0.0000671717,0.00045034508,0.00035300638,0.00026206466,0.00043513175],"domain_scores_gemma":[0.9992217,0.000088925735,0.00007784411,0.00033620055,0.00010273373,0.00017259139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019245927,0.00039272849,0.0005376563,0.00060278777,0.00014280665,0.00008561933,0.0002057436,0.00017036236,0.00024891764],"category_scores_gemma":[0.0000038492167,0.00033360277,0.00020672772,0.0012896578,0.00040182588,0.0002224539,0.000020081641,0.00020346224,0.000004179958],"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.0006740026,0.00076084764,0.22061595,0.0021469407,0.0038240917,0.00010796846,0.0039236937,0.0015378942,0.3376184,0.3364967,0.001958239,0.09033525],"study_design_scores_gemma":[0.016486475,0.005853328,0.25067782,0.004348962,0.0017994669,0.0011501665,0.012711914,0.039955754,0.5392815,0.094364785,0.021351103,0.01201874],"about_ca_topic_score_codex":0.0000035424396,"about_ca_topic_score_gemma":0.000007012579,"teacher_disagreement_score":0.24213192,"about_ca_system_score_codex":0.0000055946257,"about_ca_system_score_gemma":0.0000050814206,"threshold_uncertainty_score":0.9999116},"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":"W1506026585","doi":"10.1023/a:1016549024113","title":"On the Security of the Digital Signature Algorithm","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","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 Toronto","funders":"","keywords":"Ephemeral key; Key (lock); Key size; Computer science; Upper and lower bounds; Digital signature; Theoretical computer science; Lattice reduction; Mathematics; Discrete mathematics; Algorithm; Public-key cryptography; Computer security; Encryption; Computer network; Channel (broadcasting); Hash function","score_opus":0.015309284858419923,"score_gpt":0.1986974840301912,"score_spread":0.18338819917177127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506026585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10061042,0.004766011,0.87554556,0.0035392179,0.00061607314,0.0010039733,0.00057164807,0.00027935317,0.013067728],"genre_scores_gemma":[0.995077,0.00017615674,0.0040493594,0.00064018695,0.000031609517,0.0000127999865,0.0000030610915,0.00000686866,0.000002958851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987404,0.000108041546,0.00019437037,0.00033986848,0.0003621575,0.00025516475],"domain_scores_gemma":[0.99855393,0.00037596453,0.00010888543,0.0008289295,0.000054903678,0.00007736521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021621252,0.00019149845,0.00016846159,0.00011196107,0.00034262933,0.0002872546,0.0010621236,0.0000919165,0.0000429981],"category_scores_gemma":[0.00003281839,0.00010234349,0.00025872793,0.0011485525,0.0003512545,0.0002854261,0.00022968459,0.0003043425,0.000004069637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005054101,0.00018823425,0.00068905955,0.000010912394,0.00004935967,0.0000032053329,0.0010322774,0.000002385842,0.00011035825,0.9525443,0.010031776,0.035333134],"study_design_scores_gemma":[0.0008018138,0.0005369643,0.0063062194,0.00012115464,0.000048458238,0.00004237737,0.0003546203,0.02886317,0.0030851287,0.9256269,0.03350898,0.000704226],"about_ca_topic_score_codex":0.000008030219,"about_ca_topic_score_gemma":0.0000030485783,"teacher_disagreement_score":0.8944666,"about_ca_system_score_codex":0.0000031701286,"about_ca_system_score_gemma":0.000007252676,"threshold_uncertainty_score":0.41734463},"labels":[],"label_agreement":null},{"id":"W1519765522","doi":"10.1023/a:1016567022721","title":"Packing Arrays and Packing Designs","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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 Toronto; Carleton University","funders":"","keywords":"Combinatorics; Alphabet; Mathematics; Disjoint sets; Row; Upper and lower bounds; Row and column spaces; Discrete mathematics; Computer science","score_opus":0.03282951747971311,"score_gpt":0.20017519738008152,"score_spread":0.16734567990036842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519765522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7482808,0.015847458,0.22099212,0.000043898384,0.00037554346,0.00041656173,0.000021998676,0.00079470477,0.013226871],"genre_scores_gemma":[0.99644667,0.0013123109,0.0020131152,0.000057872836,0.000080164835,0.000030050145,0.0000028774612,0.000043012566,0.000013927954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989138,0.0000756073,0.00023189087,0.00026364264,0.00013126456,0.00038375164],"domain_scores_gemma":[0.9994566,0.00011306862,0.000036593934,0.00020745858,0.00002306667,0.00016324819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024547963,0.00026350547,0.00027084432,0.00024457584,0.00023956357,0.00016563876,0.00009956591,0.000116261064,0.00007621388],"category_scores_gemma":[0.000007653486,0.00025053287,0.000098586046,0.00037840052,0.00012845368,0.00018069895,0.000018166345,0.00016402772,0.0000091225165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000968198,0.00029451642,0.11568318,0.0018769882,0.0016586118,0.00025126518,0.021060608,0.0029366119,0.26699117,0.3712916,0.012294255,0.20556436],"study_design_scores_gemma":[0.012652422,0.0028232867,0.058542736,0.003780248,0.001646584,0.0019575371,0.021826718,0.3123624,0.079555415,0.3350624,0.15510373,0.014686506],"about_ca_topic_score_codex":0.0000061288006,"about_ca_topic_score_gemma":0.0000057320003,"teacher_disagreement_score":0.30942577,"about_ca_system_score_codex":0.000006274687,"about_ca_system_score_gemma":0.0000014348285,"threshold_uncertainty_score":0.9999947},"labels":[],"label_agreement":null},{"id":"W1528227909","doi":"10.1023/a:1016501125022","title":"Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science","score_opus":0.014008493613757519,"score_gpt":0.20708942770020075,"score_spread":0.19308093408644322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528227909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7793036,0.004471489,0.20267588,0.00012870849,0.00062889466,0.0009930076,0.0005078057,0.00033262136,0.010958006],"genre_scores_gemma":[0.99518,0.00023561639,0.0042623063,0.00005002815,0.000053808242,0.0001564419,0.000022689317,0.00001764869,0.000021475858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994345,0.000020395919,0.00014767327,0.00015884596,0.00006629718,0.00017230111],"domain_scores_gemma":[0.9996316,0.0001171183,0.000027974444,0.00009828835,0.000040954223,0.000084052714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007285583,0.00015593934,0.00016955077,0.00014450903,0.00022738127,0.00008854033,0.000048492326,0.00006581727,0.00006753335],"category_scores_gemma":[0.0000032722555,0.00014978489,0.000087171094,0.00014277331,0.00014938535,0.00012941084,0.000008660815,0.00008626101,0.0000022308698],"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.0001266971,0.00027078678,0.014954384,0.0008336852,0.0022928857,0.000015769403,0.0052168234,0.0004563098,0.022845931,0.8969233,0.034129277,0.021934161],"study_design_scores_gemma":[0.010202778,0.0019677035,0.0147888325,0.0009072952,0.0009017036,0.00075400085,0.015227857,0.104797766,0.017625026,0.3779374,0.4511643,0.0037253248],"about_ca_topic_score_codex":0.0000024121623,"about_ca_topic_score_gemma":0.000007004144,"teacher_disagreement_score":0.51898587,"about_ca_system_score_codex":0.000007321083,"about_ca_system_score_gemma":0.0000023624734,"threshold_uncertainty_score":0.61080503},"labels":[],"label_agreement":null},{"id":"W1545406086","doi":"10.1023/a:1016506704066","title":"Partitioning Sets of Triples into Small Planes","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fano plane; Affine transformation; Combinatorics; Mathematics; Partition (number theory); Disjoint sets; Pure mathematics","score_opus":0.028945925164152182,"score_gpt":0.1936804898784044,"score_spread":0.1647345647142522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545406086","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9749242,0.0062104124,0.014205532,0.000012003873,0.00013725637,0.00012790623,0.0000172568,0.00019091135,0.004174522],"genre_scores_gemma":[0.99788094,0.0004902985,0.0015434843,0.000013380491,0.000023130717,0.000020271393,0.0000066059915,0.000014672013,0.000007234335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994254,0.000039883947,0.00019591031,0.00011236453,0.00006887343,0.00015758234],"domain_scores_gemma":[0.9997002,0.000066860455,0.00003099845,0.00012196081,0.00001794322,0.00006207172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011639463,0.00012358591,0.00018339441,0.00015869497,0.00008012181,0.000029560804,0.0000721855,0.00006212499,0.00007181671],"category_scores_gemma":[0.000004358242,0.00011584776,0.00007993699,0.00023784071,0.0000779676,0.000057867444,0.000007130524,0.000062486564,0.0000050510744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017548782,0.00051517464,0.15158054,0.004214505,0.0018030372,0.00009629691,0.028722886,0.011667743,0.18845364,0.46827123,0.012790026,0.13170943],"study_design_scores_gemma":[0.009333101,0.0027127818,0.0693756,0.0030688234,0.0010192489,0.00044589498,0.017141119,0.18093182,0.22246087,0.3809931,0.10571949,0.006798141],"about_ca_topic_score_codex":0.000014898447,"about_ca_topic_score_gemma":0.000019113148,"teacher_disagreement_score":0.1692641,"about_ca_system_score_codex":0.0000021818016,"about_ca_system_score_gemma":9.4541247e-7,"threshold_uncertainty_score":0.47241345},"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":"W157693631","doi":"10.1023/a:1016502619995","title":"A new bound on the number of designs with classical affine parameters","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Concordia University","funders":"","keywords":"Combinatorics; Hyperplane; Upper and lower bounds; Mathematics; Physics; Mathematical analysis","score_opus":0.031624451258734323,"score_gpt":0.20987776773415298,"score_spread":0.17825331647541864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157693631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.913912,0.0006281672,0.07038877,0.00015703806,0.000107891916,0.00034679016,0.000012463476,0.00017624484,0.014270631],"genre_scores_gemma":[0.9969314,0.00008942266,0.002747516,0.00007023105,0.000033280845,0.000027142236,0.0000013293003,0.000028589937,0.0000711424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914163,0.00008113622,0.00018699675,0.00017149838,0.00017212876,0.00024662446],"domain_scores_gemma":[0.9993147,0.00025267107,0.00003945085,0.00026209094,0.000019070882,0.00011200022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014476472,0.00020695842,0.00023668063,0.00009302012,0.00009729449,0.00006300136,0.00014111359,0.00007609268,0.00024542643],"category_scores_gemma":[0.0000057802995,0.00012896948,0.000113505674,0.00044153188,0.0001660594,0.000059808666,0.000007953371,0.00015249911,0.00001542673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004928671,0.00038545992,0.017989935,0.00031754907,0.0016472327,0.0000767158,0.004179535,0.0036538984,0.016583966,0.8707282,0.050653074,0.033291556],"study_design_scores_gemma":[0.023942234,0.013374634,0.05084658,0.005154068,0.0032245375,0.0021631054,0.01371626,0.11896183,0.17565209,0.41363806,0.1661687,0.0131579],"about_ca_topic_score_codex":0.000013012122,"about_ca_topic_score_gemma":0.000008060591,"teacher_disagreement_score":0.45709014,"about_ca_system_score_codex":0.000005062587,"about_ca_system_score_gemma":0.0000040982836,"threshold_uncertainty_score":0.5259223},"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":"W1606300424","doi":"10.1023/a:1016588722296","title":"The Existence of Four HMOLS with Equal Sized Holes","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; Suzhou University; University of New South Wales; University Research Committee, Emory University; Mount Saint Vincent University","keywords":"Prime power; Mathematics; Combinatorics; Prime (order theory); Discrete mathematics; Pure mathematics","score_opus":0.02939402757677752,"score_gpt":0.19118167629087704,"score_spread":0.1617876487140995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606300424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89123017,0.009604195,0.08599125,0.00004880746,0.0001627624,0.0004093009,0.000024207835,0.00025525104,0.012274046],"genre_scores_gemma":[0.9983801,0.00059332675,0.0009228857,0.000012637477,0.000021266855,0.000030439172,7.015161e-7,0.000016706887,0.000021928528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993082,0.000058678906,0.00017726925,0.00011723437,0.00013237455,0.00020622922],"domain_scores_gemma":[0.9994828,0.00017872074,0.000040896633,0.00020776471,0.000032485692,0.000057308473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019384557,0.00013905636,0.00017657723,0.00007139376,0.00014646327,0.000053366304,0.00014018684,0.00004594464,0.0000157651],"category_scores_gemma":[0.0000054657335,0.000086962296,0.00007670479,0.00031237022,0.00027015028,0.00006369154,0.000009071334,0.000081632286,0.0000026975185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029682717,0.0001448783,0.014728135,0.000603502,0.0010238448,0.000054449956,0.004255465,0.0017056635,0.05441069,0.8661114,0.002550985,0.05411419],"study_design_scores_gemma":[0.02098237,0.008367001,0.055794615,0.0038358162,0.0015904865,0.0012106951,0.031067794,0.117434226,0.12595902,0.4811092,0.14305234,0.009596431],"about_ca_topic_score_codex":0.0000039798606,"about_ca_topic_score_gemma":0.000008078755,"teacher_disagreement_score":0.38500217,"about_ca_system_score_codex":0.0000020144837,"about_ca_system_score_gemma":0.000001969788,"threshold_uncertainty_score":0.35462195},"labels":[],"label_agreement":null},{"id":"W1754939103","doi":"10.1023/a:1008354106356","title":"The State of Elliptic Curve Cryptography","year":2000,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":668,"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; Public-key cryptography; Multiplicative function; Mathematics; Modulo; Cryptosystem; Elliptic curve cryptography; Elliptic curve; Cryptography; Arithmetic; Key (lock); Diffie–Hellman key exchange; Prime (order theory); Discrete mathematics; Logarithm; Computer science; Pure mathematics; Algorithm; Combinatorics; Computer security; Key exchange; Encryption","score_opus":0.010677520357142905,"score_gpt":0.21868783298679312,"score_spread":0.20801031262965022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1754939103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46115187,0.018739482,0.51326007,0.00063356216,0.0003031685,0.0007051441,0.000027722022,0.000337496,0.004841458],"genre_scores_gemma":[0.95023865,0.011521136,0.03786011,0.00021366015,0.00003998049,0.000050410938,0.0000031334448,0.000024209257,0.000048702943],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780405,0.00021989094,0.00048027863,0.0005049793,0.00041949697,0.0005713096],"domain_scores_gemma":[0.99825525,0.00046472542,0.000145731,0.0008194829,0.000118955366,0.00019582766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006021254,0.00029826604,0.00032219797,0.00038090337,0.00060838816,0.0003315289,0.0009891054,0.00007515667,0.00003673139],"category_scores_gemma":[0.000010712456,0.00020323008,0.00038190416,0.0020932453,0.0007393414,0.00030436914,0.00009236912,0.00021859647,0.000011271137],"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.000104167746,0.00025485863,0.007782164,0.00006424931,0.00034906258,0.000022074868,0.0015092104,0.00019523359,0.0018123345,0.2916914,0.0009121015,0.69530314],"study_design_scores_gemma":[0.0023639014,0.001675181,0.10760177,0.00021939064,0.00018388405,0.00012514909,0.00031460187,0.01184244,0.009489758,0.77942276,0.08497875,0.0017824392],"about_ca_topic_score_codex":0.00006571151,"about_ca_topic_score_gemma":0.000026816888,"teacher_disagreement_score":0.6935207,"about_ca_system_score_codex":0.000003683677,"about_ca_system_score_gemma":0.000033081255,"threshold_uncertainty_score":0.8287482},"labels":[],"label_agreement":null},{"id":"W1762828224","doi":"10.1007/s10623-015-0157-4","title":"Quantum cryptography beyond quantum key distribution","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":216,"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; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Quantum cryptography; Quantum network; Quantum key distribution; Quantum algorithm; Quantum computer; Quantum technology; Quantum information; Quantum capacity; Open quantum system","score_opus":0.030899767848802405,"score_gpt":0.24691661816796875,"score_spread":0.21601685031916634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1762828224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052367017,0.001806634,0.93945575,0.0007777028,0.0006611875,0.00040650662,0.00007424585,0.00073140924,0.0037195275],"genre_scores_gemma":[0.96952087,0.00056824135,0.02830597,0.0011901233,0.00010897368,0.00009499429,0.00017317949,0.00003191652,0.0000057546663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996617,0.00022649376,0.0007302206,0.00073185697,0.00085013005,0.000844254],"domain_scores_gemma":[0.9973896,0.00013578829,0.0003068904,0.00090779987,0.00043907377,0.0008208374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001007178,0.00053325034,0.0004982657,0.00082057127,0.0005025407,0.0008634519,0.0010146587,0.00024072932,0.000022618911],"category_scores_gemma":[0.000055739223,0.00048388046,0.00042620505,0.003015155,0.0004164125,0.0016653854,0.0002442948,0.00034526674,0.000071384835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046554804,0.00014556259,0.0041704588,0.000029779028,0.00008152665,0.000012145137,0.0010832234,0.000019817797,0.0002249414,0.96987766,0.017519383,0.006788966],"study_design_scores_gemma":[0.003155467,0.001451605,0.012620947,0.00009279861,0.000104840736,0.00016161393,0.0019268651,0.07148527,0.0012765978,0.70925754,0.19649452,0.0019718993],"about_ca_topic_score_codex":0.00006147417,"about_ca_topic_score_gemma":0.000008865544,"teacher_disagreement_score":0.91715384,"about_ca_system_score_codex":0.000027536524,"about_ca_system_score_gemma":0.00011286188,"threshold_uncertainty_score":0.9997613},"labels":[],"label_agreement":null},{"id":"W1763766134","doi":"10.1023/a:1016550519087","title":"Modular Arithmetic on Elements of Small Norm in Quadratic Fields","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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 Calgary; University of Manitoba","funders":"","keywords":"Modulo; Integer (computer science); Mathematics; Logarithm; Riemann hypothesis; Diophantine approximation; Discrete mathematics; Norm (philosophy); Primitive root modulo n; Diophantine equation; Pure mathematics; Combinatorics; Computer science; Mathematical analysis","score_opus":0.06308024945839212,"score_gpt":0.26672499561082896,"score_spread":0.20364474615243683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763766134","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9674517,0.0003237245,0.02504896,0.000060987066,0.00003534604,0.00023075573,0.0000060255275,0.000027195483,0.006815291],"genre_scores_gemma":[0.98788744,0.000099912,0.011757888,0.000111729925,0.00001632203,0.000019646972,0.0000017706961,0.000013369819,0.00009190411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989986,0.0000946906,0.00033932776,0.00019732326,0.00015268252,0.00021737587],"domain_scores_gemma":[0.99922526,0.0003425331,0.00009998328,0.00024647437,0.000026315733,0.00005946193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035515637,0.0001537649,0.0002749368,0.00030495346,0.000051346058,0.000016969097,0.00012413347,0.00009570835,0.00038111873],"category_scores_gemma":[0.000070374364,0.00013620271,0.000095599506,0.00043078442,0.0000796792,0.00004107065,0.000023678733,0.0001447685,0.000010125803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020972709,0.0029590973,0.03410935,0.0010469434,0.00041977485,0.00007321684,0.005412239,0.00007856616,0.0022938803,0.91610837,0.0013390604,0.035949748],"study_design_scores_gemma":[0.0013365292,0.0007700448,0.0046781497,0.0002191423,0.000081080936,0.000009173651,0.0006418069,0.0029083204,0.0033726627,0.98524976,0.00035021783,0.0003831082],"about_ca_topic_score_codex":0.000014121051,"about_ca_topic_score_gemma":0.000021919292,"teacher_disagreement_score":0.069141366,"about_ca_system_score_codex":0.0000054991297,"about_ca_system_score_gemma":0.0000030711208,"threshold_uncertainty_score":0.5554185},"labels":[],"label_agreement":null},{"id":"W1809742378","doi":"10.1023/a:1008312401197","title":"Analysis of the Xedni Calculus Attack","year":2000,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":65,"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; Elliptic curve; Logarithm; Discrete logarithm; Finite field; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.01767769015688338,"score_gpt":0.24122421574292593,"score_spread":0.22354652558604254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809742378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7532316,0.0018536045,0.23975219,0.00046670978,0.0001118168,0.00024056622,0.000020600604,0.000104127335,0.004218783],"genre_scores_gemma":[0.992092,0.00037616008,0.0072045913,0.00025790435,0.00001307971,0.00000966304,0.000001829996,0.000005706401,0.000039039194],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99875605,0.00012595834,0.00025025246,0.00034039633,0.00027207338,0.00025525637],"domain_scores_gemma":[0.9989992,0.00010907782,0.00007731236,0.00066978676,0.000053000935,0.00009167018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002206359,0.00015453158,0.00028400365,0.00042901622,0.00023432057,0.000099908546,0.00069000054,0.00006976848,0.00010744632],"category_scores_gemma":[0.000005351608,0.000100492194,0.0005162055,0.004696368,0.0002831941,0.00013697827,0.000082735554,0.00010756124,0.0000028115805],"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.0000714583,0.00067500107,0.2351714,0.000086012995,0.005016072,0.000026468751,0.0043555093,0.0049116733,0.0035632143,0.35455015,0.0021276125,0.38944542],"study_design_scores_gemma":[0.0009009444,0.0002891534,0.88699025,0.00006368266,0.0017294097,0.000024384502,0.00016263366,0.07780282,0.0031372898,0.009822682,0.01829905,0.0007776933],"about_ca_topic_score_codex":0.00008858378,"about_ca_topic_score_gemma":0.000050775772,"teacher_disagreement_score":0.6518189,"about_ca_system_score_codex":0.0000031161458,"about_ca_system_score_gemma":0.000017904262,"threshold_uncertainty_score":0.40979528},"labels":[],"label_agreement":null},{"id":"W1878001422","doi":"10.1007/s10623-015-0162-7","title":"On generalized Howell designs with block size three","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Toronto Metropolitan University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland","keywords":"Combinatorics; Mathematics; Permutation (music); Lambda; Block (permutation group theory); Steiner system; Column (typography); Constant (computer programming); Discrete mathematics; Connection (principal bundle); Geometry; Physics; Computer science","score_opus":0.029166425862312675,"score_gpt":0.2086252813018232,"score_spread":0.1794588554395105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878001422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92668325,0.0014945656,0.062276997,0.000027125212,0.00023534212,0.0004065255,0.000018932398,0.00050794816,0.008349312],"genre_scores_gemma":[0.9958812,0.000069011956,0.0037168763,0.0001049371,0.00007142192,0.00006509907,0.0000048046904,0.000055880897,0.00003077677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988338,0.00008524789,0.00020071039,0.0002749386,0.00023686279,0.0003684478],"domain_scores_gemma":[0.9991542,0.0001509242,0.000038441267,0.00032135413,0.000056191886,0.00027888498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029805832,0.00031357296,0.0003140718,0.00016984454,0.00010850758,0.000102447535,0.0001594536,0.00011586394,0.00002617433],"category_scores_gemma":[0.000011386464,0.0002437208,0.000103142935,0.0004457016,0.00011640404,0.000095332645,0.000012672058,0.00015382531,0.0000185521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002954929,0.00065609365,0.03487961,0.0006413787,0.0026063032,0.00041429728,0.0050762678,0.07131799,0.054565,0.76988184,0.04864618,0.00836013],"study_design_scores_gemma":[0.033015758,0.013438045,0.022222253,0.0015681746,0.0014881284,0.0009248362,0.0046982146,0.0506482,0.06433235,0.72239804,0.07454549,0.010720487],"about_ca_topic_score_codex":0.000019459672,"about_ca_topic_score_gemma":0.000038622406,"teacher_disagreement_score":0.06919794,"about_ca_system_score_codex":0.000011700049,"about_ca_system_score_gemma":0.0000139673975,"threshold_uncertainty_score":0.99386454},"labels":[],"label_agreement":null},{"id":"W1899294640","doi":"10.1007/s10623-015-0123-1","title":"A Latin square autotopism secret sharing scheme","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Dalhousie University","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Latin square; Secret sharing; Scheme (mathematics); Initialization; Computer science; Square (algebra); Theoretical computer science; Shamir's Secret Sharing; Homomorphic secret sharing; Algorithm; Mathematics; Cryptography","score_opus":0.0431490186133615,"score_gpt":0.22567523647646529,"score_spread":0.1825262178631038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899294640","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9570018,0.0022503796,0.029221019,0.00001918334,0.00028463802,0.00024298897,0.000017328242,0.0006675622,0.010295081],"genre_scores_gemma":[0.9967591,0.000045862438,0.0029438818,0.000037880407,0.00007922247,0.000047180933,0.0000120875275,0.000033264394,0.000041486062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913204,0.000032344375,0.00019708775,0.00021333086,0.00014361518,0.0002815734],"domain_scores_gemma":[0.9994652,0.000028488865,0.000025997686,0.00023408969,0.000037494035,0.00020871291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027217125,0.00019478342,0.00021176605,0.00018234104,0.00008378124,0.00010303115,0.00014061062,0.00010504279,0.00003038098],"category_scores_gemma":[0.000008420382,0.00018519179,0.00009452534,0.00035939025,0.000057263565,0.00012415826,0.000029545938,0.0001391178,0.00001569607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110742345,0.00011557356,0.23648147,0.00085635995,0.00061852456,0.00009739793,0.0111778,0.0029828574,0.027277203,0.7030614,0.008663964,0.008556684],"study_design_scores_gemma":[0.008345997,0.0013051586,0.056912895,0.0013887295,0.0003294696,0.00022230673,0.014918789,0.28446206,0.0155565655,0.44887266,0.16197929,0.0057060905],"about_ca_topic_score_codex":0.000020221802,"about_ca_topic_score_gemma":0.000008864843,"teacher_disagreement_score":0.2814792,"about_ca_system_score_codex":0.000009388784,"about_ca_system_score_gemma":0.000006997053,"threshold_uncertainty_score":0.7551902},"labels":[],"label_agreement":null},{"id":"W1927099252","doi":"10.1023/a:1022595222606","title":"An Efficient Protocol for Authenticated Key Agreement","year":2003,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":513,"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 Security Agency","keywords":"Key (lock); Protocol (science); Standardization; Computer science; Computer security; Operating system; Medicine","score_opus":0.04136267479298559,"score_gpt":0.3335327797335682,"score_spread":0.2921701049405826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927099252","genre_codex":"methods","genre_gemma":"protocol","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.0005156097,0.000006185318,0.83224654,0.000053019834,0.000028604098,0.16671878,0.0000048435822,0.00013569357,0.00029075117],"genre_scores_gemma":[0.15762553,4.496593e-7,0.30978653,0.00012312447,0.000010314195,0.53242993,0.0000027794244,0.000012077871,0.000009271094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984082,0.00014350479,0.00029309164,0.0005565315,0.00023381528,0.00036483616],"domain_scores_gemma":[0.9988048,0.00007664044,0.00013440383,0.0006312128,0.00015978918,0.00019316463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005020868,0.00019920117,0.00017143214,0.00016547956,0.00029256108,0.00023250203,0.0004536603,0.000059824066,0.00002779887],"category_scores_gemma":[0.000030737156,0.00017445169,0.00009328618,0.0004799923,0.00010745109,0.00021975185,0.000041275016,0.000072833674,0.000006341242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023698076,0.00045666102,0.00034933272,0.000056855104,0.0000178022,0.0000010040349,0.0007231063,0.000099934885,0.002517817,0.9910707,0.00004580934,0.004637304],"study_design_scores_gemma":[0.0043447763,0.0014687324,0.0015641548,0.000085720145,0.00002976212,0.000016082997,0.00017411515,0.17290074,0.04179049,0.7316949,0.045013066,0.00091750786],"about_ca_topic_score_codex":0.0000016289531,"about_ca_topic_score_gemma":0.0000011770385,"teacher_disagreement_score":0.52246,"about_ca_system_score_codex":0.0000137387415,"about_ca_system_score_gemma":0.000040567797,"threshold_uncertainty_score":0.71139336},"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":"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":"W1971435733","doi":"10.1007/s10623-004-4851-x","title":"Distance Regular Covers of Complete Graphs from Latin Squares","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Finite Group Theory Research","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Combinatorics; Latin square; Mathematics; Order (exchange); Strongly regular graph; Graph; Discrete mathematics; Graph power; Line graph","score_opus":0.08499397780819595,"score_gpt":0.3068153643344252,"score_spread":0.22182138652622924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971435733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9031387,0.0011841505,0.09199681,0.00013981451,0.00003229887,0.00035861187,0.00034787602,0.00009199848,0.002709724],"genre_scores_gemma":[0.94469565,0.00015819562,0.054942746,0.00005845119,0.000035743695,0.000019254852,0.000025980338,0.000029796136,0.000034193334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849504,0.00018473114,0.00034952527,0.0002976719,0.0003673519,0.00030566173],"domain_scores_gemma":[0.998184,0.001027178,0.00014359846,0.0004400915,0.000092811504,0.000112322916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000408911,0.00019623307,0.00036880685,0.00030339923,0.000125987,0.000049672646,0.00024704912,0.000087297194,0.00019236594],"category_scores_gemma":[0.00008743138,0.00017731232,0.0001737097,0.0005873283,0.00042823635,0.000113499285,0.000056397814,0.00015197229,0.000006121023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023601465,0.00016559791,0.011990367,0.000098437304,0.00016576858,0.000006018485,0.0009984303,0.000012910173,0.021074384,0.9598212,0.0021069057,0.0033239275],"study_design_scores_gemma":[0.0010398029,0.0002240157,0.004956397,0.00013091245,0.000071895185,0.0000020742,0.0006498,0.0009432371,0.0057820254,0.97702456,0.008841887,0.0003334029],"about_ca_topic_score_codex":0.000057809153,"about_ca_topic_score_gemma":0.00007256412,"teacher_disagreement_score":0.04155693,"about_ca_system_score_codex":0.000009991187,"about_ca_system_score_gemma":0.000013868502,"threshold_uncertainty_score":0.7230587},"labels":[],"label_agreement":null},{"id":"W1971749321","doi":"10.1007/s10623-006-0008-4","title":"The Existence of (ν,6, λ)-Perfect Mendelsohn Designs with λ > 1","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Mount Saint Vincent University","funders":"","keywords":"Mathematics; Combinatorics; Physics; Arithmetic; Discrete mathematics","score_opus":0.010746906289025781,"score_gpt":0.183547787819434,"score_spread":0.17280088153040823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971749321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80638397,0.00917135,0.15800601,0.00002611826,0.00018829152,0.00052533246,0.000027421036,0.00033856623,0.025332961],"genre_scores_gemma":[0.99794316,0.00026402174,0.0016408733,0.000008586731,0.000037874735,0.000051051582,0.0000035289302,0.000027211643,0.000023675842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902207,0.00008386722,0.00024772,0.0001733008,0.00017600133,0.00029705488],"domain_scores_gemma":[0.999376,0.00019526937,0.000054524102,0.00026866156,0.00004792179,0.00005764641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003420306,0.00019965209,0.00022216648,0.00011298484,0.00022247514,0.00006807116,0.0001736564,0.000063853324,0.000008089386],"category_scores_gemma":[0.0000029221537,0.00013009753,0.000099541416,0.00044673396,0.00027080445,0.00008510246,0.000011083267,0.00009875406,0.0000017922891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024358726,0.00010410406,0.014266139,0.00030399064,0.0004572148,0.000025576486,0.00068310683,0.004731421,0.10629303,0.86342394,0.002276541,0.007191348],"study_design_scores_gemma":[0.006933566,0.0046448465,0.06744597,0.0014717458,0.0010917404,0.0005963865,0.00715062,0.027487125,0.28557873,0.5233979,0.06882425,0.0053771217],"about_ca_topic_score_codex":0.00003844098,"about_ca_topic_score_gemma":0.000055552835,"teacher_disagreement_score":0.34002602,"about_ca_system_score_codex":0.0000054565635,"about_ca_system_score_gemma":0.000008065892,"threshold_uncertainty_score":0.53052235},"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":"W1974271501","doi":"10.1007/s10623-012-9684-4","title":"Constructions for retransmission permutation arrays","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Retransmission; Permutation (music); Computer science; Simple (philosophy); Class (philosophy); Connection (principal bundle); Channel (broadcasting); Partial permutation; Algorithm; Mathematics; Permutation matrix; Physics; Computer network; Transmission (telecommunications); Telecommunications; Artificial intelligence","score_opus":0.018799110953715312,"score_gpt":0.2375980290679508,"score_spread":0.2187989181142355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974271501","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.009979912,0.0010034181,0.9872044,0.0000094257475,0.00023426974,0.0002749827,0.000019460233,0.00020382408,0.0010703371],"genre_scores_gemma":[0.81209964,0.00017431797,0.18751305,0.0000091387365,0.00008202706,0.000066552515,0.000029188308,0.000021103368,0.000004948582],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995514,0.000012089463,0.00012886297,0.0000846373,0.00004417091,0.0001788431],"domain_scores_gemma":[0.9997418,0.000044856675,0.000021048185,0.00007350339,0.00003632208,0.00008248399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008115972,0.00009792379,0.00009859842,0.00011194362,0.000117658376,0.000020897767,0.000025445892,0.00006298745,0.000011334308],"category_scores_gemma":[0.0000069204434,0.00009657923,0.00004822615,0.00017097789,0.00003429892,0.00023251625,0.000002092709,0.000043885724,0.0000012056413],"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.000129181,0.00016952708,0.029204985,0.0014623768,0.00043726843,0.0000012694327,0.0080060335,0.19138311,0.3909256,0.20902775,0.0057254513,0.16352746],"study_design_scores_gemma":[0.0065800515,0.00065695314,0.01115549,0.00065072754,0.0007170989,0.00029371702,0.008431987,0.6977025,0.11697875,0.044583883,0.10844784,0.0038009963],"about_ca_topic_score_codex":0.0000011271845,"about_ca_topic_score_gemma":7.5914835e-7,"teacher_disagreement_score":0.80211973,"about_ca_system_score_codex":0.000009437284,"about_ca_system_score_gemma":0.0000027775752,"threshold_uncertainty_score":0.39383864},"labels":[],"label_agreement":null},{"id":"W1975861567","doi":"10.1007/s10623-014-9952-6","title":"Paillier-based publicly verifiable (non-interactive) secret sharing","year":2014,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Verifiable secret sharing; Paillier cryptosystem; Correctness; Semantic security; Computer science; Homomorphic secret sharing; Secret sharing; Computer security; Scheme (mathematics); Homomorphic encryption; Shamir's Secret Sharing; Security analysis; Encryption; Theoretical computer science; Public-key cryptography; Cryptography; Hybrid cryptosystem; Algorithm; Mathematics; Programming language; Attribute-based encryption","score_opus":0.014836702109259437,"score_gpt":0.22962428863276396,"score_spread":0.21478758652350452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975861567","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.06373426,0.0001688168,0.9314685,0.00021119323,0.00020433152,0.0002001128,0.000023606537,0.00028962412,0.003699564],"genre_scores_gemma":[0.9149965,0.00004907675,0.08393685,0.0008367032,0.000072220224,0.00004520349,0.000041021598,0.000018286773,0.0000041219037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978554,0.00011794513,0.00029393713,0.00086582336,0.00031246562,0.0005543878],"domain_scores_gemma":[0.9982522,0.00019669949,0.00013106383,0.0010062823,0.00011066223,0.00030307643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007480258,0.00031034712,0.00032170006,0.00050317484,0.00040495518,0.000974725,0.0010211287,0.00011909602,0.00005315057],"category_scores_gemma":[0.000039006252,0.00028981562,0.00022466242,0.0011750088,0.00015701137,0.0011099031,0.00026086852,0.00025724125,0.000013778089],"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.00008394043,0.0004066045,0.05771164,0.00014217454,0.0001562186,0.000018495379,0.0008333901,0.00010786882,0.004526821,0.8906439,0.005898429,0.039470494],"study_design_scores_gemma":[0.0040427344,0.0015762184,0.053418808,0.00028788394,0.000103469465,0.000044075376,0.00031808298,0.49597114,0.011429571,0.25440425,0.1758593,0.0025444562],"about_ca_topic_score_codex":0.00016472979,"about_ca_topic_score_gemma":0.0000330152,"teacher_disagreement_score":0.8512623,"about_ca_system_score_codex":0.000010346039,"about_ca_system_score_gemma":0.000034958648,"threshold_uncertainty_score":0.9999554},"labels":[],"label_agreement":null},{"id":"W1976201283","doi":"10.1007/s10623-014-9944-6","title":"Mutually unbiased weighing matrices","year":2014,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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 Alberta; University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Hadamard transform; Mutually unbiased bases; Mathematics; Best linear unbiased prediction; Upper and lower bounds; Combinatorics; Computer science; Statistics; Algorithm; Pure mathematics; Artificial intelligence","score_opus":0.00843946014366608,"score_gpt":0.18375611678491696,"score_spread":0.17531665664125087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976201283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7667619,0.0023379533,0.2137139,0.000019149527,0.00044841474,0.00018609971,0.0000109658395,0.0006978178,0.015823817],"genre_scores_gemma":[0.9975192,0.00020096054,0.002050811,0.00006231476,0.00010333267,0.000020595679,0.000005691465,0.000028400247,0.000008708776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918824,0.000076612814,0.00018811358,0.00017559851,0.00011466491,0.0002567509],"domain_scores_gemma":[0.9995281,0.00012659396,0.000028983019,0.00018611421,0.000020817648,0.00010939272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031862367,0.00018013385,0.0002024867,0.00021314206,0.0001329932,0.00010587153,0.00012780154,0.00008097491,0.000031387422],"category_scores_gemma":[0.000007212107,0.00016370855,0.000100256344,0.0003480132,0.00006075165,0.0001161478,0.000012019125,0.00010348058,0.000014450948],"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.000090568814,0.000113547445,0.01910549,0.0009922761,0.00062495586,0.000026710974,0.0030885905,0.0036459584,0.088561535,0.7918719,0.006910482,0.084967986],"study_design_scores_gemma":[0.006337704,0.0016104252,0.034631725,0.0012029285,0.0007203387,0.00017962245,0.0049637733,0.16896664,0.042408876,0.3173448,0.4153344,0.0062987604],"about_ca_topic_score_codex":0.000009733322,"about_ca_topic_score_gemma":0.000006376911,"teacher_disagreement_score":0.4745271,"about_ca_system_score_codex":0.0000035965788,"about_ca_system_score_gemma":0.0000024421875,"threshold_uncertainty_score":0.66758406},"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":"W1979275900","doi":"10.1007/s10623-014-9934-8","title":"Quantum codes from nearly self-orthogonal quaternary linear codes","year":2014,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Quantum Computing Algorithms and Architecture","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":"Simon Fraser University","funders":"","keywords":"Quantum convolutional code; Quantum; Linear code; Orthogonality; Mathematics; Discrete mathematics; Code (set theory); Minimum distance; Error detection and correction; Expander code; Combinatorics; Physics; Block code; Quantum mechanics; Algorithm; Computer science; Decoding methods; Geometry; Set (abstract data type)","score_opus":0.012815740740361412,"score_gpt":0.22674125120547778,"score_spread":0.21392551046511638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979275900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41976717,0.0005712667,0.5783913,0.00033082254,0.00023896815,0.00011089286,0.000027409207,0.00043832065,0.00012384301],"genre_scores_gemma":[0.76453775,0.00017719048,0.23416409,0.0006958931,0.00034682697,0.000013542658,0.00002955432,0.000028975603,0.000006151616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973116,0.00032717397,0.00041264115,0.00088735076,0.00045519683,0.00060606404],"domain_scores_gemma":[0.99818885,0.00053066073,0.00017531085,0.0006879505,0.000106218016,0.00031101806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005505786,0.00042818912,0.0004867327,0.0002698873,0.0005156757,0.00051868,0.00093316176,0.00015782785,0.0000126048935],"category_scores_gemma":[0.00002451411,0.00036039486,0.00024341965,0.00057577476,0.00019232316,0.00026004427,0.00030249814,0.00036357343,0.000023387163],"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.00024462075,0.0014722083,0.105634354,0.00027196345,0.0013485382,0.00028763973,0.011125818,0.0094006425,0.013921975,0.57273823,0.0049230857,0.2786309],"study_design_scores_gemma":[0.000589339,0.00048920943,0.013567969,0.000080367165,0.00003786317,0.000037645063,0.000045036224,0.9276363,0.000656308,0.04747957,0.008778688,0.0006016611],"about_ca_topic_score_codex":0.0003260899,"about_ca_topic_score_gemma":0.000020422467,"teacher_disagreement_score":0.9182357,"about_ca_system_score_codex":0.000008227204,"about_ca_system_score_gemma":0.000042442392,"threshold_uncertainty_score":0.9998848},"labels":[],"label_agreement":null},{"id":"W1980499647","doi":"10.1007/s10623-011-9604-z","title":"Anonymity and one-way authentication in key exchange protocols","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":65,"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":"Anonymity; Computer science; Computer security; Authenticated Key Exchange; Mutual authentication; Key (lock); Key exchange; Session key; Authentication (law); Authentication protocol; Secrecy; Key-agreement protocol; Public-key cryptography; Forward secrecy; Internet privacy; Key distribution; Encryption","score_opus":0.05317927073998197,"score_gpt":0.3066438702162299,"score_spread":0.25346459947624794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980499647","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.024525188,0.00027964378,0.9556713,0.00024791018,0.00003070496,0.018739102,0.00000433575,0.000115174866,0.00038664823],"genre_scores_gemma":[0.8595435,0.00004086003,0.11523052,0.00013073182,0.00003137104,0.025001485,0.000002669861,0.000010016026,0.000008850618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99870896,0.00014613237,0.00024337342,0.00034804016,0.00019476141,0.00035874193],"domain_scores_gemma":[0.9991726,0.000089258436,0.0001129214,0.000403452,0.000052977943,0.00016876255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006062201,0.00015596647,0.00017831528,0.00023235781,0.00013054005,0.00014569667,0.00027114555,0.00007529712,0.00001527297],"category_scores_gemma":[0.000030382678,0.00015177592,0.00003749629,0.000559428,0.00012735435,0.00091440225,0.0001512074,0.00012147207,0.0000060818343],"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.000019772411,0.00041187808,0.072854914,0.00014287037,0.000013124199,0.0000011038684,0.004769144,5.878655e-7,0.0042027174,0.882553,0.00002311925,0.035007797],"study_design_scores_gemma":[0.0016538466,0.0002632598,0.49838105,0.00020133702,0.000018150857,0.000018196244,0.00014169634,0.0045357496,0.007656699,0.47982985,0.0065935953,0.00070657884],"about_ca_topic_score_codex":0.000010040202,"about_ca_topic_score_gemma":0.000011988071,"teacher_disagreement_score":0.84044075,"about_ca_system_score_codex":0.00001380702,"about_ca_system_score_gemma":0.000015501975,"threshold_uncertainty_score":0.6189242},"labels":[],"label_agreement":null},{"id":"W1980792663","doi":"10.1023/b:desi.0000032607.03637.1c","title":"The Non-Existence of Maximal Sets of Four Mutually Orthogonal Latin Squares of Order 8","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latin square; Mathematics; Order (exchange); Set (abstract data type); Combinatorics; Projective test; Orthogonal array; Pure mathematics; Computer science; Statistics; Chemistry","score_opus":0.016162427861778395,"score_gpt":0.2094475287446339,"score_spread":0.1932851008828555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980792663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9688843,0.00096624915,0.028359361,0.000009419839,0.00007591967,0.00015601386,0.000039738778,0.00002677315,0.0014822433],"genre_scores_gemma":[0.99625736,0.00016570407,0.0035296658,0.000004779516,0.000010772132,0.000011494888,0.0000027258625,0.000014482143,0.0000029919388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991389,0.000036959045,0.00035812004,0.000112420494,0.00017761797,0.00017601287],"domain_scores_gemma":[0.9994226,0.00011895857,0.00010592236,0.00020014663,0.00010739344,0.000044989098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027535713,0.00013860737,0.00025582573,0.00014879854,0.00006828605,0.000012219927,0.00016304373,0.000066701214,0.000008882694],"category_scores_gemma":[0.000011547623,0.000102661565,0.00013445636,0.0005311186,0.00026013743,0.00005309404,0.000017586912,0.000079276666,4.6380657e-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.0004348578,0.00022870542,0.05929482,0.001680507,0.000860012,0.000017040627,0.005031729,0.020240223,0.18428595,0.71462667,0.00012574505,0.013173757],"study_design_scores_gemma":[0.006926983,0.0030041444,0.3975696,0.0021272155,0.00048230743,0.000113005415,0.011569607,0.008483556,0.2299787,0.33612555,0.0016291318,0.0019901986],"about_ca_topic_score_codex":0.000025125415,"about_ca_topic_score_gemma":0.000026527898,"teacher_disagreement_score":0.3785011,"about_ca_system_score_codex":0.0000025735483,"about_ca_system_score_gemma":0.000018048462,"threshold_uncertainty_score":0.41864172},"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":"W1984179204","doi":"10.1007/s10623-012-9749-4","title":"A unified approach to combinatorial key predistribution schemes for sensor networks","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":55,"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":"Key (lock); Computer science; Class (philosophy); Scheme (mathematics); Combinatorial design; Wireless sensor network; Theoretical computer science; Mathematics; Artificial intelligence; Computer network; Discrete mathematics; Computer security","score_opus":0.027292689026266175,"score_gpt":0.24677819362380077,"score_spread":0.2194855045975346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984179204","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.026049359,0.00070412055,0.970721,0.00010718201,0.00093336846,0.0007535044,0.000020503989,0.00023915576,0.000471796],"genre_scores_gemma":[0.8275588,0.000045711797,0.17144619,0.00019696778,0.000548792,0.00013860968,0.000044794302,0.000016901986,0.000003243044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982263,0.000113710965,0.00025905354,0.00043913219,0.00023669413,0.0007251454],"domain_scores_gemma":[0.99871564,0.0002445045,0.00009179457,0.00044678242,0.00014532098,0.0003559808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000515608,0.0002533975,0.00028630995,0.00016139746,0.00030471286,0.00026752418,0.0004485107,0.00020211107,0.0000014539186],"category_scores_gemma":[0.00003716624,0.00024564326,0.00014523743,0.0007949653,0.000087185515,0.0003540257,0.0001349368,0.00017132361,0.0000020402915],"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.00008540712,0.00029589614,0.002260426,0.000034729157,0.0000775581,6.305958e-7,0.0007972141,0.00071087887,0.0003761358,0.98694664,0.0032194369,0.0051950295],"study_design_scores_gemma":[0.005013137,0.0012345683,0.0077126212,0.00013680458,0.00021265722,0.00008579901,0.00069495366,0.8152102,0.003920468,0.03558283,0.12766087,0.0025350845],"about_ca_topic_score_codex":0.000008868703,"about_ca_topic_score_gemma":5.6029216e-7,"teacher_disagreement_score":0.9513638,"about_ca_system_score_codex":0.000021239466,"about_ca_system_score_gemma":0.000015471825,"threshold_uncertainty_score":0.9999996},"labels":[],"label_agreement":null},{"id":"W1987668102","doi":"10.1007/s10623-006-9023-8","title":"Applications of representation theory to wireless communications","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Wireless Communication Networks Research","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 Ottawa","funders":"","keywords":"Wireless; Computer science; Representation (politics); Antenna (radio); Space (punctuation); Theoretical computer science; Electronic engineering; Telecommunications; Engineering","score_opus":0.032792183516689166,"score_gpt":0.30886248840817465,"score_spread":0.2760703048914855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987668102","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.004683957,0.0008839898,0.9893314,0.0008879352,0.000011667498,0.00046142153,0.0000068997883,0.00009694643,0.003635743],"genre_scores_gemma":[0.81828487,0.00037262458,0.18087773,0.000079976984,0.00001715481,0.00030810846,0.000018349148,0.000008293861,0.000032905602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868774,0.00033200003,0.00029521657,0.00026062378,0.00023509456,0.00018934219],"domain_scores_gemma":[0.9970027,0.00058208144,0.00010623503,0.0020007729,0.0002236943,0.00008451807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000513526,0.00010133882,0.0001566061,0.0003538074,0.0002707526,0.00011909226,0.0016704393,0.000049714712,0.000005339104],"category_scores_gemma":[0.000010641363,0.00010119096,0.000067317305,0.0017663587,0.00024494255,0.00019994001,0.0005487989,0.00011870217,0.000006238432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061871565,0.00010682517,0.0023766272,0.000008758164,0.000014910597,1.7920777e-7,0.00019813312,0.00011265259,0.0033463705,0.88112515,0.0005540786,0.1121501],"study_design_scores_gemma":[0.0011252667,0.00030401716,0.060466032,0.00013752458,0.000054072687,0.000020634945,0.00082030427,0.09233821,0.01549175,0.76317406,0.065072194,0.0009959635],"about_ca_topic_score_codex":0.000133257,"about_ca_topic_score_gemma":0.000052480787,"teacher_disagreement_score":0.8136009,"about_ca_system_score_codex":0.000009542894,"about_ca_system_score_gemma":0.000028321096,"threshold_uncertainty_score":0.41264477},"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":"W1992938819","doi":"10.1007/s10623-015-0067-5","title":"Finding shortest lattice vectors faster using quantum search","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":91,"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; Canadian Institute for Advanced Research","funders":"Engineering and Physical Sciences Research Council; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Lorentz Center; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Lattice problem; Quantum; Lattice (music); Computer science; Theoretical computer science; Algorithm; Physics; Quantum mechanics; Cryptography","score_opus":0.08119813990694018,"score_gpt":0.29312610930515437,"score_spread":0.21192796939821418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992938819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48270428,0.00033717853,0.5163347,0.00010399249,0.00018619515,0.00008330737,0.00000235549,0.00011402917,0.00013395514],"genre_scores_gemma":[0.85813856,0.000013244395,0.14153884,0.00016590973,0.000116535164,0.000002875301,0.0000019680906,0.000016759084,0.0000053287827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982642,0.00015400397,0.00022036236,0.00049635407,0.00036800228,0.0004970859],"domain_scores_gemma":[0.99898756,0.00015952776,0.000060618022,0.00037777555,0.0001048152,0.0003096933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005969118,0.00022979458,0.00023606184,0.00033786736,0.00030092316,0.00045323328,0.0004980864,0.00008004879,0.0000031682753],"category_scores_gemma":[0.0000200603,0.00019621196,0.00010092619,0.00088696677,0.000118913566,0.00025554997,0.00026198287,0.00024995414,0.000005728604],"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.00016501397,0.00096625264,0.14405744,0.00030500657,0.0007453085,0.0010749276,0.038889386,0.08090801,0.021749344,0.44614404,0.0028345091,0.26216078],"study_design_scores_gemma":[0.0003676402,0.00026191628,0.0028020882,0.00006702178,0.000018926106,0.00014548535,0.00026131538,0.98674583,0.0006188018,0.00742247,0.0008903948,0.00039811674],"about_ca_topic_score_codex":0.00007974431,"about_ca_topic_score_gemma":0.0000036428328,"teacher_disagreement_score":0.90583783,"about_ca_system_score_codex":0.000015084395,"about_ca_system_score_gemma":0.000069620204,"threshold_uncertainty_score":0.8001291},"labels":[],"label_agreement":null},{"id":"W1993405564","doi":"10.1023/b:desi.0000029211.79206.e1","title":"On the Action of the Groups GL(n+1, q), PGL(n + 1, q), SL(n + 1, q) and PSL(n + 1, q) on PG(n, qt)","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"York University","funders":"","keywords":"PSL; Combinatorics; Prime (order theory); Prime power; Group (periodic table); Mathematics; Physics","score_opus":0.019267064133812545,"score_gpt":0.20105479734727522,"score_spread":0.18178773321346267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993405564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99224323,0.0006556805,0.0036254115,0.00017868563,0.00030944397,0.00035156636,0.00002151951,0.000102053884,0.002512423],"genre_scores_gemma":[0.99931216,0.00031189263,0.00007071624,0.00017604206,0.000050727307,0.00004044708,0.0000022422566,0.000027058435,0.00000870643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990213,0.00010706695,0.00022244599,0.00020982351,0.00020651962,0.00023283403],"domain_scores_gemma":[0.999279,0.00019995989,0.00006435929,0.00036478185,0.000025489626,0.00006640163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000311351,0.00023330457,0.00021120216,0.00013912996,0.00026604906,0.000059542115,0.00018160431,0.00010549494,0.000015968688],"category_scores_gemma":[0.000015614258,0.00013703709,0.00015351964,0.00044312247,0.00021831077,0.00007513465,0.000021772645,0.00022656922,0.0000037695863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001289877,0.00010578358,0.0013532018,0.00016682848,0.00022351049,0.00000424111,0.00126551,0.003513124,0.0243675,0.96406424,0.0009798915,0.0038271556],"study_design_scores_gemma":[0.0041309036,0.0019468372,0.06544994,0.001548864,0.0003808947,0.00014945993,0.005163107,0.0018372857,0.17167544,0.7369631,0.008966797,0.0017873511],"about_ca_topic_score_codex":0.000025561114,"about_ca_topic_score_gemma":0.000028367844,"teacher_disagreement_score":0.22710115,"about_ca_system_score_codex":0.0000127905,"about_ca_system_score_gemma":0.000006763953,"threshold_uncertainty_score":0.558821},"labels":[],"label_agreement":null},{"id":"W1994984340","doi":"10.1007/s10623-012-9753-8","title":"A new class of near-optimal partial Fourier codebooks from an almost difference set","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Tsinghua National Laboratory for Information Science and Technology; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Codebook; Mathematics; Decimation; Combinatorics; Fourier transform; Discrete mathematics; Difference set; Algorithm; Mathematical analysis; Computer science","score_opus":0.05187389898742431,"score_gpt":0.28821935079856187,"score_spread":0.23634545181113756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994984340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28170043,0.00013069237,0.7173448,0.000049338392,0.00011457901,0.00013541633,0.000047719583,0.000055941466,0.00042103577],"genre_scores_gemma":[0.84282416,0.000011262293,0.15675671,0.00024673494,0.00007890005,0.00001159721,0.00003686642,0.000010184694,0.000023569208],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99866825,0.00009468236,0.00027658074,0.0003062447,0.0002731634,0.00038107307],"domain_scores_gemma":[0.9990468,0.00009177498,0.000115765855,0.00035794856,0.000046505884,0.00034118042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016218863,0.00019136506,0.0002215868,0.000093638795,0.000115774696,0.0003525379,0.0003812546,0.00006278399,0.000042682357],"category_scores_gemma":[0.000006167659,0.00017086428,0.00008891352,0.00024104085,0.00010070561,0.0009601161,0.00010539112,0.00007675386,0.000005492896],"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.00024312205,0.00046259322,0.09510038,0.000039308874,0.0002885513,0.000010067849,0.015814515,0.000023384882,0.050069235,0.33788595,0.0061709355,0.49389195],"study_design_scores_gemma":[0.009124041,0.006774348,0.41294813,0.0002943908,0.0004823607,0.00009250156,0.0019923006,0.1872305,0.2004779,0.11480157,0.061431333,0.0043506282],"about_ca_topic_score_codex":0.00022398679,"about_ca_topic_score_gemma":0.000012537714,"teacher_disagreement_score":0.5611237,"about_ca_system_score_codex":0.00000511684,"about_ca_system_score_gemma":0.000049648534,"threshold_uncertainty_score":0.69676435},"labels":[],"label_agreement":null},{"id":"W2003743811","doi":"10.1007/s10623-011-9520-2","title":"Steiner triple systems satisfying the 4-vertex condition","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Aalto-Yliopisto; Academy of Finland","keywords":"Combinatorics; Vertex (graph theory); Affine transformation; Mathematics; Steiner system; Projective plane; Graph; Discrete mathematics; Block (permutation group theory); Triple system; Pure mathematics; Geometry","score_opus":0.029903246043006478,"score_gpt":0.19741332686179824,"score_spread":0.16751008081879176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003743811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8228806,0.012008775,0.12613904,0.000015139946,0.002042412,0.0010548737,0.00006867499,0.0008403771,0.034950063],"genre_scores_gemma":[0.99937946,0.00019115198,0.00019474301,0.000030522722,0.00004833944,0.00009379314,0.000007862589,0.000026091759,0.000028064953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991701,0.000105492414,0.00021984437,0.0001529542,0.00011668132,0.00023487613],"domain_scores_gemma":[0.9995679,0.00006476974,0.0000391648,0.00022755773,0.000027673563,0.00007291656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030480805,0.00017412956,0.000187568,0.0001330494,0.00020118401,0.00008240786,0.00013038867,0.00008013143,0.000052300587],"category_scores_gemma":[0.0000038284406,0.00012229654,0.000096075266,0.000296911,0.00010102433,0.00012757273,0.000011174295,0.00011581727,0.000014113376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008565958,0.00007746528,0.015361426,0.0005564372,0.0007637504,0.00003194661,0.0072696814,0.00063675607,0.023396637,0.93139523,0.010914976,0.0095100375],"study_design_scores_gemma":[0.012039724,0.0026843287,0.2283671,0.00263953,0.0020790366,0.0012282955,0.05959556,0.14066568,0.03995797,0.33512542,0.16645518,0.009162183],"about_ca_topic_score_codex":0.00006333268,"about_ca_topic_score_gemma":0.000010591649,"teacher_disagreement_score":0.5962698,"about_ca_system_score_codex":0.00000549914,"about_ca_system_score_gemma":0.0000033282981,"threshold_uncertainty_score":0.49871078},"labels":[],"label_agreement":null},{"id":"W2005094977","doi":"10.1007/s10623-010-9483-8","title":"Hamilton cycles in restricted block-intersection graphs","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Intersection (aeronautics); Mathematics; Block (permutation group theory); Hamiltonian path; Discrete mathematics; Graph; Geography","score_opus":0.02530779575660416,"score_gpt":0.19915862997280187,"score_spread":0.1738508342161977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005094977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98751664,0.00078728516,0.0033070524,0.000001519082,0.00024166756,0.00017068828,0.000006264302,0.00028170715,0.007687166],"genre_scores_gemma":[0.9990368,0.00038442158,0.00047538226,0.000013689506,0.00001745467,0.00004063553,0.000004101135,0.00002346999,0.0000040604773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991806,0.00006923004,0.00022891916,0.00018983966,0.00008197353,0.00024943711],"domain_scores_gemma":[0.99968,0.000030960844,0.00002740411,0.00016614654,0.000018044348,0.000077460485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013339226,0.00017698287,0.00018488648,0.00056318677,0.00006479866,0.000029640234,0.0000967931,0.000109190645,0.000019815061],"category_scores_gemma":[0.000002939105,0.00017123015,0.00009561585,0.0007063144,0.00007452545,0.00011409764,0.0000079561005,0.00014251287,0.0000042473816],"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.00073885906,0.0006679741,0.36683407,0.00078898337,0.0009006368,0.0002594488,0.03187148,0.0014102533,0.17504793,0.39621678,0.0024047245,0.022858843],"study_design_scores_gemma":[0.003372106,0.0009646189,0.7374261,0.00065455964,0.00018190613,0.00019166917,0.007498016,0.009064585,0.039199945,0.19498986,0.004112642,0.0023439995],"about_ca_topic_score_codex":0.000117529315,"about_ca_topic_score_gemma":0.000116510564,"teacher_disagreement_score":0.37059203,"about_ca_system_score_codex":0.000007756344,"about_ca_system_score_gemma":0.0000025347827,"threshold_uncertainty_score":0.69825625},"labels":[],"label_agreement":null},{"id":"W2006439589","doi":"10.1007/s10623-007-9088-z","title":"Golay complementary array pairs","year":2007,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":71,"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":"Binary Golay code; Constructive; Binary number; Ternary Golay code; Mathematics; Complementary sequences; Combinatorics; Algorithm; Arithmetic; Computer science; Process (computing); Hamming code; Decoding methods","score_opus":0.021033139686618605,"score_gpt":0.2401961966686455,"score_spread":0.2191630569820269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006439589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35987327,0.001739393,0.6150726,0.000059098482,0.00062483235,0.00023179215,0.000027353193,0.0006670782,0.021704568],"genre_scores_gemma":[0.9781791,0.00014939245,0.02137534,0.00010113192,0.00012790099,0.000010458958,0.000015483098,0.000027198466,0.000013989728],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923325,0.0000147805395,0.00019001942,0.0001484031,0.00012137826,0.0002921646],"domain_scores_gemma":[0.99963427,0.00005685313,0.00001889994,0.00014840435,0.00001945136,0.00012215009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023572941,0.00014661864,0.00013135672,0.00020705645,0.00009522519,0.00003472356,0.00008645551,0.00004924528,0.00014330652],"category_scores_gemma":[0.0000024311075,0.00014778199,0.00007326595,0.0003001921,0.00008321253,0.00008562404,0.000009340293,0.00011086528,0.000012172169],"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.00013515531,0.00024050902,0.10365001,0.0004008054,0.0011344894,0.00008050491,0.0036895536,0.0026655376,0.61376625,0.03225132,0.13333227,0.10865356],"study_design_scores_gemma":[0.0027426505,0.00048544415,0.113841385,0.00015111027,0.00021076527,0.00019804804,0.0055654887,0.0019504263,0.18184175,0.022046119,0.668553,0.002413792],"about_ca_topic_score_codex":0.000016797625,"about_ca_topic_score_gemma":0.000017358485,"teacher_disagreement_score":0.6183058,"about_ca_system_score_codex":0.0000137316865,"about_ca_system_score_gemma":0.0000029422538,"threshold_uncertainty_score":0.60263747},"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":"W2011595107","doi":"10.1023/a:1016592806366","title":"Balanced Incomplete Block Designs with Block Size 9 and λ=2,4,8","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"BGC Engineering (Canada); University of Northern British Columbia","funders":"","keywords":"Block (permutation group theory); Ternary operation; Lambda; Combinatorics; Mathematics; Group (periodic table); Physics; Arithmetic; Computer science; Quantum mechanics","score_opus":0.018081097912936026,"score_gpt":0.1854340216622266,"score_spread":0.1673529237492906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011595107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9809318,0.004360786,0.00836822,0.000041664607,0.000107956526,0.0004010086,0.000028833727,0.00047873196,0.0052809636],"genre_scores_gemma":[0.99630296,0.0005954329,0.0028362235,0.00007880584,0.000054282205,0.00005157229,0.0000019767638,0.00004663856,0.000032089978],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9988388,0.00007397276,0.0002302392,0.00030552206,0.00015801597,0.00039348015],"domain_scores_gemma":[0.99929065,0.00018417362,0.000041443323,0.00025468,0.000033669054,0.00019536422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015436175,0.00031708254,0.00034432055,0.00016063178,0.00020206007,0.00011637307,0.000122006,0.00010705958,0.00005251451],"category_scores_gemma":[0.000006451927,0.0002657788,0.00007514938,0.0004552465,0.0001861576,0.00011984475,0.000019208917,0.0001619901,0.000007702076],"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.0009687476,0.00096554164,0.2132541,0.003635099,0.005260232,0.00069664634,0.017773692,0.011872243,0.54658747,0.14383255,0.022414146,0.032739546],"study_design_scores_gemma":[0.042960305,0.013124312,0.305848,0.0047296844,0.003392253,0.007250676,0.013746742,0.23288167,0.06661486,0.09682519,0.18869273,0.023933569],"about_ca_topic_score_codex":0.000009233031,"about_ca_topic_score_gemma":0.000013291714,"teacher_disagreement_score":0.47997263,"about_ca_system_score_codex":0.0000059858203,"about_ca_system_score_gemma":0.0000025227598,"threshold_uncertainty_score":0.99997944},"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":"W2017220809","doi":"10.1007/s10623-014-9977-x","title":"Diagonally cyclic equitable rectangles","year":2014,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"National Natural Science Foundation of China","keywords":"Combinatorics; Rectangle; Diagonal; Mathematics; Constructive proof; Row; Diagonally dominant matrix; Embedding; Geometry; Pure mathematics; Computer science; Invertible matrix","score_opus":0.010308050751546586,"score_gpt":0.1910353581056382,"score_spread":0.18072730735409162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017220809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8116247,0.003615881,0.13110727,0.000027669474,0.00043706878,0.00022564571,0.000022908016,0.00074081094,0.052198026],"genre_scores_gemma":[0.9982713,0.0002677584,0.0012108644,0.00006345255,0.0000903711,0.000038674836,0.000008581378,0.00002993581,0.000019078912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991312,0.00007264728,0.00017226048,0.00017581267,0.0001065329,0.00034153168],"domain_scores_gemma":[0.99952793,0.00011927213,0.000022057933,0.00019882339,0.00001913713,0.00011279715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035308962,0.0001746627,0.00020738822,0.00016085818,0.0001387619,0.00007958564,0.000122213,0.00008190529,0.000032754604],"category_scores_gemma":[0.000008033478,0.00015960845,0.000100947254,0.00029417354,0.000071680995,0.00010019998,0.000017838824,0.0000961768,0.000017558368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004868392,0.00010388371,0.03048252,0.00040158172,0.00036618602,0.00001136598,0.0009359373,0.0010561482,0.08198837,0.81664515,0.007928345,0.060031846],"study_design_scores_gemma":[0.0037508316,0.001139023,0.040597856,0.0006142654,0.00029033018,0.00021269653,0.0014484557,0.02353408,0.027223846,0.52198374,0.37542492,0.00377996],"about_ca_topic_score_codex":0.000006507665,"about_ca_topic_score_gemma":0.000011048801,"teacher_disagreement_score":0.36749658,"about_ca_system_score_codex":0.000004740635,"about_ca_system_score_gemma":0.000002947384,"threshold_uncertainty_score":0.65086436},"labels":[],"label_agreement":null},{"id":"W2022676089","doi":"10.1007/s10623-008-9261-z","title":"An intrinsical description of group codes","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cooperative Communication and Network Coding","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 Regina","funders":"","keywords":"Mathematics; Abelian group; Group code; General linear group; Group (periodic table); Combinatorics; Linear code; Code (set theory); Discrete mathematics; Isomorphism (crystallography); Group algebra; Algebra over a field; Pure mathematics; Block code; Decoding methods; Symmetric group; Algorithm; Computer science; Physics","score_opus":0.04610486165626739,"score_gpt":0.277141148110304,"score_spread":0.2310362864540366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022676089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12918852,0.0010322713,0.8686641,0.00024645065,0.000037804366,0.00010023398,0.0000012190892,0.00009593934,0.00063344656],"genre_scores_gemma":[0.92493445,0.0013562351,0.07331816,0.00035242375,0.00002338424,0.00000477883,0.0000051513316,0.000003205685,0.000002237739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991168,0.00017176541,0.00019729443,0.00022943414,0.00013013244,0.0001545725],"domain_scores_gemma":[0.9992337,0.000056937268,0.000066268905,0.0004496277,0.00009485777,0.00009859063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028962424,0.00011168012,0.0001687758,0.0001750692,0.00016366097,0.00014737675,0.00045889433,0.000047124257,0.000006918296],"category_scores_gemma":[0.000008967069,0.000100145524,0.000060279643,0.00057036954,0.000093276765,0.0004373104,0.000053626176,0.0000975032,9.849957e-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.00001528541,0.00017838541,0.0021070412,0.0000041327353,0.000011898891,0.000001458296,0.00054919894,0.00001418382,0.04765539,0.7056717,0.00021955442,0.24357173],"study_design_scores_gemma":[0.0027351268,0.0060926843,0.55948895,0.00027848838,0.000079751655,0.000065162574,0.00046708906,0.21398608,0.018718038,0.1823055,0.014124968,0.0016581304],"about_ca_topic_score_codex":0.0000039895494,"about_ca_topic_score_gemma":0.000013173217,"teacher_disagreement_score":0.7957459,"about_ca_system_score_codex":0.000005476637,"about_ca_system_score_gemma":0.000010473119,"threshold_uncertainty_score":0.40838158},"labels":[],"label_agreement":null},{"id":"W2022789141","doi":"10.1007/s10623-006-9014-9","title":"On binary signed digit representations of integers","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Digital Image Processing Techniques","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":"University of Waterloo","funders":"","keywords":"Integer (computer science); Mathematics; Binary number; Numerical digit; Representation (politics); Cryptography; Discrete mathematics; Arithmetic; Number theory; Combinatorics; Algorithm; Computer science","score_opus":0.015423869744795576,"score_gpt":0.2578590586946326,"score_spread":0.24243518894983704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022789141","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.020052772,0.00014794493,0.95889133,0.00018434032,0.000025551608,0.000114341485,0.000009324671,0.00030159857,0.020272825],"genre_scores_gemma":[0.8750825,0.0000121018265,0.12471423,0.0001241485,0.00000772098,0.000017612287,0.0000053964873,0.000007433409,0.000028888511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991758,0.000028799048,0.00019586884,0.0002768689,0.00017056437,0.00015212079],"domain_scores_gemma":[0.9993294,0.00013807013,0.00009034323,0.0003176591,0.000082128994,0.00004238774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089205285,0.00011639798,0.00013560362,0.0003090595,0.00007590848,0.0002500981,0.0003448518,0.000036938767,0.0000030316928],"category_scores_gemma":[0.000020417248,0.000103838625,0.000078066776,0.0006660651,0.00017367421,0.0004956321,0.00008407146,0.000055641245,0.0000021507476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000297312,0.00042484037,0.0019868482,0.000051904466,0.000032445845,0.000024659916,0.00016791724,0.00008294693,0.034884464,0.89962876,0.01643469,0.046250787],"study_design_scores_gemma":[0.00028968081,0.00056336605,0.0020953682,0.00009910189,0.000013858005,0.0000108087415,0.000037214864,0.0027408986,0.12966356,0.86315805,0.0009913045,0.00033678088],"about_ca_topic_score_codex":0.000039196995,"about_ca_topic_score_gemma":0.0000015229684,"teacher_disagreement_score":0.8550297,"about_ca_system_score_codex":0.000004684289,"about_ca_system_score_gemma":0.00001697658,"threshold_uncertainty_score":0.42344162},"labels":[],"label_agreement":null},{"id":"W2023171134","doi":"10.1023/b:desi.0000029231.44423.43","title":"On a Bound of Cover-Free Families","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cellular Automata and Applications","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":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Stirling engine; Upper and lower bounds; Mathematics; Combinatorics; Computer science; Engineering; Mathematical analysis; Mechanical engineering","score_opus":0.014380880511451666,"score_gpt":0.22724741568630147,"score_spread":0.2128665351748498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023171134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1928813,0.00027215888,0.80389917,0.0002094921,0.000028218683,0.00010993999,0.00001196619,0.000076958146,0.002510781],"genre_scores_gemma":[0.9547562,0.00012964207,0.04489062,0.00018123447,0.000008387573,0.000018199125,0.000003132828,0.000004914978,0.00000767861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936116,0.000014835468,0.00012918084,0.00021418191,0.00014683907,0.00013378052],"domain_scores_gemma":[0.99928737,0.00006314803,0.00005024215,0.00051339023,0.000030458908,0.00005542162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008171681,0.00009453684,0.00011980327,0.000145355,0.00011314637,0.00008129502,0.00042345154,0.000034369445,0.000005213482],"category_scores_gemma":[0.000007887735,0.00008352029,0.000075603806,0.00045353288,0.00011721036,0.00011050868,0.00008301681,0.00004916118,0.000007813519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004241944,0.00010413933,0.000100311845,0.000012007424,0.000016577316,0.0000033683007,0.00029248348,0.00007787808,0.010281641,0.9833262,0.00043501885,0.005346154],"study_design_scores_gemma":[0.0013861856,0.0005088439,0.008509639,0.00006543044,0.000024019319,0.000030381234,0.00010679758,0.0015030266,0.031471428,0.9499112,0.006127618,0.0003554741],"about_ca_topic_score_codex":0.000043996148,"about_ca_topic_score_gemma":0.0000064181604,"teacher_disagreement_score":0.7618749,"about_ca_system_score_codex":0.00000469578,"about_ca_system_score_gemma":0.000024654264,"threshold_uncertainty_score":0.34058586},"labels":[],"label_agreement":null},{"id":"W2024144406","doi":"10.1007/s10623-007-9163-5","title":"Williamson matrices up to order 59","year":2008,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Class (philosophy); Order (exchange); Mathematics; Combinatorics; Pure mathematics; Computer science; Artificial intelligence; Economics","score_opus":0.01850153224551272,"score_gpt":0.2070204207014444,"score_spread":0.1885188884559317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024144406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9231137,0.0026831746,0.06893977,0.000022895041,0.00039931576,0.00023945165,0.00001611291,0.0003995588,0.0041860123],"genre_scores_gemma":[0.996064,0.0008262701,0.0027929647,0.000089240806,0.00007126054,0.00004395957,0.000004481099,0.000030370522,0.00007744523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991879,0.000037383306,0.00017678563,0.00019122749,0.0001282902,0.00027845026],"domain_scores_gemma":[0.9995556,0.000043161683,0.000018377685,0.00018704278,0.000038067872,0.00015778758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012571106,0.0001876194,0.00020455124,0.0002584234,0.00017357999,0.000041960786,0.00012099055,0.00007864121,0.000055105094],"category_scores_gemma":[0.0000047767903,0.00017041386,0.00008211546,0.0007919489,0.00005962786,0.00010330949,0.000014518065,0.00008843743,0.000038593367],"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.0006538176,0.00044786633,0.17486858,0.002186028,0.0023440477,0.00048384463,0.039467275,0.01991264,0.18149659,0.3348588,0.17865005,0.06463046],"study_design_scores_gemma":[0.00581209,0.002042253,0.10719208,0.00090288225,0.00044849992,0.0011228629,0.00755917,0.011312426,0.03907305,0.04950331,0.7678251,0.0072062435],"about_ca_topic_score_codex":0.00001529611,"about_ca_topic_score_gemma":0.000007688201,"teacher_disagreement_score":0.5891751,"about_ca_system_score_codex":0.000004638255,"about_ca_system_score_gemma":0.0000044866856,"threshold_uncertainty_score":0.6949276},"labels":[],"label_agreement":null},{"id":"W2024356427","doi":"10.1023/b:desi.0000029217.97956.26","title":"The Lovász Local Lemma and Its Applications to some Combinatorial Arrays","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Lakehead University; University of Waterloo","funders":"","keywords":"Lemma (botany); Probabilistic logic; Set (abstract data type); Hash function; Cover (algebra); Discrete mathematics; Mathematics; Combinatorics; Computer science; Theoretical computer science","score_opus":0.012036355856310578,"score_gpt":0.21135189421678455,"score_spread":0.19931553836047397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024356427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3713419,0.010041061,0.61407644,0.00029458143,0.00074786064,0.0012329617,0.000041247502,0.00044192432,0.001781985],"genre_scores_gemma":[0.998935,0.0004206399,0.00024717566,0.0000571849,0.00012168753,0.00019081282,0.0000030139522,0.000020592941,0.000003895406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928504,0.000028663175,0.0001630951,0.00017333867,0.00010491249,0.00024497107],"domain_scores_gemma":[0.99954265,0.000086347274,0.000018098754,0.00017141136,0.000027752081,0.000153715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018765226,0.000154485,0.00014395581,0.0000924764,0.00033968757,0.00010931145,0.0001287912,0.0000709345,0.0000022563506],"category_scores_gemma":[0.0000039462934,0.000121380246,0.000058066853,0.00030748453,0.000103497216,0.000087528504,0.000019968089,0.000106413056,0.000012274039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017620217,0.000019061976,0.00006428486,0.00003922073,0.000055875225,0.000001608938,0.0002838617,0.0013189445,0.004648384,0.98947173,0.00015682216,0.003922558],"study_design_scores_gemma":[0.002076022,0.00039910286,0.0011404486,0.00011252187,0.000097076976,0.000051075476,0.0016297614,0.0012997211,0.015959887,0.8628809,0.11341878,0.0009347469],"about_ca_topic_score_codex":0.00000699028,"about_ca_topic_score_gemma":0.000008651508,"teacher_disagreement_score":0.6275931,"about_ca_system_score_codex":0.000008985182,"about_ca_system_score_gemma":0.0000068261143,"threshold_uncertainty_score":0.4949743},"labels":[],"label_agreement":null},{"id":"W2027722985","doi":"10.1007/s10623-009-9352-5","title":"Practical unconditionally secure two-channel message authentication","year":2010,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Advanced Authentication Protocols Security","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":"Computer science; Cryptography; Hash function; Authentication (law); Message authentication code; Channel (broadcasting); Generalization; Security parameter; Theoretical computer science; Wireless; Scheme (mathematics); Computer network; Computer security; Mathematics; Telecommunications","score_opus":0.025413137034956502,"score_gpt":0.31728876607246465,"score_spread":0.29187562903750813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027722985","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.0062869904,0.00002637964,0.9897103,0.0016431197,0.00016610895,0.0012214344,0.00001354471,0.00020999013,0.00072217785],"genre_scores_gemma":[0.76004285,0.000008838228,0.23895654,0.0002958086,0.000051067313,0.0006057249,0.000014761123,0.00001049578,0.000013922133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985689,0.00009036425,0.00024876863,0.0004971275,0.0003188135,0.00027602844],"domain_scores_gemma":[0.99871355,0.00021078729,0.00015117189,0.0005576171,0.0001802688,0.0001866095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040179308,0.00018163265,0.00015288341,0.00017653915,0.00027982245,0.00026230328,0.00039139562,0.000095402975,0.00006746834],"category_scores_gemma":[0.00007930497,0.00017040149,0.0000864842,0.0004755749,0.00020722784,0.00080449414,0.00012455528,0.00033379628,0.000027325215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065960467,0.00012629967,0.00024293172,0.000012703014,0.000019314048,0.0000054921156,0.00041585614,0.0000036393615,0.01174108,0.9857116,0.00019743518,0.0015170708],"study_design_scores_gemma":[0.00055590365,0.00008000962,0.0035030183,0.000015036603,0.000020212763,0.00006691155,0.00005599293,0.016437443,0.0045556473,0.9715906,0.0028148831,0.00030433404],"about_ca_topic_score_codex":0.000004068972,"about_ca_topic_score_gemma":0.000014705798,"teacher_disagreement_score":0.75375587,"about_ca_system_score_codex":0.0000065452314,"about_ca_system_score_gemma":0.00006223252,"threshold_uncertainty_score":0.6948771},"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":"W2031189409","doi":"10.1007/s10623-011-9550-9","title":"Improved distinguishers for HC-128","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptographic Implementations and Security","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 Ottawa","funders":"","keywords":"Keystream; Stream cipher; Computer science; Cryptanalysis; Block cipher; Cryptography; Block (permutation group theory); Algorithm; Mathematics; Arithmetic; Combinatorics","score_opus":0.06587416371629709,"score_gpt":0.27297986656915246,"score_spread":0.20710570285285537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031189409","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.023835598,0.00021516885,0.9736679,0.00007233236,0.00018155696,0.0004009287,0.000023615677,0.00015018933,0.0014526938],"genre_scores_gemma":[0.70138294,0.000048724,0.29817703,0.00022132533,0.00003291566,0.00011221304,0.000009408434,0.00001002246,0.0000054118987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988812,0.000036481943,0.00023344815,0.00039230497,0.00010668027,0.0003498488],"domain_scores_gemma":[0.9992366,0.00009632021,0.00008729322,0.00033780013,0.000108092274,0.0001339199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002976846,0.0001686711,0.00016853877,0.00022231984,0.000334428,0.00017648737,0.00038059856,0.000053983465,0.000024387513],"category_scores_gemma":[0.000020162017,0.0001528188,0.0001632204,0.000519723,0.0001147093,0.00024637903,0.0000787547,0.000068843416,7.750871e-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.00003764681,0.00017200873,0.008071685,0.000043687258,0.000097129225,0.0000039688643,0.004057956,2.1350004e-7,0.0016135531,0.9287056,0.0014675522,0.055729043],"study_design_scores_gemma":[0.0066808346,0.0033887688,0.06580535,0.000082782506,0.00025760883,0.00006572565,0.0034563998,0.043163594,0.009373981,0.7932344,0.07175198,0.002738568],"about_ca_topic_score_codex":0.00013249654,"about_ca_topic_score_gemma":0.000059882368,"teacher_disagreement_score":0.67754734,"about_ca_system_score_codex":0.0000046125383,"about_ca_system_score_gemma":0.0000210709,"threshold_uncertainty_score":0.623177},"labels":[],"label_agreement":null},{"id":"W2033154378","doi":"10.1007/s10623-010-9481-x","title":"On the complexity of the herding attack and some related attacks on hash functions","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":49,"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":"Herding; Hash function; Computer science; Theoretical computer science; Computational complexity theory; Discrete mathematics; Mathematics; Algorithm; Computer security","score_opus":0.10930816950440699,"score_gpt":0.2494344636524989,"score_spread":0.1401262941480919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033154378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96246594,0.00040142497,0.030528817,0.001315866,0.0004078872,0.00040329574,0.000011569702,0.00011974383,0.0043454384],"genre_scores_gemma":[0.9977066,0.00008339289,0.0015653183,0.00058890873,0.000021730384,0.000010708011,8.554434e-7,0.0000101036285,0.000012400963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987882,0.00021804248,0.00021317584,0.00032133085,0.00022284061,0.0002364299],"domain_scores_gemma":[0.9987365,0.00038623472,0.00013096716,0.0006300395,0.00004963251,0.00006662607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029818228,0.00017189453,0.00018205425,0.00010304585,0.00049530657,0.0000910325,0.00050674164,0.000091326685,0.000023455998],"category_scores_gemma":[0.00002086232,0.000102341444,0.00012230946,0.0005523274,0.0007901505,0.00013412851,0.00015833948,0.00029265074,0.0000045695656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023887313,0.00010061027,0.0029846164,0.000010046406,0.00007445517,0.0000019943373,0.0018047618,0.000098283715,0.00024344941,0.9910134,0.0018530781,0.0017914367],"study_design_scores_gemma":[0.0015932642,0.0015200119,0.17828283,0.0005657751,0.00014140875,0.00006716447,0.0011696832,0.072832175,0.004841279,0.73623323,0.0017186726,0.0010344788],"about_ca_topic_score_codex":0.000034734243,"about_ca_topic_score_gemma":0.000013914316,"teacher_disagreement_score":0.2547801,"about_ca_system_score_codex":0.00000676062,"about_ca_system_score_gemma":0.0000097219545,"threshold_uncertainty_score":0.41733631},"labels":[],"label_agreement":null},{"id":"W2034630642","doi":"10.1007/s10623-003-6737-8","title":"A Family of Complete Caps in PG (n, 2)","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Finite Group Theory Research","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Cardinality (data modeling); Combinatorics; Mathematics; Sequence (biology); Dimension (graph theory); Discrete mathematics; Projective test; Pure mathematics; Computer science","score_opus":0.14005697547140997,"score_gpt":0.34096175046311966,"score_spread":0.2009047749917097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034630642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98154926,0.00067415676,0.011532895,0.000083786836,0.000014904824,0.00028387716,0.00003516973,0.000037943682,0.0057880078],"genre_scores_gemma":[0.9632439,0.0001338272,0.036448754,0.00007899575,0.000026244554,0.000023545397,0.0000036433191,0.000020082989,0.0000210197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882215,0.00015052265,0.00031295695,0.00019963227,0.00022902834,0.00028572138],"domain_scores_gemma":[0.999008,0.00052455417,0.00006910232,0.00026189777,0.00006150592,0.00007495889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000673152,0.00013537938,0.00029601972,0.00040960594,0.00004765193,0.000023324385,0.00017481176,0.00007102707,0.00006186254],"category_scores_gemma":[0.00006426646,0.00012195419,0.0000915874,0.0005239704,0.0002120887,0.000075451324,0.000052434443,0.0001550569,0.0000069525454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023888088,0.00050740514,0.02580121,0.000321331,0.00010188251,0.000018930352,0.0022064194,0.000013895159,0.067427345,0.8874696,0.0024068167,0.013486309],"study_design_scores_gemma":[0.0031446945,0.00069059123,0.04484157,0.00029018146,0.000063430096,0.000024112072,0.0020674237,0.0027641412,0.00510198,0.9312993,0.009002508,0.0007100326],"about_ca_topic_score_codex":0.000048940412,"about_ca_topic_score_gemma":0.00008254629,"teacher_disagreement_score":0.062325366,"about_ca_system_score_codex":0.000009789564,"about_ca_system_score_gemma":0.000016554945,"threshold_uncertainty_score":0.49731472},"labels":[],"label_agreement":null},{"id":"W2034670354","doi":"10.1007/s10623-009-9349-0","title":"Codes with girth 8 Tanner graph representation","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Error Correcting Code Techniques","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":"Girth (graph theory); Tanner graph; BCH code; Mathematics; Combinatorics; Discrete mathematics; Low-density parity-check code; Graph; Block code; Linear code; Algorithm; Decoding methods","score_opus":0.022173682511064947,"score_gpt":0.2638585864305356,"score_spread":0.24168490391947067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034670354","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.07062017,0.0003375628,0.9244628,0.00049342285,0.000059122158,0.00024678808,0.0000020438497,0.0008429644,0.0029351332],"genre_scores_gemma":[0.76376194,0.000120563986,0.23558356,0.0004607584,0.000024236077,0.000020243166,0.000003385405,0.000009522502,0.00001580545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985348,0.00010245259,0.00020545094,0.00054350233,0.0002948214,0.00031899186],"domain_scores_gemma":[0.99897707,0.00010106563,0.00011738654,0.0005589814,0.0001255263,0.00012000189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026678658,0.00022244426,0.00022603646,0.00038420586,0.0002359477,0.0002866742,0.00044893817,0.00007468884,0.000004311449],"category_scores_gemma":[0.00001621201,0.00017929522,0.00009118108,0.0012614463,0.000111607995,0.0005041404,0.000047566387,0.00015613413,0.00000200396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001879515,0.00044726575,0.064212985,0.00004073743,0.00016330405,0.00015177281,0.003832323,0.00015343732,0.031575803,0.5651297,0.008325597,0.32577914],"study_design_scores_gemma":[0.0026205224,0.0069743674,0.2186074,0.00047918322,0.00018282082,0.0006040921,0.0009305266,0.019079652,0.11177982,0.6295766,0.0059827524,0.003182253],"about_ca_topic_score_codex":0.0000521241,"about_ca_topic_score_gemma":0.000028369632,"teacher_disagreement_score":0.69314176,"about_ca_system_score_codex":0.000008281738,"about_ca_system_score_gemma":0.000020874577,"threshold_uncertainty_score":0.7311447},"labels":[],"label_agreement":null},{"id":"W2034819091","doi":"10.1007/s10623-015-0037-y","title":"On tight bounds for binary frameproof codes","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"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":"Alphabet; Combinatorics; Binary number; Permutation (music); Mathematics; Hash function; Binary code; Degree (music); Discrete mathematics; Permutation matrix; Physics; Arithmetic; Computer science","score_opus":0.0312588281043503,"score_gpt":0.2366463420175295,"score_spread":0.2053875139131792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034819091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8121378,0.0053052623,0.1682822,0.00006261375,0.00089362985,0.0007885262,0.00012145843,0.0007123159,0.0116962],"genre_scores_gemma":[0.9974399,0.00007022576,0.0020602937,0.00009386167,0.000089159,0.0001452121,0.00002313006,0.000040565126,0.000037644517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910617,0.000047324458,0.00019042485,0.00022292799,0.00013781933,0.00029533924],"domain_scores_gemma":[0.9993592,0.00014255462,0.000028408585,0.000231133,0.00005215006,0.00018655033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033923145,0.00021832231,0.00025044865,0.00022621783,0.0001264459,0.00009533212,0.00012660559,0.00012886926,0.000013180674],"category_scores_gemma":[0.000014924836,0.00019131397,0.00013371042,0.00028305672,0.000099555975,0.000096293115,0.000011176606,0.00011119889,0.000009633887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000513768,0.0002232341,0.003339932,0.0005093018,0.00052172056,0.000023160377,0.0021270202,0.0042901305,0.012698757,0.8997178,0.066861674,0.009173503],"study_design_scores_gemma":[0.004124742,0.0032586493,0.0018317393,0.00038831885,0.00021543975,0.00004832215,0.0019626934,0.029566282,0.0127868755,0.7547005,0.1891887,0.0019277574],"about_ca_topic_score_codex":0.000004780466,"about_ca_topic_score_gemma":0.0000040185023,"teacher_disagreement_score":0.18530211,"about_ca_system_score_codex":0.00001014756,"about_ca_system_score_gemma":0.000009848928,"threshold_uncertainty_score":0.7801557},"labels":[],"label_agreement":null},{"id":"W2038828464","doi":"10.1007/s10623-007-9101-6","title":"On τ-adic representations of integers","year":2007,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Residue Arithmetic","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; Base (topology); Mathematics; Representation (politics); Computation; Key (lock); Hamming code; Arithmetic; Hamming distance; Hamming weight; Cryptography; Discrete mathematics; Elliptic curve; Computer science; Algorithm; Pure mathematics; Mathematical analysis","score_opus":0.016921586223117943,"score_gpt":0.26685874590883013,"score_spread":0.24993715968571217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038828464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106846154,0.00044959874,0.88707584,0.00013542113,0.00011710039,0.0001327483,0.0000031250352,0.00007797265,0.005162019],"genre_scores_gemma":[0.949586,0.00012496448,0.050072934,0.00017963581,0.000015903055,0.000005753361,0.0000017683707,0.0000063504467,0.000006718566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890727,0.000049197555,0.0002548927,0.0003092961,0.00022759174,0.00025174758],"domain_scores_gemma":[0.99891573,0.0003999572,0.00009152762,0.00040116816,0.00006875686,0.00012283781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044076802,0.00013018935,0.00016513206,0.0006397136,0.0001429853,0.000059609003,0.00033864236,0.000062224164,0.000011170849],"category_scores_gemma":[0.000026231233,0.000109794106,0.00015588915,0.0012283897,0.00022651395,0.00014446671,0.000055835662,0.000118279,0.0000027228114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032207834,0.0001440974,0.0064663356,0.000024155153,0.00006440783,0.000018753884,0.00072898937,0.000042794167,0.004477336,0.9595055,0.000544416,0.027951038],"study_design_scores_gemma":[0.002328863,0.002125875,0.25872883,0.0002602986,0.000112500864,0.00009512925,0.0015669246,0.003471343,0.06838949,0.65806705,0.0036854183,0.001168316],"about_ca_topic_score_codex":0.000046179783,"about_ca_topic_score_gemma":0.000013002574,"teacher_disagreement_score":0.8427398,"about_ca_system_score_codex":0.0000036998063,"about_ca_system_score_gemma":0.000014665276,"threshold_uncertainty_score":0.44772735},"labels":[],"label_agreement":null},{"id":"W2040765034","doi":"10.1007/s10623-009-9342-7","title":"NTRU over rings beyond $${\\mathbb{Z}}$$","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":26,"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":"","keywords":"NTRU; Cryptosystem; Lattice (music); Eisenstein integer; Mathematics; Lattice problem; Discrete mathematics; Pure mathematics; Combinatorics; Physics; Cryptography; Algorithm; Algebraic number; Mathematical analysis","score_opus":0.011912492673488161,"score_gpt":0.23611152333174534,"score_spread":0.2241990306582572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040765034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110892534,0.0019936827,0.8793658,0.0005935184,0.00019748797,0.00024992597,0.00003331511,0.00045456825,0.0062191435],"genre_scores_gemma":[0.8913442,0.0004926417,0.10577557,0.0022595203,0.000085169915,0.000012002699,0.000016184224,0.000010596813,0.000004152124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820375,0.000065723674,0.0002759438,0.0006321879,0.00032688896,0.00049548637],"domain_scores_gemma":[0.99878657,0.000091465285,0.00009534963,0.0007095248,0.00005868623,0.0002584073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003191418,0.00028635992,0.0002802729,0.00040251436,0.00033542464,0.00050321565,0.0007214269,0.0001196867,0.000034222336],"category_scores_gemma":[0.000012086962,0.00026096747,0.00021436796,0.001156169,0.00014158848,0.00085077644,0.00012755409,0.00020488752,0.000010322786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017640323,0.00013427954,0.0034125654,0.000011441364,0.000029665682,0.000023248367,0.00051003514,0.0000015902014,0.0020152018,0.95132166,0.0037644666,0.0387582],"study_design_scores_gemma":[0.0013244707,0.00074299035,0.12382324,0.000053156946,0.000049896047,0.00008013084,0.00009822462,0.002903406,0.0021269398,0.81315666,0.054580208,0.0010606968],"about_ca_topic_score_codex":0.00002708169,"about_ca_topic_score_gemma":0.000008443016,"teacher_disagreement_score":0.78045166,"about_ca_system_score_codex":0.0000062532745,"about_ca_system_score_gemma":0.000020597861,"threshold_uncertainty_score":0.99998426},"labels":[],"label_agreement":null},{"id":"W2042048765","doi":"10.1007/s10623-003-6739-6","title":"Resolvable Maximum Packings with Quadruples","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"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":"Combinatorics; Mathematics; Partition (number theory); Block (permutation group theory); Type (biology); Group (periodic table); Physics","score_opus":0.00945934874243578,"score_gpt":0.18325039145913236,"score_spread":0.17379104271669657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042048765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.897634,0.005409349,0.07624368,0.000086445725,0.00011079377,0.0002981781,0.000019869085,0.0007361119,0.019461561],"genre_scores_gemma":[0.9942474,0.0002631584,0.0052345376,0.000069457434,0.00007971695,0.00003470914,0.0000053592494,0.00003557124,0.000030111452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991935,0.000031273517,0.00016033843,0.00018736215,0.0001241909,0.00030337187],"domain_scores_gemma":[0.9995974,0.000043480013,0.000024757863,0.00020110184,0.000024977595,0.00010832014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017155365,0.00019645703,0.00019704054,0.00017215172,0.0001299115,0.00009177782,0.000103413724,0.000072651776,0.000051591633],"category_scores_gemma":[0.0000017733654,0.00015841855,0.00006846948,0.0003390016,0.00009861612,0.00016121267,0.0000095512405,0.00011148915,0.000014213566],"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.00066847773,0.00040549733,0.08110307,0.0012975762,0.0017775497,0.00013412228,0.009531261,0.022414625,0.08411877,0.61997193,0.029441364,0.14913578],"study_design_scores_gemma":[0.0048876125,0.0014022547,0.017873194,0.00089996675,0.00040961115,0.00044457297,0.0059236446,0.021188915,0.052409224,0.07144512,0.81897247,0.0041434085],"about_ca_topic_score_codex":0.000013435196,"about_ca_topic_score_gemma":0.00004270968,"teacher_disagreement_score":0.7895311,"about_ca_system_score_codex":0.000006189438,"about_ca_system_score_gemma":0.0000043022937,"threshold_uncertainty_score":0.64601207},"labels":[],"label_agreement":null},{"id":"W2042786892","doi":"10.1007/s10623-003-6740-0","title":"A Recursive Construction for New Symmetric Designs","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Central Michigan University","keywords":"Integer (computer science); Prime (order theory); Mathematics; Construct (python library); Combinatorics; Prime power; Discrete mathematics; Computer science","score_opus":0.02292562942737984,"score_gpt":0.2237173399532567,"score_spread":0.20079171052587688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042786892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09243771,0.0051839896,0.89773035,0.0000713178,0.00040484185,0.00065786915,0.000036424786,0.0004046895,0.0030728017],"genre_scores_gemma":[0.9517672,0.00042913642,0.047276497,0.000063339714,0.00029589204,0.000082825485,0.000012622475,0.00003783626,0.00003464805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914825,0.000037347658,0.00022078223,0.00020745637,0.00009298844,0.000293173],"domain_scores_gemma":[0.9994635,0.0001418333,0.000040300387,0.0001522995,0.000042034604,0.00016002619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018689904,0.00019681663,0.00022324453,0.00041794384,0.00013749278,0.00007305324,0.00009479836,0.000114910596,0.000026632059],"category_scores_gemma":[0.000013596635,0.00019290151,0.00015332295,0.0006376639,0.00007381522,0.00015343264,0.0000065247395,0.00009063707,0.0000074958275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013024165,0.00005055336,0.0015253269,0.00020712499,0.0003958364,0.0000028976729,0.0010055064,0.0016986068,0.01345196,0.7428806,0.014341342,0.22431004],"study_design_scores_gemma":[0.007287496,0.00165198,0.0031914883,0.0004603309,0.0007806233,0.00040771486,0.003904022,0.022149267,0.07117105,0.49409527,0.39158988,0.0033108795],"about_ca_topic_score_codex":0.0000073513324,"about_ca_topic_score_gemma":0.000008327689,"teacher_disagreement_score":0.8593295,"about_ca_system_score_codex":0.000014003408,"about_ca_system_score_gemma":0.000011963204,"threshold_uncertainty_score":0.78662956},"labels":[],"label_agreement":null},{"id":"W2043233494","doi":"10.1007/s10623-007-9166-2","title":"On the existence of nearly Kirkman triple systems with subsystems","year":2008,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Shanghai Jiao Tong University","keywords":"Embedding; Combinatorics; Mathematics; Triple system; Discrete mathematics; Computer science; Pure mathematics; Artificial intelligence","score_opus":0.023992949675428484,"score_gpt":0.1781646385760412,"score_spread":0.15417168890061272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043233494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9789255,0.0023162446,0.012160277,0.000009134106,0.00022490488,0.00046532135,0.000020841415,0.0001516842,0.0057260706],"genre_scores_gemma":[0.9995482,0.00015262049,0.0000979051,0.000015682248,0.000035202927,0.00008332894,0.0000024617439,0.000027860591,0.000036766498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989582,0.00012389585,0.0002680818,0.00018087996,0.0002313402,0.00023765047],"domain_scores_gemma":[0.99926543,0.00018684873,0.00007048138,0.00034664338,0.00005121249,0.000079405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030038907,0.00020645707,0.0003068824,0.00015249182,0.00020234514,0.000044670225,0.00018488201,0.00007100236,0.000007719221],"category_scores_gemma":[0.0000056040712,0.00012630486,0.000096572905,0.0005114556,0.0002424001,0.000075651944,0.000007449905,0.00012770345,0.000004546086],"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.0003206031,0.00014017723,0.02066869,0.000937331,0.0006847008,0.000082059145,0.0048804674,0.0060717086,0.012851927,0.94910336,0.0038904257,0.0003685836],"study_design_scores_gemma":[0.0333411,0.03270042,0.22650199,0.020662302,0.00243815,0.009859485,0.0981055,0.23647794,0.12832409,0.09491095,0.0957453,0.020932786],"about_ca_topic_score_codex":0.0000622051,"about_ca_topic_score_gemma":0.000007112709,"teacher_disagreement_score":0.8541924,"about_ca_system_score_codex":0.000005521166,"about_ca_system_score_gemma":0.00000835181,"threshold_uncertainty_score":0.51505625},"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":"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":"W2045656598","doi":"10.1007/s10623-005-3256-9","title":"Super-simple (ν, 5, 5) Designs","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Beijing Institute For Brain Disorders","keywords":"Simple (philosophy); Computer science; Block (permutation group theory); Hash function; Block code; Arithmetic; Mathematics; Algorithm; Theoretical computer science; Combinatorics; Decoding methods; Programming language","score_opus":0.013824033353011033,"score_gpt":0.19672450476921718,"score_spread":0.18290047141620616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045656598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83441466,0.003794897,0.14471075,0.000015918547,0.00023819692,0.00029005774,0.00004033241,0.00074268546,0.015752474],"genre_scores_gemma":[0.99823225,0.000115204464,0.0013599691,0.00003551362,0.000116588635,0.000044161112,0.000026077927,0.000040439776,0.000029826742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989788,0.000060107122,0.00024234822,0.00021623823,0.00012969862,0.0003728145],"domain_scores_gemma":[0.9995442,0.000083232364,0.000021345099,0.00022524358,0.000026699707,0.00009925244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019973726,0.00023451775,0.00023630547,0.00021618519,0.00016352649,0.00010119049,0.00012769188,0.00010842966,0.00007516444],"category_scores_gemma":[0.0000028793709,0.00022083457,0.00013844516,0.00042041927,0.00010074127,0.0001278001,0.000012794085,0.000112639995,0.00001841448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007382572,0.0002012604,0.060876843,0.00043191502,0.000369193,0.00008063953,0.0008265515,0.0042958646,0.19583377,0.68001175,0.045926154,0.011072215],"study_design_scores_gemma":[0.0038109834,0.00075799465,0.061505303,0.00024031635,0.00039066796,0.00028956524,0.0025904507,0.016212007,0.078047,0.5889865,0.24292941,0.0042397967],"about_ca_topic_score_codex":0.00005917369,"about_ca_topic_score_gemma":0.000036646776,"teacher_disagreement_score":0.19700326,"about_ca_system_score_codex":0.00000710378,"about_ca_system_score_gemma":0.0000047177514,"threshold_uncertainty_score":0.90053725},"labels":[],"label_agreement":null},{"id":"W2046430605","doi":"10.1007/s10623-011-9540-y","title":"On-line secret sharing","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","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":"Secret sharing; Access structure; Secure multi-party computation; Verifiable secret sharing; Homomorphic secret sharing; Shamir's Secret Sharing; Infimum and supremum; Scheme (mathematics)","score_opus":0.07813434218639215,"score_gpt":0.25972917301492143,"score_spread":0.18159483082852929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046430605","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.06057427,0.0003868681,0.9301553,0.000047640668,0.0001564389,0.00014830056,0.00002216117,0.00027737662,0.00823165],"genre_scores_gemma":[0.8977414,0.00019104306,0.10139315,0.00059238396,0.00003602852,0.000020936492,0.000011113465,0.000011578701,0.00000241019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985929,0.00004367429,0.00021091473,0.00058867276,0.0002059067,0.00035790878],"domain_scores_gemma":[0.9988991,0.00006335888,0.0000691883,0.0007194147,0.000046809793,0.00020215553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030222442,0.00021842486,0.00019945732,0.00035030144,0.00023849389,0.0001858053,0.0007784555,0.00008363789,0.00007559709],"category_scores_gemma":[0.0000128214515,0.00019206518,0.00014680583,0.00078683224,0.00012816544,0.00042889136,0.00023538346,0.00017653606,0.00001576363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021580507,0.00012130952,0.0030020275,0.000012683335,0.0000357536,0.000020887486,0.00086402317,0.0000018737037,0.0001848327,0.98799926,0.0005231571,0.007212629],"study_design_scores_gemma":[0.0007626066,0.0008976487,0.012775652,0.00006177522,0.000028237035,0.00003486375,0.000110051034,0.0066054743,0.002608598,0.9726776,0.002776062,0.0006614178],"about_ca_topic_score_codex":0.000057917492,"about_ca_topic_score_gemma":0.000014761571,"teacher_disagreement_score":0.8371671,"about_ca_system_score_codex":0.0000034970967,"about_ca_system_score_gemma":0.000011583076,"threshold_uncertainty_score":0.7832191},"labels":[],"label_agreement":null},{"id":"W2047127803","doi":"10.1007/s10623-005-2140-y","title":"Classification and Constructions of Complete Caps in Binary Spaces","year":2006,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"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":"Simon Fraser University","keywords":"Equivalence (formal languages); Mathematics; Dependency (UML); Combinatorics; Binary number; Projective test; Discrete mathematics; Pure mathematics; Computer science; Arithmetic; Artificial intelligence","score_opus":0.017507920630705602,"score_gpt":0.20007116234668312,"score_spread":0.18256324171597751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047127803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99249405,0.0017930664,0.0035750333,0.0000122972315,0.00005556436,0.00010679784,0.000025465335,0.00005072493,0.001887003],"genre_scores_gemma":[0.9988054,0.00018323422,0.00096176,0.0000028734119,0.000013343988,0.000014288141,0.000009127662,0.0000077831055,0.0000021824587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99954504,0.0000362237,0.00016824488,0.000100793506,0.000047747573,0.00010194782],"domain_scores_gemma":[0.99980396,0.000044092583,0.000028616983,0.00008290165,0.0000146041375,0.000025815249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009612207,0.00008658477,0.00014066693,0.00023976565,0.00004653864,0.000020876934,0.00003253412,0.000048080597,0.0000050864187],"category_scores_gemma":[0.0000011932814,0.00008510583,0.00003085778,0.00028830618,0.00016852241,0.000060751514,0.000005069158,0.000053278174,4.0090362e-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.000020606221,0.0000453017,0.32117045,0.00023967231,0.000047553916,0.0000037874975,0.0003842263,0.0008987405,0.22627217,0.44912252,0.0003430815,0.0014518909],"study_design_scores_gemma":[0.0009230806,0.00012735355,0.9221361,0.00016261727,0.00004940356,0.000051006708,0.0035549712,0.014483649,0.0025064363,0.053009506,0.0025611783,0.00043466623],"about_ca_topic_score_codex":0.000075503114,"about_ca_topic_score_gemma":0.00005141295,"teacher_disagreement_score":0.6009657,"about_ca_system_score_codex":0.0000027363103,"about_ca_system_score_gemma":0.0000022825006,"threshold_uncertainty_score":0.3470515},"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":"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":"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":"W2053695259","doi":"10.1007/s10623-009-9357-0","title":"Anonymity in shared symmetric key primitives","year":2010,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Anonymity; Key (lock); Computer science; Context (archaeology); Set (abstract data type); Scheme (mathematics); Symmetric-key algorithm; Computer security; Theoretical computer science; Internet privacy; Public-key cryptography; Mathematics; Programming language; Encryption; Geography","score_opus":0.016838542394689588,"score_gpt":0.23947193515252987,"score_spread":0.22263339275784028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053695259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5063502,0.00082314835,0.4874297,0.00023722924,0.00032653645,0.00037381414,0.00006611615,0.00025005278,0.0041431645],"genre_scores_gemma":[0.8748908,0.0002298406,0.12456966,0.00021396147,0.000039314797,0.00003105407,0.000015675692,0.000008769989,8.9849016e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99831295,0.0001008877,0.00027419836,0.00062468165,0.0002528601,0.00043442132],"domain_scores_gemma":[0.9987733,0.00024909826,0.00008317386,0.000624942,0.00006814587,0.00020138928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005353629,0.00023461567,0.00026382811,0.0010157163,0.00018928658,0.00039911797,0.00073643005,0.00014703818,0.00003344337],"category_scores_gemma":[0.000065904576,0.00021834414,0.00014420632,0.0027849711,0.00020499827,0.0008339292,0.00022602093,0.00042209117,0.000006154874],"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.000021081358,0.00023795305,0.07215877,0.000025595034,0.00002341943,0.000031669173,0.0006768494,8.0053695e-7,0.0055577434,0.8963926,0.00042580412,0.024447735],"study_design_scores_gemma":[0.0015795568,0.0002937401,0.77977455,0.000049894697,0.00002238921,0.000053337855,0.00016557633,0.004169438,0.0029894917,0.19739777,0.012566217,0.00093803636],"about_ca_topic_score_codex":0.000104917475,"about_ca_topic_score_gemma":0.00025565765,"teacher_disagreement_score":0.7076158,"about_ca_system_score_codex":0.00000436566,"about_ca_system_score_gemma":0.000034273777,"threshold_uncertainty_score":0.8903815},"labels":[],"label_agreement":null},{"id":"W2055253799","doi":"10.1007/s10623-009-9268-0","title":"A generalization of Meshulam’s theorem on subsets of finite abelian groups with no 3-term arithmetic progression","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"Abelian group; Cardinality (data modeling); Mathematics; Combinatorics; Finite set; Discrete mathematics; Additive group; Arithmetic progression; Generalization; Group (periodic table); Physics; Mathematical analysis","score_opus":0.023754865245260878,"score_gpt":0.284586878016114,"score_spread":0.2608320127708531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055253799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96577,0.00033537354,0.031465773,0.000030149291,0.000054715467,0.00042977088,0.000026205797,0.00005046226,0.0018375135],"genre_scores_gemma":[0.96710855,0.0001838465,0.032550484,0.000078846126,0.000029436249,0.000009887456,0.000012878019,0.000019560606,0.00000650572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987988,0.00012498365,0.00033719026,0.00024071892,0.00029826653,0.00020006704],"domain_scores_gemma":[0.9989705,0.00020299785,0.0002770933,0.0003277769,0.0001530238,0.00006859137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028875022,0.00022143431,0.00036137132,0.00030193105,0.00013192493,0.000022328848,0.00014902481,0.000107845466,0.00003056259],"category_scores_gemma":[0.000041318144,0.00014223752,0.00012090462,0.0004047367,0.00025019964,0.00006355837,0.000019963849,0.00009777287,2.5292542e-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.00048819566,0.00027669405,0.0063779047,0.00020156012,0.000099424615,0.0000061523765,0.0012263029,0.000021676216,0.0065925694,0.9762645,0.000098516364,0.008346529],"study_design_scores_gemma":[0.0013245736,0.0028155711,0.017526207,0.00066701276,0.00018359651,0.000013133321,0.00011608081,0.0005843109,0.020502556,0.9558234,0.00006595817,0.00037757223],"about_ca_topic_score_codex":0.0000018078258,"about_ca_topic_score_gemma":0.0000019815973,"teacher_disagreement_score":0.020441048,"about_ca_system_score_codex":0.0000038860344,"about_ca_system_score_gemma":0.000010892074,"threshold_uncertainty_score":0.58002776},"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":"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":"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":"W2063797848","doi":"10.1007/s10623-008-9252-0","title":"On orthogonal generalized equitable rectangles","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptographic Implementations and Security","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":"Lakehead University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Orthogonal array; Discrete mathematics; Statistics","score_opus":0.029300659011295752,"score_gpt":0.2815478909078108,"score_spread":0.25224723189651505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063797848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29157692,0.00065631594,0.70378745,0.0007844735,0.00011730035,0.00021635542,0.000014469262,0.0002057944,0.002640929],"genre_scores_gemma":[0.9232642,0.00025627922,0.07471038,0.0016865574,0.00003668585,0.000017875964,0.000013804141,0.0000063002053,0.000007902431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985785,0.00008713056,0.00023015491,0.00041063828,0.00026489838,0.0004286624],"domain_scores_gemma":[0.9992654,0.00010283813,0.00006792349,0.0003629826,0.00006105265,0.00013980675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003347292,0.00019021252,0.00019490489,0.0003594466,0.00040664195,0.00030620024,0.00034120167,0.000057810896,0.000051727347],"category_scores_gemma":[0.000008629346,0.00016586536,0.00014106759,0.0008835077,0.000061095394,0.0002658675,0.000053410076,0.00010931669,0.000004493356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019348183,0.00010237775,0.00064197386,0.0000031374577,0.000021079226,0.000009006544,0.0002450074,0.000009243225,0.0016942234,0.9554916,0.002339543,0.039423473],"study_design_scores_gemma":[0.0016099246,0.0014778116,0.022080598,0.00003683468,0.000030967996,0.00004051093,0.00012249012,0.004776951,0.0014896555,0.9585662,0.009079223,0.0006888716],"about_ca_topic_score_codex":0.000016652157,"about_ca_topic_score_gemma":0.000015782034,"teacher_disagreement_score":0.6316873,"about_ca_system_score_codex":0.000008057107,"about_ca_system_score_gemma":0.000025301995,"threshold_uncertainty_score":0.6763793},"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":"W2066218472","doi":"10.1023/b:desi.0000029212.52214.71","title":"Constructions for Permutation Codes in Powerline Communications","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":177,"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":"Army Research Office; Deutscher Akademischer Austauschdienst","keywords":"Hamming distance; Permutation (music); Partial permutation; Mathematics; Hamming weight; Hamming code; Discrete mathematics; Combinatorics; Coding theory; Coding (social sciences); Cyclic permutation; Set (abstract data type); Automorphism; Permutation graph; Hamming graph; Block code; Computer science; Algorithm; Symmetric group; Decoding methods; Statistics; Physics","score_opus":0.02147336466098679,"score_gpt":0.2456515097056048,"score_spread":0.224178145044618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066218472","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55332476,0.0027435948,0.4398288,0.00016225239,0.00020627066,0.00065587426,0.0001266305,0.0002889772,0.0026627993],"genre_scores_gemma":[0.97991246,0.00038797245,0.019435842,0.000025494106,0.000017411177,0.00015261487,0.000049712875,0.000016347041,0.0000021676976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943763,0.000031223368,0.00020705012,0.000114904906,0.0000491584,0.00016004185],"domain_scores_gemma":[0.999565,0.0000974201,0.000024262928,0.00022656097,0.00003673497,0.000050000275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016254524,0.00011432519,0.00015082287,0.00024061675,0.00014830916,0.00004202822,0.00011384101,0.0000656997,0.000004864921],"category_scores_gemma":[0.000008007473,0.00011818671,0.00007288098,0.0003476177,0.0001529178,0.000102128055,0.000009542111,0.00008652829,0.0000015598948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002601522,0.000083702536,0.004092077,0.00012060944,0.00009324885,0.0000015603124,0.0017142815,0.007885891,0.012995609,0.9678135,0.00009100553,0.005082492],"study_design_scores_gemma":[0.007300362,0.00053791725,0.020116776,0.00054911344,0.00021835718,0.00017130173,0.0130453445,0.029642783,0.008636417,0.89555925,0.022577172,0.001645201],"about_ca_topic_score_codex":0.000022389318,"about_ca_topic_score_gemma":0.0001519005,"teacher_disagreement_score":0.42658764,"about_ca_system_score_codex":0.000013058344,"about_ca_system_score_gemma":0.000009127113,"threshold_uncertainty_score":0.48195145},"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":"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":"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":"W2071880083","doi":"10.1007/s10623-009-9290-2","title":"Unitary designs and codes","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":107,"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":"Unitary state; Unitary group; Mathematics; Unitary matrix; Product (mathematics); Code (set theory); TRACE (psycholinguistics); Group (periodic table); Special unitary group; Upper and lower bounds; Combinatorics; Inner product space; Circular ensemble; Unit (ring theory); Pure mathematics; Discrete mathematics; Geometry; Computer science; Mathematical analysis; Physics; Quantum mechanics; Mathematical physics","score_opus":0.07906106529969248,"score_gpt":0.31325710142248125,"score_spread":0.23419603612278878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071880083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30011538,0.0005732606,0.68136775,0.00095436105,0.000034728964,0.0005806802,0.000016804783,0.00027183734,0.01608518],"genre_scores_gemma":[0.7456157,0.000276055,0.25321743,0.0007030789,0.000041239193,0.000023447377,0.000013185296,0.00001722339,0.00009260513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899083,0.00008839185,0.0002934983,0.00023444009,0.00018002243,0.0002128057],"domain_scores_gemma":[0.9992063,0.00031124984,0.00008064727,0.00018506615,0.00007589575,0.00014083553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035526243,0.00020116761,0.0002776796,0.00017152204,0.00018302955,0.000117693126,0.000083813145,0.00009861053,0.00011279286],"category_scores_gemma":[0.0001095034,0.00015550862,0.00007316993,0.0002595562,0.00012428187,0.00016601333,0.000015130717,0.00012253012,0.000004714202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021648364,0.00012791713,0.00015437594,0.00006858892,0.000025654012,0.0000024441276,0.000569651,1.6076824e-7,0.0021802767,0.98427474,0.0024646607,0.010109899],"study_design_scores_gemma":[0.00033408462,0.00030631048,0.00096977915,0.00007134994,0.000056535904,0.000022879334,0.00047344956,0.0021630756,0.0018533296,0.99259,0.0009216117,0.00023758838],"about_ca_topic_score_codex":0.0000050351864,"about_ca_topic_score_gemma":0.0000057978264,"teacher_disagreement_score":0.44550034,"about_ca_system_score_codex":0.0000057663665,"about_ca_system_score_gemma":0.000010352165,"threshold_uncertainty_score":0.6341458},"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":"W2079579769","doi":"10.1023/b:desi.0000029220.27696.d0","title":"Nets of Small Degree Without Ovals","year":2004,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degree (music); Construct (python library); Combinatorics; Computer science; Mathematics; Physics; Computer network","score_opus":0.03434175849806045,"score_gpt":0.21365939596047664,"score_spread":0.1793176374624162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079579769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87281394,0.0025421646,0.11827955,0.000009636608,0.0001424196,0.00018495515,0.00001320159,0.00018853105,0.0058256183],"genre_scores_gemma":[0.99400544,0.00019352672,0.005701385,0.000025811483,0.00002325349,0.00001788353,0.000004200622,0.00002366807,0.0000048043844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931735,0.000029037803,0.00021590966,0.00013917167,0.00008923618,0.00020927453],"domain_scores_gemma":[0.9996301,0.00002944365,0.000035810066,0.00018837383,0.000030447422,0.00008582331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017148945,0.00016066912,0.00024270952,0.00017372439,0.000053556243,0.000025037116,0.000109054665,0.00008144738,0.00001648424],"category_scores_gemma":[0.0000034199188,0.00014525028,0.000102260805,0.00027908914,0.00009869944,0.00005637534,0.000010787433,0.0000807938,0.000004208641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018030351,0.0002596626,0.057775542,0.0011709159,0.0010575742,0.000048040496,0.003888672,0.017082766,0.2433544,0.6310944,0.00060863426,0.043479107],"study_design_scores_gemma":[0.010831251,0.0021243026,0.12298741,0.0018716628,0.00070421904,0.00038270783,0.003188066,0.0052546426,0.28584626,0.53426105,0.028220812,0.0043276036],"about_ca_topic_score_codex":0.000030866642,"about_ca_topic_score_gemma":0.00002129128,"teacher_disagreement_score":0.12119154,"about_ca_system_score_codex":0.000004225256,"about_ca_system_score_gemma":0.0000063570615,"threshold_uncertainty_score":0.5923134},"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":"W2082276697","doi":"10.1007/s10623-007-9105-2","title":"Kirkman frames having hole type h u m 1 for small h","year":2007,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Program for New Century Excellent Talents in University; Natural Science Foundation of Zhejiang Province; Memorial University of Newfoundland; National Natural Science Foundation of China","keywords":"Type (biology); Combinatorics; Mathematics; Spectrum (functional analysis); Physics; Quantum mechanics; Geology","score_opus":0.025328448796234578,"score_gpt":0.23075111447154312,"score_spread":0.20542266567530854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082276697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68372047,0.001905812,0.31184462,0.0000063263956,0.0003088303,0.00023575773,0.000012488676,0.00025655032,0.0017091548],"genre_scores_gemma":[0.9930787,0.00008956206,0.00659337,0.00005399043,0.000098433986,0.000020802629,0.00001186228,0.00003326408,0.000020016518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992515,0.00001585046,0.00018362403,0.00016438185,0.0000643564,0.00032028215],"domain_scores_gemma":[0.9995423,0.00013160521,0.000024034167,0.0001562377,0.000040883326,0.00010495038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033477976,0.00016101467,0.00017376822,0.00018945988,0.0001301214,0.000061544706,0.0001033785,0.0000943285,0.000010405783],"category_scores_gemma":[0.000009667392,0.00015348924,0.00010369848,0.00032542495,0.000056653207,0.000059902082,0.000009620609,0.000092329814,0.0000036703989],"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.0006883603,0.00028581644,0.12985171,0.0020896571,0.0012814105,0.00006740579,0.00650374,0.003959878,0.19338083,0.4872079,0.0118640205,0.16281925],"study_design_scores_gemma":[0.005952104,0.002756581,0.20282501,0.0008738009,0.0007625981,0.000117973665,0.008787213,0.022742443,0.103785,0.17205796,0.47338948,0.0059498334],"about_ca_topic_score_codex":0.0000064656783,"about_ca_topic_score_gemma":0.000042845455,"teacher_disagreement_score":0.46152547,"about_ca_system_score_codex":0.0000048365737,"about_ca_system_score_gemma":0.0000031493041,"threshold_uncertainty_score":0.62591094},"labels":[],"label_agreement":null},{"id":"W2083142817","doi":"10.1007/s10623-010-9376-x","title":"Existence of directed BIBDs with block size 7 and related perfect 5-deletion-correcting codes of length 7","year":2010,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Institute For Brain Disorders; Mount Saint Vincent University","keywords":"Alphabet; Mathematics; Combinatorics; Block size; Code (set theory); Block (permutation group theory); Arithmetic; Discrete mathematics; Algorithm; Computer science; Philosophy; Linguistics; Programming language","score_opus":0.008440811014382437,"score_gpt":0.22151810603271468,"score_spread":0.21307729501833225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083142817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99776757,0.00058830966,0.00055049435,0.000013689415,0.000044938046,0.000117832875,0.000009879408,0.000022795357,0.00088447414],"genre_scores_gemma":[0.9916327,0.00023027448,0.008054168,0.000020051142,0.00002535817,0.000004479889,0.000011613154,0.000009626669,0.000011711669],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917626,0.000068754474,0.00021604668,0.0002903902,0.0000819174,0.00016660317],"domain_scores_gemma":[0.9993858,0.00013128658,0.00014721924,0.000151044,0.00012278414,0.00006187669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024476642,0.00014873038,0.0002285907,0.000060019698,0.00009546873,0.000015944997,0.00008728407,0.00015423543,0.0000063063444],"category_scores_gemma":[0.000113014416,0.000105272724,0.0000699047,0.0002573253,0.00035084673,0.000003689981,0.000053190484,0.00013491983,8.399774e-8],"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.00011614738,0.000050685627,0.07703047,0.000037270693,0.00007395784,0.0000011701463,0.000064991706,0.0000039283955,0.9187872,0.0002753897,0.000013022127,0.0035457932],"study_design_scores_gemma":[0.0013336266,0.0033791803,0.15054786,0.00015851516,0.00013870414,0.00018788302,0.00046706758,0.0005254271,0.84128696,0.00072413986,0.0006742435,0.0005764094],"about_ca_topic_score_codex":0.000035117984,"about_ca_topic_score_gemma":0.000022341957,"teacher_disagreement_score":0.07750023,"about_ca_system_score_codex":6.982444e-7,"about_ca_system_score_gemma":0.000015166766,"threshold_uncertainty_score":0.4292897},"labels":[],"label_agreement":null},{"id":"W2085688367","doi":"10.1007/s10623-003-4195-y","title":"Symmetric (4,4)-Nets and Generalized Hadamard Matrices Over Groups of Order 4","year":2005,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Hadamard transform; Mathematics; Order (exchange); Pure mathematics; Combinatorics; Complex Hadamard matrix; Hadamard matrix; Mathematical analysis; Business","score_opus":0.009775038603313631,"score_gpt":0.20490864356431165,"score_spread":0.19513360496099802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085688367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97054404,0.017060434,0.010090744,0.000016461463,0.00009811921,0.00016953258,0.000020180287,0.00012439128,0.0018760945],"genre_scores_gemma":[0.99309844,0.0022686792,0.004464886,0.000050777133,0.000057308403,0.000018308883,0.0000051982456,0.000025378456,0.0000109970715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99913377,0.000054722714,0.00026311263,0.00018359574,0.00013689509,0.00022788519],"domain_scores_gemma":[0.9995725,0.00008342205,0.000050377283,0.00015967927,0.00003574919,0.000098233766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021092896,0.00019452753,0.0002929345,0.00046573684,0.000071653674,0.00005253214,0.0000898602,0.000098996185,0.0000470795],"category_scores_gemma":[0.000005788639,0.00017268512,0.000085946,0.0008687161,0.00008860108,0.00014286394,0.000019070729,0.000082894025,0.000001973965],"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.00031694057,0.0003326663,0.12638123,0.0018212412,0.0016966297,0.00002691634,0.0029155666,0.004749096,0.09384753,0.6438969,0.010481651,0.11353368],"study_design_scores_gemma":[0.019143302,0.002109471,0.34311625,0.0011270916,0.001822889,0.00042421237,0.0028578385,0.15238346,0.05862374,0.10540158,0.3051081,0.007882065],"about_ca_topic_score_codex":0.00002581531,"about_ca_topic_score_gemma":0.000013869407,"teacher_disagreement_score":0.53849524,"about_ca_system_score_codex":0.0000043677496,"about_ca_system_score_gemma":0.0000035100873,"threshold_uncertainty_score":0.7041895},"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":"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":"W208847948","doi":"10.1023/a:1011212922844","title":"The Existence of a Bush-Type Hadamard Matrix of Order 324 and Two New Infinite Classes of Symmetric Designs","year":2001,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Hadamard transform; Mathematics; Order (exchange); Type (biology); Lambda; Block (permutation group theory); Graph; Integer (computer science); Matrix (chemical analysis); Physics; Mathematical analysis; Quantum mechanics; Computer science","score_opus":0.027807764892830402,"score_gpt":0.25404811182113607,"score_spread":0.22624034692830566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W208847948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94804615,0.018363561,0.031106057,0.00001610589,0.0001466588,0.00029686774,0.0000149979305,0.00005892951,0.001950672],"genre_scores_gemma":[0.9917135,0.0050920737,0.003103749,0.000007613521,0.000021925356,0.0000071011336,0.0000019111512,0.000021376769,0.000030734387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888057,0.0000958164,0.0004438995,0.00015947118,0.00018752806,0.000232746],"domain_scores_gemma":[0.9988402,0.00050778413,0.00014126641,0.00026855545,0.00014864774,0.00009354868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039431354,0.00019295712,0.0003777944,0.00037837008,0.00008312223,0.00003279387,0.0001767823,0.00008325639,0.000010904159],"category_scores_gemma":[0.000048923113,0.00014572631,0.000103775485,0.0018947733,0.00027602256,0.00009236582,0.000026667361,0.000104317325,5.554881e-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.0008793261,0.00021226413,0.16735153,0.0018296081,0.0013754757,0.000019186738,0.0026489238,0.003467703,0.16634952,0.61212915,0.0013046656,0.042432636],"study_design_scores_gemma":[0.016888274,0.009348133,0.20664048,0.004491763,0.002825379,0.0006953352,0.01800893,0.03698912,0.16258593,0.4567506,0.078956634,0.005819408],"about_ca_topic_score_codex":0.000113595015,"about_ca_topic_score_gemma":0.00003341971,"teacher_disagreement_score":0.15537855,"about_ca_system_score_codex":0.0000032529674,"about_ca_system_score_gemma":0.000025630892,"threshold_uncertainty_score":0.5942547},"labels":[],"label_agreement":null},{"id":"W2089241088","doi":"10.1007/s10623-015-0071-9","title":"Quantifying the security advantage of password expiration policies","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":46,"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; Canada Research Chairs","keywords":"Password; Expiration; Security policy; Computer security; Computer science; Business; Psychology","score_opus":0.09323440488320062,"score_gpt":0.3056442427337035,"score_spread":0.21240983785050288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089241088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48437455,0.0014677879,0.5113481,0.001120503,0.00023275537,0.00030268656,0.0000069292128,0.00011724273,0.001029417],"genre_scores_gemma":[0.9977296,0.00007063663,0.0019605686,0.00018789573,0.000026308244,0.00001361384,0.0000021531878,0.0000042298275,0.00000501505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990619,0.00015271382,0.00022296843,0.0001765204,0.00023996292,0.0001459351],"domain_scores_gemma":[0.99923915,0.000087485016,0.0001147219,0.00035945332,0.00011666348,0.000082540595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005199988,0.00009670999,0.0001398107,0.00012643925,0.000120021694,0.00016064127,0.00036975348,0.000039098264,0.0000017169988],"category_scores_gemma":[0.000022772107,0.00006697366,0.00006592239,0.0004649375,0.000105285166,0.00026727316,0.00007537359,0.00006519103,0.0000026850948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011703095,0.000094608986,0.02805729,0.000049766168,0.000042513464,0.0000016152431,0.11074001,0.000003085663,0.002539447,0.85381776,0.001124841,0.003517351],"study_design_scores_gemma":[0.004292992,0.0016466329,0.06476484,0.0003659181,0.00018791319,0.00014263697,0.05202861,0.29495388,0.03484748,0.42403334,0.12053955,0.002196187],"about_ca_topic_score_codex":0.000087000204,"about_ca_topic_score_gemma":0.000053279095,"teacher_disagreement_score":0.513355,"about_ca_system_score_codex":0.0000044521607,"about_ca_system_score_gemma":0.000025401278,"threshold_uncertainty_score":0.27311066},"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":"W2093225692","doi":"10.1007/s10623-011-9559-0","title":"Cyclic block designs with block size 3 from Skolem-type sequences","year":2011,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Sequence (biology); Block (permutation group theory); Combinatorics; Type (biology); Mathematics; Extension (predicate logic); Null (SQL); Construct (python library); Discrete mathematics; Computer science; Chemistry","score_opus":0.029368422217057197,"score_gpt":0.20056410939752703,"score_spread":0.17119568718046985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093225692","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9850976,0.002342918,0.0051300856,0.000007215405,0.00024584512,0.00029500795,0.000035498382,0.00048578548,0.006360034],"genre_scores_gemma":[0.99322116,0.00033561193,0.0061813244,0.00005880305,0.000077722485,0.00004309441,0.000007082007,0.000055032913,0.000020161207],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986101,0.000107073,0.0002867032,0.00036665646,0.00019292173,0.00043653927],"domain_scores_gemma":[0.99913913,0.00017672127,0.00006130373,0.00035778363,0.000057022986,0.00020805212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001877406,0.0003677318,0.00036811476,0.000166899,0.00018014343,0.00008547805,0.00024834336,0.00015638319,0.00012470584],"category_scores_gemma":[0.0000083659625,0.00029723157,0.000115565366,0.0006194167,0.00022097911,0.00016371843,0.00001923174,0.00019432836,0.000022465278],"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.0018109621,0.00082401984,0.30088407,0.0008310512,0.0058847643,0.0007105315,0.02722394,0.0031722246,0.5592014,0.08509316,0.0057583316,0.008605531],"study_design_scores_gemma":[0.010031249,0.007859188,0.21697508,0.0023418104,0.002822574,0.00090422307,0.01707322,0.005471343,0.421651,0.27355674,0.029669423,0.011644156],"about_ca_topic_score_codex":0.00018883983,"about_ca_topic_score_gemma":0.000075462056,"teacher_disagreement_score":0.18846358,"about_ca_system_score_codex":0.000007805003,"about_ca_system_score_gemma":0.000014702928,"threshold_uncertainty_score":0.99994797},"labels":[],"label_agreement":null},{"id":"W2094697984","doi":"10.1007/s10623-007-9060-y","title":"There are no Barker arrays having more than two dimensions","year":2007,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"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; Simon Fraser University","keywords":"Mathematics; Combinatorics","score_opus":0.013349359042528756,"score_gpt":0.22509786505139284,"score_spread":0.21174850600886408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094697984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9097877,0.0029498392,0.0764925,0.000014931568,0.00041103488,0.0002386545,0.0000222628,0.00043360778,0.009649422],"genre_scores_gemma":[0.9978074,0.00014810731,0.0017583376,0.00006864139,0.00011505645,0.000018356795,0.0000073581614,0.000048101156,0.000028654487],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988776,0.000046000747,0.00024539218,0.00024270607,0.0001582215,0.00043006978],"domain_scores_gemma":[0.9993134,0.0001141509,0.000045352997,0.0002908306,0.000052218173,0.0001840489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004175933,0.00026125865,0.00025465208,0.00022220393,0.00023132065,0.00007148363,0.00013213133,0.00010568686,0.00005367993],"category_scores_gemma":[0.000007809703,0.00022825997,0.00017002238,0.0003924706,0.00010923534,0.00011496356,0.000020756745,0.00019071143,0.000021560307],"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.0003248416,0.00033854216,0.4485112,0.00081291114,0.0014851511,0.0004524531,0.0065884255,0.0044869427,0.3895995,0.1252012,0.009665358,0.012533472],"study_design_scores_gemma":[0.008438451,0.0009901471,0.63922524,0.0035106034,0.0010214404,0.000538831,0.04076182,0.030113405,0.08538225,0.06976576,0.111449376,0.008802672],"about_ca_topic_score_codex":0.000017631062,"about_ca_topic_score_gemma":0.000048444017,"teacher_disagreement_score":0.30421725,"about_ca_system_score_codex":0.000008004232,"about_ca_system_score_gemma":0.0000035765945,"threshold_uncertainty_score":0.9308171},"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":"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":"W2134442222","doi":"10.1007/s10623-012-9729-8","title":"Group divisible designs in MOLS of order ten","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Camosun College; University of Victoria","funders":"","keywords":"Counterexample; Conjecture; Mathematics; Dimension (graph theory); Argument (complex analysis); Group (periodic table); Order (exchange); Combinatorics; Rank (graph theory); Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.020743893246600247,"score_gpt":0.22038179602817734,"score_spread":0.1996379027815771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134442222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91055036,0.0050766817,0.08010442,0.0000048763522,0.00019093961,0.00027652588,0.000015291223,0.00012906757,0.003651852],"genre_scores_gemma":[0.9968306,0.00022840984,0.0027968963,0.00001712673,0.00003917287,0.000048302772,0.000005921402,0.000027808052,0.000005760747],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99901134,0.000084629784,0.00027630143,0.00013058391,0.0001184707,0.00037869407],"domain_scores_gemma":[0.99954516,0.00009192281,0.000036370362,0.00018982396,0.00002327741,0.0001134548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045292417,0.00018139854,0.00027798067,0.00034095274,0.00004448654,0.00002254463,0.000114737464,0.00010202002,0.00004148815],"category_scores_gemma":[0.0000072851035,0.00016469942,0.0000867274,0.00075543387,0.00007897528,0.00020350504,0.000017432445,0.000111447574,0.000004573402],"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.000079265476,0.00036131154,0.5772551,0.0006522593,0.00030264864,0.000008324197,0.0036205999,0.0010394626,0.12575008,0.28037247,0.00088294264,0.009675588],"study_design_scores_gemma":[0.007187825,0.0013989673,0.73213464,0.0014362884,0.00045742592,0.00013280263,0.008222722,0.009991113,0.08866511,0.12676302,0.018885424,0.004724678],"about_ca_topic_score_codex":0.000031486434,"about_ca_topic_score_gemma":0.0000132186815,"teacher_disagreement_score":0.15487956,"about_ca_system_score_codex":0.000005853067,"about_ca_system_score_gemma":0.0000033302917,"threshold_uncertainty_score":0.6716247},"labels":[],"label_agreement":null},{"id":"W2140685585","doi":"10.1007/s10623-009-9334-7","title":"Comparing two pairing-based aggregate signature schemes","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":53,"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":"Random oracle; Pairing; Bilinear interpolation; Scheme (mathematics); Computer science; Signature (topology); Mathematics; Public-key cryptography; Theoretical computer science; Computer security; Statistics; Encryption; Physics","score_opus":0.026301828463056835,"score_gpt":0.2562259585936287,"score_spread":0.22992413013057184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140685585","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.09319313,0.0030315665,0.90155256,0.00047284094,0.00011282851,0.00021116972,0.000011976131,0.0005088381,0.0009051034],"genre_scores_gemma":[0.8751181,0.00009662929,0.123540945,0.0011515593,0.00005295729,0.000009844878,0.000020380654,0.000008895392,7.268578e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981247,0.000104261795,0.0002771987,0.0006590851,0.00032441758,0.0005103333],"domain_scores_gemma":[0.9987322,0.00011488366,0.00012290907,0.00069788966,0.00008408148,0.00024804065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035979613,0.0003229531,0.0003377491,0.00043521792,0.00038685557,0.00050910574,0.0008041302,0.00010983254,0.000011034509],"category_scores_gemma":[0.000014850462,0.00029550667,0.00019944686,0.0012572674,0.00014851053,0.0005778292,0.00010552651,0.000316153,0.000004782036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006679396,0.00033489842,0.017489143,0.000040822513,0.00006732478,0.000057478286,0.00032930233,0.0001637506,0.0078086145,0.92631036,0.001766701,0.045564804],"study_design_scores_gemma":[0.008410275,0.002569477,0.103627175,0.00067804405,0.00019535204,0.000104861676,0.0001873783,0.22616602,0.04013416,0.5476777,0.066208385,0.0040411754],"about_ca_topic_score_codex":0.000020376929,"about_ca_topic_score_gemma":0.000017814718,"teacher_disagreement_score":0.7819249,"about_ca_system_score_codex":0.000007426365,"about_ca_system_score_gemma":0.000031897882,"threshold_uncertainty_score":0.9999497},"labels":[],"label_agreement":null},{"id":"W2141368734","doi":"10.1007/s10623-012-9770-7","title":"Combinatorial solutions providing improved security for the generalized Russian cards problem","year":2012,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":20,"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":"Alice (programming language); Alice and Bob; Computer science; Set (abstract data type); Characterization (materials science); Theoretical computer science; Computer security; Mathematical economics; Mathematics; Programming language; Physics","score_opus":0.030845778076768953,"score_gpt":0.25751079346635564,"score_spread":0.2266650153895867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141368734","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.0071550948,0.0048494227,0.98405814,0.0006652918,0.0010654379,0.0013449559,0.00013276978,0.00025075575,0.00047813766],"genre_scores_gemma":[0.92323357,0.0002870548,0.075368606,0.00022013158,0.0003851529,0.0004573895,0.000029971963,0.000017189268,9.1788536e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980515,0.00015451701,0.0003041774,0.00043455724,0.00023754011,0.0008176892],"domain_scores_gemma":[0.99854845,0.00032414796,0.00013620139,0.0006435128,0.000088660876,0.00025900736],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011990736,0.00027743084,0.0002741342,0.00018332238,0.0013137661,0.0004625963,0.0007072715,0.00013403878,0.0000054666903],"category_scores_gemma":[0.000026608406,0.00020029643,0.000324049,0.0007884273,0.00021951411,0.0008511721,0.00026392235,0.00020907789,0.0000010780018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036079204,0.00015144238,0.001296695,0.00003998103,0.000092466056,3.1988222e-7,0.0013866109,0.0000011148489,0.0010439982,0.99152356,0.0019378946,0.0024898616],"study_design_scores_gemma":[0.003612769,0.000530446,0.0034578147,0.000045614604,0.0002814211,0.00003527532,0.00044608035,0.02374452,0.0023841904,0.84221125,0.12211784,0.001132805],"about_ca_topic_score_codex":0.00016930769,"about_ca_topic_score_gemma":0.000028103013,"teacher_disagreement_score":0.9160785,"about_ca_system_score_codex":0.000014647705,"about_ca_system_score_gemma":0.00005504035,"threshold_uncertainty_score":0.9999864},"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":"W2168721746","doi":"10.1007/s10623-015-0064-8","title":"Constructions of complex equiangular lines from mutually unbiased bases","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Simon Fraser University","funders":"","keywords":"Equiangular polygon; Mutually unbiased bases; Hermitian matrix; Combinatorics; Conjecture; Mathematics; Set (abstract data type); Norm (philosophy); Product (mathematics); Discrete mathematics; Computer science; Geometry; Pure mathematics; Hilbert space","score_opus":0.21542043138336806,"score_gpt":0.349584259933231,"score_spread":0.13416382854986295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168721746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.578375,0.00042058833,0.41802275,0.00007633442,0.00031103982,0.0004174745,0.00020838284,0.00019659036,0.0019718492],"genre_scores_gemma":[0.6303536,0.00002752594,0.36942172,0.000038849725,0.00008284026,0.000017991151,0.000021606014,0.000027510261,0.000008319858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876475,0.00009268989,0.0004322632,0.00022449432,0.00028125278,0.00020453437],"domain_scores_gemma":[0.9981321,0.0008014911,0.00024040256,0.0003748664,0.00027965952,0.00017147129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018035792,0.00020979001,0.000453969,0.00016417222,0.00008283895,0.000035180292,0.00017037208,0.00008957552,0.000056041783],"category_scores_gemma":[0.0004113191,0.00019078718,0.00012368833,0.00036634487,0.0003267424,0.00010500183,0.00006236121,0.00009236024,0.000002632161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091257534,0.00037775649,0.0017716138,0.00014214298,0.00024538976,0.000012134511,0.0016489131,0.000021050259,0.013352931,0.9761696,0.003468034,0.0026991942],"study_design_scores_gemma":[0.0010756279,0.00019197376,0.00010728955,0.00008768794,0.00014155157,0.000009438393,0.0018408886,0.00066580327,0.0042068837,0.98924255,0.0021910453,0.00023927522],"about_ca_topic_score_codex":0.00004606783,"about_ca_topic_score_gemma":0.000016289972,"teacher_disagreement_score":0.051978633,"about_ca_system_score_codex":0.000010727939,"about_ca_system_score_gemma":0.000041942338,"threshold_uncertainty_score":0.7780075},"labels":[],"label_agreement":null},{"id":"W2471514104","doi":"10.1007/s10623-017-0397-6","title":"Miklós–Manickam–Singhi conjectures on partial geometries","year":2017,"lang":"en","type":"preprint","venue":"Designs Codes and Cryptography","topic":"Finite Group Theory Research","field":"Mathematics","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":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Combinatorics; Pure mathematics","score_opus":0.18387480452785382,"score_gpt":0.385326083372249,"score_spread":0.20145127884439518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471514104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9228767,0.004683,0.044892274,0.0006631628,0.0013041771,0.002568828,0.0006977631,0.0006759452,0.021638144],"genre_scores_gemma":[0.9896412,0.0008852368,0.008220238,0.00016525132,0.0004705494,0.0001910719,0.00007148205,0.00013418103,0.00022080174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966611,0.00034833082,0.00051744096,0.00096573366,0.0007546245,0.0007527544],"domain_scores_gemma":[0.9955457,0.0018009241,0.0004564624,0.0017216272,0.00020934425,0.0002659379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001487921,0.0006854778,0.00096427655,0.0010043688,0.0007285812,0.0010027617,0.0009872862,0.00066260766,0.0002109951],"category_scores_gemma":[0.0010240613,0.00058884145,0.0005047333,0.00025020223,0.0009119444,0.00009005632,0.00079703843,0.0012910503,0.00002807392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001044882,0.0005812658,0.002940328,0.0018170595,0.0012865644,0.00016719727,0.0019438285,0.00003564097,0.0010166903,0.9570224,0.019140085,0.013004032],"study_design_scores_gemma":[0.00075184077,0.00056319934,0.0009685896,0.0005816497,0.00023000968,0.000016826789,0.00018977914,0.00017884625,0.0041658147,0.9823012,0.009158308,0.0008939867],"about_ca_topic_score_codex":0.00007504054,"about_ca_topic_score_gemma":0.00003439701,"teacher_disagreement_score":0.06676448,"about_ca_system_score_codex":0.000031230535,"about_ca_system_score_gemma":0.00011301486,"threshold_uncertainty_score":0.9996563},"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":"W2478399918","doi":"10.1007/s10623-016-0259-7","title":"Twofold triple systems without 2-intersecting Gray codes","year":2016,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Modulo; Vertex (graph theory); Mathematics; Graph; Hamiltonian path; Discrete mathematics","score_opus":0.015457978594454434,"score_gpt":0.2104273174880232,"score_spread":0.19496933889356877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478399918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73863286,0.0044070217,0.24797927,0.000021599355,0.0018109969,0.00051560893,0.000064833446,0.0009561826,0.005611613],"genre_scores_gemma":[0.9989599,0.0002860612,0.00035017796,0.000015876798,0.00016024272,0.00008542734,0.0000033161534,0.000053342097,0.00008564859],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986248,0.00012463715,0.00034527516,0.0002988681,0.00016758809,0.0004388413],"domain_scores_gemma":[0.9992824,0.00015180679,0.00006379435,0.00028938445,0.00004534302,0.0001672541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046024896,0.0002992815,0.00038626083,0.00028420196,0.00017428937,0.0001335276,0.00017204684,0.00012370256,0.000028300296],"category_scores_gemma":[0.000013501912,0.0002057229,0.00016847046,0.00033950852,0.00012219221,0.00019234179,0.000020531383,0.00010847956,0.000018396804],"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.00031554958,0.00015438854,0.18161167,0.0015953134,0.0017323031,0.000052520325,0.003383589,0.0007989133,0.48421296,0.29175553,0.0115445275,0.022842739],"study_design_scores_gemma":[0.03716146,0.0055559687,0.046767954,0.020396998,0.0026037137,0.0027047244,0.05177175,0.07019761,0.21312793,0.13854298,0.38922384,0.021945085],"about_ca_topic_score_codex":0.000038421487,"about_ca_topic_score_gemma":0.000017080696,"teacher_disagreement_score":0.37767932,"about_ca_system_score_codex":0.000015788224,"about_ca_system_score_gemma":0.00000558084,"threshold_uncertainty_score":0.8389136},"labels":[],"label_agreement":null},{"id":"W2507172686","doi":"10.1007/s10623-017-0336-6","title":"Combinatorial repairability for threshold schemes","year":2017,"lang":"en","type":"preprint","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","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":"Lakehead University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheme (mathematics); Set (abstract data type); Event (particle physics); Process (computing); Computer science; Protocol (science); Compromise; Mathematics; Mathematical optimization; Theoretical computer science","score_opus":0.05425319039236241,"score_gpt":0.3014853999421467,"score_spread":0.24723220954978425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507172686","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.025894344,0.0037446013,0.96297526,0.00044038452,0.0028606856,0.0015718404,0.00057863735,0.00058715814,0.0013471041],"genre_scores_gemma":[0.7930609,0.0010250801,0.20441972,0.00019279605,0.00050922664,0.00050670526,0.00024372137,0.000039698596,0.000002167677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670756,0.00010975945,0.0005203467,0.0016399143,0.00041710353,0.0006053302],"domain_scores_gemma":[0.9955123,0.00028710236,0.0004611416,0.003158286,0.00029403562,0.00028710565],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012620189,0.00058967614,0.000776406,0.00036252238,0.00092435186,0.0016013915,0.0024770761,0.00058917893,0.000007003342],"category_scores_gemma":[0.00012786375,0.0005655413,0.00083791744,0.00023770373,0.0005309208,0.0005110737,0.0019388013,0.00065296097,0.0000015456108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008179538,0.0002320955,0.005014166,0.00038979703,0.00018767643,0.0000070155334,0.00026223535,0.0000029828566,0.00008042718,0.9836149,0.0034747743,0.006652105],"study_design_scores_gemma":[0.0009567206,0.00023931875,0.0020270396,0.0001345468,0.00008841293,0.000005393779,0.000019368123,0.0039666453,0.0004822583,0.9595834,0.031731613,0.00076526357],"about_ca_topic_score_codex":0.00007504256,"about_ca_topic_score_gemma":0.000021993006,"teacher_disagreement_score":0.76716655,"about_ca_system_score_codex":0.000017295646,"about_ca_system_score_gemma":0.0001594968,"threshold_uncertainty_score":0.9996796},"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":"W2767022249","doi":"10.1007/s10623-017-0428-3","title":"Unweighted linear congruences with distinct coordinates and the Varshamov–Tenengolts codes","year":2017,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Analytic Number Theory Research","field":"Mathematics","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":"Congruence relation; Hamming code; Bijection, injection and surjection; Class (philosophy); Hamming weight; Ramanujan's sum; Code (set theory)","score_opus":0.052505271860480554,"score_gpt":0.3226394858823445,"score_spread":0.27013421402186394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767022249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9645417,0.00083419756,0.025183799,0.0012242435,0.00004178691,0.0007511566,0.000049125032,0.00010580621,0.0072682006],"genre_scores_gemma":[0.9927354,0.0002958728,0.006541253,0.000053476913,0.00005598247,0.000053525753,0.0000043836067,0.000029698516,0.00023042987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843407,0.0002454994,0.00024152946,0.00037098493,0.00032900568,0.0003789334],"domain_scores_gemma":[0.997137,0.0016418139,0.00022159281,0.0006549983,0.0001837376,0.00016083919],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0012360092,0.00026594635,0.0004628725,0.000103795,0.0013205858,0.00050078105,0.00048220906,0.000083484825,0.00005387549],"category_scores_gemma":[0.0003601476,0.00014154956,0.000092994196,0.00016174641,0.0032193172,0.0001839828,0.00016057341,0.00022547314,0.000003468009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092198484,0.000108372034,0.09664262,0.00016988195,0.00060712785,0.000051012652,0.0009648338,6.380318e-7,0.0002051447,0.89716387,0.00072634296,0.002438151],"study_design_scores_gemma":[0.00487051,0.00040535856,0.022770945,0.00027163333,0.00045764804,0.00010050135,0.0016861709,0.003533128,0.0011158409,0.96267307,0.0014982293,0.00061697897],"about_ca_topic_score_codex":0.00028030717,"about_ca_topic_score_gemma":0.0002740137,"teacher_disagreement_score":0.07387168,"about_ca_system_score_codex":0.000005632896,"about_ca_system_score_gemma":0.000031919193,"threshold_uncertainty_score":0.99997956},"labels":[],"label_agreement":null},{"id":"W2775536822","doi":"10.1007/s10623-018-0499-9","title":"Covers and partial transversals of Latin squares","year":2018,"lang":"en","type":"preprint","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Transversal (combinatorics); Latin square; Cover (algebra); Mathematics; Combinatorics; Square (algebra); Order (exchange); Bar (unit); Discrete mathematics; Physics; Geometry; Mathematical analysis","score_opus":0.024702778303927263,"score_gpt":0.22075161584219583,"score_spread":0.19604883753826857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775536822","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94391924,0.0043579633,0.048727848,0.000009710028,0.00043487284,0.00037437797,0.0002497562,0.00017827818,0.001747929],"genre_scores_gemma":[0.99799794,0.0010134125,0.00079871475,0.000010640054,0.0000798411,0.0000356546,0.000026951304,0.000032991946,0.0000038444336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989472,0.00008705818,0.00032462142,0.00027942433,0.00013965595,0.00022203951],"domain_scores_gemma":[0.99943846,0.00008905352,0.00007679505,0.00025229924,0.0000391442,0.0001042685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025543675,0.00029066642,0.0004618099,0.0003073411,0.000062836305,0.00006171508,0.00012679829,0.00027313095,0.000034203273],"category_scores_gemma":[0.0000050189005,0.00028137222,0.00017634498,0.00018914006,0.00029799403,0.000048700804,0.000042708645,0.0001993177,0.0000014389295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018705603,0.00061767094,0.13663256,0.028033262,0.011087211,0.00011694373,0.048805658,0.0328713,0.18187095,0.5047603,0.018880263,0.034453306],"study_design_scores_gemma":[0.011929567,0.004341111,0.05757946,0.009713042,0.0046648695,0.00011837855,0.011227317,0.10451037,0.24895711,0.46198723,0.07291523,0.012056322],"about_ca_topic_score_codex":0.000028396815,"about_ca_topic_score_gemma":0.000007921992,"teacher_disagreement_score":0.07905309,"about_ca_system_score_codex":0.0000038960757,"about_ca_system_score_gemma":0.000009831998,"threshold_uncertainty_score":0.9999638},"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":"W2797024006","doi":"10.1007/s10623-018-0484-3","title":"Secure simultaneous bit extraction from Koblitz curves","year":2018,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Residue Arithmetic","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":"Randomness; Pseudorandom number generator; Computer science; Cryptography; Elliptic curve cryptography; Algorithm; Theoretical computer science; Mathematics; Encryption; Public-key cryptography; Computer security; Statistics","score_opus":0.015151713538853032,"score_gpt":0.2546843695743034,"score_spread":0.23953265603545038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797024006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083848186,0.008434448,0.90444833,0.0007145346,0.00046013042,0.00028081657,0.000030212788,0.00038793453,0.0013953908],"genre_scores_gemma":[0.9293226,0.0022597893,0.067173295,0.0009526962,0.00022846364,0.000019202716,0.000013202385,0.000016169506,0.0000145495005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829173,0.00012566158,0.0002631563,0.00062083825,0.00031318617,0.00038543905],"domain_scores_gemma":[0.9985637,0.00042082547,0.000111171954,0.00055063877,0.00015901208,0.00019466887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002209699,0.00025617753,0.00024674225,0.0003414725,0.00041215966,0.00029256477,0.00051458145,0.00013339477,0.00007734335],"category_scores_gemma":[0.00003593552,0.0002193935,0.0001748418,0.0011925924,0.00034044852,0.0004298375,0.00011188756,0.00019346502,0.00002846459],"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.00030004757,0.0013845648,0.027908606,0.00045051082,0.0011578598,0.0005303575,0.007393106,0.00008523072,0.07713108,0.33556917,0.03113923,0.51695025],"study_design_scores_gemma":[0.0044722846,0.004592685,0.075546786,0.001971427,0.0006173114,0.00048894546,0.0011121102,0.09494058,0.054453198,0.5213613,0.2354089,0.005034497],"about_ca_topic_score_codex":0.00019664525,"about_ca_topic_score_gemma":0.000084505176,"teacher_disagreement_score":0.8454744,"about_ca_system_score_codex":0.0000061301735,"about_ca_system_score_gemma":0.000026523945,"threshold_uncertainty_score":0.8946607},"labels":[],"label_agreement":null},{"id":"W2799736692","doi":"10.1007/s10623-018-0490-5","title":"Improved bounds on 2-frameproof codes with length 4","year":2018,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Advanced Steganography and Watermarking Techniques","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":"Upper and lower bounds; Alphabet; Combinatorics; Mathematics; Integer (computer science); Infinity; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.016997610066672674,"score_gpt":0.2475740513278008,"score_spread":0.23057644126112814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799736692","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.048332803,0.0001818952,0.9477993,0.0001823609,0.00008706422,0.00026179221,0.000006743995,0.0006313539,0.0025166553],"genre_scores_gemma":[0.7686697,0.00009692527,0.23056126,0.0005297778,0.00006467601,0.00004627298,0.000002682886,0.000015868367,0.000012791201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847007,0.00007390537,0.00019277433,0.0006036205,0.00022600443,0.0004336136],"domain_scores_gemma":[0.9988772,0.00009023064,0.000103157356,0.0006632629,0.00012833904,0.00013780584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002503801,0.00028668964,0.00024990775,0.00034968444,0.00046995783,0.00033491486,0.0005670625,0.000106404405,0.0000046168066],"category_scores_gemma":[0.0000072561247,0.00020932304,0.00009953025,0.0007858856,0.00053793134,0.00040545387,0.00010292206,0.00019100205,0.000002215957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006190523,0.000449157,0.0143961,0.000078363286,0.00031192048,0.000051423238,0.0022663816,0.0000060702537,0.02041397,0.7386622,0.001910177,0.22083518],"study_design_scores_gemma":[0.0035772251,0.023075134,0.014300271,0.0006789071,0.00013973657,0.0002084131,0.00030667768,0.018593611,0.3800623,0.4814929,0.07404865,0.0035161623],"about_ca_topic_score_codex":0.000018364777,"about_ca_topic_score_gemma":0.000016139553,"teacher_disagreement_score":0.7203369,"about_ca_system_score_codex":0.000007764953,"about_ca_system_score_gemma":0.000021830761,"threshold_uncertainty_score":0.8535946},"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":"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":"W2963653441","doi":"10.1007/s10623-019-00622-z","title":"Linked systems of symmetric group divisible designs of type II","year":2019,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; Soochow University","keywords":"Mathematics; Affine transformation; Group (periodic table); Equivalence (formal languages); Type (biology); Orthogonal array; Symmetric group; Combinatorics; Pure mathematics; Physics; Statistics","score_opus":0.01889534089713072,"score_gpt":0.2081665042103435,"score_spread":0.18927116331321278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963653441","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97867817,0.006533706,0.010770406,0.0000013227896,0.0004936373,0.00042128973,0.000027632008,0.000116049545,0.002957807],"genre_scores_gemma":[0.99896723,0.00041252875,0.0005077857,0.0000052693917,0.000027036991,0.000015997874,0.000010851378,0.000032191892,0.000021123977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988579,0.000089498826,0.0004146857,0.00019280247,0.00019424579,0.0002508814],"domain_scores_gemma":[0.99925745,0.00014866285,0.00010516549,0.00031729694,0.000086541455,0.000084882755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003475319,0.00020402434,0.00047914856,0.000596545,0.00005676395,0.000022638771,0.00018521378,0.00012403632,0.000030169474],"category_scores_gemma":[0.000008906605,0.00018408443,0.00014699284,0.0015329779,0.00007679237,0.00010277318,0.00002974118,0.000109529545,0.0000064427495],"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.0002009615,0.00030148865,0.16052032,0.0044222507,0.0011040599,0.000006472632,0.0014575602,0.00937867,0.27777675,0.5403641,0.0009305561,0.0035368307],"study_design_scores_gemma":[0.01914601,0.0259447,0.51462424,0.007889708,0.002677015,0.00025145157,0.012556319,0.20787814,0.10427969,0.061016712,0.033108123,0.010627893],"about_ca_topic_score_codex":0.000035847926,"about_ca_topic_score_gemma":0.000002442845,"teacher_disagreement_score":0.47934738,"about_ca_system_score_codex":0.0000058657815,"about_ca_system_score_gemma":0.0000071942,"threshold_uncertainty_score":0.75067455},"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":"W2981592602","doi":"10.1007/s10623-020-00800-4","title":"Maximal nonassociativity via fields","year":2020,"lang":"en","type":"preprint","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quasigroup; Conjecture; Constructive; Associative property; Mathematics; Character (mathematics); Set (abstract data type); Combinatorics; Field (mathematics); Quadratic equation; Discrete mathematics; Pure mathematics; Computer science; Geometry","score_opus":0.024347394247268093,"score_gpt":0.21747760601648916,"score_spread":0.19313021176922107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981592602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27160275,0.005241644,0.7069705,0.00021474794,0.00162298,0.0007675953,0.00029380762,0.0013015444,0.011984422],"genre_scores_gemma":[0.9973907,0.00044553936,0.0016514076,0.000107844004,0.00020438606,0.000090126974,0.000050151746,0.000052088413,0.000007773685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986597,0.00011626254,0.00029919515,0.00040325054,0.00019014899,0.00033147438],"domain_scores_gemma":[0.9993064,0.000095402305,0.00007743454,0.000308004,0.000035177756,0.00017759413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023528257,0.0004059042,0.00054008776,0.00016455342,0.000108771055,0.00013929862,0.00024884078,0.00048471466,0.000044579425],"category_scores_gemma":[0.000008706939,0.0004157975,0.00033775487,0.00024257028,0.00008045851,0.00005800233,0.00014483403,0.0007252875,0.000012542184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089336076,0.0010841776,0.11747223,0.024956329,0.017692337,0.0010408048,0.03074612,0.03088857,0.0695886,0.41478392,0.09787255,0.192981],"study_design_scores_gemma":[0.0015750005,0.00051098224,0.027604586,0.00081074395,0.0007807867,0.000052244704,0.00070728624,0.07005318,0.006196305,0.8661093,0.021086637,0.004512964],"about_ca_topic_score_codex":0.00003103687,"about_ca_topic_score_gemma":0.00001883797,"teacher_disagreement_score":0.72578794,"about_ca_system_score_codex":0.000014365003,"about_ca_system_score_gemma":0.000012804278,"threshold_uncertainty_score":0.9998294},"labels":[],"label_agreement":null},{"id":"W3004178638","doi":"10.1007/s10623-021-00857-9","title":"A scalable post-quantum hash-based group signature","year":2021,"lang":"en","type":"preprint","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","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":"Hash function; Computer science; Scalability; Group signature; Signature (topology); Computer network; Computer security; Mathematics; Public-key cryptography; Database; Encryption","score_opus":0.019475789153454746,"score_gpt":0.23896928683658733,"score_spread":0.2194934976831326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004178638","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.028136669,0.012139002,0.9562965,0.00063384406,0.0008622861,0.0006304889,0.00039317177,0.00057011656,0.00033793907],"genre_scores_gemma":[0.7433694,0.0010195803,0.2522094,0.0020160927,0.00015138727,0.00016962571,0.0010098566,0.00005285289,0.0000018176216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955095,0.00038924956,0.0005867396,0.0019574738,0.00071388157,0.0008431544],"domain_scores_gemma":[0.9963943,0.00029381778,0.00032630895,0.0021206744,0.00040892,0.00045598048],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006790876,0.00083165267,0.00087695394,0.00089223194,0.0005033207,0.002257915,0.0019203634,0.00086015364,0.00007329553],"category_scores_gemma":[0.000046263896,0.00080440793,0.0008660302,0.001644966,0.00036196428,0.0005873763,0.0015972995,0.0014634415,0.0000051932825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002449951,0.002102989,0.0054587503,0.0016886805,0.00096802565,0.0007693623,0.0022644035,0.00037620403,0.013130838,0.92767096,0.010865241,0.03445956],"study_design_scores_gemma":[0.0082631735,0.003333545,0.04061707,0.0048473724,0.0012975482,0.00028302948,0.0018425472,0.25974113,0.0133251995,0.5960629,0.05730881,0.013077687],"about_ca_topic_score_codex":0.0002626884,"about_ca_topic_score_gemma":0.00011889399,"teacher_disagreement_score":0.71523273,"about_ca_system_score_codex":0.000022006036,"about_ca_system_score_gemma":0.00027119165,"threshold_uncertainty_score":0.99944067},"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":"W3204835119","doi":"10.1007/s10623-022-01096-2","title":"On a class of optimal constant weight ternary codes","year":2022,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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 Lethbridge","funders":"Japan Society for the Promotion of Science; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Ternary operation; Combinatorics; Integer (computer science); Mathematics; Order (exchange); Constant (computer programming); Prime (order theory); Prime power; Matrix (chemical analysis); Physics; Chemistry; Computer science","score_opus":0.010407589298477304,"score_gpt":0.19621618130382187,"score_spread":0.18580859200534458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204835119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97162384,0.0021648614,0.015779186,0.000018134857,0.00030901105,0.00024244956,0.000205996,0.00018914008,0.009467377],"genre_scores_gemma":[0.9990649,0.00012653104,0.0006151071,0.00004963509,0.000020786343,0.000072752155,0.000011880482,0.000025510686,0.000012895408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904484,0.000111547655,0.00024052436,0.0001819431,0.00019895934,0.00022218167],"domain_scores_gemma":[0.9995309,0.00012630862,0.00004857627,0.00020095876,0.000017513856,0.00007575507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024254806,0.00017556809,0.00026389764,0.00026465557,0.0001721867,0.000021888329,0.0001553614,0.000043709966,0.00015818949],"category_scores_gemma":[0.0000025987501,0.00016676224,0.0001400164,0.00035154846,0.00013338012,0.00004575825,0.000036247242,0.00017819545,0.0000018566283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043430476,0.0002517745,0.0067676147,0.000283091,0.00057793595,0.00009713864,0.0016056882,0.024488619,0.053660035,0.9030268,0.0057369936,0.0030700096],"study_design_scores_gemma":[0.015329642,0.014052172,0.01164899,0.0012380427,0.0011052467,0.0013244873,0.028003484,0.2283604,0.1164184,0.34442607,0.2301552,0.007937863],"about_ca_topic_score_codex":0.0000075681605,"about_ca_topic_score_gemma":0.0000013900166,"teacher_disagreement_score":0.5586007,"about_ca_system_score_codex":0.000010069598,"about_ca_system_score_gemma":0.000007794087,"threshold_uncertainty_score":0.68003666},"labels":[],"label_agreement":null},{"id":"W4224286454","doi":"10.1007/s10623-022-01048-w","title":"Sharper bounds on four lattice constants","year":2022,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Constant (computer programming); Upper and lower bounds; Mathematics; Lattice (music); Mathematical analysis; Computer science; Physics","score_opus":0.024357526316692198,"score_gpt":0.20584657018460156,"score_spread":0.18148904386790937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224286454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9595941,0.0018488534,0.005384695,0.00004336771,0.00065047026,0.0002926234,0.00014049068,0.00046089632,0.031584516],"genre_scores_gemma":[0.99925405,0.000073805204,0.00025277297,0.00020959717,0.00003773305,0.000090864385,0.000008859273,0.000029830628,0.00004246662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909574,0.00009899766,0.00016210087,0.0001944071,0.0001878606,0.00026092294],"domain_scores_gemma":[0.9995811,0.00009237357,0.000023841865,0.00019731965,0.00001434221,0.00009105185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027898268,0.00016797923,0.00017688781,0.00021096703,0.00036907214,0.00006954056,0.00013697277,0.0000402281,0.00030291633],"category_scores_gemma":[0.0000034418558,0.00016784524,0.00010079697,0.00040367834,0.00007001409,0.000061322375,0.000028839582,0.00020199173,0.000011150394],"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.00030068532,0.00023821423,0.015988512,0.00027900696,0.00073252036,0.00019878203,0.002685967,0.006211724,0.02023547,0.9185009,0.022123659,0.012504553],"study_design_scores_gemma":[0.0054101925,0.0027040297,0.01945426,0.000256795,0.00038649433,0.00065538386,0.010782948,0.023986919,0.005167294,0.16335516,0.7639222,0.003918288],"about_ca_topic_score_codex":0.0000054072466,"about_ca_topic_score_gemma":0.000002495315,"teacher_disagreement_score":0.7551457,"about_ca_system_score_codex":0.000012348699,"about_ca_system_score_gemma":0.0000060363013,"threshold_uncertainty_score":0.684453},"labels":[],"label_agreement":null},{"id":"W4230766887","doi":"10.1023/a:1016512717269","title":"On Group-Divisible Designs with Block Size Four and Group-Type gum1","year":2002,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Advanced Algebra and Geometry","field":"Mathematics","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":"Memorial University of Newfoundland","funders":"Suzhou University","keywords":"Value (mathematics); Mathematics; Spectrum (functional analysis); Physics; Combinatorics; Statistics; Quantum mechanics","score_opus":0.059694347676069924,"score_gpt":0.265416555905958,"score_spread":0.20572220822988804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230766887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93140453,0.0010248957,0.06377024,0.00016164253,0.00008435946,0.00051035214,0.000016546162,0.00019937502,0.002828079],"genre_scores_gemma":[0.9452842,0.00055892096,0.053562306,0.00033692853,0.00006424494,0.000027840495,0.0000022094225,0.00005770763,0.0001056404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835914,0.000074947406,0.00026652415,0.0005191503,0.00030824842,0.0004719852],"domain_scores_gemma":[0.998094,0.0009670072,0.0001591739,0.00048430552,0.00006927296,0.00022622196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021772628,0.00037963962,0.000419566,0.00022662352,0.0004944735,0.00019097587,0.00018803154,0.00013741617,0.0001486892],"category_scores_gemma":[0.00013960956,0.00029352593,0.00009389291,0.00059216545,0.00025883087,0.00021190662,0.00006578433,0.00023585734,0.000010712623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005305236,0.0010048014,0.02593494,0.00042880772,0.0005414247,0.00017429545,0.000851309,0.000022396514,0.004903888,0.9441678,0.0060618618,0.015377933],"study_design_scores_gemma":[0.003627762,0.0041395277,0.015268947,0.00034308658,0.00033867187,0.00016673464,0.0005306258,0.0008486742,0.0009075283,0.97054124,0.0018942842,0.0013929055],"about_ca_topic_score_codex":0.000005916266,"about_ca_topic_score_gemma":0.000024931902,"teacher_disagreement_score":0.026373435,"about_ca_system_score_codex":0.000008937104,"about_ca_system_score_gemma":0.000004180695,"threshold_uncertainty_score":0.99995166},"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":"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":"W4387616307","doi":"10.1007/s10623-023-01306-5","title":"New quantum codes from self-dual codes over $$\\mathbb {F}_4$$","year":2023,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Quantum Computing Algorithms and Architecture","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear code; Mathematics; Expander code; Discrete mathematics; Block code; Minimum distance; Quantum; Concatenated error correction code; Combinatorics; Physics; Algorithm; Quantum mechanics; Decoding methods","score_opus":0.01668971577279916,"score_gpt":0.24187927839778794,"score_spread":0.2251895626249888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387616307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38657424,0.0011374565,0.6088031,0.00067131396,0.000537115,0.00022525985,0.00008524341,0.0017753094,0.00019096903],"genre_scores_gemma":[0.6636177,0.001016239,0.33336958,0.0010080055,0.0007006532,0.000029266635,0.000113062364,0.00007739175,0.000068154804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972147,0.00017521052,0.0003989331,0.00093005516,0.0005270875,0.00075405504],"domain_scores_gemma":[0.9981448,0.00054857973,0.00014852903,0.00070219074,0.000066766544,0.000389155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041882126,0.0004463735,0.0004901809,0.0004785747,0.00051287265,0.00069586304,0.00080595183,0.00016868518,0.000030399624],"category_scores_gemma":[0.000021565605,0.00038511914,0.0002594874,0.0017296901,0.00011741454,0.00026930164,0.00043807697,0.00033157994,0.000056642653],"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.00013503524,0.00057881227,0.016544105,0.00021757,0.0014660625,0.00080415275,0.01976995,0.005128133,0.023107618,0.51489365,0.1372837,0.2800712],"study_design_scores_gemma":[0.001185841,0.0004236016,0.024423094,0.00014518453,0.000074833304,0.00004126775,0.00022311395,0.796093,0.0011945223,0.14709194,0.028018437,0.0010851548],"about_ca_topic_score_codex":0.00056610594,"about_ca_topic_score_gemma":0.000034803226,"teacher_disagreement_score":0.7909649,"about_ca_system_score_codex":0.000012077597,"about_ca_system_score_gemma":0.00009146321,"threshold_uncertainty_score":0.99986005},"labels":[],"label_agreement":null},{"id":"W4388733982","doi":"10.1007/s10623-023-01322-5","title":"Unconditionally secure non-malleable secret sharing and circular external difference families","year":2023,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Secret sharing; Construct (python library); Theoretical computer science; Relation (database); Computer science; Code (set theory); Scheme (mathematics); Secure multi-party computation; Algebraic number; Computer security; Type (biology); Mathematics; Cryptography; Computer network; Programming language; Data mining","score_opus":0.020179994465163435,"score_gpt":0.23656166278674562,"score_spread":0.21638166832158218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388733982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5402936,0.0008276814,0.4578681,0.00010011146,0.00010013181,0.00015790157,0.00006805685,0.00025162954,0.0003328065],"genre_scores_gemma":[0.97857034,0.0018686306,0.019107241,0.00025921914,0.00005850633,0.000049108425,0.000065197055,0.0000150279475,0.0000067525743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981493,0.000049456416,0.0002444364,0.00075020787,0.0003451231,0.00046147185],"domain_scores_gemma":[0.99899036,0.00013899304,0.00007937623,0.00049561437,0.000070401606,0.00022525982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035609395,0.00027293706,0.0002707812,0.0005499882,0.00046462353,0.00058077666,0.0006293585,0.000110841625,0.000020156338],"category_scores_gemma":[0.000014580584,0.00025540203,0.00013039129,0.0013478685,0.00021945921,0.0005435128,0.00045707653,0.00021092984,0.000008935946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036193276,0.00012182519,0.17469916,0.00028637177,0.00018466194,0.00018109613,0.0034118302,0.00005311005,0.013897711,0.7922838,0.001461617,0.013382649],"study_design_scores_gemma":[0.0010676812,0.0002863122,0.38610885,0.00023098526,0.000048221384,0.000096054806,0.00073529145,0.040624186,0.00069946167,0.56704414,0.0021308132,0.00092800317],"about_ca_topic_score_codex":0.00007738168,"about_ca_topic_score_gemma":0.000029584106,"teacher_disagreement_score":0.43876085,"about_ca_system_score_codex":0.0000055118735,"about_ca_system_score_gemma":0.000027937482,"threshold_uncertainty_score":0.9999898},"labels":[],"label_agreement":null},{"id":"W4389783994","doi":"10.1007/s10623-023-01341-2","title":"Optimal binary and ternary locally repairable codes with minimum distance 6","year":2023,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Advanced Data Storage Technologies","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 British Columbia","funders":"","keywords":"Linear subspace; Combinatorics; Mathematics; Ternary operation; Binary number; Intersection (aeronautics); Code (set theory); Code word; Discrete mathematics; Upper and lower bounds; Disjoint sets; Computer science; Algorithm; Arithmetic; Decoding methods; Pure mathematics","score_opus":0.01800367410080721,"score_gpt":0.23779753718322075,"score_spread":0.21979386308241353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389783994","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.14908095,0.0012964667,0.8474436,0.0003870977,0.00004208179,0.00018827841,0.000038627084,0.0013565947,0.00016632245],"genre_scores_gemma":[0.55722475,0.0012223471,0.44127208,0.00012191208,0.000014760007,0.000058453083,0.00001592549,0.000020660096,0.00004912159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984606,0.000038941733,0.00018462347,0.0006681329,0.0002260146,0.00042172143],"domain_scores_gemma":[0.99894416,0.0001550389,0.000085463325,0.0006606449,0.0000493224,0.000105391846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002033273,0.00024167591,0.0002508398,0.00031973998,0.00027913664,0.00020074286,0.0005623699,0.00008254323,0.000001972278],"category_scores_gemma":[0.000019865787,0.00019511716,0.000042507567,0.0012835342,0.0005285859,0.0006874211,0.0004335555,0.00015397466,0.0000051702204],"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.0009451609,0.0005626373,0.09399788,0.000712104,0.0006491068,0.005384675,0.0031028811,0.0062251952,0.031169409,0.6318565,0.03538453,0.19000994],"study_design_scores_gemma":[0.0063758227,0.010695428,0.08372959,0.0013592227,0.00021621822,0.0012275788,0.0061935293,0.62406904,0.013075719,0.16932584,0.07776465,0.0059673386],"about_ca_topic_score_codex":0.000013664502,"about_ca_topic_score_gemma":0.000010653282,"teacher_disagreement_score":0.61784387,"about_ca_system_score_codex":0.000008973762,"about_ca_system_score_gemma":0.00002406395,"threshold_uncertainty_score":0.79566467},"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":"W4396885387","doi":"10.1007/s10623-024-01414-w","title":"On optimal constant weight codes derived from $$\\omega $$-circulant balanced generalized weighing matrices","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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; University of Lethbridge","funders":"","keywords":"Circulant matrix; Constant (computer programming); Mathematics; Omega; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Physics","score_opus":0.011661370651380275,"score_gpt":0.21187667797458667,"score_spread":0.2002153073232064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396885387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8847915,0.020451333,0.0904638,0.000027527256,0.00091358146,0.00027862718,0.00025792758,0.00088603335,0.0019296926],"genre_scores_gemma":[0.99368894,0.0022695034,0.003586171,0.000068463014,0.0001693707,0.00007436449,0.0000689795,0.000066593006,0.0000075905386],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836427,0.00012502326,0.00037209803,0.00046218673,0.0002377687,0.00043864094],"domain_scores_gemma":[0.99914396,0.0003401696,0.000040361145,0.00027339323,0.000027460237,0.00017464212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002400295,0.0004032589,0.00046367626,0.0003930062,0.00019290565,0.00038338653,0.0001920648,0.00016154589,0.0001111551],"category_scores_gemma":[0.0000058649684,0.00033899792,0.0002415071,0.000542933,0.00013386496,0.00017969156,0.000023153145,0.00024655837,0.000027240465],"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.0003122519,0.00010165501,0.0017983125,0.0007012517,0.002113087,0.00058692816,0.0025396482,0.0070263064,0.49183115,0.48158684,0.003898803,0.0075037437],"study_design_scores_gemma":[0.0075713363,0.0011622927,0.0045169657,0.005442945,0.0016147149,0.00032520792,0.0037284982,0.49610904,0.17312753,0.24457733,0.05478976,0.007034374],"about_ca_topic_score_codex":0.00004641885,"about_ca_topic_score_gemma":0.000007701579,"teacher_disagreement_score":0.48908272,"about_ca_system_score_codex":0.000022515409,"about_ca_system_score_gemma":0.000015659793,"threshold_uncertainty_score":0.9999062},"labels":[],"label_agreement":null},{"id":"W4398183348","doi":"10.1007/s10623-024-01417-7","title":"On duplication-free codes for disjoint or equal-length errors","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"McMaster University","funders":"","keywords":"Disjoint sets; Gene duplication; Computer science; Mathematics; Combinatorics; Genetics; Biology; Gene","score_opus":0.03477657022504555,"score_gpt":0.29394680708308035,"score_spread":0.2591702368580348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398183348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7175771,0.0026694313,0.2768869,0.0005696281,0.0002179723,0.0005721055,0.00018818073,0.00012218682,0.0011964561],"genre_scores_gemma":[0.99259084,0.00031126515,0.0061151674,0.00046387254,0.0001797465,0.00008279688,0.00013716605,0.000019301511,0.00009984019],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990022,0.000040117484,0.00017735468,0.00045730377,0.00007887505,0.00024411459],"domain_scores_gemma":[0.99941945,0.00015470858,0.000034700257,0.00026414404,0.000042696287,0.000084312625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022217623,0.00017941471,0.00015170744,0.00007241482,0.00015146538,0.000096290416,0.00017778431,0.0001335896,0.000016135757],"category_scores_gemma":[0.000101725345,0.00011683962,0.00016275622,0.00016326977,0.00010917493,0.0000034125835,0.00007712977,0.00007332436,0.0000029775183],"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.001339258,0.0003564371,0.0017572274,0.00041982174,0.0005667305,0.000018189281,0.0001887271,0.00016498727,0.62393916,0.23977518,0.038498655,0.09297563],"study_design_scores_gemma":[0.0042018015,0.018980905,0.0076306155,0.0006997182,0.00045990024,0.000100372825,0.0008259919,0.015681976,0.266316,0.18910974,0.49265814,0.0033348366],"about_ca_topic_score_codex":0.000004751382,"about_ca_topic_score_gemma":0.000010759981,"teacher_disagreement_score":0.4541595,"about_ca_system_score_codex":0.000003705983,"about_ca_system_score_gemma":0.000022180066,"threshold_uncertainty_score":0.47645813},"labels":[],"label_agreement":null},{"id":"W4398247717","doi":"10.1007/s10623-024-01418-6","title":"Bounds on data limits for all-to-all comparison from combinatorial designs","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorial design; Combinatorics; Cryptography; Combinatorial algorithms; Discrete mathematics; Algorithm","score_opus":0.09736931338553659,"score_gpt":0.309788310489445,"score_spread":0.2124189971039084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398247717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3849836,0.0122940205,0.58406717,0.00025156557,0.008632878,0.0020817714,0.0025251743,0.0019487062,0.0032151102],"genre_scores_gemma":[0.99579626,0.00013534799,0.0028386689,0.0001782247,0.00039002698,0.00012314976,0.00045231383,0.00007726041,0.000008740517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984097,0.000081102764,0.00034019386,0.00054688513,0.00020494465,0.000417188],"domain_scores_gemma":[0.9985922,0.0005253838,0.000025808487,0.0006072768,0.000028587252,0.00022076735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041585346,0.00032777435,0.00040387234,0.00030478602,0.00013082438,0.00042934564,0.0004558834,0.00016772354,0.000021532842],"category_scores_gemma":[0.000017020577,0.0003077869,0.00014205553,0.00038951923,0.00005616683,0.00018108367,0.00004440526,0.00020321742,0.00003236861],"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.00072582805,0.00036471552,0.0014962504,0.0008317685,0.0031161804,0.00004859588,0.004105917,0.002173473,0.059823915,0.6427585,0.2635549,0.02099999],"study_design_scores_gemma":[0.001975468,0.0016013811,0.0007253378,0.0007141958,0.00071406167,0.000009977715,0.0007519908,0.10394923,0.010304456,0.13535082,0.74219674,0.0017063556],"about_ca_topic_score_codex":0.000029848063,"about_ca_topic_score_gemma":0.000022058644,"teacher_disagreement_score":0.61081266,"about_ca_system_score_codex":0.000015609588,"about_ca_system_score_gemma":0.000013258883,"threshold_uncertainty_score":0.9999374},"labels":[],"label_agreement":null},{"id":"W4399434193","doi":"10.1007/s10623-024-01427-5","title":"On the classification of skew Hadamard matrices of order $$\\varvec{36}$$ and related structures","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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 Lethbridge","funders":"Natural Science Foundation of Anhui Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Skew; Hadamard transform; Order (exchange); Mathematics; Combinatorics; Computer science; Mathematical analysis; Telecommunications; Business","score_opus":0.013674302757528638,"score_gpt":0.21367640397838608,"score_spread":0.20000210122085743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399434193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9779371,0.010537881,0.008238027,0.00004939983,0.00019357345,0.00019668802,0.000029623756,0.00010694217,0.0027107734],"genre_scores_gemma":[0.9989593,0.00068097556,0.00030341922,0.0000066503117,0.000010186807,0.000011834812,0.0000042294487,0.000015447951,0.0000079506435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938816,0.00006549337,0.0002161744,0.00012864538,0.00010430961,0.000097214535],"domain_scores_gemma":[0.9994936,0.00026440804,0.000038187583,0.00014582291,0.000029422088,0.000028532591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022339963,0.00011848255,0.000157572,0.00019894102,0.000050925522,0.00004337327,0.0000749342,0.00007813117,0.000035247675],"category_scores_gemma":[0.000010121533,0.000077597986,0.00006509688,0.00054364075,0.00013087183,0.000053883075,0.000007972763,0.00010193945,8.0880375e-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.000025710944,0.000009852788,0.00041652183,0.000441864,0.00021988383,0.000001586717,0.0007584042,0.00018297978,0.030746108,0.9627148,0.0006611083,0.0038211856],"study_design_scores_gemma":[0.00056782103,0.00046557706,0.061877035,0.0009621968,0.00034551046,0.000044441796,0.0019397247,0.023705343,0.020090027,0.8848321,0.004535908,0.0006343531],"about_ca_topic_score_codex":0.000008961849,"about_ca_topic_score_gemma":0.000002105828,"teacher_disagreement_score":0.07788273,"about_ca_system_score_codex":0.0000021360331,"about_ca_system_score_gemma":0.000004809854,"threshold_uncertainty_score":0.3164354},"labels":[],"label_agreement":null},{"id":"W4399490788","doi":"10.1007/s10623-024-01439-1","title":"External codes for multiple unicast networks via interference alignment","year":2024,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cooperative Communication and Network Coding","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 Toronto","funders":"Division of Mathematical Sciences; European Commission; Koninklijke Nederlandse Akademie van Wetenschappen; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Clemson University","keywords":"Unicast; Finite field; Mathematics; Context (archaeology); Upper and lower bounds; Code (set theory); Interference (communication); Field (mathematics); Interference alignment; Theoretical computer science; Discrete mathematics; Computer science; Topology (electrical circuits); Combinatorics; Telecommunications; Multicast; Computer network; Pure mathematics; Mathematical analysis","score_opus":0.04815929764473289,"score_gpt":0.2870985302757326,"score_spread":0.23893923263099973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399490788","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.0016989531,0.01177832,0.9851178,0.000390216,0.00026079913,0.00028662873,0.000006156969,0.0002090539,0.00025205794],"genre_scores_gemma":[0.9188469,0.0040139216,0.07660241,0.00030264346,0.00007561547,0.00011158143,0.0000073183646,0.000012903739,0.000026692642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988167,0.00011533324,0.00024182192,0.00042415745,0.00011562687,0.00028634194],"domain_scores_gemma":[0.99881643,0.00048189703,0.000043133357,0.00045521982,0.00008360475,0.00011969538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038292262,0.0001893729,0.00018610217,0.00015860343,0.0002858581,0.0006140369,0.00065848045,0.000058555554,0.000013566374],"category_scores_gemma":[0.000011863912,0.00016310596,0.00012929949,0.00048063204,0.000107538304,0.00027452083,0.00028026974,0.00015190874,0.0000034295722],"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.00003298797,0.00008194695,0.0011126833,0.000047970098,0.000116360854,0.000009153218,0.00087893195,0.00049092213,0.007193536,0.4443868,0.0020186293,0.54363006],"study_design_scores_gemma":[0.00030428087,0.00021983052,0.00071806426,0.00024212232,0.000019924968,0.000019247509,0.00004160417,0.9711636,0.0009089643,0.007946768,0.018113598,0.00030201633],"about_ca_topic_score_codex":0.000005437914,"about_ca_topic_score_gemma":0.000034075634,"teacher_disagreement_score":0.97067267,"about_ca_system_score_codex":0.000017742906,"about_ca_system_score_gemma":0.000021054575,"threshold_uncertainty_score":0.6651268},"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":"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":"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":"W4406464666","doi":"10.1007/s10623-024-01552-1","title":"Additive twisted codes: new distance bounds and infinite families of quantum codes","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Quantum Computing Algorithms and Architecture","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; Ministerio de Ciencia e Innovación; Ministerio de Economía y Competitividad","keywords":"Mathematics; Quantum; Cryptography; Discrete mathematics; Combinatorics; Algorithm; Quantum mechanics","score_opus":0.011477188684224376,"score_gpt":0.2414844077531521,"score_spread":0.23000721906892774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406464666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1089113,0.003565372,0.8859681,0.00034093158,0.00016128492,0.00018542037,0.00007219493,0.00014859374,0.0006467941],"genre_scores_gemma":[0.93253213,0.0013597502,0.06553351,0.00044265058,0.0000412119,0.0000119502765,0.000016690656,0.0000125544375,0.000049555987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836683,0.00012107539,0.00037089735,0.0005582118,0.00022503277,0.0003579549],"domain_scores_gemma":[0.9986386,0.00052460784,0.00016048933,0.0004099768,0.00011949442,0.00014686404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024944817,0.0002966275,0.00045947023,0.00042730806,0.00030314483,0.00027930265,0.00045454403,0.00009930539,0.0000032412647],"category_scores_gemma":[0.000042850923,0.00025717032,0.00012483225,0.0012178292,0.00048286945,0.00016636577,0.00023256757,0.00020628859,5.5606387e-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.00009517796,0.00014648166,0.006848117,0.00023625791,0.00029861293,0.000020597307,0.0046700407,0.00041403866,0.0015193281,0.7899239,0.003524868,0.19230255],"study_design_scores_gemma":[0.002451841,0.0010936988,0.051769406,0.001239337,0.00014381025,0.000043747186,0.0014831325,0.61463225,0.0034589435,0.26868066,0.05371719,0.0012859729],"about_ca_topic_score_codex":0.00021887808,"about_ca_topic_score_gemma":0.000047803842,"teacher_disagreement_score":0.8236208,"about_ca_system_score_codex":0.0000074790246,"about_ca_system_score_gemma":0.00009869454,"threshold_uncertainty_score":0.9999881},"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":"W4408029834","doi":"10.1007/s10623-025-01581-4","title":"Constructing k-ary orientable sequences with asymptotically optimal length","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Asymptotically optimal algorithm; Cryptography; Discrete mathematics; Algorithm","score_opus":0.00643270379213447,"score_gpt":0.19659421892699305,"score_spread":0.19016151513485857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408029834","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77405244,0.0016780914,0.18643561,0.00003576262,0.00028153104,0.00024458804,0.000018948205,0.0004113638,0.036841642],"genre_scores_gemma":[0.9894637,0.00009064299,0.010292863,0.00005307949,0.00002457722,0.000029727436,0.0000061223654,0.000015806456,0.00002347621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991204,0.00004925067,0.00019712426,0.0002224478,0.00011320529,0.00029755323],"domain_scores_gemma":[0.99955827,0.00011458445,0.00002481881,0.00016054492,0.00004021403,0.00010156454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020107192,0.0001962573,0.00023566607,0.00020940861,0.00017517978,0.00011645815,0.00011653185,0.00008289848,0.000030767773],"category_scores_gemma":[0.000007382028,0.00016128142,0.0000622503,0.0005850732,0.00024412041,0.00014604283,0.000017433273,0.00015553959,0.0000019022007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092960836,0.000036864138,0.07494678,0.00034747954,0.0005651112,0.000032247954,0.0004297751,0.0026690296,0.0051233433,0.9050427,0.0005236257,0.010190049],"study_design_scores_gemma":[0.018748026,0.0052965498,0.034789458,0.009095428,0.003269588,0.0020787069,0.12586625,0.15759486,0.26192465,0.2930073,0.07519278,0.013136382],"about_ca_topic_score_codex":0.000012727639,"about_ca_topic_score_gemma":0.000010501582,"teacher_disagreement_score":0.6120354,"about_ca_system_score_codex":0.0000105536255,"about_ca_system_score_gemma":0.000023454824,"threshold_uncertainty_score":0.65768653},"labels":[],"label_agreement":null},{"id":"W4408582142","doi":"10.1007/s10623-025-01612-0","title":"Sequences, codes, and Boolean functions: in memory of Kai-Uwe Schmidt","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Mathematics; Combinatorics; Boolean function; Discrete mathematics; Cryptography; Arithmetic; Algorithm","score_opus":0.014378925083762921,"score_gpt":0.25192530533287666,"score_spread":0.23754638024911373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408582142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9803815,0.007861736,0.008736621,0.00007660353,0.0000520668,0.00014684808,0.000017701592,0.000011405714,0.0027155022],"genre_scores_gemma":[0.9965729,0.000917312,0.0021122536,0.0002470839,0.00002711909,0.00001038806,0.000039901166,0.0000042562574,0.00006876781],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991983,0.00007380249,0.00020475463,0.0002980661,0.0000528531,0.00017219633],"domain_scores_gemma":[0.99969006,0.000034251174,0.000052458603,0.00013609821,0.00004272562,0.00004439836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023813015,0.00012714372,0.00018108323,0.0001282026,0.0000793762,0.000024419225,0.0000893017,0.00013365157,0.000006455409],"category_scores_gemma":[0.00003295651,0.0001034379,0.0000615343,0.0002724413,0.00023333776,0.000003605996,0.00008145388,0.00008299023,3.085303e-7],"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.00020282937,0.00012861095,0.15291804,0.00013042617,0.00012660012,0.0000061696574,0.00004666623,0.00003800582,0.798987,0.0054655033,0.0010491756,0.040901024],"study_design_scores_gemma":[0.0066201356,0.0048663137,0.37639633,0.0010781541,0.00033687567,0.00006268225,0.004222021,0.0014159376,0.4726448,0.03428716,0.09576464,0.002304962],"about_ca_topic_score_codex":0.0000686606,"about_ca_topic_score_gemma":0.00005433494,"teacher_disagreement_score":0.32634217,"about_ca_system_score_codex":0.0000027757008,"about_ca_system_score_gemma":0.000027585718,"threshold_uncertainty_score":0.42180753},"labels":[],"label_agreement":null},{"id":"W4410005165","doi":"10.1007/s10623-025-01635-7","title":"Weak colourings of Kirkman triple systems","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Triple system; Cryptography; Discrete mathematics; Arithmetic; Pure mathematics; Algorithm","score_opus":0.009053155272220269,"score_gpt":0.2041809074481235,"score_spread":0.19512775217590322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410005165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8482773,0.013828694,0.08889711,0.000021743654,0.0012120845,0.00066189625,0.000045225097,0.00044955226,0.04660642],"genre_scores_gemma":[0.99931014,0.0002471702,0.00022098002,0.000011809232,0.000020674723,0.00004987717,0.000003532681,0.000014296474,0.000121513345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992255,0.000054963013,0.0002819273,0.00014848233,0.00009035459,0.00019875515],"domain_scores_gemma":[0.99960154,0.000068861,0.00003874889,0.0001967346,0.00003715538,0.000056950572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024590341,0.00015374682,0.0002969235,0.00033756855,0.00007768252,0.000045058703,0.0001271432,0.00009424872,0.000008941723],"category_scores_gemma":[0.000005156671,0.00014490113,0.000112168724,0.0005600986,0.00008983487,0.000060039365,0.000015587604,0.00008709655,0.0000018036022],"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.00007420263,0.000074631665,0.0155378245,0.0017360807,0.0005643128,0.000005475679,0.0005241181,0.0016972387,0.049553305,0.9192285,0.008623865,0.0023804486],"study_design_scores_gemma":[0.011601729,0.0017450553,0.071983576,0.005560303,0.001454686,0.00013037234,0.019937273,0.072165236,0.16532439,0.14949043,0.49578577,0.0048211934],"about_ca_topic_score_codex":0.0000314006,"about_ca_topic_score_gemma":0.0000050177705,"teacher_disagreement_score":0.7697381,"about_ca_system_score_codex":0.000006015692,"about_ca_system_score_gemma":0.000007088976,"threshold_uncertainty_score":0.59088963},"labels":[],"label_agreement":null},{"id":"W4410258353","doi":"10.1007/s10623-025-01627-7","title":"On the coding capacity of reverse-complement and palindromic duplication-correcting codes","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Ben-Gurion University of the Negev; National Science Foundation","keywords":"Mathematics; Palindrome; Complement (music); Coding (social sciences); Combinatorics; Discrete mathematics; Arithmetic; Statistics; Genetics","score_opus":0.031171073131005093,"score_gpt":0.26220500117402756,"score_spread":0.23103392804302247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410258353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9787259,0.00030821477,0.019785414,0.000204242,0.00003927122,0.0001638584,0.000011916685,0.000008185184,0.00075299654],"genre_scores_gemma":[0.99802023,0.00018719948,0.0012747674,0.00046158335,0.000019570765,0.000011348315,0.000011828676,0.0000033972933,0.000010056796],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993356,0.000096862605,0.00015986065,0.00022958628,0.00004955617,0.00012854337],"domain_scores_gemma":[0.99953055,0.00018127538,0.0000734783,0.00014682447,0.000041087067,0.000026776808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037729682,0.000103513,0.00012660827,0.00004452968,0.00023075879,0.00002590026,0.000094001894,0.00006193534,0.0000056415533],"category_scores_gemma":[0.000083555184,0.000068505025,0.000059756505,0.00012617122,0.00014805928,0.0000014814444,0.000068326975,0.00008031239,1.8619225e-7],"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.000096557225,0.00007015165,0.042465705,0.000063129075,0.0001481564,4.785672e-7,0.00011738469,0.000017802338,0.8798213,0.06672415,0.0012045415,0.009270615],"study_design_scores_gemma":[0.0014947216,0.0015055512,0.09067549,0.00045371856,0.00017189521,0.00002165873,0.0022553445,0.0017093446,0.86060625,0.030466998,0.009874951,0.0007640865],"about_ca_topic_score_codex":0.000029870282,"about_ca_topic_score_gemma":0.0000096901485,"teacher_disagreement_score":0.048209783,"about_ca_system_score_codex":0.000002420046,"about_ca_system_score_gemma":0.0000084557305,"threshold_uncertainty_score":0.2793554},"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":"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":"W4413376972","doi":"10.1007/s10623-025-01715-8","title":"Near-factorizations of dihedral groups","year":2025,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Finite Group Theory Research","field":"Mathematics","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; Dihedral group; Dihedral angle; Combinatorics; Cryptography; Pure mathematics; Discrete mathematics; Group (periodic table); Algebra over a field; Algorithm","score_opus":0.06096021156398708,"score_gpt":0.34364246009577437,"score_spread":0.2826822485317873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413376972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7124392,0.00035683464,0.27605304,0.0001255871,0.00008663893,0.00034728268,0.000043457127,0.00009293376,0.010455057],"genre_scores_gemma":[0.977843,0.00007178066,0.02187701,0.000038559458,0.000015249976,0.000024364293,0.000007976507,0.00001435388,0.00010769216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990664,0.000118797616,0.0002438594,0.0001829164,0.0001726743,0.00021536536],"domain_scores_gemma":[0.9987864,0.0007044607,0.00005847172,0.0002830087,0.00010857932,0.000059110283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003401148,0.00012289005,0.00023083361,0.00027076429,0.00016953702,0.00006465877,0.00017043916,0.00007953577,0.000082939834],"category_scores_gemma":[0.0001624462,0.00010875496,0.000105467916,0.0008635873,0.0003029709,0.00007590891,0.00007029542,0.00012135463,0.0000020181462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040260114,0.000117213196,0.019114325,0.0001834495,0.000090140165,0.0000015633735,0.00038980244,0.0000019687363,0.0036480478,0.974178,0.0009940005,0.0012412249],"study_design_scores_gemma":[0.00048337944,0.0001361055,0.0082943635,0.00008457901,0.00008200697,0.000001834839,0.0003662759,0.00045363515,0.002593763,0.98596483,0.0013821883,0.0001570531],"about_ca_topic_score_codex":0.000013554185,"about_ca_topic_score_gemma":0.000009890841,"teacher_disagreement_score":0.26540384,"about_ca_system_score_codex":0.000006659633,"about_ca_system_score_gemma":0.000037976963,"threshold_uncertainty_score":0.44348988},"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":"W561113958","doi":"10.1007/s10623-015-0088-0","title":"Some primality tests that eluded Lucas","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Mount Royal University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Primality test; Lucas sequence; Mathematics; Mathematical proof; Prime (order theory); Arithmetic; Order (exchange); Discrete mathematics; Combinatorics; Fibonacci polynomials","score_opus":0.06445656069064902,"score_gpt":0.3083436854497091,"score_spread":0.24388712475906005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W561113958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20961905,0.0006362535,0.76847947,0.0003794758,0.00008329532,0.00050721684,0.000088570676,0.00014420396,0.020062476],"genre_scores_gemma":[0.9767682,0.000015719146,0.022772685,0.00009739958,0.00016880479,0.00008298108,0.000019724746,0.0000142453255,0.000060261875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992807,0.00002704458,0.00014018595,0.00021211545,0.00012066622,0.00021927764],"domain_scores_gemma":[0.9993581,0.000094322306,0.00006468514,0.00023182794,0.00004882466,0.00020222705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014764296,0.00014400257,0.00018635824,0.000038156395,0.00013313134,0.00006796323,0.000105838015,0.00002858542,0.000049799957],"category_scores_gemma":[0.000005660429,0.0001177598,0.000085434935,0.00017119943,0.0001487999,0.00014793365,0.000046676985,0.00008387007,0.000015134346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009388856,0.00009943398,0.0068792365,0.000008183834,0.00003038697,3.707892e-7,0.00013176196,0.000004468835,0.00039149853,0.9877845,0.0005121382,0.0041486192],"study_design_scores_gemma":[0.0003237905,0.000043779917,0.0012820648,0.000010694375,0.00002704807,0.000001017156,0.00062547566,0.00007459026,0.0016873457,0.98619324,0.009549874,0.00018105208],"about_ca_topic_score_codex":0.000017844503,"about_ca_topic_score_gemma":4.6794298e-7,"teacher_disagreement_score":0.76714915,"about_ca_system_score_codex":0.000004669313,"about_ca_system_score_gemma":0.00001803345,"threshold_uncertainty_score":0.48021054},"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":"W813457708","doi":"10.1007/s10623-015-0092-4","title":"Batch verifiable computation of outsourced functions","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Delegate; Verifiable secret sharing; Correctness; Computer science; Cloud computing; Computation; Delegation; Function (biology); Cloud storage; Theoretical computer science; Distributed computing; Algorithm; Operating system; Programming language","score_opus":0.045978153996709806,"score_gpt":0.25644332041693846,"score_spread":0.21046516642022867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W813457708","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.057029136,0.0005974287,0.9401461,0.00009627329,0.00017804955,0.00012820915,0.000026655738,0.00012548006,0.0016727069],"genre_scores_gemma":[0.8889659,0.000044287914,0.11083114,0.00008524848,0.000025538247,0.000011904528,0.000026588486,0.0000065390827,0.0000028186453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988954,0.00008522238,0.00023603601,0.00031518118,0.00025424644,0.00021391132],"domain_scores_gemma":[0.99912685,0.0000689567,0.00010280782,0.00034053723,0.00016805565,0.00019276394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036230296,0.00014127561,0.0002046686,0.0002954736,0.00012873938,0.00012697668,0.000293981,0.00006783799,0.000005603484],"category_scores_gemma":[0.000019009183,0.00013301728,0.00010618506,0.0010671893,0.00013691698,0.00043169784,0.0001074798,0.00009321055,0.0000053672366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013261041,0.00057004095,0.030705003,0.000113109825,0.00021000669,0.000012063409,0.0047842157,0.00084715476,0.0035586788,0.89961874,0.019294115,0.040154263],"study_design_scores_gemma":[0.007823859,0.0035678577,0.045152146,0.00025089958,0.00026729755,0.00013138051,0.0053436332,0.15785208,0.007916292,0.689431,0.0797998,0.002463754],"about_ca_topic_score_codex":0.00011080866,"about_ca_topic_score_gemma":0.000011184595,"teacher_disagreement_score":0.8319368,"about_ca_system_score_codex":0.000005356824,"about_ca_system_score_gemma":0.00004162388,"threshold_uncertainty_score":0.54242873},"labels":[],"label_agreement":null},{"id":"W813596860","doi":"10.1007/s10623-015-0094-2","title":"The random oracle model: a twenty-year retrospective","year":2015,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":112,"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":"Random oracle; Computer science; Oracle; Mathematical proof; Provable security; Pseudorandom number generator; Theoretical computer science; Schnorr signature; Concrete security; Flexibility (engineering); Computer security model; Computer security; Cryptography; Encryption; Mathematics; Algorithm; Public-key cryptography; Programming language; Statistics","score_opus":0.03038591141236432,"score_gpt":0.2513953581725988,"score_spread":0.22100944676023446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W813596860","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.011842282,0.001980803,0.98202646,0.00044554658,0.00019754753,0.00028771046,0.000030118166,0.00023113514,0.0029584104],"genre_scores_gemma":[0.9114725,0.0007729079,0.08733583,0.00026599373,0.000066442684,0.000054855183,0.000008246683,0.000015342794,0.000007892285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828637,0.0001504687,0.00023640298,0.0004893763,0.00041717725,0.00042022963],"domain_scores_gemma":[0.99852115,0.00016300978,0.00009861749,0.0007406327,0.00018660388,0.00029001656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009912614,0.00021519858,0.00023670805,0.00015951159,0.000554854,0.00065141584,0.00079015055,0.00008069965,0.0000027193005],"category_scores_gemma":[0.000060142625,0.00014928576,0.00017463048,0.0009808275,0.0002910957,0.0005658966,0.000254474,0.00021103506,0.000008458135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001337579,0.00007237473,0.0053707203,0.000004830803,0.00006063741,0.0000064572496,0.0011551247,0.00004891146,0.000074953256,0.98091704,0.0071855774,0.0049696323],"study_design_scores_gemma":[0.0031661307,0.00037820503,0.003153753,0.000021037982,0.000041198222,0.000022587374,0.0006150547,0.081527986,0.00030423558,0.88936985,0.02086255,0.00053744315],"about_ca_topic_score_codex":0.000040616902,"about_ca_topic_score_gemma":0.000039920204,"teacher_disagreement_score":0.8996302,"about_ca_system_score_codex":0.000014229183,"about_ca_system_score_gemma":0.00006238616,"threshold_uncertainty_score":0.6281618},"labels":[],"label_agreement":null}]}