{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15857372,0.00058954314,0.6464812,0.005441519,0.001028566,0.00025206816,0.0029958694,0.003420583,0.18121693],"genre_scores_gemma":[0.7442457,0.0005057861,0.13137849,0.0022388243,0.00029433588,0.0005188494,0.0028413446,0.0015715193,0.116405085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987204,0.00022682725,0.000064590175,0.0002837153,0.00039730288,0.00030719096],"domain_scores_gemma":[0.9981129,0.0005971669,0.00010532002,0.000571854,0.00045640377,0.00015638166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010463359,0.0005319067,0.00057952164,0.0010524929,0.0020666146,0.0022544018,0.0014483788,0.000986022,0.027205275],"category_scores_gemma":[0.002513672,0.00045548542,0.00077460374,0.00087408663,0.001960353,0.003260913,0.0033182825,0.0026751286,0.0070157778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024753113,0.00005032167,0.0003342121,0.000055799366,0.000011542513,0.00007683946,0.00016084207,0.0010178591,0.0029159994,0.95125824,0.012919928,0.030950893],"study_design_scores_gemma":[0.00009274331,0.00007575756,0.00036726406,0.00004717129,0.000028339733,0.00051979924,0.00013356897,0.007920215,0.012156392,0.88493437,0.09366344,0.00006098181],"about_ca_topic_score_codex":0.0007293438,"about_ca_topic_score_gemma":0.0007012606,"teacher_disagreement_score":0.027205275,"about_ca_system_score_codex":0.0016474647,"about_ca_system_score_gemma":0.00096846436,"threshold_uncertainty_score":0.09101075},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28741875,0.0014151625,0.45039853,0.0045933058,0.0022492805,0.00023770018,0.00065885356,0.0006703501,0.252358],"genre_scores_gemma":[0.7949534,0.00063731073,0.11837395,0.0012484544,0.00051146763,0.00020827746,0.0003783805,0.00017591956,0.083512954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923503,0.00022915486,0.000037381935,0.00010279733,0.00024489837,0.00015070064],"domain_scores_gemma":[0.99880147,0.0003560186,0.00015290937,0.00026349537,0.0002819486,0.00014413027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086801534,0.0004980476,0.00028106396,0.001478116,0.0011195868,0.0017589511,0.0006727621,0.0011647858,0.015182182],"category_scores_gemma":[0.0024528075,0.00028307523,0.000325175,0.0008998571,0.0017012383,0.0019522114,0.0011808854,0.001379329,0.0023993193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006280111,0.00002061819,0.00013298278,0.000017858656,0.0000049450114,0.0000492768,0.000059139886,0.0015724314,0.0026848626,0.97967803,0.0022482877,0.01346869],"study_design_scores_gemma":[0.000021858963,0.000044016986,0.00035076987,0.000024670202,0.0000046055443,0.00022768725,0.0000858315,0.019456323,0.005395603,0.9576933,0.016654287,0.00004100417],"about_ca_topic_score_codex":0.0008948608,"about_ca_topic_score_gemma":0.0009906641,"teacher_disagreement_score":0.015182182,"about_ca_system_score_codex":0.00073030783,"about_ca_system_score_gemma":0.00075814466,"threshold_uncertainty_score":0.050789416},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13784249,0.00018454112,0.83503574,0.00043086326,0.00016239138,0.00019423808,0.00028592895,0.00076877174,0.025095077],"genre_scores_gemma":[0.5042853,0.00019823086,0.47703046,0.0003216193,0.00004917046,0.00024472713,0.00051086687,0.000244142,0.017115502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994642,0.00016466799,0.000027262347,0.00008949147,0.0001612548,0.000093136565],"domain_scores_gemma":[0.99923885,0.00020884196,0.00008568764,0.00021121286,0.0001672502,0.000088235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046302268,0.00060940423,0.0005795896,0.00047267711,0.000575687,0.00074531056,0.0006396006,0.0005972909,0.004663562],"category_scores_gemma":[0.0012721313,0.0005439267,0.0004594631,0.00064566213,0.00065110624,0.0008041188,0.0016401442,0.00076518214,0.0015860723],"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.00075445935,0.00021132978,0.0017410059,0.0003520387,0.00010154631,0.00036573954,0.00034172373,0.041410215,0.15644245,0.60367095,0.009565425,0.18504313],"study_design_scores_gemma":[0.0005766959,0.0010388682,0.0016788996,0.00012130238,0.00012875388,0.000965174,0.0002867015,0.28612998,0.23743993,0.40134114,0.070168726,0.00012381819],"about_ca_topic_score_codex":0.0004972426,"about_ca_topic_score_gemma":0.0010069828,"teacher_disagreement_score":0.004663562,"about_ca_system_score_codex":0.00043917887,"about_ca_system_score_gemma":0.00082651473,"threshold_uncertainty_score":0.015601158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8036793,0.00022145073,0.15986186,0.00041331898,0.000034418703,0.00012547646,0.00055429066,0.0001260399,0.03498385],"genre_scores_gemma":[0.9711794,0.00019707582,0.019087961,0.00012340643,0.000027667995,0.00013099815,0.0003606088,0.000034483986,0.008858303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995321,0.00015765296,0.00002469602,0.00008267064,0.00010457397,0.00009826336],"domain_scores_gemma":[0.99778336,0.0011003299,0.0004873812,0.00019241836,0.0002649813,0.00017144968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006160913,0.00036681612,0.00036910514,0.0009772433,0.0008919775,0.0012868281,0.00065665063,0.0005950329,0.004705658],"category_scores_gemma":[0.0028283389,0.00044855927,0.00039558858,0.0007511278,0.0010076583,0.001484003,0.00076577195,0.000748465,0.00030497476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022694928,0.000053524873,0.0013218729,0.000058145877,0.000020451944,0.00015985596,0.0003367953,0.022945266,0.005457499,0.9564911,0.0011017226,0.011826816],"study_design_scores_gemma":[0.000070244336,0.000080665355,0.0011954756,0.000041135525,0.000025292036,0.00014292162,0.00018707133,0.0874915,0.0032097972,0.90505296,0.0024784533,0.000024434083],"about_ca_topic_score_codex":0.0026644114,"about_ca_topic_score_gemma":0.0037032166,"teacher_disagreement_score":0.004705658,"about_ca_system_score_codex":0.0009985361,"about_ca_system_score_gemma":0.0011717299,"threshold_uncertainty_score":0.015742004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85372955,0.0006556016,0.045113727,0.0023369798,0.0004658655,0.0001379883,0.0003714645,0.00034131884,0.09684749],"genre_scores_gemma":[0.96802855,0.0004814421,0.0060514994,0.00021507638,0.0003464293,0.00006124558,0.00024395158,0.00015292445,0.024418896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987382,0.00028667436,0.000059288162,0.00017011804,0.00043129933,0.00031433505],"domain_scores_gemma":[0.99830294,0.0005002269,0.0003626624,0.00015014308,0.00026424794,0.00041985704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011311242,0.0019661635,0.0009325649,0.005238054,0.0023357093,0.005438638,0.0015083072,0.0019864824,0.008403703],"category_scores_gemma":[0.0051766476,0.00079244736,0.00073794037,0.0028922984,0.005694905,0.0049918736,0.0036420345,0.0030330515,0.0016704099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014740787,0.000034966826,0.0004825767,0.000025493136,0.0000068619147,0.00022991639,0.0006419885,0.0019488882,0.0013649163,0.98699284,0.0011072822,0.0070168236],"study_design_scores_gemma":[0.000040669867,0.000045429482,0.0003997705,0.000029554341,0.000008312099,0.00022624481,0.00025040488,0.0075173853,0.0009310877,0.98744,0.0030808507,0.00003031765],"about_ca_topic_score_codex":0.001865797,"about_ca_topic_score_gemma":0.0012439721,"teacher_disagreement_score":0.008403703,"about_ca_system_score_codex":0.0033297767,"about_ca_system_score_gemma":0.001079048,"threshold_uncertainty_score":0.028113127},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19667202,0.00040043375,0.7896241,0.00033307084,0.00008848869,0.00013193669,0.0001681127,0.0008557545,0.011726112],"genre_scores_gemma":[0.8619091,0.00033301706,0.13137925,0.00013716848,0.000040799205,0.00010659122,0.0001508062,0.00013503338,0.0058082202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897265,0.00024992315,0.000089423054,0.00015464952,0.00035966147,0.00017365492],"domain_scores_gemma":[0.99661237,0.0009845641,0.00048359518,0.0012390903,0.0005521198,0.00012830259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013328628,0.0007825706,0.00050456985,0.0007533887,0.00053059653,0.001974181,0.0008613175,0.0010596617,0.0029201726],"category_scores_gemma":[0.004600488,0.00036304802,0.00042264786,0.0009620746,0.0009712345,0.0021929136,0.0013943731,0.0009246556,0.00075864187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022130555,0.00018340655,0.0014106964,0.0003207957,0.000090234935,0.00025912467,0.00043161603,0.07602701,0.3552014,0.4618721,0.0016177702,0.100372836],"study_design_scores_gemma":[0.00017009623,0.0004142938,0.0005868639,0.00014337395,0.00007214881,0.00043889755,0.00009575462,0.361908,0.5283365,0.10336454,0.004384748,0.000084663836],"about_ca_topic_score_codex":0.00017541376,"about_ca_topic_score_gemma":0.00029243343,"teacher_disagreement_score":0.0029201726,"about_ca_system_score_codex":0.0009824515,"about_ca_system_score_gemma":0.0006575515,"threshold_uncertainty_score":0.009768963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6891871,0.0009382588,0.1857443,0.002130779,0.00032085142,0.00018923411,0.002162045,0.0006346137,0.118692756],"genre_scores_gemma":[0.81229454,0.0006561303,0.12933494,0.00063630065,0.0001848836,0.00034093816,0.002851688,0.00029621136,0.053404424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989405,0.0002888157,0.00009109014,0.0001196855,0.00035895465,0.00020095361],"domain_scores_gemma":[0.996929,0.0014680291,0.00025973935,0.00045163315,0.0006548318,0.0002367472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007087407,0.0007179562,0.0007772167,0.002016051,0.0015929487,0.002418276,0.0008422642,0.0012616977,0.010244278],"category_scores_gemma":[0.0047234036,0.0006022333,0.0006000269,0.0024176985,0.0009653742,0.0021560048,0.001957572,0.0014076702,0.002194807],"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.00078619784,0.00020103593,0.0027757809,0.00033745202,0.000028925537,0.0003171589,0.00055054046,0.0073381593,0.014674256,0.8513585,0.01155096,0.11008107],"study_design_scores_gemma":[0.00008825909,0.00016060696,0.0009581334,0.0001461912,0.000031977124,0.0009178706,0.00022657226,0.043526307,0.008976494,0.9208847,0.024034632,0.000048193575],"about_ca_topic_score_codex":0.00046271097,"about_ca_topic_score_gemma":0.00074305997,"teacher_disagreement_score":0.010244278,"about_ca_system_score_codex":0.0010978836,"about_ca_system_score_gemma":0.0012323199,"threshold_uncertainty_score":0.034270525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0963765,0.013309454,0.6452289,0.018466918,0.0038905004,0.00017254397,0.00055418164,0.0003457218,0.2216552],"genre_scores_gemma":[0.812203,0.015437616,0.11505966,0.003145367,0.0045323614,0.00023376667,0.0005761872,0.00025056145,0.048561525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689,0.0009286228,0.00018709876,0.000453849,0.0010815972,0.0004589451],"domain_scores_gemma":[0.9933509,0.0042731995,0.00037814665,0.00094645726,0.00087671174,0.00017462586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028801893,0.00124882,0.0011278656,0.0023419799,0.0017802769,0.0038697072,0.0010718206,0.0030248726,0.006206134],"category_scores_gemma":[0.011293398,0.00052339013,0.00092726166,0.0027015281,0.0070096343,0.009024807,0.0038153839,0.0053767413,0.0020963866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016304836,0.000018795488,0.000090698086,0.00006136998,0.000013705395,0.00005814894,0.00011718202,0.0049435436,0.001072563,0.97189766,0.0022181598,0.01934505],"study_design_scores_gemma":[0.00003360581,0.000034550445,0.000058936123,0.000059170572,0.000010562483,0.000086000684,0.000029188912,0.014915114,0.0011408962,0.9740994,0.009509519,0.000022954926],"about_ca_topic_score_codex":0.00082871265,"about_ca_topic_score_gemma":0.00036802943,"teacher_disagreement_score":0.006206134,"about_ca_system_score_codex":0.0019955272,"about_ca_system_score_gemma":0.001878051,"threshold_uncertainty_score":0.02076155},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039852493,0.0032597464,0.80754375,0.0016224898,0.0007841281,0.000115666226,0.00020947964,0.000581861,0.1460303],"genre_scores_gemma":[0.5761003,0.0053266766,0.30947107,0.0026325956,0.0013245199,0.0006168549,0.00073845504,0.00049295236,0.1032967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987017,0.00041459306,0.00006748961,0.00022332964,0.0004507358,0.0001421599],"domain_scores_gemma":[0.99835324,0.0007089068,0.00019213959,0.00044480743,0.00022720794,0.00007379261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065275683,0.0009060994,0.0009148913,0.001317919,0.0013392855,0.0027465182,0.00078298274,0.0019572545,0.013097453],"category_scores_gemma":[0.0043491204,0.0009507707,0.00057954213,0.0026068476,0.0017925211,0.0041525727,0.0019091961,0.0023683265,0.003213008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049646704,0.000022530372,0.000109712935,0.000069043606,0.00000982381,0.000048748843,0.00009816791,0.0072841356,0.0017044919,0.93922424,0.0041903197,0.04718924],"study_design_scores_gemma":[0.000017323315,0.000047839552,0.000086842294,0.00004263789,0.000011112623,0.00018997483,0.000051858773,0.025096806,0.0033094445,0.9507648,0.020365126,0.000016287924],"about_ca_topic_score_codex":0.00028796794,"about_ca_topic_score_gemma":0.00031544894,"teacher_disagreement_score":0.013097453,"about_ca_system_score_codex":0.00080109714,"about_ca_system_score_gemma":0.0005320931,"threshold_uncertainty_score":0.043815374},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05963128,0.0031194228,0.8367394,0.0069847205,0.0004977508,0.00042239428,0.0010853302,0.0019703303,0.0895494],"genre_scores_gemma":[0.7624867,0.003286057,0.19602905,0.0014257132,0.00090161874,0.0015665087,0.0015824926,0.000981662,0.03174025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98165625,0.0040214094,0.00096129073,0.0026862845,0.007301041,0.00337365],"domain_scores_gemma":[0.9332033,0.046969328,0.0027689054,0.01148666,0.0029399004,0.002631894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0111447545,0.0032343916,0.0031157488,0.0040752436,0.005662488,0.015293201,0.009476336,0.005844024,0.015649024],"category_scores_gemma":[0.04266531,0.0034378343,0.003230844,0.006623103,0.0087028025,0.030550051,0.019986333,0.023095535,0.0055157547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019385495,0.00011270898,0.00020921516,0.00013593897,0.000031010997,0.0000587225,0.00033713103,0.0117259165,0.0012157303,0.9730032,0.0026473303,0.01032915],"study_design_scores_gemma":[0.00003831895,0.00004089571,0.00011791187,0.0000922101,0.000050146104,0.00006416978,0.00007218464,0.04272301,0.0030946683,0.9496188,0.0040301024,0.000057659876],"about_ca_topic_score_codex":0.0013876151,"about_ca_topic_score_gemma":0.0016313996,"teacher_disagreement_score":0.015649024,"about_ca_system_score_codex":0.010877669,"about_ca_system_score_gemma":0.0060407617,"threshold_uncertainty_score":0.078923404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21956144,0.00034352732,0.745166,0.0006045035,0.000102531274,0.0005616678,0.0010581306,0.0004792064,0.032122992],"genre_scores_gemma":[0.5339282,0.00052419753,0.44724822,0.0002552447,0.00004344143,0.0005470094,0.0019029162,0.0003180335,0.015232682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908674,0.00027440875,0.00006759203,0.00015827645,0.00025392245,0.00015897078],"domain_scores_gemma":[0.9985216,0.00054658134,0.00014003602,0.00047337174,0.00023008356,0.000088346314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048698203,0.0006199766,0.0008522669,0.0012175187,0.0011088252,0.0020621193,0.0010022016,0.0008323114,0.009214384],"category_scores_gemma":[0.0022898363,0.0006735804,0.00080039474,0.0018438436,0.0012516177,0.002712567,0.0024938222,0.0014619053,0.0018530469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011658927,0.00029451755,0.0027022844,0.00059308315,0.00015276943,0.0003507572,0.0009208819,0.13301025,0.049422894,0.5650272,0.010861084,0.23549843],"study_design_scores_gemma":[0.00017202819,0.00041949397,0.001317311,0.0002071922,0.00009223413,0.00040123274,0.0018112578,0.24760208,0.038005933,0.67644054,0.03347493,0.00005583692],"about_ca_topic_score_codex":0.0015576674,"about_ca_topic_score_gemma":0.0017932131,"teacher_disagreement_score":0.009214384,"about_ca_system_score_codex":0.00074260164,"about_ca_system_score_gemma":0.00067538855,"threshold_uncertainty_score":0.030825138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29010132,0.008745598,0.38234082,0.024879904,0.003405914,0.00014046757,0.00082265824,0.0001880796,0.28937525],"genre_scores_gemma":[0.8865017,0.006771138,0.028501747,0.0020017147,0.0024663117,0.00014943295,0.00048873277,0.00015499126,0.07296409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911636,0.00023441097,0.00005944799,0.00014438569,0.00027350016,0.00017190365],"domain_scores_gemma":[0.9983057,0.0010364244,0.00014839358,0.00012771055,0.00027334705,0.00010841485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016069242,0.00080659264,0.001155953,0.0016283131,0.0014535264,0.0021756752,0.0008377128,0.0021284532,0.008240617],"category_scores_gemma":[0.0042152815,0.00044205177,0.0008184817,0.0020100437,0.004594326,0.008629248,0.003065041,0.0043848837,0.0014963441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020487252,0.00000890601,0.00009488038,0.00001950587,0.0000030800609,0.00005173603,0.0001380009,0.00072612526,0.00030223484,0.99555826,0.0009540829,0.0021226706],"study_design_scores_gemma":[0.000017830007,0.000008859248,0.00007960939,0.000014916308,0.0000050978947,0.000058889185,0.00002689369,0.0037765284,0.0001946063,0.9930092,0.0027971496,0.000010410363],"about_ca_topic_score_codex":0.0018285313,"about_ca_topic_score_gemma":0.00088411215,"teacher_disagreement_score":0.008240617,"about_ca_system_score_codex":0.0020591689,"about_ca_system_score_gemma":0.0013083197,"threshold_uncertainty_score":0.027567565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076017186,0.0047534434,0.822593,0.0056741345,0.001238595,0.0002815268,0.0009902578,0.0017067234,0.08674523],"genre_scores_gemma":[0.62165743,0.0044166646,0.32200107,0.0033611446,0.0030245571,0.0014231391,0.0013629757,0.0010815742,0.04167148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897441,0.0026695107,0.0006626168,0.0025030256,0.0032589089,0.0011618567],"domain_scores_gemma":[0.95197237,0.031954158,0.0024305035,0.0099169165,0.001958488,0.0017675823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006964686,0.0036561778,0.00288573,0.003993687,0.0028126235,0.008530551,0.00546874,0.004878144,0.022108134],"category_scores_gemma":[0.035611905,0.0018570448,0.0024431648,0.00406638,0.0063220738,0.022433566,0.008132971,0.008886168,0.003935402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010844854,0.00022515625,0.0015223941,0.00053321884,0.0001302344,0.00022219932,0.00021677754,0.030095626,0.011447706,0.8803367,0.0110514015,0.06313417],"study_design_scores_gemma":[0.00015268764,0.00021513323,0.0004594405,0.00015382035,0.00012684548,0.00052006193,0.00004898726,0.09070991,0.008066781,0.8866457,0.012800553,0.00010021994],"about_ca_topic_score_codex":0.00036197083,"about_ca_topic_score_gemma":0.00063322193,"teacher_disagreement_score":0.022108134,"about_ca_system_score_codex":0.0039263633,"about_ca_system_score_gemma":0.002632246,"threshold_uncertainty_score":0.07395911},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010371379,0.0019465986,0.8819499,0.009268693,0.0014053072,0.00018596346,0.00050910737,0.00071486353,0.093648225],"genre_scores_gemma":[0.3934761,0.006048016,0.50597256,0.007050229,0.0038450898,0.0011065508,0.0012469443,0.0012312046,0.08002337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953353,0.0011340247,0.00019411035,0.00059128547,0.0022857843,0.00045958257],"domain_scores_gemma":[0.99281764,0.0040719174,0.00032303226,0.0012634506,0.0012340804,0.00028998847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037754383,0.001678985,0.0017988664,0.0025106727,0.002776525,0.005691874,0.0032987173,0.003385168,0.015744949],"category_scores_gemma":[0.021440338,0.0011300886,0.0020343803,0.0033731288,0.0059719686,0.0128434785,0.0072359485,0.01061959,0.0052197124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003204702,0.000040227726,0.00006755353,0.00006779711,0.000013539547,0.000033923472,0.000080313424,0.0027547136,0.00053201825,0.97425836,0.007194202,0.014925353],"study_design_scores_gemma":[0.000033001346,0.000014997858,0.000044652694,0.000039884973,0.000008278119,0.000035880785,0.000018292307,0.0172303,0.000688366,0.9726575,0.009207433,0.00002152844],"about_ca_topic_score_codex":0.0028868786,"about_ca_topic_score_gemma":0.002581998,"teacher_disagreement_score":0.015744949,"about_ca_system_score_codex":0.0035272024,"about_ca_system_score_gemma":0.0047845743,"threshold_uncertainty_score":0.052672148},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8786302,0.00024417683,0.0790184,0.00095084,0.00013429488,0.000071111506,0.00015709574,0.00023217978,0.04056167],"genre_scores_gemma":[0.9710361,0.0000667352,0.020579958,0.00011943261,0.000023846056,0.00004012489,0.000062849474,0.000028200227,0.0080426205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993679,0.00014288288,0.000028694169,0.00010363702,0.00011002579,0.00024677147],"domain_scores_gemma":[0.997329,0.00130062,0.00035442878,0.00044940037,0.00020077813,0.00036578908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000562292,0.00041817754,0.00050365186,0.00095354085,0.0013906686,0.0021483002,0.00082178786,0.001620927,0.0075435527],"category_scores_gemma":[0.003702286,0.0005277834,0.00044015897,0.0005071442,0.0031503667,0.0026929253,0.0028487106,0.0010172423,0.000542792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009615131,0.000045478846,0.0014837293,0.000067944726,0.000017621143,0.00024813315,0.0004515254,0.0028806427,0.015922392,0.9644672,0.0009427827,0.012510972],"study_design_scores_gemma":[0.00030072877,0.0003455529,0.0023042958,0.00007018894,0.00005319469,0.00069901795,0.0011407679,0.033911303,0.03221327,0.9194718,0.00938133,0.000108521395],"about_ca_topic_score_codex":0.00037392092,"about_ca_topic_score_gemma":0.0003214807,"teacher_disagreement_score":0.0075435527,"about_ca_system_score_codex":0.0007020101,"about_ca_system_score_gemma":0.0005251064,"threshold_uncertainty_score":0.025235713},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035628054,0.3292655,0.16699506,0.13083844,0.010444677,0.0001753098,0.0008796202,0.0006501788,0.32512313],"genre_scores_gemma":[0.67217726,0.20158471,0.048777893,0.011711391,0.028139561,0.00026792302,0.0005565085,0.000211814,0.036573008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958287,0.0013474742,0.0002866377,0.0007269275,0.0014548085,0.00035534016],"domain_scores_gemma":[0.988398,0.0060305484,0.0006504888,0.002749855,0.0017087619,0.00046239316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060066725,0.0007053165,0.0012252564,0.00312519,0.0028840112,0.010763685,0.0014735704,0.0046666465,0.005974757],"category_scores_gemma":[0.014882519,0.00091372005,0.0005760495,0.004169207,0.016069153,0.023271978,0.0044360873,0.0126144085,0.0027094574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007866194,0.00003983699,0.00014562276,0.00017671277,0.000009844044,0.00002629972,0.000312925,0.00073002616,0.00044832044,0.9443856,0.0068409913,0.046805095],"study_design_scores_gemma":[0.000023561728,0.000044327848,0.00011972995,0.00023960984,0.0000092419195,0.00006248105,0.000093822906,0.0023897386,0.00083064486,0.8723568,0.12379854,0.000031494426],"about_ca_topic_score_codex":0.0008980347,"about_ca_topic_score_gemma":0.00041058878,"teacher_disagreement_score":0.010763685,"about_ca_system_score_codex":0.0036079253,"about_ca_system_score_gemma":0.0027203062,"threshold_uncertainty_score":0.031766713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012258345,0.15910624,0.42053282,0.044208664,0.0034152637,0.00025915104,0.00027358037,0.0003957727,0.35955018],"genre_scores_gemma":[0.6242528,0.19744155,0.117521375,0.009604295,0.0072051687,0.0006673193,0.00028615605,0.0003511969,0.042670123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960465,0.0013487267,0.00020188345,0.0005130726,0.0014883262,0.00040143615],"domain_scores_gemma":[0.9915519,0.004994825,0.00032066982,0.0021098854,0.00083596184,0.00018683843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004626601,0.000805588,0.0016651588,0.0017049903,0.0023573886,0.005471599,0.0017144792,0.004235264,0.007815497],"category_scores_gemma":[0.010980778,0.0007321938,0.0009155732,0.0020029796,0.011530807,0.024367558,0.004988893,0.008975782,0.003413102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033461727,0.000004230068,0.000017588643,0.00006893499,0.0000018879589,0.000009461082,0.000035039055,0.00035570367,0.000111431866,0.9941743,0.0006779384,0.0045401077],"study_design_scores_gemma":[0.000004997203,0.0000152333805,0.000028576947,0.00014786152,0.0000027539154,0.00008887742,0.000035474648,0.0024956346,0.00040276,0.95349765,0.043270227,0.000009945596],"about_ca_topic_score_codex":0.0007760374,"about_ca_topic_score_gemma":0.00032010567,"teacher_disagreement_score":0.007815497,"about_ca_system_score_codex":0.0041712723,"about_ca_system_score_gemma":0.0030582629,"threshold_uncertainty_score":0.030264795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82057106,0.0009119803,0.10646429,0.0027866757,0.00048380895,0.00007971805,0.0001934528,0.00031847315,0.0681904],"genre_scores_gemma":[0.96462846,0.00050727447,0.01215078,0.00021312006,0.00056522136,0.000057086312,0.00011833557,0.00006674079,0.02169285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903655,0.0003095397,0.000038342932,0.00011457154,0.00030192663,0.00019911837],"domain_scores_gemma":[0.99781334,0.0009879053,0.00033296904,0.00019869562,0.00029134232,0.00037580408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445355,0.0011028869,0.0010151573,0.002065872,0.0016832221,0.002333941,0.00090364437,0.00083794235,0.0050608097],"category_scores_gemma":[0.0043001473,0.0004341562,0.0005184302,0.0016490419,0.0044931364,0.005021698,0.002865699,0.002365712,0.000875887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012258835,0.00002779957,0.00020713583,0.000027448825,0.0000046122195,0.000046855017,0.00023166894,0.0014194496,0.0012411425,0.98987216,0.00061433105,0.0061847595],"study_design_scores_gemma":[0.0000342348,0.000074395626,0.00023874422,0.000015300415,0.000007780852,0.00007348053,0.00008106705,0.0061920434,0.0012558785,0.99007493,0.0019364572,0.000015692502],"about_ca_topic_score_codex":0.00072595256,"about_ca_topic_score_gemma":0.0008306337,"teacher_disagreement_score":0.0050608097,"about_ca_system_score_codex":0.0014686804,"about_ca_system_score_gemma":0.00084210414,"threshold_uncertainty_score":0.016930163},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33932257,0.0025339297,0.3446432,0.00560432,0.0004643263,0.00016266279,0.00020790192,0.00048727388,0.3065738],"genre_scores_gemma":[0.9668764,0.00091877545,0.008006113,0.00019142652,0.00025799277,0.00004478819,0.0000690625,0.000067270186,0.023568276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987325,0.00025675228,0.000030017596,0.000110111876,0.00057253597,0.00029808166],"domain_scores_gemma":[0.99787426,0.00086470845,0.00028196772,0.0004890646,0.00032367648,0.0001663559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013390235,0.0008415177,0.00079732994,0.0018822128,0.0016890182,0.0027075296,0.0013472454,0.0017886576,0.010286383],"category_scores_gemma":[0.005341158,0.00031548474,0.00076815276,0.001356206,0.0033614042,0.0053827064,0.0020502175,0.0026564253,0.0010415943],"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.000049744667,0.000018991375,0.00018778973,0.000017725693,0.0000057862894,0.00005125472,0.00006252502,0.00680263,0.0006303867,0.9872543,0.0008524789,0.004066352],"study_design_scores_gemma":[0.000019551007,0.000031908006,0.00034054066,0.000024808043,0.000012065732,0.0001380372,0.00006695362,0.13551813,0.0011205166,0.85931474,0.0033921886,0.000020641572],"about_ca_topic_score_codex":0.0012347597,"about_ca_topic_score_gemma":0.00083727186,"teacher_disagreement_score":0.010286383,"about_ca_system_score_codex":0.0024931736,"about_ca_system_score_gemma":0.0013821252,"threshold_uncertainty_score":0.03441143},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17184669,0.001489388,0.68602806,0.0014096859,0.00034668122,0.00019869892,0.000319785,0.00045580184,0.13790525],"genre_scores_gemma":[0.81500614,0.0016883669,0.14130817,0.0011635536,0.0003053244,0.0003205799,0.00025938754,0.0002119918,0.039736435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986627,0.00055623264,0.00004592969,0.00014249056,0.00039343056,0.00019919768],"domain_scores_gemma":[0.9975821,0.0011517092,0.0002573086,0.00052116596,0.0003739336,0.000113782145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012492221,0.0012711429,0.00065699365,0.0014305149,0.0010657279,0.0016775595,0.0007438864,0.0013838968,0.0064378064],"category_scores_gemma":[0.0050782682,0.0004447308,0.0005772262,0.0013866071,0.001959301,0.001865909,0.0019308223,0.0014992352,0.0012588587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121744626,0.000017149981,0.00021781768,0.000047275866,0.000015955018,0.00007559692,0.00017480874,0.015777111,0.0033221468,0.95477766,0.0018700011,0.023582691],"study_design_scores_gemma":[0.00006674272,0.000106336774,0.0002069863,0.000101805635,0.000029519448,0.0002590862,0.00012409464,0.08314662,0.0053088465,0.897435,0.013159919,0.00005492709],"about_ca_topic_score_codex":0.0015534444,"about_ca_topic_score_gemma":0.00281163,"teacher_disagreement_score":0.0064378064,"about_ca_system_score_codex":0.0015205309,"about_ca_system_score_gemma":0.00097447314,"threshold_uncertainty_score":0.021536589},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08023692,0.00054329063,0.88618886,0.0014052961,0.00027318043,0.00022866191,0.000230844,0.00068098604,0.030211994],"genre_scores_gemma":[0.7278666,0.000446729,0.25536177,0.0005803547,0.000103581086,0.00021478615,0.00020350036,0.000056788558,0.01516595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887294,0.0003666014,0.000058039015,0.00021170492,0.0003249699,0.00016577812],"domain_scores_gemma":[0.9990945,0.00016998862,0.00013311229,0.00038104944,0.00013827953,0.00008303076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076706934,0.0003096558,0.00045776126,0.00043672055,0.0007142309,0.0010030502,0.0008315591,0.0009989048,0.0034149156],"category_scores_gemma":[0.0011982032,0.00024772887,0.00052673154,0.0008735733,0.0012418517,0.0020281486,0.0020210173,0.0010062059,0.0009726217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004027842,0.00013759384,0.00063945353,0.00024062929,0.00006868845,0.00064218557,0.00059884717,0.031670988,0.08819838,0.786861,0.0046397042,0.08589966],"study_design_scores_gemma":[0.0004534935,0.00084609684,0.00084298913,0.00011854282,0.00011084425,0.0029988904,0.0002647997,0.44295588,0.12192133,0.3162472,0.11296016,0.00027981095],"about_ca_topic_score_codex":0.0003351542,"about_ca_topic_score_gemma":0.0002579688,"teacher_disagreement_score":0.0034149156,"about_ca_system_score_codex":0.0007002361,"about_ca_system_score_gemma":0.0009532279,"threshold_uncertainty_score":0.011424065},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005787799,0.00037089246,0.98362297,0.00065132376,0.0003176939,0.00037723538,0.00013978659,0.0009245654,0.0078077493],"genre_scores_gemma":[0.27135164,0.00096509705,0.691364,0.0006709673,0.0004872168,0.0015631992,0.0008056542,0.0003726075,0.032419678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99175394,0.002350327,0.0006501168,0.0007298538,0.003815676,0.000700156],"domain_scores_gemma":[0.99343336,0.0018278647,0.00049249356,0.0027663969,0.0012175716,0.0002622352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050816354,0.0011746342,0.0015632169,0.0014774336,0.0024613428,0.0040613855,0.0030872517,0.002847783,0.0066878446],"category_scores_gemma":[0.009882995,0.001175397,0.0010158118,0.0021769996,0.0026251725,0.009015481,0.0070929453,0.004258597,0.0040459614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005111994,0.0001464474,0.0001747785,0.00023519759,0.00007082753,0.00025343813,0.0003452466,0.011288172,0.014562745,0.8708382,0.011183782,0.090389974],"study_design_scores_gemma":[0.0004540821,0.00038856445,0.000217595,0.0001677651,0.00024024273,0.0008782431,0.00013501482,0.19665386,0.035577297,0.65001386,0.11507615,0.00019721332],"about_ca_topic_score_codex":0.00049427355,"about_ca_topic_score_gemma":0.00068491994,"teacher_disagreement_score":0.0066878446,"about_ca_system_score_codex":0.0016960737,"about_ca_system_score_gemma":0.003987882,"threshold_uncertainty_score":0.026874602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87914795,0.00049349497,0.056891352,0.0016165447,0.00021776532,0.00005303221,0.00026226338,0.00023310332,0.06108449],"genre_scores_gemma":[0.9785014,0.00016986144,0.01067157,0.00034876078,0.00012806269,0.000060866074,0.0001476549,0.000062325926,0.009909621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988697,0.0003352079,0.000049738395,0.00013788092,0.0002975642,0.0003098034],"domain_scores_gemma":[0.99684036,0.0014785386,0.00053961546,0.00041158617,0.0003304188,0.00039942225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012007247,0.0005688646,0.00068554457,0.0017838242,0.0018447646,0.002666248,0.0007522033,0.00134416,0.0053135008],"category_scores_gemma":[0.0061809253,0.0004915993,0.00047374252,0.0007384155,0.0029791782,0.0028639815,0.0023918822,0.0023504773,0.0006676726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038321645,0.00004047895,0.00069940055,0.00003904549,0.0000105457575,0.00014825023,0.0002317316,0.0025109132,0.002835141,0.9858329,0.0010301628,0.0062383576],"study_design_scores_gemma":[0.000045640598,0.000051948424,0.0004020119,0.000027627619,0.00000915512,0.0002548961,0.00012523217,0.010754903,0.0021012526,0.9847453,0.0014529348,0.000029029336],"about_ca_topic_score_codex":0.00035726497,"about_ca_topic_score_gemma":0.00046739087,"teacher_disagreement_score":0.0053135008,"about_ca_system_score_codex":0.001117444,"about_ca_system_score_gemma":0.0011216865,"threshold_uncertainty_score":0.017775357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07261589,0.0105818715,0.5034696,0.0046236264,0.0041371086,0.00019379672,0.002384212,0.0064367745,0.39555714],"genre_scores_gemma":[0.7529535,0.005449333,0.11505161,0.0022279813,0.0025710098,0.0003456267,0.0016338943,0.00261186,0.11715517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989961,0.00030997058,0.000059617396,0.00014778922,0.00029989847,0.00018660193],"domain_scores_gemma":[0.9988462,0.00045907102,0.00012867789,0.00025620448,0.00017597109,0.0001338194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012742382,0.0009360959,0.00101134,0.001960772,0.0011296028,0.0029759945,0.0008738309,0.00094229943,0.02347396],"category_scores_gemma":[0.0043277876,0.00030165105,0.00045852724,0.0020539341,0.0016514387,0.0051480248,0.0021848008,0.0027299696,0.007987991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000223211,0.000023252665,0.00014485483,0.00012727997,0.000007570072,0.00009179784,0.00009817581,0.0012684125,0.0012976732,0.9287852,0.012146472,0.05578606],"study_design_scores_gemma":[0.000077429664,0.00006780104,0.00020492464,0.00018610069,0.000018269193,0.00027953947,0.000041537154,0.0069642956,0.0049294285,0.8875901,0.099607065,0.00003355457],"about_ca_topic_score_codex":0.0005302676,"about_ca_topic_score_gemma":0.00050273264,"teacher_disagreement_score":0.02347396,"about_ca_system_score_codex":0.0012454671,"about_ca_system_score_gemma":0.00070807576,"threshold_uncertainty_score":0.078528166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8321834,0.0011824545,0.10019306,0.0012394333,0.00012239245,0.00006599958,0.0006675754,0.00035407356,0.063991524],"genre_scores_gemma":[0.9662368,0.00078333385,0.0155604435,0.0002876074,0.00021790493,0.00007470871,0.0008364398,0.00018283006,0.015819902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990496,0.00024267446,0.00004434003,0.00018190719,0.0003202435,0.00016127476],"domain_scores_gemma":[0.9971432,0.0015402759,0.00047025693,0.00040003812,0.00017894787,0.00026728457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047648433,0.0006965565,0.0008332696,0.0015761069,0.0013140598,0.0029169742,0.0009040319,0.0009797511,0.005843065],"category_scores_gemma":[0.004222433,0.0007091498,0.0006803417,0.0015837363,0.0020040667,0.0035782582,0.002862496,0.0016316513,0.00081520126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029729318,0.000042476193,0.000964234,0.00011469698,0.000029349281,0.00025828343,0.00082560256,0.012302786,0.004713264,0.9622582,0.0027404432,0.015453403],"study_design_scores_gemma":[0.000038298665,0.000038422022,0.0007352989,0.000032897526,0.000024598867,0.00031205695,0.00022225376,0.018581565,0.002618019,0.9712967,0.0060778186,0.000022037373],"about_ca_topic_score_codex":0.00079479744,"about_ca_topic_score_gemma":0.000955067,"teacher_disagreement_score":0.005843065,"about_ca_system_score_codex":0.001019447,"about_ca_system_score_gemma":0.00046002868,"threshold_uncertainty_score":0.019547045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6460679,0.0010925771,0.26418933,0.0030786581,0.00031093284,0.00015065326,0.000587798,0.0006372411,0.08388485],"genre_scores_gemma":[0.9287795,0.0003542664,0.061424177,0.00044767035,0.00012818401,0.00018594081,0.00019213816,0.00005212226,0.008436075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980769,0.0006327331,0.00013102779,0.0003743889,0.0004936663,0.00029126173],"domain_scores_gemma":[0.99259526,0.0043782047,0.0013640578,0.00071013515,0.00052131736,0.0004309803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023883237,0.0006574663,0.0006530119,0.0015329103,0.0021283631,0.0029513848,0.0010322133,0.002040709,0.0042150836],"category_scores_gemma":[0.012755128,0.0012113203,0.0005868392,0.0012823072,0.0025587403,0.0027031102,0.0022868346,0.001395206,0.0007955661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004642045,0.000048658396,0.0012447832,0.00013040788,0.000033629716,0.00019301692,0.00038709005,0.005619942,0.008860938,0.9646234,0.0015949119,0.016799016],"study_design_scores_gemma":[0.00023102394,0.0002014971,0.00072513364,0.00009278121,0.000037712107,0.00083705044,0.00014671533,0.027192008,0.008950287,0.95531255,0.006189214,0.000084060266],"about_ca_topic_score_codex":0.00046979237,"about_ca_topic_score_gemma":0.0005275005,"teacher_disagreement_score":0.0042150836,"about_ca_system_score_codex":0.0013654603,"about_ca_system_score_gemma":0.0016151291,"threshold_uncertainty_score":0.014100909},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50906366,0.0015462866,0.39655057,0.0036136368,0.00029723288,0.00006361335,0.00028151568,0.00031387658,0.088269524],"genre_scores_gemma":[0.9521077,0.0007194033,0.024140503,0.0005785786,0.00025267355,0.00007940876,0.00017900807,0.000085825646,0.021856798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994972,0.00016893694,0.00002202583,0.00009170404,0.00012787881,0.00009231661],"domain_scores_gemma":[0.9982938,0.0009087859,0.00022764425,0.00021194285,0.00021289497,0.0001448856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010166338,0.0006076472,0.00046429774,0.0014543842,0.0009570167,0.0018648736,0.000741789,0.0010646883,0.0035240664],"category_scores_gemma":[0.0043215887,0.00031895933,0.00033679113,0.0013391007,0.0028665657,0.0034780686,0.0015366736,0.0019835446,0.00059499126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000631468,0.000012936576,0.00017193587,0.000022585104,0.000002890667,0.000021680105,0.00006737595,0.0026657898,0.0008821445,0.98822844,0.000694857,0.0071661784],"study_design_scores_gemma":[0.000011649411,0.000011568393,0.00010850553,0.000008830775,0.0000028516981,0.000035599907,0.00003094823,0.010104697,0.00048231115,0.9881003,0.0010959464,0.0000068320273],"about_ca_topic_score_codex":0.0008441025,"about_ca_topic_score_gemma":0.0007410298,"teacher_disagreement_score":0.0035240664,"about_ca_system_score_codex":0.0013298361,"about_ca_system_score_gemma":0.00065191434,"threshold_uncertainty_score":0.011789143},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9539383,0.00024521656,0.03320699,0.000783837,0.00006474841,0.000029446157,0.00037431714,0.00026602906,0.011091223],"genre_scores_gemma":[0.9782648,0.00014014076,0.014465993,0.00011756788,0.000075451026,0.000020676776,0.00047144666,0.000075508404,0.006368413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999332,0.000103721984,0.000044973363,0.00015750149,0.00011752804,0.00024418073],"domain_scores_gemma":[0.99759895,0.0011861939,0.00033894766,0.00035144924,0.00020537834,0.000319105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008451855,0.00065788784,0.00067010906,0.00091462064,0.0009285755,0.0033421905,0.00091891043,0.0006394059,0.0057847425],"category_scores_gemma":[0.0034445191,0.00030710822,0.0006031253,0.0008781119,0.0018674743,0.0053929454,0.0022781563,0.001362531,0.00083797704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004277945,0.00032411655,0.025779923,0.00049277383,0.00011398532,0.0011000457,0.002038874,0.04288215,0.020515075,0.8164474,0.0069055404,0.0791222],"study_design_scores_gemma":[0.000079678284,0.00019147579,0.0028903296,0.000076793825,0.000048168717,0.00041572706,0.0005224699,0.0458191,0.009084589,0.93616116,0.0046642153,0.000046204892],"about_ca_topic_score_codex":0.00080475974,"about_ca_topic_score_gemma":0.0020873325,"teacher_disagreement_score":0.0057847425,"about_ca_system_score_codex":0.0012871627,"about_ca_system_score_gemma":0.0010338066,"threshold_uncertainty_score":0.0193519},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016310837,0.00020069131,0.95632744,0.00066158257,0.0001824557,0.00011689731,0.00015290696,0.00046626653,0.025580907],"genre_scores_gemma":[0.5203432,0.0009003177,0.441877,0.0013728584,0.0003860953,0.000829126,0.0007134185,0.0005233013,0.033054672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973883,0.0010697397,0.0001355739,0.00027758145,0.00071840646,0.00041045054],"domain_scores_gemma":[0.99567956,0.001863114,0.00043225638,0.0013272642,0.0005171912,0.00018061778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002104373,0.0013876898,0.0007874179,0.000992779,0.001279895,0.0024453087,0.001433425,0.0017724928,0.0083155185],"category_scores_gemma":[0.007103279,0.00078546716,0.0010998647,0.0013942417,0.0019410038,0.0029841182,0.0029507577,0.003299694,0.0034994355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011690845,0.000045536068,0.00016543022,0.00006193861,0.000018547149,0.00011511285,0.00012778424,0.021738289,0.0059108217,0.9382605,0.0034367973,0.030002404],"study_design_scores_gemma":[0.00007026271,0.0001705344,0.00014075618,0.00007037926,0.000034337427,0.00042627158,0.000084023144,0.1237682,0.019148218,0.83970857,0.0163065,0.000071947325],"about_ca_topic_score_codex":0.00023393052,"about_ca_topic_score_gemma":0.00035256732,"teacher_disagreement_score":0.0083155185,"about_ca_system_score_codex":0.0011296495,"about_ca_system_score_gemma":0.0013893547,"threshold_uncertainty_score":0.027818203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041336905,0.00048470421,0.9277851,0.0011452147,0.0002303442,0.00028235363,0.0004348463,0.0038418095,0.02445871],"genre_scores_gemma":[0.8642806,0.0003174797,0.10561577,0.0004034156,0.00018022602,0.00031547053,0.00046193594,0.00032520771,0.02809994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928756,0.0014358613,0.00025348883,0.0011913874,0.002771968,0.0014716708],"domain_scores_gemma":[0.9887489,0.0040790774,0.0010528719,0.0045030387,0.0011538987,0.00046215253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033359334,0.0010801485,0.0019058571,0.0014389266,0.0020503083,0.0042092917,0.0042475606,0.003286277,0.012617035],"category_scores_gemma":[0.011226121,0.0008889185,0.0013067705,0.0018415792,0.0033283622,0.008004043,0.0080795325,0.0038108139,0.0037241653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019064001,0.0003346163,0.0008783338,0.0002556565,0.00014900102,0.000501142,0.00069835066,0.077320494,0.022881525,0.78517133,0.009031139,0.100872025],"study_design_scores_gemma":[0.00033956935,0.0003774643,0.00032068833,0.00008250788,0.000103439124,0.00041446261,0.00008780707,0.54395187,0.03764195,0.40108415,0.015440319,0.00015564107],"about_ca_topic_score_codex":0.0018654783,"about_ca_topic_score_gemma":0.0016907518,"teacher_disagreement_score":0.012617035,"about_ca_system_score_codex":0.0034076464,"about_ca_system_score_gemma":0.004075755,"threshold_uncertainty_score":0.042208135},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009965319,0.00022257387,0.9726178,0.00040815977,0.00014040704,0.000065227,0.00013704888,0.00025750586,0.016185941],"genre_scores_gemma":[0.5137994,0.00090707926,0.4396719,0.0010499149,0.0005119585,0.0004165509,0.0005246319,0.00030423273,0.04281416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996289,0.0014220985,0.00013399731,0.0006143227,0.0012938615,0.00024679417],"domain_scores_gemma":[0.9954222,0.0016158982,0.00042243648,0.0013885361,0.0009991598,0.0001517688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023294052,0.0011356976,0.000765923,0.0014110208,0.00083498284,0.00191994,0.00089062547,0.0018713091,0.010331624],"category_scores_gemma":[0.013478937,0.0005880018,0.00046007888,0.0012685667,0.0013799709,0.0021604246,0.0021398938,0.001331734,0.0042806794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014621852,0.000047782505,0.00091283274,0.00010895237,0.000085554486,0.00007717088,0.00010568469,0.04680276,0.019241719,0.7820382,0.0046404246,0.14579266],"study_design_scores_gemma":[0.000046199126,0.00012320965,0.0008411886,0.00010040823,0.000067415785,0.00051891315,0.00007626231,0.27957243,0.02181009,0.67451686,0.022251422,0.0000757047],"about_ca_topic_score_codex":0.00033925055,"about_ca_topic_score_gemma":0.0005905956,"teacher_disagreement_score":0.010331624,"about_ca_system_score_codex":0.0006296338,"about_ca_system_score_gemma":0.0009815744,"threshold_uncertainty_score":0.034562767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23239076,0.006850259,0.54619306,0.007591887,0.0013364181,0.00011484087,0.0005704628,0.0005459099,0.20440648],"genre_scores_gemma":[0.8688531,0.0030779885,0.06102213,0.0018000142,0.0013613199,0.00023621946,0.0005218925,0.00019704772,0.062930316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964533,0.0008407662,0.00021366219,0.00070537685,0.0013304794,0.00045634675],"domain_scores_gemma":[0.9901918,0.0058331457,0.001109445,0.0019395695,0.00061914074,0.00030693156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019501843,0.0013102201,0.0013569186,0.0022428061,0.0023304683,0.004342658,0.0016894339,0.0024525963,0.008940875],"category_scores_gemma":[0.011909229,0.0010130246,0.00094921625,0.0030043444,0.00702953,0.0075821048,0.005330213,0.008481476,0.0016522738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035081368,0.000014576903,0.000092088536,0.000028075858,0.000004240329,0.00009464286,0.000110605666,0.0017185021,0.0002691808,0.99037814,0.000907216,0.006347635],"study_design_scores_gemma":[0.00000702983,0.000014318959,0.000065565444,0.000020367926,0.000004385784,0.00016000765,0.000027579204,0.0031035442,0.00060435117,0.9931238,0.0028582776,0.000010686263],"about_ca_topic_score_codex":0.0003913648,"about_ca_topic_score_gemma":0.00039170092,"teacher_disagreement_score":0.008940875,"about_ca_system_score_codex":0.001692313,"about_ca_system_score_gemma":0.00094665703,"threshold_uncertainty_score":0.029910207},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35227877,0.010369769,0.29831913,0.0164501,0.0008740223,0.00010206167,0.0013501872,0.0004864748,0.3197694],"genre_scores_gemma":[0.9513726,0.0033393272,0.023708882,0.0015335297,0.0013720467,0.00012693249,0.0005234912,0.0001521812,0.017870974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969994,0.001031838,0.0001592477,0.00052529474,0.0007560202,0.00052823004],"domain_scores_gemma":[0.983275,0.012394314,0.0008625296,0.0013572,0.001239164,0.00087178266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031896224,0.0007851031,0.0013407117,0.0018035183,0.002361828,0.003793398,0.0011960799,0.0013792949,0.004898263],"category_scores_gemma":[0.01410635,0.0008269716,0.0009740276,0.0016647008,0.007276167,0.0077257683,0.0048957835,0.004909779,0.0010154597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060729562,0.000008004405,0.00016114561,0.000036569665,0.0000058573537,0.0000203937,0.00014271388,0.00088668393,0.00035646296,0.9937605,0.0010006108,0.0035602506],"study_design_scores_gemma":[0.000010261454,0.000012027728,0.00006717017,0.000021756216,0.0000043885707,0.000035728724,0.000028612436,0.0017736342,0.00033207645,0.9957917,0.0019144722,0.000008285242],"about_ca_topic_score_codex":0.0010107119,"about_ca_topic_score_gemma":0.00069279614,"teacher_disagreement_score":0.004898263,"about_ca_system_score_codex":0.002136771,"about_ca_system_score_gemma":0.0015534606,"threshold_uncertainty_score":0.016868532},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002661745,0.2843854,0.0052330107,0.1375914,0.5243592,0.000042321182,0.00040351684,0.00016709148,0.047551826],"genre_scores_gemma":[0.0080547305,0.12859385,0.0030040531,0.07910753,0.65267813,0.00015535444,0.0005197555,0.000594956,0.12729171],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99748355,0.00065920094,0.00018905383,0.0003597633,0.0011350339,0.00017347776],"domain_scores_gemma":[0.99002963,0.0052686534,0.00047424005,0.00035989672,0.0031613184,0.00070631545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021041227,0.0028449462,0.0027691927,0.0052853134,0.002709213,0.0069031157,0.002399181,0.0075020306,0.0417216],"category_scores_gemma":[0.013082004,0.0005750665,0.0009895939,0.006619534,0.0037847112,0.012003974,0.0021731062,0.012922947,0.0275274],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001735072,0.000013550203,0.000025041594,0.00046192334,0.000010078129,0.000018735713,0.000036161662,0.00010062625,0.00009998448,0.048725992,0.9264779,0.02401265],"study_design_scores_gemma":[0.00001909055,0.000030234183,0.00012161543,0.00059846934,0.00001784421,0.00009271559,0.000039310555,0.00030399027,0.00017831205,0.055410355,0.9431661,0.00002191048],"about_ca_topic_score_codex":0.0022890246,"about_ca_topic_score_gemma":0.0029109532,"teacher_disagreement_score":0.0417216,"about_ca_system_score_codex":0.005001715,"about_ca_system_score_gemma":0.0034363235,"threshold_uncertainty_score":0.13957268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23302053,0.002483674,0.60923594,0.0033421342,0.001429244,0.00026272182,0.0009215145,0.0006720504,0.14863227],"genre_scores_gemma":[0.8554519,0.0018205837,0.09953772,0.0016866205,0.0009464036,0.00022089855,0.00063775043,0.00035069973,0.039347544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999171,0.00019255409,0.000049762082,0.00008989395,0.0004004413,0.000096334305],"domain_scores_gemma":[0.9985065,0.0004678738,0.0002062104,0.00032240202,0.00037325957,0.00012372003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007409697,0.0004873168,0.00060016935,0.0011166098,0.0008245199,0.002071287,0.00050183805,0.0013893592,0.006418106],"category_scores_gemma":[0.003867173,0.0003783927,0.00050136424,0.0009349359,0.0017848628,0.0022459123,0.00217523,0.0018725609,0.0018917845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043422715,0.000010835395,0.00012293547,0.00003980981,0.0000048876786,0.000039880564,0.00009285509,0.003438151,0.004041246,0.9824576,0.0008540033,0.008854205],"study_design_scores_gemma":[0.000024481522,0.000037219805,0.00028898643,0.000039375776,0.0000054738302,0.00018246927,0.00003349465,0.024898216,0.004222071,0.96252376,0.007710248,0.000034346096],"about_ca_topic_score_codex":0.00039150508,"about_ca_topic_score_gemma":0.00044780262,"teacher_disagreement_score":0.006418106,"about_ca_system_score_codex":0.00084057095,"about_ca_system_score_gemma":0.0009540129,"threshold_uncertainty_score":0.021470726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029066069,0.0024525244,0.93829966,0.0030527066,0.0006444479,0.000102184174,0.00012936819,0.00031602578,0.025937019],"genre_scores_gemma":[0.8244446,0.003152416,0.140618,0.000917646,0.001205921,0.00039683914,0.0002421694,0.00017373063,0.028848754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929335,0.0033288645,0.00045919998,0.0008845336,0.0017834074,0.0006105777],"domain_scores_gemma":[0.9894866,0.005981625,0.0010096154,0.0021410536,0.0010836123,0.0002974698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040027867,0.000979299,0.0011017649,0.0017286465,0.0034613868,0.0056015626,0.00134137,0.0033968673,0.0034677777],"category_scores_gemma":[0.013268512,0.00066932815,0.0009466702,0.0029606197,0.008321904,0.01251284,0.003163187,0.0052429857,0.0015094321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007994267,0.000015358552,0.00010388832,0.000040091687,0.000005224383,0.00004746666,0.00022713444,0.001889039,0.00048802074,0.987976,0.0008296087,0.0082982825],"study_design_scores_gemma":[0.000017681217,0.000025783473,0.00006220733,0.000029092549,0.000015576754,0.00016456576,0.000087688924,0.013429841,0.0014751721,0.9778715,0.0067942874,0.000026674481],"about_ca_topic_score_codex":0.00065600633,"about_ca_topic_score_gemma":0.0005510836,"teacher_disagreement_score":0.0056015626,"about_ca_system_score_codex":0.0018325653,"about_ca_system_score_gemma":0.0018520092,"threshold_uncertainty_score":0.021168947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92077535,0.00022915546,0.045718532,0.0008850876,0.00012327351,0.00003759511,0.00022474914,0.00021952209,0.031786732],"genre_scores_gemma":[0.9728836,0.000044834545,0.022991389,0.00013236438,0.000030200585,0.000047835307,0.0002324725,0.000040718427,0.0035966474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986966,0.0003945083,0.00010641313,0.0002823686,0.00027131516,0.00024880425],"domain_scores_gemma":[0.9905083,0.005713443,0.001216567,0.0013503755,0.00063404883,0.00057724526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041507,0.00045817508,0.0007401673,0.0009658589,0.002714282,0.0026296233,0.001294561,0.0018232117,0.006060563],"category_scores_gemma":[0.007790003,0.001131066,0.00068537315,0.00086164346,0.0030022026,0.0022924284,0.002528838,0.0012864787,0.0007743465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015348428,0.00014840008,0.010567021,0.0002756597,0.00012298084,0.0013221132,0.0015567972,0.009495555,0.06684692,0.8802888,0.0029798376,0.024861101],"study_design_scores_gemma":[0.00030558262,0.00045237617,0.006169587,0.00012674644,0.00015253805,0.0038505166,0.0018616535,0.058061704,0.100397035,0.8137739,0.014676151,0.00017235609],"about_ca_topic_score_codex":0.00030322248,"about_ca_topic_score_gemma":0.0004135906,"teacher_disagreement_score":0.006060563,"about_ca_system_score_codex":0.00059202313,"about_ca_system_score_gemma":0.00077670626,"threshold_uncertainty_score":0.02027464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33960578,0.00403554,0.32039353,0.005227269,0.004239962,0.0007332294,0.0052094706,0.0038471085,0.31670815],"genre_scores_gemma":[0.8791918,0.0017735405,0.06921483,0.0017419512,0.00097281963,0.0006739585,0.0016800427,0.0007353256,0.044015747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995171,0.00010432169,0.000042924366,0.00010245438,0.0000940211,0.00013927364],"domain_scores_gemma":[0.99908435,0.00019828424,0.00021017462,0.0001702278,0.00021565137,0.00012121486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004901079,0.00135122,0.00052775675,0.0016624985,0.0014951783,0.0024964442,0.00045910125,0.0012148971,0.012814806],"category_scores_gemma":[0.001712511,0.00028556693,0.0002695768,0.0012716843,0.0016768649,0.0015138441,0.0012414757,0.0013290124,0.0061636325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011108211,0.000100418154,0.0015732838,0.00032962445,0.000018656072,0.0009077606,0.00058935076,0.0018054111,0.049719527,0.81521523,0.028702017,0.09992793],"study_design_scores_gemma":[0.0001799161,0.0011280739,0.001924109,0.00035031387,0.00006641019,0.0036632298,0.0007472593,0.012403466,0.13123038,0.5992925,0.24885495,0.00015944442],"about_ca_topic_score_codex":0.00027177786,"about_ca_topic_score_gemma":0.00015652095,"teacher_disagreement_score":0.012814806,"about_ca_system_score_codex":0.0009806018,"about_ca_system_score_gemma":0.0010576496,"threshold_uncertainty_score":0.042869866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020627188,0.00035598967,0.9890915,0.00022355853,0.00010663341,0.00005039908,0.000033940894,0.00006678308,0.008008421],"genre_scores_gemma":[0.28144643,0.003222495,0.6912857,0.00065056526,0.00068241364,0.00061823975,0.0002442001,0.0002525251,0.021597425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794763,0.00069465116,0.00012367073,0.00023911336,0.0008211487,0.00017376465],"domain_scores_gemma":[0.99844736,0.00052277214,0.000106712745,0.0005348047,0.0003193121,0.00006899881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014751625,0.0011758258,0.0011280414,0.0017074302,0.0010140042,0.0030657141,0.0024039552,0.0015411017,0.005123413],"category_scores_gemma":[0.0039157327,0.000646203,0.0012881947,0.002167829,0.0024101748,0.004335473,0.00320248,0.0033060813,0.0014364389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021720816,0.00002335984,0.00003630285,0.00005477621,0.000014005648,0.00003772502,0.000052867555,0.037886124,0.0019343283,0.9390507,0.0012811762,0.019606885],"study_design_scores_gemma":[0.000016685115,0.000050675844,0.00004387637,0.000046373847,0.000018356988,0.00013096764,0.0000367944,0.32620195,0.001676581,0.6622318,0.009512062,0.000033889253],"about_ca_topic_score_codex":0.00059391756,"about_ca_topic_score_gemma":0.0011555402,"teacher_disagreement_score":0.005123413,"about_ca_system_score_codex":0.001864029,"about_ca_system_score_gemma":0.0017298145,"threshold_uncertainty_score":0.017139494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02120766,0.018873695,0.8680309,0.008594784,0.0013529799,0.000053731997,0.00017770607,0.00019530748,0.08151322],"genre_scores_gemma":[0.71525425,0.03190647,0.2154265,0.002792543,0.006367945,0.0002890118,0.00043143527,0.00018329444,0.027348557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988403,0.0006508114,0.000042847914,0.00009364327,0.0002908267,0.000081659426],"domain_scores_gemma":[0.9961659,0.0028618714,0.00021468334,0.0003750369,0.000295995,0.0000864535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013747946,0.0009076582,0.0010085035,0.0017173765,0.0009406974,0.0028220224,0.0008592125,0.001834088,0.004636557],"category_scores_gemma":[0.006220081,0.00036133247,0.0008579714,0.002683186,0.0038482263,0.0037272556,0.0016482689,0.004037111,0.0008562914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062856457,0.000006337229,0.000048075446,0.00003790448,0.0000051964776,0.00001476146,0.00005314503,0.0031295407,0.00018893661,0.98665035,0.0009237993,0.008935575],"study_design_scores_gemma":[0.0000044048124,0.0000067477126,0.00001872419,0.000015840342,0.0000019589527,0.000023572595,0.0000138926125,0.006307211,0.000060054823,0.99121386,0.0023293677,0.000004562645],"about_ca_topic_score_codex":0.0008164914,"about_ca_topic_score_gemma":0.00041236528,"teacher_disagreement_score":0.004636557,"about_ca_system_score_codex":0.0013186659,"about_ca_system_score_gemma":0.00092834904,"threshold_uncertainty_score":0.0155107975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11785698,0.024752751,0.700019,0.008151739,0.0024759446,0.00018024968,0.0009988524,0.0014236035,0.14414084],"genre_scores_gemma":[0.68837327,0.018203607,0.23355779,0.005295905,0.00472373,0.00062055764,0.0014440994,0.0013961722,0.046384923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969965,0.00073527044,0.00016992635,0.00060347765,0.0011334923,0.00036127365],"domain_scores_gemma":[0.98601276,0.008989797,0.0014331035,0.0018277062,0.0010034927,0.00073323474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017191152,0.0027886676,0.0025179845,0.0046302676,0.0022990797,0.0039391024,0.002810581,0.0031001463,0.006205464],"category_scores_gemma":[0.01687192,0.0015052274,0.0015949704,0.0052136644,0.0038738635,0.008943262,0.006407378,0.0059764134,0.0022166672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003168064,0.000060766695,0.0005436186,0.00045356274,0.00006360514,0.00022983295,0.00048296564,0.018752202,0.0046302723,0.9185226,0.011656213,0.04428748],"study_design_scores_gemma":[0.00004782561,0.000108228116,0.0003782601,0.00013113637,0.00007139061,0.0007973436,0.00014554258,0.04012483,0.0039867717,0.92896914,0.025162574,0.0000769144],"about_ca_topic_score_codex":0.00086909987,"about_ca_topic_score_gemma":0.000774334,"teacher_disagreement_score":0.006205464,"about_ca_system_score_codex":0.002272243,"about_ca_system_score_gemma":0.0010486706,"threshold_uncertainty_score":0.020759344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078820996,0.00078125903,0.88974607,0.0017875141,0.00024234378,0.00018075999,0.0002326944,0.0023009267,0.025907421],"genre_scores_gemma":[0.38477218,0.0005478958,0.6056462,0.000539278,0.0001364985,0.00026306583,0.00047387969,0.00059519283,0.0070256977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809784,0.00051780994,0.00010223682,0.00034829075,0.0007320936,0.00020178707],"domain_scores_gemma":[0.99704045,0.0016923146,0.00021126836,0.00069329666,0.00025726014,0.00010533596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012620703,0.00067487644,0.0012222641,0.001290528,0.0009356158,0.0020471155,0.0014827402,0.0012095199,0.011105966],"category_scores_gemma":[0.008053584,0.0005742931,0.0011134588,0.0018833965,0.0018482791,0.005793813,0.0020615335,0.0025152364,0.0022417232],"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.0005166916,0.00033293772,0.0009038033,0.0004339714,0.000111433845,0.000085435866,0.00023558585,0.18195994,0.01487622,0.5848801,0.0119448835,0.20371903],"study_design_scores_gemma":[0.00018717223,0.00009622561,0.00014713738,0.00004304518,0.000020469704,0.000057991332,0.00008117162,0.5871657,0.0048864735,0.4007394,0.0065418435,0.000033384676],"about_ca_topic_score_codex":0.0023622664,"about_ca_topic_score_gemma":0.0045475904,"teacher_disagreement_score":0.011105966,"about_ca_system_score_codex":0.0017849946,"about_ca_system_score_gemma":0.0025539473,"threshold_uncertainty_score":0.037153125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6715329,0.004271617,0.09589683,0.0044583348,0.00092288497,0.00008449104,0.0004922893,0.00029048076,0.2220502],"genre_scores_gemma":[0.9562005,0.0030935365,0.0089883525,0.00052181253,0.00048920093,0.000073269126,0.00024524218,0.00010623267,0.03028177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927145,0.00019592472,0.000024741246,0.000103798026,0.00019569426,0.00020835978],"domain_scores_gemma":[0.9987203,0.00053147675,0.0003284529,0.00012294161,0.000121462814,0.00017538734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079735427,0.0012908132,0.0006055641,0.0020511507,0.0014758448,0.001955025,0.00063069287,0.0010559064,0.008481048],"category_scores_gemma":[0.0016539255,0.00028347687,0.00062174676,0.0011030865,0.0034933002,0.0026494737,0.0018728559,0.0013339911,0.001367598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019711537,0.000057456535,0.00044480278,0.000059503505,0.000016314661,0.0003414359,0.00067128864,0.0051017953,0.0049632103,0.9697897,0.0017073766,0.016650146],"study_design_scores_gemma":[0.00005626114,0.00010992247,0.00088836055,0.00007396241,0.000021717677,0.00030567145,0.0001679609,0.017956086,0.0031497746,0.9711882,0.006028898,0.000053245953],"about_ca_topic_score_codex":0.0016169994,"about_ca_topic_score_gemma":0.0016191731,"teacher_disagreement_score":0.008481048,"about_ca_system_score_codex":0.0009541329,"about_ca_system_score_gemma":0.0008206688,"threshold_uncertainty_score":0.02837193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037817407,0.0007990339,0.94992393,0.0002988311,0.00015643354,0.00008101328,0.00034120976,0.00030593868,0.010276264],"genre_scores_gemma":[0.54617244,0.0013198365,0.4358232,0.00059037324,0.00024551575,0.00037049648,0.0012752292,0.00023183861,0.013971035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903667,0.00024333109,0.00006814585,0.00014052831,0.0004335203,0.00007792608],"domain_scores_gemma":[0.9982784,0.0006926966,0.00014375795,0.00041546757,0.00035090634,0.00011872587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010532124,0.00061552203,0.0009051054,0.001039524,0.0004901021,0.0013762612,0.0011983863,0.00094664766,0.0038123892],"category_scores_gemma":[0.005268254,0.00045213118,0.00050114846,0.0010408028,0.0009968816,0.0018386792,0.0018001349,0.0012597247,0.00095529406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039986393,0.00007828072,0.0006902375,0.00019723133,0.000046092206,0.000106636835,0.00015421688,0.045895528,0.021872476,0.7604237,0.0044471384,0.16568859],"study_design_scores_gemma":[0.00011462944,0.0003395969,0.00049807195,0.00010565305,0.000028155519,0.0008567832,0.00007390185,0.56209886,0.014082658,0.40439555,0.017303966,0.000102214835],"about_ca_topic_score_codex":0.00042054514,"about_ca_topic_score_gemma":0.00046041256,"teacher_disagreement_score":0.0038123892,"about_ca_system_score_codex":0.0006113065,"about_ca_system_score_gemma":0.0008891679,"threshold_uncertainty_score":0.012753785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56386167,0.00064116163,0.24890202,0.0016756203,0.00042785096,0.00016812842,0.0017513237,0.00041662797,0.1821557],"genre_scores_gemma":[0.9444963,0.00049636565,0.032572325,0.00035123172,0.0001403735,0.00013802019,0.0010638388,0.00010580557,0.020635603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927086,0.00015826878,0.00005492989,0.00009705012,0.0002284371,0.0001904318],"domain_scores_gemma":[0.99859685,0.00052827277,0.00028420717,0.00019779778,0.00022505331,0.00016783453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044051115,0.00060618087,0.00088623795,0.0015481875,0.0014797392,0.0026447377,0.00059375906,0.0021023012,0.016800953],"category_scores_gemma":[0.002343886,0.0006098467,0.00061871606,0.0016043764,0.0009399859,0.0025828122,0.0017970044,0.0018664782,0.0028675336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014168417,0.00002814609,0.00043085866,0.00007413753,0.000024996674,0.00041912842,0.00018867337,0.0061476077,0.0061871586,0.9712038,0.004058336,0.011095476],"study_design_scores_gemma":[0.000054230102,0.000046811907,0.00029244277,0.000027366355,0.000012434075,0.00034947734,0.00025237398,0.018542076,0.003566512,0.97171074,0.0051216413,0.00002386301],"about_ca_topic_score_codex":0.00048795991,"about_ca_topic_score_gemma":0.0006689245,"teacher_disagreement_score":0.016800953,"about_ca_system_score_codex":0.0007162205,"about_ca_system_score_gemma":0.0007654046,"threshold_uncertainty_score":0.056204736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73036546,0.000730751,0.19174373,0.001141928,0.00007954183,0.00022449813,0.0008599928,0.0004235086,0.07443058],"genre_scores_gemma":[0.94590276,0.00053081964,0.027128614,0.0002735515,0.000051750234,0.00023717435,0.0005638907,0.00012389208,0.025187569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939585,0.00019717468,0.000029857205,0.000094253606,0.00015228953,0.00013050175],"domain_scores_gemma":[0.99770737,0.0010457517,0.00043474534,0.00027768774,0.00029438455,0.0002400452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044755006,0.0004211152,0.00065550016,0.0016167276,0.001591841,0.0018797535,0.0012478265,0.0009878376,0.008377339],"category_scores_gemma":[0.0030529173,0.00079350296,0.0004340933,0.0019086557,0.0013409767,0.0024680216,0.0013502487,0.0011364417,0.000879807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014058295,0.000038056296,0.00050137134,0.000057664103,0.000018243596,0.00009224457,0.00023947036,0.008796647,0.0019849534,0.9782624,0.00198138,0.007887053],"study_design_scores_gemma":[0.0000532452,0.000027667009,0.0004288652,0.000024807643,0.000020465439,0.0000983284,0.00016042097,0.046738148,0.0016662366,0.9473762,0.0033865888,0.000019003039],"about_ca_topic_score_codex":0.0042313784,"about_ca_topic_score_gemma":0.0056824437,"teacher_disagreement_score":0.008377339,"about_ca_system_score_codex":0.0011704854,"about_ca_system_score_gemma":0.0012336752,"threshold_uncertainty_score":0.028025031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03984761,0.002129173,0.8490459,0.0017676548,0.0007637987,0.000231117,0.00041266,0.0008651689,0.10493698],"genre_scores_gemma":[0.49879307,0.0022285087,0.42499068,0.0023273716,0.0010163578,0.00056338456,0.0006309722,0.00024944785,0.06920025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988154,0.0004539766,0.000055669578,0.00016482745,0.00037833586,0.00013175991],"domain_scores_gemma":[0.99820197,0.00069400173,0.00023563247,0.00037783384,0.00041254418,0.00007805948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073331635,0.0012477582,0.00078685983,0.0018598558,0.0011584802,0.0025268449,0.0005720761,0.001707956,0.015839532],"category_scores_gemma":[0.0034454325,0.00038389425,0.0004906913,0.00208154,0.001100947,0.0015554174,0.0016457316,0.0011819206,0.0077741668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003664121,0.00006077203,0.00053666666,0.00024158868,0.0000746861,0.00032971994,0.00021124154,0.011342034,0.030175628,0.7698045,0.007931877,0.17892484],"study_design_scores_gemma":[0.00017401611,0.0007240779,0.0009892575,0.00037141974,0.00013174617,0.0039608926,0.00024287656,0.13187955,0.116861045,0.6041331,0.14033064,0.00020143144],"about_ca_topic_score_codex":0.00019829647,"about_ca_topic_score_gemma":0.00037504383,"teacher_disagreement_score":0.015839532,"about_ca_system_score_codex":0.0007540556,"about_ca_system_score_gemma":0.0009997512,"threshold_uncertainty_score":0.05298859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85054445,0.0007292102,0.1258703,0.0014534732,0.00013083805,0.00007942845,0.000680857,0.00024830733,0.020263163],"genre_scores_gemma":[0.9577835,0.00077344535,0.033168055,0.00027767208,0.00019872285,0.0001451027,0.00080466946,0.00022567715,0.0066232486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881554,0.0003441927,0.000058706017,0.00017151757,0.0003184346,0.0002916939],"domain_scores_gemma":[0.99287415,0.0042293672,0.001067553,0.0006717682,0.00066181435,0.0004952122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012973208,0.0012304116,0.0008719595,0.002071272,0.0014240341,0.0022721805,0.0013880625,0.0015570867,0.003361479],"category_scores_gemma":[0.0111776935,0.00055425824,0.0005262257,0.0020144773,0.0019763939,0.003097661,0.0019911001,0.0019702804,0.00059528986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010797807,0.00011764404,0.002506514,0.00027349434,0.00006009392,0.00020253171,0.0006264427,0.038124144,0.017499471,0.897204,0.0043084375,0.03799735],"study_design_scores_gemma":[0.00008698112,0.0001281792,0.0010170564,0.00010351264,0.00003598701,0.00024382272,0.00017595301,0.08536643,0.008352581,0.90185183,0.0025811528,0.00005662534],"about_ca_topic_score_codex":0.0010978214,"about_ca_topic_score_gemma":0.0015122563,"teacher_disagreement_score":0.003361479,"about_ca_system_score_codex":0.0012531005,"about_ca_system_score_gemma":0.0011317137,"threshold_uncertainty_score":0.01124531},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22096649,0.0008090157,0.7303728,0.00083191635,0.00025096853,0.0005588715,0.002111138,0.00095208373,0.043146722],"genre_scores_gemma":[0.6980033,0.00057255797,0.28207535,0.0004177825,0.00010292508,0.00076989504,0.0013068047,0.00013356931,0.01661776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850994,0.0006401585,0.000110127236,0.00015159907,0.00035671567,0.00023142569],"domain_scores_gemma":[0.9967506,0.00088325725,0.0005587742,0.000746821,0.0008795037,0.00018097785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018446678,0.00071676803,0.0008395003,0.0009319675,0.0007919348,0.0012537326,0.0007449456,0.00073876785,0.008494386],"category_scores_gemma":[0.004262248,0.0003806335,0.00042361044,0.0008674617,0.0004893039,0.0012954541,0.0007597086,0.00050735404,0.0019684713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047287866,0.00038300356,0.0032178,0.0005326753,0.0002322198,0.0003176721,0.00029562766,0.093114704,0.10654666,0.5669822,0.012287054,0.21136151],"study_design_scores_gemma":[0.0016083746,0.002890535,0.0026732185,0.0004048423,0.0003768931,0.0009099662,0.00017099976,0.421105,0.16591994,0.3305469,0.07319824,0.00019510133],"about_ca_topic_score_codex":0.0007072826,"about_ca_topic_score_gemma":0.0016544469,"teacher_disagreement_score":0.008494386,"about_ca_system_score_codex":0.0010904631,"about_ca_system_score_gemma":0.0017808321,"threshold_uncertainty_score":0.028416514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39106512,0.001574383,0.47490984,0.0017839263,0.0005925295,0.00022133312,0.0003910398,0.00085318706,0.12860864],"genre_scores_gemma":[0.86743766,0.0009648191,0.09792118,0.00041570087,0.00041651138,0.00021870044,0.00030029914,0.0003586061,0.03196648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855334,0.0005051932,0.00007124389,0.0001619526,0.0004323257,0.0002758088],"domain_scores_gemma":[0.9980293,0.0010625896,0.00017790672,0.00033145936,0.00016186206,0.00023692533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016768713,0.00095182756,0.00076196855,0.002006201,0.0012400569,0.0039933003,0.0013043763,0.0009908278,0.005425129],"category_scores_gemma":[0.0050605647,0.0008179145,0.0008283723,0.0013857419,0.003513139,0.0041810386,0.0034898345,0.0037012906,0.0015011658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008569017,0.000018686784,0.00011949788,0.000022309277,0.0000046730415,0.000028376007,0.00013009133,0.0018281728,0.00088755327,0.988384,0.00059745804,0.007893332],"study_design_scores_gemma":[0.000032686465,0.000042886746,0.00008390285,0.000018822422,0.000011680556,0.000070260074,0.00004751256,0.010682343,0.0017296476,0.98409754,0.0031627198,0.000019934698],"about_ca_topic_score_codex":0.00036438592,"about_ca_topic_score_gemma":0.00045847695,"teacher_disagreement_score":0.005425129,"about_ca_system_score_codex":0.0015928084,"about_ca_system_score_gemma":0.00076029665,"threshold_uncertainty_score":0.01814884},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23601435,0.0008190622,0.57975763,0.0013551089,0.00034383204,0.00027985784,0.0011522181,0.0011562508,0.17912169],"genre_scores_gemma":[0.8271816,0.00067208114,0.1325898,0.00073016295,0.00016294453,0.00037284594,0.0007850085,0.00029599687,0.03720959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848783,0.0005428225,0.00008771646,0.00023057462,0.00034263605,0.0003083579],"domain_scores_gemma":[0.9972696,0.000978717,0.00034379077,0.00081441656,0.0004536169,0.0001398551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080744474,0.0005493433,0.00046710245,0.0010403343,0.000935885,0.0017645311,0.0007609185,0.00073212443,0.01616607],"category_scores_gemma":[0.004098944,0.00039069177,0.00024139545,0.001525413,0.0011818632,0.001612725,0.0015758023,0.0010160601,0.003207236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031948223,0.00006342471,0.00028322838,0.00009450544,0.000011720048,0.00012391775,0.00015438694,0.009375211,0.013639291,0.92294234,0.0050380407,0.04795457],"study_design_scores_gemma":[0.00020075924,0.00036717148,0.0005918186,0.00012894759,0.000032355107,0.00066790124,0.00041459405,0.0649616,0.03652747,0.83179444,0.064242534,0.00007040454],"about_ca_topic_score_codex":0.00057996897,"about_ca_topic_score_gemma":0.00073057157,"teacher_disagreement_score":0.01616607,"about_ca_system_score_codex":0.00064456527,"about_ca_system_score_gemma":0.0007327177,"threshold_uncertainty_score":0.054080844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032138184,0.0014851165,0.7889137,0.0033914025,0.0010710306,0.00017784818,0.0005794424,0.0002901837,0.17195311],"genre_scores_gemma":[0.7032041,0.0030871783,0.20324807,0.0024805204,0.002482904,0.000672082,0.0008150097,0.00044337806,0.08356674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984363,0.00047220997,0.00008167242,0.00021235288,0.00057927484,0.00021824805],"domain_scores_gemma":[0.99840885,0.00043116754,0.00014110008,0.0004324196,0.00046850357,0.00011798149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014771108,0.0008079019,0.0005089789,0.0021831538,0.00177385,0.0029727507,0.0014032078,0.0018272218,0.0066284104],"category_scores_gemma":[0.003712059,0.00033086233,0.00092972285,0.0014291927,0.004242147,0.004445673,0.0023126132,0.003124997,0.0019907155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026525472,0.00000230465,0.000021421441,0.000008161115,8.354352e-7,0.000014535863,0.00005777202,0.00035689058,0.0001423026,0.99756026,0.00044495266,0.0013878712],"study_design_scores_gemma":[0.0000039000356,0.000014717233,0.00004158114,0.000014365317,0.0000029140635,0.00010912098,0.000034608383,0.004444273,0.0002599352,0.9819031,0.013163356,0.000008164327],"about_ca_topic_score_codex":0.0006797353,"about_ca_topic_score_gemma":0.00045725732,"teacher_disagreement_score":0.0066284104,"about_ca_system_score_codex":0.0013246748,"about_ca_system_score_gemma":0.0009561586,"threshold_uncertainty_score":0.022174299},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05313645,0.004705862,0.87124914,0.0015439856,0.001594916,0.000081648635,0.00030132238,0.00049584475,0.06689093],"genre_scores_gemma":[0.65935695,0.0097847,0.28076887,0.0013090154,0.0017281378,0.0002455426,0.0008054103,0.00032571045,0.0456757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990044,0.00028547028,0.00008727957,0.0001155453,0.00039739592,0.000109903995],"domain_scores_gemma":[0.9982309,0.0008504793,0.00023844193,0.00032093094,0.00029679222,0.00006250451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007881209,0.00082279625,0.00044711973,0.001838744,0.0005222271,0.0025105032,0.0005621079,0.0009591093,0.0055321706],"category_scores_gemma":[0.0065846234,0.00027382842,0.00034578552,0.0029622668,0.0015132386,0.0032972659,0.0014951541,0.0014827232,0.0019693307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078654586,0.0000147239925,0.00009574969,0.0000668512,0.0000037729833,0.00007025248,0.00012774597,0.0057026856,0.0021996885,0.9125199,0.0029692864,0.0761507],"study_design_scores_gemma":[0.000017930886,0.00006241852,0.00010512209,0.00014499432,0.000008246726,0.0002028878,0.00007690713,0.03587118,0.0028029254,0.93805933,0.022619745,0.000028379565],"about_ca_topic_score_codex":0.00040584992,"about_ca_topic_score_gemma":0.00045885448,"teacher_disagreement_score":0.0055321706,"about_ca_system_score_codex":0.00063596934,"about_ca_system_score_gemma":0.0005049442,"threshold_uncertainty_score":0.018506944},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41164383,0.003928067,0.37382776,0.0154579105,0.0005882758,0.00012615594,0.0016003129,0.0010306012,0.19179712],"genre_scores_gemma":[0.92635536,0.002565488,0.03313907,0.002267551,0.0009473103,0.00038003712,0.001153472,0.00050458446,0.032687172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964115,0.0008379517,0.00013768216,0.0006761457,0.0010677812,0.0008689855],"domain_scores_gemma":[0.9680935,0.025121143,0.001112844,0.0022717349,0.0012705054,0.0021301894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030500004,0.0015858617,0.0028245957,0.0037220092,0.0059408243,0.006161559,0.0032168191,0.004332557,0.018046383],"category_scores_gemma":[0.023594085,0.0016594399,0.0023310957,0.0040937327,0.0061764247,0.014457843,0.007995801,0.007911096,0.0018974193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021829613,0.000044477423,0.0003419301,0.00007614747,0.000025192467,0.00007735576,0.00035068646,0.007022163,0.00064362795,0.982612,0.0036784816,0.0049096355],"study_design_scores_gemma":[0.000035417357,0.000028449474,0.00019044097,0.00003888352,0.000026631136,0.000104125706,0.00006320671,0.020321151,0.000420182,0.9759837,0.0027682576,0.00001949909],"about_ca_topic_score_codex":0.002711115,"about_ca_topic_score_gemma":0.0019168969,"teacher_disagreement_score":0.018046383,"about_ca_system_score_codex":0.005689305,"about_ca_system_score_gemma":0.0017783671,"threshold_uncertainty_score":0.06037116},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15524322,0.0018007382,0.27417153,0.0035029314,0.001528124,0.00019369954,0.00073403935,0.0007393677,0.5620864],"genre_scores_gemma":[0.6829434,0.0019936631,0.063445374,0.0016168165,0.0008523348,0.00019368125,0.00043277928,0.0004156641,0.24810632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999009,0.00016768489,0.000051317176,0.0001927003,0.00034519998,0.00023405475],"domain_scores_gemma":[0.9984498,0.00053424074,0.00017970944,0.00035155617,0.00035303916,0.00013159917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005217258,0.0010781089,0.0006289006,0.0018927194,0.0016851816,0.002158117,0.00062968954,0.0012446523,0.021364251],"category_scores_gemma":[0.0037913853,0.00060955354,0.0005053231,0.0015571328,0.0021683502,0.002737429,0.0015815377,0.002585584,0.0074868007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003186825,0.000012568169,0.000054028766,0.000018672767,0.000003919949,0.000075668715,0.00010154653,0.000687523,0.0015914921,0.9838832,0.002403956,0.011135562],"study_design_scores_gemma":[0.000012747701,0.000032039374,0.00014548887,0.000032040654,0.000007310726,0.00022133622,0.00004882631,0.0031983173,0.004693266,0.9632824,0.028301137,0.000025149575],"about_ca_topic_score_codex":0.0013023999,"about_ca_topic_score_gemma":0.0015419283,"teacher_disagreement_score":0.021364251,"about_ca_system_score_codex":0.0010760613,"about_ca_system_score_gemma":0.001044898,"threshold_uncertainty_score":0.0714705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073117994,0.004881545,0.7820665,0.0064036176,0.00048368052,0.000059256603,0.00031766316,0.00041010225,0.13225968],"genre_scores_gemma":[0.8422004,0.0071507795,0.09931256,0.0026755612,0.0024406493,0.0003084071,0.00047497425,0.0004242025,0.04501251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993325,0.00026220875,0.000034940567,0.000117557574,0.00017020074,0.000082553604],"domain_scores_gemma":[0.9960323,0.00277971,0.00033415022,0.0003226916,0.0003474528,0.0001836915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014215404,0.00078728324,0.0011735405,0.003088871,0.0015813885,0.0033637788,0.0009657196,0.0014488016,0.007365212],"category_scores_gemma":[0.007799823,0.00051509036,0.0011008447,0.003406688,0.0037843643,0.0051950924,0.0020947054,0.0041033416,0.0015011173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013320935,0.000011278571,0.00006485042,0.000029947736,0.000005172415,0.00003993738,0.00007355436,0.0015571829,0.00045874034,0.9914384,0.0014474785,0.0048601255],"study_design_scores_gemma":[0.000007925462,0.00000967827,0.000051275736,0.000008203405,0.00000610537,0.00006731576,0.000030435633,0.008849259,0.00036913846,0.98759985,0.0029896738,0.0000110956935],"about_ca_topic_score_codex":0.00065193645,"about_ca_topic_score_gemma":0.0006231343,"teacher_disagreement_score":0.007365212,"about_ca_system_score_codex":0.0016029564,"about_ca_system_score_gemma":0.00064159156,"threshold_uncertainty_score":0.02463901},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026030498,0.00026753749,0.9516582,0.0014730651,0.00022199315,0.00017726979,0.00016559976,0.0015084078,0.018497396],"genre_scores_gemma":[0.833538,0.00031431043,0.13803197,0.0004643278,0.00026968768,0.0003947402,0.00030302693,0.00018976236,0.026494164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99434596,0.0013890562,0.00034696265,0.00069294294,0.0020500785,0.0011749999],"domain_scores_gemma":[0.99349517,0.0020833686,0.00041567194,0.0026671502,0.001057154,0.0002815124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030523501,0.0013078152,0.0011952843,0.0010666908,0.0024487344,0.0030832023,0.0017398436,0.0030902722,0.012556355],"category_scores_gemma":[0.008207069,0.00091252674,0.00069399027,0.0013694534,0.0029176679,0.007077457,0.008372682,0.0038621451,0.005785077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001435061,0.00018951324,0.00050205743,0.00026218154,0.000047715355,0.00035470387,0.00048576965,0.020269325,0.033855446,0.8301423,0.00908129,0.10337471],"study_design_scores_gemma":[0.0003143128,0.000325633,0.00039179582,0.00011857885,0.00006729623,0.0008794959,0.00018456345,0.2633843,0.062278517,0.651596,0.02028957,0.00016993152],"about_ca_topic_score_codex":0.00038601615,"about_ca_topic_score_gemma":0.0005314129,"teacher_disagreement_score":0.012556355,"about_ca_system_score_codex":0.0014530924,"about_ca_system_score_gemma":0.0031993918,"threshold_uncertainty_score":0.04200518},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29980507,0.0069906283,0.32355234,0.009224338,0.0022929541,0.00018778486,0.000693753,0.0007968836,0.35645628],"genre_scores_gemma":[0.8690347,0.0064942967,0.0454251,0.002681602,0.0023405133,0.00033744687,0.0008509521,0.0005400141,0.072295405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982089,0.00048038145,0.00014005745,0.00026009412,0.0005692791,0.00034131328],"domain_scores_gemma":[0.99167585,0.0047769714,0.0008471423,0.0008391665,0.0009557648,0.0009051204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00417679,0.002392417,0.00221684,0.009191092,0.003916412,0.0038325035,0.0021749516,0.001942341,0.011988121],"category_scores_gemma":[0.013243806,0.0010925194,0.0028334875,0.007858587,0.008587251,0.015700407,0.0066801673,0.0074715833,0.0024231556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009890285,0.00006227205,0.0005967402,0.00015359305,0.000026559017,0.00012745107,0.00035132206,0.0016130373,0.0007203534,0.9836464,0.0034728686,0.009130542],"study_design_scores_gemma":[0.000013157183,0.00001919882,0.00020511911,0.000032706354,0.000024577666,0.00009452235,0.00006561787,0.0047080135,0.00032408553,0.99195296,0.002541297,0.000018881787],"about_ca_topic_score_codex":0.0018161208,"about_ca_topic_score_gemma":0.0026940384,"teacher_disagreement_score":0.011988121,"about_ca_system_score_codex":0.0028050668,"about_ca_system_score_gemma":0.0016565573,"threshold_uncertainty_score":0.04010433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19556965,0.0021476701,0.74531084,0.002163,0.00077007787,0.0003455714,0.0007818022,0.0033771584,0.04953424],"genre_scores_gemma":[0.67184705,0.0005186239,0.28779072,0.00082050863,0.0004039937,0.00026032227,0.0010257058,0.00038698604,0.036946192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782914,0.00041757684,0.00012860782,0.0003163271,0.00095605163,0.00035240848],"domain_scores_gemma":[0.99712235,0.0011202529,0.00023336045,0.00092282466,0.00047966457,0.000121620804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017117808,0.0007821468,0.00085945235,0.0012283103,0.0010683404,0.0016344025,0.0009603034,0.0013358124,0.011921669],"category_scores_gemma":[0.0041437047,0.00035830907,0.0004167999,0.001039576,0.0009804248,0.0028303002,0.0026387912,0.0028319384,0.0027430712],"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.001689537,0.00022724389,0.0009822926,0.00023156218,0.00005278847,0.00021507962,0.00034409246,0.019880079,0.054954648,0.68369484,0.011255677,0.2264722],"study_design_scores_gemma":[0.0004920018,0.0007029357,0.0012858495,0.00023726036,0.00010659756,0.0009211707,0.00017086322,0.24537773,0.16926695,0.5075871,0.07363012,0.00022149956],"about_ca_topic_score_codex":0.0005146423,"about_ca_topic_score_gemma":0.0012010821,"teacher_disagreement_score":0.011921669,"about_ca_system_score_codex":0.0016052794,"about_ca_system_score_gemma":0.0017447869,"threshold_uncertainty_score":0.039881945},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39481694,0.007928576,0.47152045,0.029227236,0.0006710123,0.00049871893,0.0021364389,0.0007781493,0.09242249],"genre_scores_gemma":[0.9453901,0.004030072,0.035682797,0.0012004611,0.001266069,0.00033958818,0.0008880896,0.00029206442,0.010910701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915086,0.0029053073,0.00035795258,0.0008439073,0.0030593039,0.0013250399],"domain_scores_gemma":[0.89415973,0.09031038,0.004426932,0.00709478,0.002460954,0.00154704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056877513,0.0019322488,0.003548715,0.0036057865,0.0035267868,0.0059578405,0.0036542937,0.005693987,0.009854819],"category_scores_gemma":[0.05010771,0.0014869191,0.0029695034,0.004207683,0.007183231,0.02272609,0.006452555,0.008988487,0.0011630794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014528573,0.0003459051,0.0037354976,0.00051560113,0.00030715013,0.00039693367,0.0006313603,0.24344634,0.0035301489,0.692137,0.016689278,0.036811877],"study_design_scores_gemma":[0.00013249743,0.00008133177,0.0008123545,0.000056501613,0.000101574566,0.00027722467,0.00012184858,0.34679487,0.001081166,0.64849716,0.0019673111,0.00007610734],"about_ca_topic_score_codex":0.0024403946,"about_ca_topic_score_gemma":0.0019919437,"teacher_disagreement_score":0.009854819,"about_ca_system_score_codex":0.006008873,"about_ca_system_score_gemma":0.003128219,"threshold_uncertainty_score":0.04359764},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30836675,0.0026080874,0.3941909,0.0024139162,0.00092467025,0.0005070025,0.0021580358,0.0015250855,0.28730553],"genre_scores_gemma":[0.8222696,0.0013663456,0.085108176,0.0008790217,0.00040734743,0.0008414933,0.002159847,0.0003686316,0.08659941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998638,0.0003565442,0.000059790942,0.00027439592,0.00042399482,0.00024726495],"domain_scores_gemma":[0.99747086,0.0008791909,0.00038940873,0.00042944704,0.00037860312,0.000452477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008544213,0.0011646271,0.00082790357,0.0015297505,0.003186254,0.0033651826,0.0010738192,0.0012739314,0.00934887],"category_scores_gemma":[0.0040785195,0.0007702014,0.000867642,0.0018562505,0.0024275053,0.0024423038,0.0027232494,0.0025743477,0.0020365326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019367225,0.000035491008,0.00062351336,0.00010984357,0.000026338483,0.00031871465,0.0002695163,0.0055066464,0.0019238645,0.9537154,0.010341104,0.026935983],"study_design_scores_gemma":[0.00009966517,0.00020300946,0.0013152862,0.00013522804,0.00003508206,0.0012955628,0.00030857392,0.022507735,0.00590542,0.8751062,0.09299418,0.00009402657],"about_ca_topic_score_codex":0.00079841143,"about_ca_topic_score_gemma":0.00067208,"teacher_disagreement_score":0.00934887,"about_ca_system_score_codex":0.0011140556,"about_ca_system_score_gemma":0.0012753091,"threshold_uncertainty_score":0.031275094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23278366,0.0013919692,0.6731651,0.002769472,0.0006847456,0.00044015166,0.0015477826,0.0029528064,0.08426427],"genre_scores_gemma":[0.7870879,0.0010570642,0.1619779,0.0009136584,0.00022442902,0.00042378908,0.00090313284,0.00034430978,0.047067776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939835,0.0001739952,0.00003263644,0.000080947306,0.00021035419,0.00010367982],"domain_scores_gemma":[0.99837315,0.00048161036,0.00017624052,0.0006360244,0.00027004958,0.00006289613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003985828,0.00056479883,0.0005440442,0.0012429387,0.0010105517,0.0013014135,0.00069761276,0.0013287828,0.008885412],"category_scores_gemma":[0.0025426224,0.0003039649,0.00045891685,0.0014577924,0.000848202,0.0011993815,0.0010535733,0.0015349516,0.0019932494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026962813,0.000088390414,0.00056478794,0.00017575668,0.00003775265,0.0003186402,0.0004224154,0.032874532,0.015486256,0.86094886,0.008558396,0.08025457],"study_design_scores_gemma":[0.0001048562,0.00021858868,0.00059794885,0.00014598202,0.00006273694,0.0007299581,0.00013187986,0.114018746,0.025246197,0.823157,0.035515673,0.00007037584],"about_ca_topic_score_codex":0.0010100415,"about_ca_topic_score_gemma":0.0015085757,"teacher_disagreement_score":0.008885412,"about_ca_system_score_codex":0.00084751245,"about_ca_system_score_gemma":0.0012582714,"threshold_uncertainty_score":0.029724658},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07389941,0.023274437,0.7191444,0.015393872,0.001852889,0.00035528676,0.0021646873,0.0017628542,0.16215222],"genre_scores_gemma":[0.7836845,0.021083962,0.13481978,0.0058362465,0.0038708528,0.0015348309,0.0025976922,0.0018158645,0.04475625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886362,0.0028067722,0.00031547892,0.0011793894,0.004212146,0.002849964],"domain_scores_gemma":[0.9136841,0.07003727,0.0027294883,0.006540668,0.004632136,0.0023763103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009575779,0.0057552215,0.0044659968,0.008118759,0.0040955837,0.0106196,0.0056928126,0.004599805,0.02059726],"category_scores_gemma":[0.07542602,0.0024314993,0.0020292453,0.0100300005,0.008423593,0.020463938,0.011679522,0.01263551,0.004947117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007157432,0.00021062508,0.0006413116,0.0005474961,0.00008570757,0.00016155776,0.0005955322,0.047523595,0.0026649283,0.8793586,0.021314029,0.046180908],"study_design_scores_gemma":[0.00005476766,0.00007046882,0.00020022425,0.00024830113,0.00006458811,0.00008957495,0.000099851015,0.057623535,0.0013253972,0.9332533,0.006914005,0.00005607147],"about_ca_topic_score_codex":0.0052232714,"about_ca_topic_score_gemma":0.0053565847,"teacher_disagreement_score":0.02059726,"about_ca_system_score_codex":0.01136885,"about_ca_system_score_gemma":0.0047128657,"threshold_uncertainty_score":0.082487226},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.391276,0.0084628435,0.24723306,0.004386519,0.002251864,0.000103372084,0.00048963656,0.00040651878,0.34539026],"genre_scores_gemma":[0.91179305,0.005683327,0.029330978,0.00094697915,0.0017739738,0.0000981227,0.00028046494,0.00013118789,0.049961913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944144,0.0001305316,0.000033953558,0.00008991296,0.00016572337,0.00013835577],"domain_scores_gemma":[0.99911314,0.00036227945,0.00016904202,0.00012002465,0.00012722948,0.00010838754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007937775,0.0013215811,0.0006265064,0.0026112378,0.0013704051,0.0034888163,0.00068299513,0.0010465198,0.0059309397],"category_scores_gemma":[0.00245305,0.00044211943,0.00055237045,0.0026333602,0.0030355153,0.0037816006,0.0016857393,0.0023493795,0.0013618558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013454619,0.0000070213046,0.000037778344,0.000014978341,0.0000012680899,0.000029818711,0.00013840952,0.00047857995,0.00029907472,0.99342656,0.00054542813,0.0050077112],"study_design_scores_gemma":[0.0000070431934,0.000012315169,0.00004568076,0.000018336501,0.0000021024593,0.000041949093,0.00004166665,0.00117739,0.00013947353,0.9952945,0.0032129767,0.0000064110172],"about_ca_topic_score_codex":0.0007747152,"about_ca_topic_score_gemma":0.00059255376,"teacher_disagreement_score":0.0059309397,"about_ca_system_score_codex":0.0014773043,"about_ca_system_score_gemma":0.00055147195,"threshold_uncertainty_score":0.019840956},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14999674,0.0022790493,0.29846475,0.0030184146,0.002239689,0.00015490824,0.0011991902,0.0031260601,0.5395212],"genre_scores_gemma":[0.80928606,0.00088722736,0.048658654,0.00096599665,0.00083484285,0.00015254028,0.00050250953,0.00076731446,0.13794477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867356,0.0003595529,0.000071281494,0.00021641424,0.00038263682,0.00029658282],"domain_scores_gemma":[0.9988881,0.0002853867,0.00014252434,0.0003179049,0.00023757489,0.00012855008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010208461,0.0007478341,0.00079704926,0.0010269202,0.0015280837,0.0029805086,0.00078168896,0.0007259895,0.02430453],"category_scores_gemma":[0.0026497862,0.00031055513,0.00047445385,0.0007395662,0.0015735592,0.0040520513,0.0021654158,0.0018724325,0.00882065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000222304,0.000041745076,0.00014324296,0.00008879902,0.000008611248,0.0000800457,0.00011899371,0.0007053924,0.0027667382,0.95819354,0.0066517987,0.03097874],"study_design_scores_gemma":[0.00005212073,0.00015332933,0.00032856135,0.00012553413,0.000041629435,0.00054867566,0.00007885435,0.008966606,0.018468987,0.88387513,0.08730005,0.000060630406],"about_ca_topic_score_codex":0.0005454266,"about_ca_topic_score_gemma":0.00053983636,"teacher_disagreement_score":0.02430453,"about_ca_system_score_codex":0.001094302,"about_ca_system_score_gemma":0.0006850763,"threshold_uncertainty_score":0.081306756},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25585482,0.001096366,0.6682604,0.0018537303,0.0003388337,0.00018666353,0.00075970753,0.0014681179,0.0701813],"genre_scores_gemma":[0.6695431,0.0010066879,0.29843557,0.0011401519,0.0002847744,0.0003826526,0.0009600547,0.00061997026,0.027627127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985947,0.000523579,0.00009676937,0.00023065406,0.00034047102,0.00021386666],"domain_scores_gemma":[0.9950984,0.0027094574,0.00059814524,0.0010449182,0.00027344268,0.00027561755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011045897,0.0008853923,0.0011913544,0.0019117949,0.0018788726,0.0024609119,0.0012706285,0.0021208802,0.011524522],"category_scores_gemma":[0.005866095,0.0012774616,0.0008913059,0.0024026495,0.0017420042,0.003986174,0.0033084925,0.002940248,0.0028223216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028859687,0.00010518002,0.0003101364,0.00016016196,0.00003061106,0.00017657445,0.00032786687,0.019578863,0.0072993888,0.9156678,0.0053428374,0.05071196],"study_design_scores_gemma":[0.0000494014,0.00011875544,0.00014098483,0.00007140049,0.000013060614,0.00024763864,0.00009826252,0.049508877,0.0051576775,0.9378048,0.0067540356,0.000035167002],"about_ca_topic_score_codex":0.0002968303,"about_ca_topic_score_gemma":0.00044358472,"teacher_disagreement_score":0.011524522,"about_ca_system_score_codex":0.0007798794,"about_ca_system_score_gemma":0.0006555198,"threshold_uncertainty_score":0.038553417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041446436,0.00022884304,0.9233717,0.00036598326,0.00024407118,0.00015495686,0.00014965089,0.0007379835,0.033300344],"genre_scores_gemma":[0.3625621,0.0004883668,0.59175324,0.00049188413,0.00021953096,0.00040876336,0.00039245322,0.0006598201,0.043023847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989209,0.00030332166,0.00006955803,0.000199753,0.000344943,0.00016151054],"domain_scores_gemma":[0.9983171,0.0006222504,0.00012357773,0.0005214584,0.0003018819,0.0001136876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010085035,0.0007679866,0.0006795822,0.0011741902,0.0012475912,0.0016705976,0.0013007778,0.0011336571,0.0077794353],"category_scores_gemma":[0.0030375433,0.0007192937,0.0012741103,0.00090457645,0.0019088828,0.0023185583,0.0023616562,0.0023819255,0.00332878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004074044,0.000037875383,0.00015541172,0.00006988721,0.000010466124,0.00009632366,0.00020549966,0.0022302472,0.008468038,0.93934184,0.0023485492,0.046995148],"study_design_scores_gemma":[0.00005699809,0.00013810473,0.00025434946,0.00006253124,0.000053167903,0.0005317072,0.0000839969,0.029536108,0.020631414,0.90891814,0.03966367,0.000069882684],"about_ca_topic_score_codex":0.00043137217,"about_ca_topic_score_gemma":0.00090640894,"teacher_disagreement_score":0.0077794353,"about_ca_system_score_codex":0.0010070456,"about_ca_system_score_gemma":0.00093247206,"threshold_uncertainty_score":0.026024878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68355155,0.0010066291,0.24604914,0.0014725724,0.00015835374,0.00005178859,0.00020640738,0.00014952791,0.06735403],"genre_scores_gemma":[0.97758764,0.0003682188,0.014394212,0.00022251812,0.00006416692,0.000053578406,0.00010453751,0.000023269393,0.007181806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951303,0.00015150396,0.00002348358,0.00007646696,0.00012984885,0.000105656814],"domain_scores_gemma":[0.9975382,0.0013751342,0.00030532727,0.00021002295,0.0003379135,0.00023326125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007952493,0.0004010006,0.0005843967,0.0010656655,0.0015019544,0.0017098555,0.0005910261,0.0012934468,0.0041185217],"category_scores_gemma":[0.0034738735,0.000436177,0.00038141676,0.00073923334,0.0022554789,0.002807398,0.0021546858,0.0014974944,0.00048930757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006920165,0.000011187555,0.00025245576,0.000027807888,0.000007862365,0.00005943913,0.00017854174,0.004988897,0.0015622394,0.98902166,0.0004846649,0.0033360175],"study_design_scores_gemma":[0.000017389391,0.000041932082,0.00022866199,0.000023892248,0.000006620991,0.00009395507,0.00018212832,0.041063573,0.0010517539,0.9560775,0.0011898886,0.000022757997],"about_ca_topic_score_codex":0.0008500816,"about_ca_topic_score_gemma":0.00071310933,"teacher_disagreement_score":0.0041185217,"about_ca_system_score_codex":0.000772179,"about_ca_system_score_gemma":0.0007197226,"threshold_uncertainty_score":0.013777852},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36589724,0.002160011,0.39638808,0.0034234226,0.0005480376,0.000112034846,0.0005206188,0.00047532527,0.23047517],"genre_scores_gemma":[0.8453527,0.0020338208,0.04126561,0.0007594595,0.0007134329,0.00017535516,0.00033645015,0.00027746157,0.109085664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896157,0.00030791812,0.000049126895,0.00013522443,0.00039299057,0.00015317107],"domain_scores_gemma":[0.9980186,0.0008776526,0.00027428434,0.0002293544,0.00033057854,0.0002694781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009896802,0.0016762057,0.0010172937,0.0039276597,0.0014184025,0.0034409412,0.0009733342,0.0013787484,0.009890492],"category_scores_gemma":[0.0040023075,0.00084709143,0.0007846282,0.0032131013,0.003671626,0.004858847,0.0026770756,0.0037939653,0.0022357013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016988317,0.000005426392,0.000039283877,0.000009385822,0.0000026857256,0.000022133183,0.00007576023,0.00075298623,0.00034568363,0.9946101,0.00040770211,0.0037118797],"study_design_scores_gemma":[0.000009277131,0.00001257363,0.00006365102,0.000012290645,0.000004372921,0.000049903025,0.000027702044,0.0034442581,0.00030104362,0.9937663,0.00229823,0.000010432925],"about_ca_topic_score_codex":0.00085806055,"about_ca_topic_score_gemma":0.0007564563,"teacher_disagreement_score":0.009890492,"about_ca_system_score_codex":0.0020382574,"about_ca_system_score_gemma":0.00067285926,"threshold_uncertainty_score":0.033087015},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72600204,0.0031866266,0.14572252,0.0029714245,0.0007411917,0.00009772591,0.00040257964,0.00021969384,0.12065617],"genre_scores_gemma":[0.95924246,0.0023862314,0.011175687,0.00048504438,0.0010440628,0.00008425174,0.00030741893,0.00008998091,0.025184909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897325,0.0002716894,0.000046300516,0.00012512493,0.00032152692,0.0002621065],"domain_scores_gemma":[0.99720395,0.001313485,0.0004702331,0.00030408255,0.00035449557,0.00035369824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010753481,0.0011262976,0.00081384846,0.0032450364,0.0018696194,0.0025118412,0.00078417856,0.0014500548,0.0054176706],"category_scores_gemma":[0.00349829,0.0006430785,0.0006642375,0.0027018648,0.004260868,0.0047218148,0.003739209,0.0022925788,0.00074988045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060927698,0.000025941355,0.00016434076,0.000028432863,0.000003737595,0.00007392006,0.00018938739,0.001848036,0.000701525,0.9932701,0.00044698382,0.0031867146],"study_design_scores_gemma":[0.000021311695,0.000037056347,0.00013295774,0.0000336582,0.0000073960814,0.000107171494,0.000067052584,0.0075738044,0.00076586724,0.9893679,0.001864702,0.000021110687],"about_ca_topic_score_codex":0.0010095306,"about_ca_topic_score_gemma":0.00094476395,"teacher_disagreement_score":0.0054176706,"about_ca_system_score_codex":0.0017928163,"about_ca_system_score_gemma":0.00097085617,"threshold_uncertainty_score":0.018123925},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33902532,0.0009636081,0.53688836,0.0012421358,0.00056116056,0.00028351686,0.00055543054,0.00094453414,0.11953598],"genre_scores_gemma":[0.85321486,0.00040343867,0.124382295,0.0006773384,0.00023773391,0.00023894131,0.00025377164,0.00008214398,0.02050943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982862,0.0007353851,0.00010588783,0.00017803993,0.00046727454,0.00022710864],"domain_scores_gemma":[0.9974577,0.0008183668,0.00036873194,0.0006820657,0.00044401403,0.00022912124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015503671,0.00069203594,0.0007410658,0.001289445,0.0011055445,0.0018371335,0.00080004893,0.0012722301,0.011325441],"category_scores_gemma":[0.0038378157,0.00054245326,0.0007091901,0.001084385,0.0010860163,0.0015400684,0.0015123824,0.0009593309,0.002711431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005982317,0.000059999864,0.000883802,0.0002026597,0.00006959382,0.00038495005,0.00022965098,0.007707093,0.018428862,0.9173771,0.0028932942,0.05116474],"study_design_scores_gemma":[0.0002675883,0.00052340294,0.0008294945,0.00011863295,0.00012576119,0.0010602548,0.00011876301,0.043980084,0.012565569,0.91728157,0.023046337,0.000082426115],"about_ca_topic_score_codex":0.0002723337,"about_ca_topic_score_gemma":0.0007132208,"teacher_disagreement_score":0.011325441,"about_ca_system_score_codex":0.0006514812,"about_ca_system_score_gemma":0.0010354463,"threshold_uncertainty_score":0.037887394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0556905,0.00048135073,0.8668575,0.0008805034,0.00030161152,0.0004116408,0.0004018395,0.0020235735,0.07295144],"genre_scores_gemma":[0.8588044,0.0003924507,0.08699898,0.0005010861,0.00023027613,0.00030621886,0.00048602305,0.00024466758,0.05203594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99640745,0.0008861871,0.0001294544,0.00046599878,0.0012876226,0.0008233431],"domain_scores_gemma":[0.99437606,0.0008298965,0.0003855,0.003510995,0.0007254034,0.00017207871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013293156,0.0011329973,0.0010837028,0.0009668372,0.001462933,0.0032841456,0.0018274323,0.0019589057,0.022356994],"category_scores_gemma":[0.0042424356,0.00049733766,0.0007103687,0.001636751,0.0011738178,0.004644158,0.0051079877,0.0015371419,0.0070264786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020266522,0.00048866874,0.001849086,0.00031752916,0.00017991559,0.0004330294,0.0005108985,0.07303071,0.046143413,0.48910126,0.019259136,0.36665976],"study_design_scores_gemma":[0.00022192356,0.0006753325,0.000689237,0.00012172452,0.00011623622,0.0010085829,0.00022212727,0.42410457,0.069330126,0.44215813,0.06124312,0.00010898711],"about_ca_topic_score_codex":0.00046251385,"about_ca_topic_score_gemma":0.0006493745,"teacher_disagreement_score":0.022356994,"about_ca_system_score_codex":0.0014274075,"about_ca_system_score_gemma":0.0017975252,"threshold_uncertainty_score":0.07479155},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23225021,0.0025793817,0.6313051,0.0033792998,0.0006402173,0.00028803898,0.0013925382,0.0006547224,0.12751052],"genre_scores_gemma":[0.7892989,0.0022239937,0.15032606,0.0009641388,0.00080125796,0.000461087,0.002798459,0.0004256374,0.052700438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982204,0.0005596344,0.000105459,0.0002955097,0.0005068858,0.0003120609],"domain_scores_gemma":[0.9963904,0.0014678007,0.0005211449,0.0006871565,0.00044223573,0.000491239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013774617,0.0010167006,0.001181431,0.0025705318,0.0028402656,0.0057151476,0.001627223,0.0019883523,0.0075939544],"category_scores_gemma":[0.006208643,0.0010427212,0.0012114542,0.0029523952,0.0046455553,0.0059441538,0.004265775,0.005365072,0.0015913766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024026258,0.000011907071,0.00011859547,0.00004041127,0.000003508664,0.000026228341,0.00014298088,0.0013718168,0.00025742696,0.9902846,0.0020127466,0.005705774],"study_design_scores_gemma":[0.00001580762,0.000028609602,0.00018839817,0.00005053289,0.000008398383,0.00013773663,0.00012422397,0.007504339,0.0010170587,0.97794807,0.012952018,0.000024847612],"about_ca_topic_score_codex":0.0005044766,"about_ca_topic_score_gemma":0.00035414132,"teacher_disagreement_score":0.0075939544,"about_ca_system_score_codex":0.0014329343,"about_ca_system_score_gemma":0.0009103406,"threshold_uncertainty_score":0.025404334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6076958,0.0040768967,0.26858038,0.001567134,0.0006904826,0.00012765655,0.00060864666,0.00044334045,0.11620967],"genre_scores_gemma":[0.93884784,0.0014970492,0.030505583,0.00021071277,0.0005385318,0.00006530143,0.000338276,0.00014018838,0.027856566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998899,0.00022970498,0.000064518725,0.00021690075,0.0003779389,0.00021187848],"domain_scores_gemma":[0.99829966,0.0006862059,0.00031503892,0.00026404904,0.00024984908,0.00018526422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010170634,0.0007862052,0.0006697866,0.0013957582,0.0009113299,0.0025229368,0.00061338244,0.000626267,0.007381643],"category_scores_gemma":[0.003294102,0.0004694311,0.00070738036,0.0013866092,0.0022701675,0.003861369,0.0014351836,0.0015161588,0.0010194965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010293003,0.000022213633,0.0002926139,0.000045071174,0.000011948528,0.00012677803,0.00023971192,0.0014559285,0.0013227839,0.9856269,0.00090814696,0.009844937],"study_design_scores_gemma":[0.000027087543,0.00005539889,0.00031272552,0.00002899583,0.000021561644,0.00025458957,0.00009172936,0.005359638,0.0025357753,0.9833377,0.007952906,0.000021825606],"about_ca_topic_score_codex":0.0005053913,"about_ca_topic_score_gemma":0.0006641748,"teacher_disagreement_score":0.007381643,"about_ca_system_score_codex":0.0010493872,"about_ca_system_score_gemma":0.00069650076,"threshold_uncertainty_score":0.024694085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2274082,0.013147222,0.68370914,0.0013203991,0.0009366926,0.00014331749,0.0003328341,0.0007178146,0.072284296],"genre_scores_gemma":[0.7656017,0.007464442,0.19930199,0.0003744142,0.0009196844,0.00015022108,0.0006116427,0.0000988349,0.025477137],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997398,0.00005115348,0.000014354745,0.000032668366,0.00013913766,0.000022940369],"domain_scores_gemma":[0.9992118,0.0004265507,0.00005659675,0.000120528384,0.00015579989,0.000028767741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029508793,0.00042297717,0.00038142223,0.0013318292,0.00033380536,0.0006834138,0.00040741093,0.0007082128,0.0031381978],"category_scores_gemma":[0.0023447168,0.00019771763,0.00024556371,0.001731261,0.000575526,0.00074730336,0.00060125196,0.00052892236,0.00052831543],"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.0004043899,0.00010472604,0.00069757854,0.00032732083,0.00002889474,0.00047171745,0.00024689408,0.05619313,0.050562423,0.43324435,0.0051048207,0.45261377],"study_design_scores_gemma":[0.00006454861,0.00028699037,0.0013197502,0.00017153117,0.000037978025,0.0019388224,0.00013785268,0.65086526,0.052344855,0.26601258,0.026760146,0.000059670834],"about_ca_topic_score_codex":0.00035915736,"about_ca_topic_score_gemma":0.00041863284,"teacher_disagreement_score":0.0031381978,"about_ca_system_score_codex":0.0004197169,"about_ca_system_score_gemma":0.00039165159,"threshold_uncertainty_score":0.010498285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3853514,0.003858152,0.3225143,0.002587546,0.0030382322,0.00052338373,0.0024892872,0.0021695122,0.2774683],"genre_scores_gemma":[0.884798,0.001359573,0.057377353,0.0010753421,0.00085968233,0.00037452392,0.0010494506,0.0004582334,0.052647922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996419,0.00007873292,0.000029485056,0.000074981384,0.00007634812,0.00009859971],"domain_scores_gemma":[0.99937916,0.00013090055,0.00014325658,0.00011543474,0.00013543123,0.00009585706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033432638,0.0012534091,0.00060074363,0.0016612594,0.0015104314,0.0027290208,0.0004238791,0.0011617275,0.0114020305],"category_scores_gemma":[0.0013139197,0.00035067872,0.0003147061,0.0014159172,0.001309312,0.0014865969,0.0011496219,0.0013192691,0.004186979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014400686,0.00011551005,0.0019316485,0.0003397993,0.000021892662,0.0010411958,0.0005090951,0.0033566619,0.06200029,0.82802063,0.016504088,0.084719196],"study_design_scores_gemma":[0.00018759428,0.0010671358,0.002835523,0.00025123585,0.00007861009,0.0047067115,0.0005263799,0.021182485,0.10661362,0.6780927,0.18428783,0.00017022519],"about_ca_topic_score_codex":0.00024669105,"about_ca_topic_score_gemma":0.00021499718,"teacher_disagreement_score":0.0114020305,"about_ca_system_score_codex":0.0007119953,"about_ca_system_score_gemma":0.00080167135,"threshold_uncertainty_score":0.038143635},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1053572,0.0003218425,0.8664795,0.00059901446,0.00027596543,0.00014671183,0.000319735,0.0018738859,0.024626248],"genre_scores_gemma":[0.6662607,0.00036399276,0.3188681,0.0005151943,0.00017948047,0.00034519206,0.0005558619,0.00028686557,0.012624675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993807,0.00012456697,0.00004745244,0.000088814384,0.00025113355,0.000107273205],"domain_scores_gemma":[0.99899954,0.00039432422,0.00013494589,0.00022293549,0.0001412703,0.00010706104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003852318,0.00065182,0.00048664236,0.0006392971,0.00066990603,0.00093002367,0.00063340034,0.0009417363,0.0036588],"category_scores_gemma":[0.001940927,0.00043634875,0.0005993919,0.00070058095,0.0006505846,0.0009738175,0.0018477251,0.001154297,0.0014790172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041841815,0.000085593245,0.00090519607,0.0002342557,0.00003890893,0.0004743929,0.00040206354,0.01937035,0.12502469,0.6880124,0.004685085,0.16034855],"study_design_scores_gemma":[0.00014386605,0.0007946157,0.0013267974,0.00014736077,0.00008392937,0.0018983522,0.00015577574,0.16224957,0.18158309,0.59912515,0.052315794,0.00017567782],"about_ca_topic_score_codex":0.00024029828,"about_ca_topic_score_gemma":0.00030065965,"teacher_disagreement_score":0.0036588,"about_ca_system_score_codex":0.0005272075,"about_ca_system_score_gemma":0.00062624994,"threshold_uncertainty_score":0.012239933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1180467,0.0009229684,0.83810174,0.003499917,0.00032315718,0.00011638341,0.00025592328,0.00054898957,0.038184125],"genre_scores_gemma":[0.9269092,0.0004339476,0.0540385,0.00039891741,0.00030843238,0.0002008942,0.00017614521,0.00015926146,0.0173748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99315464,0.0028961613,0.0003458051,0.00067771703,0.002001025,0.0009245937],"domain_scores_gemma":[0.98908114,0.005984431,0.0008861918,0.0027456188,0.0008908684,0.0004116351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040096343,0.00061033433,0.0010465627,0.0014565436,0.0032335368,0.005603558,0.0015023736,0.0024907698,0.0037312966],"category_scores_gemma":[0.012842263,0.0008375596,0.0010160828,0.002409078,0.0064413208,0.012180389,0.004570264,0.004959303,0.0011254883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010156189,0.000013165396,0.00011201874,0.000016770127,0.0000043577847,0.000033428598,0.00018962141,0.0031441622,0.00043739696,0.9912923,0.00067492225,0.003980327],"study_design_scores_gemma":[0.000014686995,0.000011621883,0.000035042638,0.000008021145,0.0000060433304,0.0000447308,0.000049194452,0.011377391,0.00076809555,0.98563,0.002044187,0.000010963386],"about_ca_topic_score_codex":0.0008362465,"about_ca_topic_score_gemma":0.0006516584,"teacher_disagreement_score":0.005603558,"about_ca_system_score_codex":0.0027823271,"about_ca_system_score_gemma":0.0021273354,"threshold_uncertainty_score":0.021205246},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35565457,0.0026895355,0.37287292,0.0071202223,0.0014314282,0.00013861149,0.0008104849,0.00047038303,0.2588117],"genre_scores_gemma":[0.91298693,0.0009949693,0.04479334,0.0016896047,0.0010416684,0.00017825108,0.00040036868,0.00015522461,0.03775967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908197,0.00016454647,0.000062161846,0.0003027676,0.00022601394,0.00016246247],"domain_scores_gemma":[0.9983215,0.00075897994,0.00015824498,0.0003425963,0.000254469,0.00016423942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001069889,0.00060206914,0.0011471867,0.0023897942,0.0025400065,0.0023524638,0.0013610927,0.0015078369,0.007235024],"category_scores_gemma":[0.0037354664,0.0004414439,0.0015799272,0.0015257573,0.0038861209,0.009014425,0.0038809967,0.0027451173,0.0009843708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001690779,0.000006507496,0.000090498674,0.000017216358,0.0000039471915,0.000026932159,0.00011090763,0.0003251206,0.0003521724,0.99622935,0.00071081985,0.0021095895],"study_design_scores_gemma":[0.000007518139,0.000012481458,0.0001293568,0.000010940225,0.0000060185616,0.000077726254,0.000039244715,0.0017173394,0.00037386533,0.99329644,0.0043202615,0.000008887846],"about_ca_topic_score_codex":0.0010020641,"about_ca_topic_score_gemma":0.0007381598,"teacher_disagreement_score":0.007235024,"about_ca_system_score_codex":0.0019248431,"about_ca_system_score_gemma":0.00077637174,"threshold_uncertainty_score":0.024203539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10784542,0.0010244946,0.88076967,0.00028049023,0.00011436353,0.00009120212,0.00015865058,0.0005636481,0.009152084],"genre_scores_gemma":[0.7398242,0.0011134672,0.25374162,0.00024004291,0.00014867821,0.00012979277,0.00024748044,0.000109945795,0.0044448217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920756,0.00019352081,0.000047374455,0.0001184214,0.00031730765,0.00011585482],"domain_scores_gemma":[0.99813277,0.0008181826,0.00030572494,0.00035725892,0.0002567925,0.00012939602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007028865,0.001005905,0.0006410069,0.0010914817,0.00059010467,0.00085943146,0.00058414723,0.00086199323,0.0015101619],"category_scores_gemma":[0.003388862,0.00049736636,0.00041156728,0.0015739219,0.0008976246,0.001620339,0.0012396247,0.0011253952,0.0004836213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011007453,0.0001886682,0.0024945848,0.00038072228,0.00011224401,0.0005735133,0.0004002439,0.09087717,0.19471622,0.47171018,0.0026587038,0.234787],"study_design_scores_gemma":[0.00022447074,0.0009740447,0.0016804539,0.00018164901,0.00019502858,0.0023521907,0.00012286112,0.5593747,0.22853759,0.18905191,0.017078523,0.00022662581],"about_ca_topic_score_codex":0.00048754283,"about_ca_topic_score_gemma":0.00071256584,"teacher_disagreement_score":0.0015101619,"about_ca_system_score_codex":0.00059452927,"about_ca_system_score_gemma":0.0011571352,"threshold_uncertainty_score":0.00505203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37109846,0.0015989821,0.56729734,0.0024056374,0.00032274736,0.00018302382,0.00045127672,0.002681764,0.05396076],"genre_scores_gemma":[0.8997141,0.0004979971,0.082881935,0.00026533336,0.00018594122,0.00008265882,0.00030267856,0.0002825262,0.015786774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822944,0.0003715049,0.000095427175,0.00029291166,0.0005492414,0.00046136705],"domain_scores_gemma":[0.99638224,0.002147057,0.00023198943,0.0008629817,0.00024348294,0.00013222445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001265751,0.0008890854,0.001209532,0.0009834719,0.0011068538,0.0029176902,0.0012444912,0.00096431095,0.009047275],"category_scores_gemma":[0.0065804794,0.0004069403,0.00062457414,0.0015088962,0.0019543115,0.005748445,0.0028040707,0.001603202,0.0020796976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020737501,0.00024747604,0.0020203155,0.0004994302,0.000085867534,0.00041132348,0.00091287,0.03822319,0.021320986,0.61641103,0.014509563,0.30328417],"study_design_scores_gemma":[0.00024529677,0.00020210883,0.00042183275,0.00007170325,0.00006346144,0.00028491367,0.00020442122,0.086229935,0.018392503,0.8870949,0.0067458106,0.000043236883],"about_ca_topic_score_codex":0.000794646,"about_ca_topic_score_gemma":0.0017449553,"teacher_disagreement_score":0.009047275,"about_ca_system_score_codex":0.0015762412,"about_ca_system_score_gemma":0.0017204521,"threshold_uncertainty_score":0.030266106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58821154,0.0036583485,0.13500924,0.0047055124,0.0016822817,0.000100007,0.00041040345,0.00042271652,0.26580006],"genre_scores_gemma":[0.8929809,0.0020723552,0.019256031,0.0014396983,0.0010190727,0.00013683617,0.00036722742,0.0003014316,0.08242647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984687,0.00038492758,0.00007754427,0.0001551062,0.0004813371,0.000432421],"domain_scores_gemma":[0.99738425,0.0014500985,0.00036993966,0.0002867226,0.00025127712,0.0002578581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012499159,0.001722359,0.0014441725,0.0030128446,0.0030866885,0.0035957065,0.0012984866,0.0020204326,0.010123175],"category_scores_gemma":[0.005083065,0.00083402265,0.0009337549,0.0032392484,0.0045183226,0.005984864,0.004585065,0.0035754035,0.0027138328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008519608,0.00001679632,0.00011737408,0.000037208334,0.000005961953,0.00007657398,0.00022767975,0.0014345525,0.00056441897,0.9897738,0.0014266951,0.006233881],"study_design_scores_gemma":[0.000012924345,0.000015687318,0.00009197993,0.000037692334,0.0000068434138,0.00009724259,0.00005475251,0.0033654666,0.0006230619,0.99289715,0.0027785616,0.000018493789],"about_ca_topic_score_codex":0.0008455201,"about_ca_topic_score_gemma":0.0011309502,"teacher_disagreement_score":0.010123175,"about_ca_system_score_codex":0.0020347715,"about_ca_system_score_gemma":0.0011662007,"threshold_uncertainty_score":0.033865333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18976478,0.0009752948,0.7236854,0.00071213813,0.0002758535,0.00008219203,0.00020754931,0.00042145033,0.0838753],"genre_scores_gemma":[0.80074805,0.0013250943,0.15448558,0.00060402823,0.00023907694,0.00019028981,0.00035564147,0.0004053145,0.041646842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860173,0.0004906714,0.00007455408,0.00018094205,0.00037738006,0.0002747421],"domain_scores_gemma":[0.9978211,0.0009296816,0.00027176636,0.0005380343,0.00031720602,0.00012217538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010627229,0.0007567162,0.00068198075,0.0011628745,0.00086560025,0.0018446425,0.0007876018,0.00075399346,0.008691814],"category_scores_gemma":[0.004326323,0.00047694962,0.0004573092,0.0017406597,0.001834128,0.0033379397,0.0026502851,0.0014090416,0.0015299808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006023045,0.000009219504,0.00008136933,0.000022546734,0.0000032823186,0.000037666134,0.000085752625,0.0049746856,0.0011747712,0.9782599,0.000888101,0.014402462],"study_design_scores_gemma":[0.000029725681,0.00005062236,0.00011490284,0.000043307118,0.000009975228,0.00014164312,0.00013030731,0.03420235,0.0021590954,0.9514179,0.011678852,0.000021259875],"about_ca_topic_score_codex":0.0007485222,"about_ca_topic_score_gemma":0.0007953134,"teacher_disagreement_score":0.008691814,"about_ca_system_score_codex":0.0007867609,"about_ca_system_score_gemma":0.0004491977,"threshold_uncertainty_score":0.029077053},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.165919,0.0036646514,0.2733122,0.008325175,0.0016892486,0.0001670571,0.001461711,0.0010184913,0.5444425],"genre_scores_gemma":[0.68513757,0.0032295312,0.07837484,0.0020044926,0.0012510917,0.0001835393,0.0011013009,0.00060565403,0.22811195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989606,0.00031457,0.00007116313,0.00017399297,0.00028351357,0.00019601008],"domain_scores_gemma":[0.9989311,0.00038689893,0.00013531087,0.00020056439,0.00019889658,0.0001473303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007638078,0.00059544365,0.00084149337,0.0017351914,0.002442197,0.004292834,0.00052823714,0.0008683313,0.017104972],"category_scores_gemma":[0.0018502532,0.00056493847,0.0004866579,0.0021001867,0.0027022657,0.005941069,0.0024972053,0.0027192107,0.005447058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030190587,0.000009968473,0.00004888672,0.000023413551,0.0000023200248,0.000020882317,0.00010514773,0.00014478387,0.00029540472,0.9899266,0.0019735808,0.007418952],"study_design_scores_gemma":[0.000010666441,0.000012723567,0.00004339957,0.00001940636,0.000004905508,0.0000830177,0.00007674478,0.00048562215,0.00059512525,0.97998524,0.018674295,0.000008780989],"about_ca_topic_score_codex":0.00052363693,"about_ca_topic_score_gemma":0.0006169401,"teacher_disagreement_score":0.017104972,"about_ca_system_score_codex":0.0014874408,"about_ca_system_score_gemma":0.0009778906,"threshold_uncertainty_score":0.05722189},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060709573,0.00046171693,0.88337153,0.0017217541,0.00020081915,0.00019618534,0.00023068361,0.00056645996,0.052541178],"genre_scores_gemma":[0.5961949,0.0012702537,0.35354427,0.00085339823,0.00028329162,0.00052650325,0.00058153283,0.00041676254,0.046329085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908435,0.00037117224,0.00003926985,0.00010187076,0.00025614194,0.00014712795],"domain_scores_gemma":[0.9982332,0.00084444234,0.00016736543,0.0004703211,0.0001781548,0.000106529835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009775474,0.0007308968,0.0004841951,0.0009525896,0.0016249229,0.0018754989,0.00085198117,0.0014148435,0.0060392586],"category_scores_gemma":[0.0035449653,0.0006174869,0.000796372,0.0014213983,0.0020850196,0.0026309509,0.002093993,0.0025094862,0.0019449819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047524238,0.000019350651,0.000109025226,0.000034060507,0.0000053844233,0.00006824902,0.00015711944,0.0060271756,0.0019131012,0.9736242,0.002227533,0.015767206],"study_design_scores_gemma":[0.000031978856,0.000051980667,0.00008122383,0.000039730905,0.000012984848,0.00017933596,0.000058567304,0.02779824,0.0061084894,0.94639075,0.01922172,0.00002494802],"about_ca_topic_score_codex":0.0006319977,"about_ca_topic_score_gemma":0.0008723227,"teacher_disagreement_score":0.0060392586,"about_ca_system_score_codex":0.0013698159,"about_ca_system_score_gemma":0.0010634597,"threshold_uncertainty_score":0.020203352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42444235,0.0020057897,0.31145552,0.007452722,0.002286428,0.0002434556,0.0018347302,0.0014050934,0.24887393],"genre_scores_gemma":[0.86146134,0.0011730975,0.04266281,0.0019804803,0.0012439545,0.00028744005,0.00077005953,0.0005621478,0.08985873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984042,0.0003336788,0.000085784435,0.0002682967,0.0005291852,0.00037891293],"domain_scores_gemma":[0.99814177,0.00048280624,0.00032023733,0.00025482362,0.0005125593,0.00028774797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011734411,0.0011117359,0.00084141875,0.0030426972,0.0018849146,0.0040160376,0.0009067001,0.0015733705,0.013549359],"category_scores_gemma":[0.0029725444,0.00058926275,0.0008170471,0.0017845146,0.0024145562,0.0038035763,0.0027174049,0.0029090368,0.0037539154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111909925,0.000033179498,0.00009711496,0.000026729416,0.0000071926497,0.000038693222,0.00007338819,0.0003841762,0.001218877,0.9884791,0.001940888,0.007588731],"study_design_scores_gemma":[0.00004715096,0.0000323603,0.00019509005,0.00004120066,0.0000144462765,0.00021620031,0.00005182047,0.003987473,0.0045084017,0.98064435,0.010226487,0.000035013793],"about_ca_topic_score_codex":0.0006108205,"about_ca_topic_score_gemma":0.0005671202,"teacher_disagreement_score":0.013549359,"about_ca_system_score_codex":0.0017847627,"about_ca_system_score_gemma":0.0013748091,"threshold_uncertainty_score":0.045327127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46487436,0.0005804658,0.47369537,0.001166093,0.00043778974,0.00022980396,0.00045304606,0.0010396505,0.057523403],"genre_scores_gemma":[0.88316995,0.00031525892,0.09715777,0.00019564363,0.00013176746,0.000115267816,0.00034362014,0.00014353453,0.01842712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994647,0.00011980724,0.000034500867,0.00006705283,0.00021049938,0.000103337145],"domain_scores_gemma":[0.99914193,0.0002299669,0.00010528401,0.0002339484,0.0001372475,0.00015159062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005852816,0.0004309252,0.0005459962,0.0012019016,0.0009078978,0.0013072821,0.000477809,0.0005518558,0.0038341312],"category_scores_gemma":[0.0012590224,0.00040823885,0.0005824149,0.0006939926,0.0010963044,0.0011088406,0.0027001488,0.0012106415,0.00081578724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014641015,0.000067272056,0.0007146061,0.00008688382,0.000017514421,0.000170029,0.0003676306,0.004799863,0.00981212,0.9575067,0.0018212707,0.02448978],"study_design_scores_gemma":[0.00018536238,0.00024039455,0.00080489804,0.00010911742,0.000057827718,0.0009775055,0.00029429636,0.062407594,0.05836043,0.8364969,0.039979137,0.00008649549],"about_ca_topic_score_codex":0.00014590166,"about_ca_topic_score_gemma":0.00021200521,"teacher_disagreement_score":0.0038341312,"about_ca_system_score_codex":0.0007078238,"about_ca_system_score_gemma":0.0007037276,"threshold_uncertainty_score":0.012826443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7163396,0.001149354,0.17165272,0.012688083,0.0010103099,0.00018949139,0.0011933516,0.0011776873,0.094599426],"genre_scores_gemma":[0.95635253,0.0005768563,0.02294298,0.00068524905,0.0005847322,0.00019211661,0.0007732394,0.00038942648,0.017502872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965469,0.00085828465,0.00021009835,0.0007141,0.0008944577,0.0007761295],"domain_scores_gemma":[0.98130405,0.01214275,0.0013771774,0.0017315972,0.0013013307,0.0021431327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037207364,0.0019271739,0.001847323,0.0028633769,0.004573914,0.006573171,0.0048619835,0.00401269,0.013268193],"category_scores_gemma":[0.019877095,0.0009595993,0.001331486,0.0023753683,0.01093608,0.013790513,0.0045093987,0.0068794303,0.0019538687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008087012,0.00014929537,0.0013314957,0.00009861528,0.000029291074,0.00010858146,0.00042770317,0.0035656313,0.0030239585,0.9760686,0.0028037343,0.011584358],"study_design_scores_gemma":[0.00008157618,0.00007722416,0.00037709868,0.000048767743,0.000028689808,0.00018728242,0.00015372732,0.016795238,0.0036814162,0.9769512,0.0015723509,0.00004549778],"about_ca_topic_score_codex":0.0012738106,"about_ca_topic_score_gemma":0.0015411518,"teacher_disagreement_score":0.013268193,"about_ca_system_score_codex":0.0031163548,"about_ca_system_score_gemma":0.0028729516,"threshold_uncertainty_score":0.044386566},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075452894,0.010407691,0.39773223,0.009498395,0.0031352756,0.00016699763,0.0004041904,0.00042407896,0.5027783],"genre_scores_gemma":[0.7925354,0.005740729,0.06650509,0.0028786596,0.0028719609,0.00031348324,0.00029005302,0.00023826073,0.1286263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821436,0.0006572239,0.00008368181,0.0002679417,0.00055941177,0.00021743221],"domain_scores_gemma":[0.99847454,0.00064156164,0.00015782264,0.00032900373,0.0002942978,0.00010274329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001221129,0.0008145312,0.0008832478,0.0018521723,0.0022729025,0.003919767,0.00065603794,0.0023114516,0.009885357],"category_scores_gemma":[0.0049343784,0.00046854556,0.0005259472,0.0019933698,0.0059290426,0.0052113524,0.0026852412,0.0034184663,0.002221233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002661785,0.0000018638481,0.000007039243,0.000004892859,5.7410693e-7,0.0000028648544,0.000030164178,0.000070254646,0.000044077162,0.99755967,0.0003737163,0.0019021969],"study_design_scores_gemma":[0.0000030269823,0.000006126586,0.000014117248,0.000008415745,0.000001189064,0.000025141526,0.000020434947,0.0005310405,0.00016033112,0.9937232,0.0055028223,0.00000412518],"about_ca_topic_score_codex":0.0005415755,"about_ca_topic_score_gemma":0.0002763594,"teacher_disagreement_score":0.009885357,"about_ca_system_score_codex":0.0015787798,"about_ca_system_score_gemma":0.0010195281,"threshold_uncertainty_score":0.03306985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5288818,0.0006781737,0.1075886,0.0030338496,0.0015354104,0.00017785569,0.00074334885,0.0010823385,0.35627875],"genre_scores_gemma":[0.8872957,0.0006330421,0.019378714,0.0012049515,0.0005252244,0.00020223304,0.00040952643,0.00042893962,0.08992153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991835,0.0001612936,0.000043991513,0.00012509663,0.00025384122,0.00023228937],"domain_scores_gemma":[0.9995789,0.00011241074,0.000068215355,0.00007866919,0.000072390496,0.00008938726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048770255,0.0011558364,0.0010158423,0.0021807316,0.002378117,0.0037238328,0.0007078292,0.0014720822,0.015453748],"category_scores_gemma":[0.0013190649,0.0005450249,0.0007256278,0.001418143,0.0022380883,0.002686798,0.0023115089,0.0023994504,0.0031890555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005925697,0.000024007966,0.000052235875,0.000023892051,0.0000061991864,0.00006775068,0.00008137265,0.0003995048,0.0012214859,0.9915201,0.0014547799,0.005089489],"study_design_scores_gemma":[0.00003984596,0.00005230021,0.00015768042,0.000027182381,0.000016669492,0.000335958,0.000092236456,0.0033097097,0.0030017078,0.9840627,0.008873125,0.00003081313],"about_ca_topic_score_codex":0.0004048462,"about_ca_topic_score_gemma":0.00049457286,"teacher_disagreement_score":0.015453748,"about_ca_system_score_codex":0.0010666968,"about_ca_system_score_gemma":0.0007738516,"threshold_uncertainty_score":0.05169797},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3337613,0.00053770415,0.56903404,0.0026993342,0.00043654503,0.000097155134,0.00034819345,0.00052000594,0.09256566],"genre_scores_gemma":[0.88782626,0.00052321906,0.066400446,0.00045475422,0.00033688036,0.00010579152,0.00032913242,0.00030263697,0.043720916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986891,0.00031284138,0.000057064437,0.00020113826,0.0005280092,0.00021186205],"domain_scores_gemma":[0.99784005,0.0008875712,0.00017996969,0.0004386168,0.0003467545,0.00030701852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009678146,0.00074927934,0.00086857466,0.0011197665,0.0009566247,0.002506592,0.001441949,0.0013633929,0.0078136595],"category_scores_gemma":[0.007470675,0.00043699457,0.0005501526,0.001009724,0.003288988,0.004391117,0.002736912,0.0031551141,0.001402461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011427413,0.000031596406,0.00015743008,0.000022550847,0.0000055322294,0.000033018117,0.00009071367,0.004664457,0.0013847203,0.98359156,0.0010007218,0.00890344],"study_design_scores_gemma":[0.000013197253,0.000038386734,0.000047020436,0.000009087691,0.0000032809794,0.00006748181,0.00003261213,0.022511905,0.001163234,0.9747696,0.00133254,0.0000116772535],"about_ca_topic_score_codex":0.00072874385,"about_ca_topic_score_gemma":0.0005103095,"teacher_disagreement_score":0.0078136595,"about_ca_system_score_codex":0.00108423,"about_ca_system_score_gemma":0.0010982356,"threshold_uncertainty_score":0.026139319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4972508,0.00054726197,0.3816663,0.0018475114,0.00037464162,0.00022598488,0.0008424382,0.0006989541,0.1165461],"genre_scores_gemma":[0.866292,0.00063424616,0.058743175,0.0003580391,0.00015350345,0.0002249668,0.00037575528,0.00015432882,0.07306408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999676,0.000064390835,0.000019739,0.000075268304,0.00007257546,0.000091961214],"domain_scores_gemma":[0.99834037,0.00063228776,0.00021108877,0.00018912295,0.00022728476,0.00039979487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038256825,0.00046319133,0.0005649412,0.0010936831,0.0011467902,0.001660412,0.00045474575,0.00058875914,0.008201009],"category_scores_gemma":[0.0017478556,0.00042443888,0.0003842556,0.00063142664,0.0014795434,0.002346769,0.0015201668,0.0010102326,0.0012477469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021379734,0.00003635253,0.0006944085,0.000097291646,0.000011390388,0.00017313671,0.0002285228,0.0053806757,0.008160469,0.96781766,0.0020945198,0.015091721],"study_design_scores_gemma":[0.00006947627,0.00012548703,0.00073532155,0.00004223198,0.000027179885,0.00030263016,0.0002492242,0.018496778,0.008668086,0.9487565,0.022497699,0.000029301094],"about_ca_topic_score_codex":0.00082087494,"about_ca_topic_score_gemma":0.0016809833,"teacher_disagreement_score":0.008201009,"about_ca_system_score_codex":0.0006410787,"about_ca_system_score_gemma":0.0005399902,"threshold_uncertainty_score":0.027435064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6853972,0.0074027367,0.1574314,0.009887434,0.00062566984,0.00007655627,0.0003942029,0.00021165682,0.13857308],"genre_scores_gemma":[0.96336293,0.0026772062,0.011478619,0.00033223178,0.0011786635,0.00006227641,0.00019289658,0.00006954954,0.020645741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986626,0.00041165273,0.00006428956,0.0002881673,0.00036065874,0.00021268925],"domain_scores_gemma":[0.9889749,0.007928472,0.0010464435,0.00093894725,0.0005983868,0.00051274704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018387921,0.00085959287,0.0011866405,0.0030176095,0.0018284512,0.0033121125,0.0013425599,0.0012926668,0.0069706477],"category_scores_gemma":[0.012004596,0.0007764864,0.00086600037,0.0024812697,0.0074612116,0.0065955366,0.0030566,0.006099337,0.0006636793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051791325,0.000029797582,0.00025468916,0.00005438643,0.0000072022312,0.000066333145,0.0002651942,0.0021458855,0.00048450966,0.99035954,0.00059080153,0.0056899763],"study_design_scores_gemma":[0.00001027973,0.000008118275,0.00008212597,0.000013070651,0.0000022101194,0.00006678086,0.000030550083,0.0023755045,0.00018604827,0.9962276,0.0009913282,0.000006420284],"about_ca_topic_score_codex":0.00066261535,"about_ca_topic_score_gemma":0.0004985993,"teacher_disagreement_score":0.0069706477,"about_ca_system_score_codex":0.0021596116,"about_ca_system_score_gemma":0.00082771585,"threshold_uncertainty_score":0.023319125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6672843,0.0010406468,0.19081534,0.002083647,0.00057845784,0.00014105729,0.00047176797,0.0005883539,0.13699637],"genre_scores_gemma":[0.96524054,0.00035969898,0.017083509,0.0004359162,0.00022286217,0.00011493863,0.0001462592,0.00008678059,0.016309425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999458,0.00014789522,0.000021683916,0.000086613574,0.000090517744,0.00019527868],"domain_scores_gemma":[0.9977563,0.00087890675,0.00036038028,0.0004108546,0.000231941,0.0003615869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009887702,0.00081526116,0.0007772305,0.0018488518,0.0018028334,0.0019704152,0.0006709462,0.0016859149,0.008959348],"category_scores_gemma":[0.004099814,0.00044111098,0.00036350047,0.0007208336,0.0020276865,0.002612194,0.0018067274,0.0013313789,0.00090940297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017437025,0.000026643203,0.0003308376,0.000034057226,0.0000051149923,0.0001336637,0.00016838608,0.0015741695,0.004787152,0.9842296,0.001967966,0.006568028],"study_design_scores_gemma":[0.000059707752,0.00014228743,0.0006641269,0.00003419346,0.000014025316,0.00022936438,0.00027433655,0.024141721,0.005905752,0.9636129,0.004871277,0.00005021701],"about_ca_topic_score_codex":0.00067013776,"about_ca_topic_score_gemma":0.00071972393,"teacher_disagreement_score":0.008959348,"about_ca_system_score_codex":0.00083591667,"about_ca_system_score_gemma":0.00060642126,"threshold_uncertainty_score":0.029972017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8130523,0.0017620232,0.12740235,0.001062412,0.00017617753,0.000108221684,0.0006278459,0.0004920153,0.055316642],"genre_scores_gemma":[0.9376779,0.0006969097,0.04986521,0.00050419325,0.00009719743,0.00020242119,0.0006115287,0.00007524198,0.010269311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926466,0.00013207308,0.00005219556,0.00010821536,0.0002806141,0.00016220297],"domain_scores_gemma":[0.996089,0.002167455,0.0006503807,0.00034142128,0.000436101,0.0003156914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006362176,0.0004406191,0.0006065883,0.0014842107,0.0011417517,0.001285431,0.00076241046,0.0014664549,0.0025159996],"category_scores_gemma":[0.0033525196,0.000632336,0.00044838057,0.00092745875,0.0013713333,0.0010376173,0.0012861572,0.0011346267,0.00062061305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039258023,0.000048844886,0.0011184919,0.00018788752,0.000028119754,0.0003226649,0.00036346953,0.004798049,0.022889925,0.9534044,0.0017692606,0.014676208],"study_design_scores_gemma":[0.00025517397,0.00029486982,0.0015553079,0.0001809425,0.00007831812,0.0017925049,0.0002470117,0.050808493,0.05301664,0.8745238,0.017115561,0.00013149016],"about_ca_topic_score_codex":0.00042306527,"about_ca_topic_score_gemma":0.000490721,"teacher_disagreement_score":0.0025159996,"about_ca_system_score_codex":0.0011124515,"about_ca_system_score_gemma":0.00089134456,"threshold_uncertainty_score":0.008416891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7232293,0.00070571294,0.21394998,0.0015079306,0.0005300508,0.000109075794,0.00024722467,0.00030737135,0.05941332],"genre_scores_gemma":[0.9355454,0.00037009508,0.039089587,0.0003487361,0.00023853079,0.000096899086,0.00013300353,0.00005281895,0.02412487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992679,0.00024502465,0.000043563152,0.00010809276,0.00016485795,0.00017055517],"domain_scores_gemma":[0.99839336,0.0005726213,0.00042356024,0.00020850393,0.00019628588,0.000205607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667852,0.00074542174,0.00060215034,0.0016627405,0.0012697382,0.0024962716,0.0006757353,0.0011473338,0.004597432],"category_scores_gemma":[0.0017533654,0.00043108175,0.00054492644,0.0012263632,0.0021878018,0.0028661855,0.0012220942,0.0014444394,0.00057765824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010452838,0.000017532968,0.00024233795,0.000021639777,0.0000082059,0.00012864225,0.00014874879,0.0039005168,0.001930858,0.9879067,0.0004784574,0.005111912],"study_design_scores_gemma":[0.0000274813,0.000053898882,0.00018834136,0.000019618414,0.000010016265,0.00016120187,0.00012392552,0.018957531,0.002953607,0.97456914,0.002908255,0.000026891152],"about_ca_topic_score_codex":0.00097288314,"about_ca_topic_score_gemma":0.0014966925,"teacher_disagreement_score":0.004597432,"about_ca_system_score_codex":0.0012843485,"about_ca_system_score_gemma":0.00096847594,"threshold_uncertainty_score":0.015379906},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58690554,0.003890816,0.20700014,0.0047199577,0.0015035917,0.00007563987,0.00032321463,0.00040731326,0.19517381],"genre_scores_gemma":[0.93750286,0.0016632464,0.014057124,0.0006778978,0.0008480154,0.00007759365,0.00019214945,0.00020684263,0.044774257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990036,0.0003163812,0.00004999046,0.0001269902,0.00028207936,0.00022089118],"domain_scores_gemma":[0.9972385,0.0015359372,0.00036090086,0.00024909555,0.0003153939,0.00030013899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001492666,0.0013841933,0.001056082,0.002833501,0.0022350089,0.0033176835,0.0013052312,0.0015498888,0.007530612],"category_scores_gemma":[0.008786697,0.00066982175,0.0007198276,0.001957834,0.005028006,0.0054442817,0.0033032463,0.0029440625,0.0017641432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075335425,0.000014803009,0.00012776231,0.000032029864,0.0000053263293,0.000058770525,0.0001824214,0.0015212864,0.0006384005,0.9922036,0.00091428077,0.004225991],"study_design_scores_gemma":[0.000013350226,0.00001357902,0.00006412052,0.000025841098,0.0000050876665,0.00006685243,0.00005276372,0.0039486615,0.00038768153,0.9942497,0.0011562267,0.000016036856],"about_ca_topic_score_codex":0.00075171416,"about_ca_topic_score_gemma":0.00073050335,"teacher_disagreement_score":0.007530612,"about_ca_system_score_codex":0.0014416807,"about_ca_system_score_gemma":0.00083455176,"threshold_uncertainty_score":0.02519238},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56140155,0.0013562887,0.2865243,0.0031983238,0.0015318396,0.00010325339,0.000369827,0.00039999562,0.14511457],"genre_scores_gemma":[0.91421837,0.0007142415,0.037669342,0.00088526163,0.0007685032,0.000126443,0.00018974066,0.00023092658,0.045197133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906784,0.00019416846,0.00005577112,0.00012593197,0.00033713775,0.0002191867],"domain_scores_gemma":[0.9973304,0.0010621944,0.00036127333,0.00042748908,0.0004485742,0.00037004636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012345485,0.00081031356,0.0005817253,0.002920231,0.001706846,0.0030391726,0.00074851286,0.0015942156,0.008350481],"category_scores_gemma":[0.0050237137,0.00040913603,0.0005851209,0.0016822026,0.0022709062,0.003421974,0.0023182074,0.0022678033,0.0015474734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045024106,0.000013979124,0.00016094501,0.000016821776,0.0000025020656,0.00003363471,0.00010866264,0.0005326812,0.001428042,0.99021554,0.00080688985,0.0066352542],"study_design_scores_gemma":[0.0000121332705,0.000016216287,0.00015393436,0.000015753123,0.00000461371,0.0001122606,0.00003472233,0.0057645952,0.0014274329,0.98962665,0.0028148822,0.000016778136],"about_ca_topic_score_codex":0.00052754884,"about_ca_topic_score_gemma":0.00071394944,"teacher_disagreement_score":0.008350481,"about_ca_system_score_codex":0.0013060115,"about_ca_system_score_gemma":0.0007152212,"threshold_uncertainty_score":0.027935207},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90613526,0.00046567057,0.05279346,0.00067634747,0.0001280886,0.000036929992,0.00017302578,0.00016863234,0.03942257],"genre_scores_gemma":[0.9804128,0.00015477573,0.012767751,0.00011307048,0.00009148111,0.000040598137,0.00014464073,0.000037725094,0.0062371613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951625,0.00010908585,0.00003637421,0.000109475106,0.000119563454,0.00010937721],"domain_scores_gemma":[0.99784946,0.0009779371,0.00032990807,0.00038540378,0.00017826643,0.00027902628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006358554,0.0004951261,0.000530917,0.0016274251,0.0014230757,0.0021682335,0.0007233001,0.0014828764,0.0026387323],"category_scores_gemma":[0.002774643,0.0004677597,0.0006342041,0.0007007605,0.0027439583,0.0023540144,0.0009401118,0.0014498339,0.00029636428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009959912,0.000028478562,0.0004921964,0.000030454941,0.000006100004,0.00018475232,0.00024859267,0.00081158016,0.0051872544,0.9884545,0.00050487934,0.00395156],"study_design_scores_gemma":[0.000063752086,0.00009098796,0.0007365542,0.00002613834,0.000017481938,0.0009668936,0.00015914123,0.016038023,0.00683858,0.9705611,0.0044468944,0.000054496722],"about_ca_topic_score_codex":0.0003389455,"about_ca_topic_score_gemma":0.00043101684,"teacher_disagreement_score":0.0026387323,"about_ca_system_score_codex":0.0008750736,"about_ca_system_score_gemma":0.00069633743,"threshold_uncertainty_score":0.008827448},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6268066,0.001868097,0.3463203,0.0022543364,0.00026361077,0.00013342661,0.00030196935,0.000727977,0.021323685],"genre_scores_gemma":[0.9881512,0.0002609469,0.010689036,0.00007212423,0.000069871145,0.00002002491,0.00004476805,0.000041496256,0.00065055897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98731196,0.005292704,0.00049651996,0.0012999219,0.004007196,0.001591674],"domain_scores_gemma":[0.91442305,0.05862982,0.0067367894,0.015064399,0.003967018,0.0011789688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011194201,0.0011770187,0.0010593568,0.0021508601,0.0008818645,0.004201753,0.0016032753,0.0030663847,0.003284166],"category_scores_gemma":[0.06711224,0.0005946355,0.00058955344,0.001738204,0.0029535508,0.010591785,0.0027675603,0.0027564268,0.00055441516],"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.0036196988,0.0006160002,0.014535102,0.00030625923,0.00018362002,0.00026614405,0.00021404904,0.25916746,0.03440501,0.55779654,0.002083355,0.12680681],"study_design_scores_gemma":[0.00009664829,0.00082429487,0.0027877546,0.00008565079,0.00014186476,0.0004428438,0.00012122284,0.73973405,0.02459555,0.22924247,0.0018293745,0.00009833678],"about_ca_topic_score_codex":0.0005831487,"about_ca_topic_score_gemma":0.00043700336,"teacher_disagreement_score":0.011194201,"about_ca_system_score_codex":0.002578063,"about_ca_system_score_gemma":0.0025034263,"threshold_uncertainty_score":0.0592013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36734807,0.0017990114,0.51194996,0.0017409648,0.00047086383,0.00011531424,0.0004841179,0.00050572376,0.11558591],"genre_scores_gemma":[0.9182807,0.0011211383,0.04907675,0.000295774,0.00029170373,0.00006273929,0.00019249904,0.00015651941,0.030522078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999302,0.00024597303,0.00003718333,0.0000886697,0.00021267163,0.00011350061],"domain_scores_gemma":[0.9988084,0.000520197,0.00018044662,0.00019158243,0.00018407125,0.00011521346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011761491,0.00047963293,0.00080595503,0.0014288865,0.0012281325,0.0013538497,0.00062461314,0.0006915267,0.0065022516],"category_scores_gemma":[0.0033289557,0.00034392683,0.00059948844,0.0016401862,0.0021477789,0.0029163726,0.0018394521,0.0020035726,0.0010759747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058593316,0.000009583293,0.00012481061,0.000020748728,0.0000027263845,0.000027574953,0.00006957756,0.003225569,0.0005309993,0.9897752,0.00047113886,0.0056834635],"study_design_scores_gemma":[0.00002167231,0.000032135213,0.00012201416,0.00001650243,0.000007278905,0.00007342255,0.000043209224,0.018598424,0.0012276315,0.9769283,0.0029142415,0.0000152834],"about_ca_topic_score_codex":0.00077288575,"about_ca_topic_score_gemma":0.0009053343,"teacher_disagreement_score":0.0065022516,"about_ca_system_score_codex":0.0011528878,"about_ca_system_score_gemma":0.0007559572,"threshold_uncertainty_score":0.021752179},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23529509,0.0016949882,0.7077589,0.0010099986,0.00039890234,0.00038359576,0.0007610891,0.0009474581,0.0517499],"genre_scores_gemma":[0.80105996,0.0010594642,0.17866604,0.00076886965,0.00023924171,0.0005341394,0.0007653719,0.00023042344,0.016676418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991868,0.00026051834,0.00005237388,0.000081207116,0.00028561032,0.00013340739],"domain_scores_gemma":[0.99838924,0.00074205507,0.00023479122,0.0003448383,0.00019554034,0.00009348528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083535776,0.00085323385,0.0005512993,0.0011803613,0.00059286196,0.0009705617,0.0005248444,0.0015992633,0.0052958373],"category_scores_gemma":[0.003041027,0.0004165759,0.0005457641,0.0011071782,0.0010814149,0.0010487995,0.0012659903,0.0011693191,0.0019548044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000985209,0.00010124423,0.0007291517,0.0003589779,0.00004829569,0.0003454559,0.00039309342,0.03308827,0.071070924,0.7908625,0.0044549694,0.097561985],"study_design_scores_gemma":[0.0002674377,0.000705554,0.0010895793,0.00033938172,0.00006567602,0.0009402233,0.000074401796,0.12314369,0.09727909,0.74774265,0.028211322,0.00014099013],"about_ca_topic_score_codex":0.0004003465,"about_ca_topic_score_gemma":0.0007490213,"teacher_disagreement_score":0.0052958373,"about_ca_system_score_codex":0.0008349877,"about_ca_system_score_gemma":0.0012917946,"threshold_uncertainty_score":0.017716348},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26082203,0.005709879,0.48415563,0.0075413836,0.0024213262,0.0001393135,0.000769483,0.002703883,0.23573725],"genre_scores_gemma":[0.78684807,0.0015788642,0.14194918,0.0027449485,0.0007175864,0.00024614934,0.00078058505,0.00028290955,0.06485163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764794,0.00053404184,0.00017101117,0.0005213371,0.0007071566,0.00041846168],"domain_scores_gemma":[0.9924722,0.0030683368,0.000783757,0.0020692123,0.0012290828,0.00037750637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011224824,0.0011792161,0.0018992923,0.0014331712,0.0023193725,0.0043086223,0.0016352261,0.0032966216,0.019275093],"category_scores_gemma":[0.0076957927,0.0007949819,0.00055117527,0.0013834488,0.0022471072,0.0073154164,0.002041451,0.0023073042,0.008313785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014177111,0.0002597441,0.0027752896,0.00068223954,0.00010851956,0.00036044087,0.00045904497,0.0057481322,0.04565978,0.7489811,0.016506616,0.17704135],"study_design_scores_gemma":[0.00017167072,0.00034261614,0.0011495531,0.00015270182,0.00008432264,0.0014162741,0.0006412527,0.01875154,0.04259225,0.856507,0.07797322,0.00021765445],"about_ca_topic_score_codex":0.00018825081,"about_ca_topic_score_gemma":0.00033946533,"teacher_disagreement_score":0.019275093,"about_ca_system_score_codex":0.0006056152,"about_ca_system_score_gemma":0.0006006792,"threshold_uncertainty_score":0.064481616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4531837,0.0013740652,0.44314992,0.0021306996,0.00058910873,0.00009896467,0.00056682545,0.00048825462,0.098418444],"genre_scores_gemma":[0.9234037,0.0009894168,0.04728791,0.0008653813,0.0007901502,0.00010611982,0.00038491513,0.00019296215,0.025979463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925774,0.00014341126,0.000051758794,0.00016143764,0.00024451886,0.0001409983],"domain_scores_gemma":[0.9977049,0.0007771492,0.00039882696,0.00026691408,0.00044021927,0.00041212057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096973946,0.0010595986,0.0006328165,0.0026393875,0.0010228178,0.002780925,0.00096166355,0.0011513409,0.003955167],"category_scores_gemma":[0.002904145,0.00046256828,0.00065640535,0.0017427042,0.0033443212,0.0044101784,0.0021650118,0.0033378666,0.0008557865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039813578,0.000020757361,0.0002605587,0.000026273217,0.000003851715,0.00006293613,0.0001826356,0.0007218131,0.0028411644,0.98767066,0.0007195704,0.007449884],"study_design_scores_gemma":[0.000011623603,0.00007787961,0.00052972377,0.000029363538,0.000009780535,0.0004759083,0.000112411544,0.0139675,0.0019658525,0.9763525,0.006436777,0.000030579406],"about_ca_topic_score_codex":0.00035750345,"about_ca_topic_score_gemma":0.00029831377,"teacher_disagreement_score":0.003955167,"about_ca_system_score_codex":0.001015036,"about_ca_system_score_gemma":0.0004648717,"threshold_uncertainty_score":0.013231337},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26834577,0.001853946,0.52112365,0.0018581791,0.0018181117,0.00015959356,0.00028131454,0.0005587799,0.2040006],"genre_scores_gemma":[0.82475585,0.001273731,0.109435365,0.0009831393,0.0005568474,0.00021814214,0.00020457742,0.0002696356,0.06230273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991341,0.0002535911,0.00006783521,0.0001260082,0.00023322325,0.00018521742],"domain_scores_gemma":[0.99914837,0.00029658436,0.00013300224,0.00018333402,0.00015767963,0.00008095146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006757424,0.0006370856,0.0006535243,0.0013807538,0.0010649464,0.0019946774,0.00050900393,0.00072252954,0.010916801],"category_scores_gemma":[0.002886135,0.0003605146,0.0004839335,0.0013987662,0.0023241804,0.002015936,0.0017207338,0.0016090629,0.0026119272],"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.00009643675,0.000025337176,0.00014482297,0.000031022446,0.000005239843,0.000054356024,0.0001415695,0.0013666596,0.0025268693,0.9657132,0.0017158525,0.028178642],"study_design_scores_gemma":[0.000030001142,0.00006522009,0.00017408504,0.000048232894,0.000010500173,0.00020315195,0.000103317994,0.011856023,0.004605546,0.9697502,0.013122558,0.000031161104],"about_ca_topic_score_codex":0.00031663338,"about_ca_topic_score_gemma":0.0004771984,"teacher_disagreement_score":0.010916801,"about_ca_system_score_codex":0.0007573503,"about_ca_system_score_gemma":0.0007064564,"threshold_uncertainty_score":0.036520302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6571806,0.0007621453,0.18581675,0.0016703486,0.00052463845,0.00021566723,0.0004625302,0.0009120998,0.15245526],"genre_scores_gemma":[0.91200733,0.00025456343,0.051361784,0.00042654655,0.00010085866,0.000119723416,0.00017682266,0.00012255694,0.035429835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993562,0.00017797617,0.000042703647,0.00008617929,0.0001613561,0.0001756683],"domain_scores_gemma":[0.99912304,0.00025608882,0.00014603989,0.00020381501,0.00017180647,0.000099243916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066519016,0.00049333007,0.0006329203,0.0010545086,0.0012576837,0.0019991552,0.0005203317,0.00074753736,0.009388586],"category_scores_gemma":[0.001749374,0.0003268353,0.0004483489,0.0007508594,0.001718833,0.0013467419,0.0013069223,0.0012414267,0.0015476597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029954722,0.000035662342,0.00043539036,0.00006273111,0.000011715216,0.00011347507,0.00025454749,0.003590462,0.0056767445,0.96788454,0.0015066877,0.020128509],"study_design_scores_gemma":[0.000113673465,0.00026341953,0.00033510337,0.00009440664,0.000018548437,0.00021988439,0.00024017211,0.019983077,0.012466279,0.94102305,0.025201188,0.00004116038],"about_ca_topic_score_codex":0.0005578636,"about_ca_topic_score_gemma":0.0009937102,"teacher_disagreement_score":0.009388586,"about_ca_system_score_codex":0.0012778182,"about_ca_system_score_gemma":0.0008948241,"threshold_uncertainty_score":0.031407952},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49899897,0.002744888,0.4589945,0.0016285816,0.0008485254,0.000574768,0.00068848813,0.0011353513,0.034385968],"genre_scores_gemma":[0.92260814,0.00076104054,0.06941752,0.00019500585,0.000142489,0.0001608569,0.0005691848,0.00009605396,0.006049676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99120784,0.0030174765,0.00051468733,0.00046304477,0.0038261139,0.00097086455],"domain_scores_gemma":[0.98637486,0.0048863096,0.0010260778,0.00497293,0.0020938693,0.00064608036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061727175,0.00060770975,0.0011841801,0.0023248142,0.0012008661,0.0031167206,0.0015303239,0.002152787,0.004954096],"category_scores_gemma":[0.015510914,0.00038022565,0.00074524345,0.0029519952,0.001923051,0.00702604,0.004150193,0.0016323801,0.001320777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012207121,0.00080138864,0.008575736,0.0008240474,0.00038901344,0.00027926802,0.0013894513,0.10925676,0.042989794,0.5014073,0.0073329075,0.3145473],"study_design_scores_gemma":[0.0011052524,0.0061672963,0.006626966,0.00030859586,0.0005338197,0.0013785668,0.0016946095,0.49575004,0.07456703,0.3744487,0.037078023,0.00034118243],"about_ca_topic_score_codex":0.00038880744,"about_ca_topic_score_gemma":0.0003586785,"teacher_disagreement_score":0.0061727175,"about_ca_system_score_codex":0.001633103,"about_ca_system_score_gemma":0.0021090624,"threshold_uncertainty_score":0.03264481},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37299556,0.0009463643,0.50695497,0.0033690315,0.0004897027,0.00024056483,0.0006339049,0.00055879896,0.113811135],"genre_scores_gemma":[0.843517,0.0007171821,0.1346941,0.00060951494,0.0002571199,0.00021735826,0.00059358246,0.00016930753,0.019224776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984843,0.0007035052,0.00005713937,0.00018836984,0.00030374908,0.00026291405],"domain_scores_gemma":[0.99776006,0.0011746157,0.00022554879,0.00053224794,0.00016970493,0.00013784155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013614363,0.0010907463,0.0011456852,0.0010637925,0.0013007079,0.00283576,0.0016236021,0.0015616792,0.0074902195],"category_scores_gemma":[0.0053307815,0.0005080446,0.001099673,0.0014783252,0.0021819128,0.0032546392,0.0028497332,0.0032605212,0.0013330996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003389669,0.00009461794,0.00021737682,0.00010811635,0.00004089971,0.000076600416,0.00013214354,0.06603949,0.0024183276,0.8990429,0.0057968395,0.025693618],"study_design_scores_gemma":[0.00020389564,0.000094653675,0.00017464685,0.00004509681,0.00004238357,0.0001078632,0.00009237139,0.18450098,0.001741719,0.80641496,0.006544247,0.000037138245],"about_ca_topic_score_codex":0.000771944,"about_ca_topic_score_gemma":0.0010277247,"teacher_disagreement_score":0.0074902195,"about_ca_system_score_codex":0.0011090619,"about_ca_system_score_gemma":0.0014557671,"threshold_uncertainty_score":0.025057256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6274722,0.005371606,0.16777086,0.004095552,0.0009347199,0.000088269706,0.0005709887,0.00041782012,0.19327793],"genre_scores_gemma":[0.96284425,0.0022804216,0.010485264,0.00028146358,0.00069138844,0.000038201342,0.00024930868,0.00011862207,0.023011122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991429,0.00017372526,0.000035502075,0.00013079436,0.00027499793,0.00024207162],"domain_scores_gemma":[0.9979965,0.0010627249,0.0002993802,0.00022284295,0.00022971073,0.00018884175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009614088,0.0014283356,0.00096107594,0.0019309069,0.0014456945,0.0026636855,0.00080459873,0.0010455229,0.008461938],"category_scores_gemma":[0.0047130114,0.00058296166,0.0006362473,0.0021861077,0.0035566303,0.005500826,0.0020176317,0.0031076388,0.0011461622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000611802,0.000026289623,0.00020737477,0.00004023841,0.000003993934,0.00010018927,0.0002329075,0.002049406,0.0005397535,0.99034894,0.00088024826,0.005509399],"study_design_scores_gemma":[0.000018269297,0.000020934407,0.00014987044,0.00003300595,0.0000070197093,0.00010422878,0.000067365334,0.004784936,0.00046590035,0.99137723,0.002957479,0.000013800782],"about_ca_topic_score_codex":0.0018524262,"about_ca_topic_score_gemma":0.0021024114,"teacher_disagreement_score":0.008461938,"about_ca_system_score_codex":0.001850758,"about_ca_system_score_gemma":0.0007483991,"threshold_uncertainty_score":0.028308034},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10607616,0.00050882425,0.8183216,0.00075721816,0.00019465062,0.00012562495,0.00025758604,0.00051357265,0.07324471],"genre_scores_gemma":[0.6965116,0.00095018564,0.27425268,0.0006753879,0.00018829713,0.00033536268,0.00041977988,0.000301492,0.026365152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909544,0.0003284917,0.000055180117,0.00010554481,0.00029046688,0.00012493921],"domain_scores_gemma":[0.99856263,0.00055792945,0.00019841596,0.00029116427,0.00029058562,0.00009931414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007973125,0.00067316584,0.000465696,0.0014083204,0.00083249545,0.0022399023,0.0007406524,0.0010212396,0.006575104],"category_scores_gemma":[0.0037622028,0.00048235292,0.00040129662,0.0011887108,0.0013339231,0.0017891686,0.0019119432,0.0016032371,0.0020429797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005088856,0.000013375391,0.00015925115,0.000034938224,0.000007119371,0.00006720744,0.0001359549,0.002668338,0.0031378246,0.970687,0.0010325224,0.022005511],"study_design_scores_gemma":[0.000050993993,0.00007259648,0.00018774811,0.00008750437,0.000017701159,0.0003562257,0.00012218284,0.029535955,0.014029175,0.93581736,0.019683167,0.000039381095],"about_ca_topic_score_codex":0.00017229501,"about_ca_topic_score_gemma":0.00024161121,"teacher_disagreement_score":0.006575104,"about_ca_system_score_codex":0.0006221938,"about_ca_system_score_gemma":0.00045334146,"threshold_uncertainty_score":0.021995902},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34700185,0.0052274303,0.21073031,0.04189701,0.0020623892,0.00019037753,0.0019084371,0.0005712369,0.39041096],"genre_scores_gemma":[0.9334907,0.002334196,0.02294365,0.0026338373,0.0020155292,0.00021867733,0.000830272,0.00018527002,0.0353479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697757,0.0010101316,0.000111095345,0.00054536335,0.00095234957,0.0004034429],"domain_scores_gemma":[0.9924103,0.003966229,0.0007929735,0.001639068,0.00067592796,0.00051548495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002314319,0.0013408253,0.0018647246,0.0024749306,0.0037468227,0.0050085513,0.002163516,0.0037937905,0.0105482545],"category_scores_gemma":[0.012905977,0.00090757734,0.0010828498,0.0027058355,0.009505509,0.012195431,0.0060092635,0.0061138645,0.0024059366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017231012,0.000006138471,0.000087466084,0.00001934807,0.0000030853635,0.00001547363,0.00010498353,0.00062716246,0.00007381739,0.99593216,0.0015566752,0.001556417],"study_design_scores_gemma":[0.0000071526833,0.0000032085081,0.00004395206,0.00000772178,0.000002077189,0.000020925892,0.000029027384,0.0010868383,0.00008416544,0.9969145,0.0017950234,0.0000054526276],"about_ca_topic_score_codex":0.0010214024,"about_ca_topic_score_gemma":0.0007906827,"teacher_disagreement_score":0.0105482545,"about_ca_system_score_codex":0.0023100642,"about_ca_system_score_gemma":0.001305015,"threshold_uncertainty_score":0.03528744},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69866997,0.0011214671,0.13496985,0.0038398874,0.00089878996,0.00009730181,0.00095741055,0.0006641757,0.15878126],"genre_scores_gemma":[0.9333329,0.0006064084,0.01520108,0.00079134846,0.0010174604,0.000110205816,0.0005047667,0.0003021542,0.04813356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856985,0.0003098599,0.00007223726,0.00027525207,0.00042430506,0.00034853542],"domain_scores_gemma":[0.99845433,0.00045998784,0.00030674087,0.00017273126,0.000298341,0.00030784422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010183045,0.0012331324,0.0010413909,0.0033861191,0.0021364621,0.00405459,0.0008712416,0.001619009,0.011145569],"category_scores_gemma":[0.0029244716,0.00061711593,0.0008321025,0.0014055248,0.0023818803,0.0036671076,0.002604737,0.0028165209,0.0017726421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001419147,0.000031198317,0.00020469655,0.000026068163,0.000012002194,0.0000846707,0.000076396784,0.0008277989,0.0012985911,0.9903183,0.0012641539,0.0057142316],"study_design_scores_gemma":[0.000039560266,0.00003508357,0.00034818464,0.00002315287,0.000016475076,0.0002951808,0.000052655123,0.006255438,0.0021864052,0.98662776,0.0040872605,0.0000329057],"about_ca_topic_score_codex":0.0007375284,"about_ca_topic_score_gemma":0.0005537687,"teacher_disagreement_score":0.011145569,"about_ca_system_score_codex":0.0016473958,"about_ca_system_score_gemma":0.00087257207,"threshold_uncertainty_score":0.037285626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41546497,0.00095239864,0.38253844,0.0016111389,0.001063482,0.0002255022,0.00071669236,0.0007506868,0.1966767],"genre_scores_gemma":[0.9242281,0.00031870737,0.032857895,0.00052737386,0.00016251704,0.00017614682,0.00028868864,0.000117294876,0.041323222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992053,0.00016313263,0.0000514486,0.00013198491,0.00023587696,0.00021235253],"domain_scores_gemma":[0.9990735,0.00020218591,0.00013103073,0.00024863836,0.00019917835,0.00014555755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045389432,0.00060385984,0.00066100346,0.0020341587,0.0015619292,0.0026401356,0.0005153624,0.0020991126,0.016282303],"category_scores_gemma":[0.0018666507,0.00039680113,0.0005292784,0.0009653866,0.0014938448,0.002574185,0.0023031125,0.0017809971,0.0030030108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009793228,0.000023425246,0.00022748667,0.00002984986,0.000007627588,0.00013530001,0.000107625696,0.002086714,0.004972378,0.98254484,0.0014011458,0.008365782],"study_design_scores_gemma":[0.00004118795,0.00012157156,0.000354334,0.000046321664,0.000014714895,0.00046747003,0.00023184324,0.03358288,0.011435196,0.944191,0.009454064,0.00005942059],"about_ca_topic_score_codex":0.0003970032,"about_ca_topic_score_gemma":0.00039082288,"teacher_disagreement_score":0.016282303,"about_ca_system_score_codex":0.0006865191,"about_ca_system_score_gemma":0.00066800584,"threshold_uncertainty_score":0.054469705},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29033196,0.0021026887,0.6135603,0.006383121,0.0003601792,0.00014827462,0.00094377843,0.0006065647,0.0855631],"genre_scores_gemma":[0.94556516,0.00096856046,0.028604284,0.0006716275,0.00036130936,0.00020505881,0.00055552105,0.00018944938,0.022878991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972952,0.0007484779,0.00016114992,0.00051955204,0.00093206536,0.00034363734],"domain_scores_gemma":[0.9893209,0.006342827,0.0011307274,0.002027497,0.00063462,0.0005434406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001919286,0.0008034146,0.0010473826,0.0016982064,0.0012627754,0.004642302,0.0015781132,0.0021883566,0.010121512],"category_scores_gemma":[0.014223489,0.0005866071,0.0011111324,0.001989473,0.0037353772,0.006104481,0.0029734897,0.004857643,0.0013416576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058802678,0.000020232921,0.00016143502,0.00006223483,0.000008774999,0.000033334913,0.00010617673,0.0066313744,0.0006782922,0.984295,0.0011923702,0.006752088],"study_design_scores_gemma":[0.000013153336,0.000009602559,0.000041304247,0.000013881275,0.0000055638984,0.00003694979,0.000017356691,0.01080992,0.0003878697,0.9877949,0.0008622114,0.000007245835],"about_ca_topic_score_codex":0.00069020194,"about_ca_topic_score_gemma":0.0005249212,"teacher_disagreement_score":0.010121512,"about_ca_system_score_codex":0.0026919958,"about_ca_system_score_gemma":0.0015465866,"threshold_uncertainty_score":0.03385985},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06890943,0.0011741857,0.81878644,0.0035386346,0.0022115412,0.00024749906,0.0005958743,0.0020455099,0.102490894],"genre_scores_gemma":[0.53444576,0.0016056467,0.36422873,0.0017879592,0.00097119034,0.00036639778,0.0009497619,0.0014876751,0.094156854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985831,0.0003331849,0.000083118706,0.00024186539,0.00044486063,0.00031396898],"domain_scores_gemma":[0.99847287,0.00050298305,0.00016348042,0.00044814977,0.0002281413,0.0001843841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011768026,0.0011615487,0.0006976484,0.0014392246,0.0014746492,0.0025627154,0.0013638884,0.0013155807,0.013973308],"category_scores_gemma":[0.0031007212,0.00080478383,0.0011927548,0.0016013844,0.002658732,0.0046495856,0.00331478,0.0038467369,0.0037048548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092721915,0.000047375834,0.00013845108,0.00008291145,0.000012427309,0.00013908392,0.00020110999,0.0013730096,0.0053766984,0.96468806,0.005457566,0.022390664],"study_design_scores_gemma":[0.00013404975,0.00014307951,0.00030360467,0.00009417558,0.00007424198,0.0012323713,0.00015661279,0.023387617,0.03044178,0.8440123,0.09988487,0.00013532549],"about_ca_topic_score_codex":0.00044288818,"about_ca_topic_score_gemma":0.0010436942,"teacher_disagreement_score":0.013973308,"about_ca_system_score_codex":0.0015500461,"about_ca_system_score_gemma":0.0011858337,"threshold_uncertainty_score":0.04674536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49860546,0.0019090062,0.3620407,0.0042495565,0.0009890136,0.00014785155,0.00044888438,0.00037346862,0.1312361],"genre_scores_gemma":[0.92591107,0.0009056529,0.046729155,0.0006231143,0.00095004437,0.00023814317,0.000299714,0.000168274,0.024174923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676174,0.0010981084,0.00018017634,0.00052119844,0.000851275,0.0005876349],"domain_scores_gemma":[0.9954124,0.002069729,0.00076433585,0.00068991206,0.0006299748,0.00043366462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002389751,0.000904917,0.0012297238,0.0024765523,0.0021331913,0.0037362615,0.0014267857,0.001609518,0.005837215],"category_scores_gemma":[0.011963296,0.0005764595,0.000895285,0.0022777717,0.005424638,0.0040510083,0.003788262,0.0036039131,0.001526638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003760408,0.0000068475842,0.00006946758,0.000008379433,0.000002828958,0.000025035864,0.000082781415,0.00052276725,0.00034210458,0.9951019,0.0003684028,0.0034317395],"study_design_scores_gemma":[0.000025026971,0.000017353208,0.00006502575,0.00001251021,0.0000035020512,0.000052473068,0.000034800763,0.0031065436,0.0005118062,0.9945663,0.0015894797,0.000015087503],"about_ca_topic_score_codex":0.0008366203,"about_ca_topic_score_gemma":0.0005484228,"teacher_disagreement_score":0.005837215,"about_ca_system_score_codex":0.0015156412,"about_ca_system_score_gemma":0.0014297107,"threshold_uncertainty_score":0.019527376},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8220072,0.0014712315,0.13348962,0.0005285075,0.000085280524,0.000076036195,0.0008744134,0.0008558736,0.040611856],"genre_scores_gemma":[0.9426722,0.0007796218,0.041181616,0.0001977587,0.00016002714,0.00017498425,0.001411605,0.0002845353,0.013137551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989122,0.00017135727,0.000055004934,0.00025153413,0.00031245087,0.00029741402],"domain_scores_gemma":[0.9954218,0.0022602193,0.00072649546,0.00083173567,0.00041912094,0.0003405754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042144852,0.00056775654,0.00057840836,0.0010957385,0.0010646929,0.001442348,0.0006035569,0.0005533598,0.007960609],"category_scores_gemma":[0.0046278834,0.00080333534,0.00088589016,0.0008626484,0.0015696767,0.0025182385,0.001989488,0.00085911836,0.0011951665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016392185,0.00015815084,0.015675513,0.0008126151,0.00019692931,0.0017238568,0.0020712921,0.09360306,0.11564331,0.6151155,0.010227984,0.14313252],"study_design_scores_gemma":[0.00019113751,0.0011185561,0.01307651,0.00020620292,0.00014591735,0.0043119635,0.0012297934,0.23780084,0.055465046,0.63168335,0.054637324,0.00013341894],"about_ca_topic_score_codex":0.0014069518,"about_ca_topic_score_gemma":0.0017740383,"teacher_disagreement_score":0.007960609,"about_ca_system_score_codex":0.0008758611,"about_ca_system_score_gemma":0.00043790884,"threshold_uncertainty_score":0.026630938},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062283028,0.0032824574,0.6516592,0.0048065316,0.0025357064,0.00009532602,0.0006548922,0.00055115117,0.27413172],"genre_scores_gemma":[0.75640255,0.0037822232,0.14407034,0.002256047,0.0032403716,0.00023462855,0.0006490708,0.00071812357,0.08864667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982835,0.00054474565,0.00005954056,0.00030970958,0.0006367252,0.00016587935],"domain_scores_gemma":[0.9983354,0.0005797889,0.00011282162,0.00049807486,0.0003394375,0.00013450529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016109854,0.0011137271,0.0009711773,0.0019916708,0.001328145,0.002803276,0.0015312014,0.0014657234,0.00985542],"category_scores_gemma":[0.00548334,0.00039370597,0.0010023906,0.0017893167,0.0038924871,0.0046926225,0.0033518856,0.004520016,0.0024824324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015122976,0.00000534651,0.00004084064,0.000012653807,0.000003213125,0.000013810658,0.00002481683,0.0006429821,0.00029407392,0.9935315,0.0009829486,0.0044327257],"study_design_scores_gemma":[0.0000062576282,0.000009577555,0.000036546106,0.000008174815,0.0000035359883,0.000035819252,0.000008208665,0.004255498,0.00028434774,0.9903143,0.0050305757,0.0000071509285],"about_ca_topic_score_codex":0.0009669085,"about_ca_topic_score_gemma":0.0006574857,"teacher_disagreement_score":0.00985542,"about_ca_system_score_codex":0.0017307783,"about_ca_system_score_gemma":0.001010043,"threshold_uncertainty_score":0.032969654},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24024794,0.0006782684,0.6607612,0.0012626791,0.000547108,0.00015676479,0.00027679402,0.0011572611,0.094912075],"genre_scores_gemma":[0.79489535,0.0006643058,0.16042003,0.0006141484,0.00023395463,0.00013392007,0.00028965864,0.0005874735,0.042161126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994962,0.00011221464,0.000021551827,0.000100782134,0.000113122056,0.00015609636],"domain_scores_gemma":[0.999421,0.00025310233,0.000058508573,0.00012047707,0.00007708223,0.00006980283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005433904,0.0006933114,0.0006129415,0.0011276465,0.0014187942,0.0018336087,0.0010042475,0.0008620002,0.0056807008],"category_scores_gemma":[0.0014677949,0.0005325487,0.00089652237,0.0011020404,0.002017288,0.0021280553,0.0017911061,0.002561726,0.0015916191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004589809,0.00003099939,0.00017991314,0.00004220273,0.0000055635423,0.00014306807,0.00025837246,0.0010957762,0.0041461694,0.97431844,0.0014041386,0.018329471],"study_design_scores_gemma":[0.000051156843,0.000086402426,0.00045080646,0.000041461753,0.000037206006,0.000516131,0.000109149485,0.013480838,0.01276449,0.94876873,0.023620468,0.00007319569],"about_ca_topic_score_codex":0.0009072544,"about_ca_topic_score_gemma":0.0011231974,"teacher_disagreement_score":0.0056807008,"about_ca_system_score_codex":0.0011266405,"about_ca_system_score_gemma":0.0009676094,"threshold_uncertainty_score":0.019003868},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24496633,0.0025271873,0.70212317,0.001972345,0.00042601005,0.0002006576,0.0007786512,0.002854943,0.04415073],"genre_scores_gemma":[0.9017316,0.0008457506,0.07972647,0.00027659902,0.00014549635,0.00010825793,0.0005792044,0.00037434822,0.0162122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787164,0.00033522048,0.00016044176,0.00031368877,0.0009422988,0.000376703],"domain_scores_gemma":[0.99796766,0.00067504,0.00020991526,0.00088806666,0.00019456045,0.000064847576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009441206,0.0010676602,0.0010066864,0.0013378348,0.0011142625,0.0022730615,0.00078216766,0.0015926932,0.0074651996],"category_scores_gemma":[0.005019785,0.0006689857,0.00081580586,0.0016547124,0.0012942867,0.005661884,0.0055793193,0.0021379285,0.004251681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001739064,0.00011838668,0.0014726697,0.0005143596,0.00013471223,0.00061916176,0.00059293397,0.024845531,0.071026795,0.5839784,0.006561194,0.30839676],"study_design_scores_gemma":[0.00016450163,0.00027802426,0.00077151,0.00026330867,0.00011234,0.0011453523,0.00016751225,0.08212328,0.17797814,0.71130216,0.025568288,0.00012558191],"about_ca_topic_score_codex":0.00019836854,"about_ca_topic_score_gemma":0.0002868076,"teacher_disagreement_score":0.0074651996,"about_ca_system_score_codex":0.00093983463,"about_ca_system_score_gemma":0.0009862958,"threshold_uncertainty_score":0.02497363},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10487414,0.014400603,0.71606094,0.011107069,0.0018930723,0.0005432181,0.003542521,0.0034752751,0.14410323],"genre_scores_gemma":[0.7295855,0.009538771,0.20015165,0.003946071,0.0025641797,0.0021057113,0.003297237,0.0018757534,0.0469351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9884908,0.0022131673,0.00041980093,0.0011413114,0.0050243186,0.002710511],"domain_scores_gemma":[0.9514126,0.03585753,0.0024014423,0.0050215465,0.0037936536,0.001513059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007285342,0.0070013287,0.0041968958,0.007121105,0.0038038853,0.007715722,0.0061877742,0.0052677365,0.02293872],"category_scores_gemma":[0.04036617,0.0025993465,0.002487483,0.0070260763,0.006688348,0.015617633,0.013294276,0.009888993,0.006767738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027507266,0.0003240484,0.0017126871,0.0010106798,0.00024219039,0.0006607709,0.0012047978,0.10394542,0.014370691,0.7403034,0.03199197,0.1014827],"study_design_scores_gemma":[0.00020796474,0.0003351249,0.0006969192,0.00045145748,0.00021974965,0.00040312269,0.00018309835,0.20247963,0.011784944,0.7629635,0.020047238,0.00022720515],"about_ca_topic_score_codex":0.0042229486,"about_ca_topic_score_gemma":0.0052247755,"teacher_disagreement_score":0.02293872,"about_ca_system_score_codex":0.010404567,"about_ca_system_score_gemma":0.006323461,"threshold_uncertainty_score":0.0767377},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76118267,0.0012488714,0.12512629,0.0012550717,0.0006263983,0.000059228118,0.00036556085,0.00022260919,0.109913334],"genre_scores_gemma":[0.9622515,0.00042314114,0.015039058,0.00044682465,0.00021792222,0.000058453617,0.00026566227,0.00008637748,0.021210998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994137,0.00014296918,0.000041100426,0.00010084458,0.00017003273,0.0001313851],"domain_scores_gemma":[0.99919814,0.0002974909,0.0001225681,0.000120312216,0.00015061561,0.00011088924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000587718,0.00048993743,0.00033552715,0.0012390139,0.0007653127,0.0015360219,0.00048738185,0.0009858096,0.008031641],"category_scores_gemma":[0.0028389532,0.0002515561,0.00033013886,0.0006643099,0.0012602828,0.0014164195,0.0009851111,0.0014537008,0.0013061265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013588097,0.000028574757,0.00029201756,0.00003113805,0.0000052114333,0.00014806876,0.0002003693,0.001830319,0.0051208492,0.975583,0.00085784704,0.015766753],"study_design_scores_gemma":[0.00004125195,0.000082326704,0.00072791387,0.000044548215,0.000009559545,0.00039903092,0.00015991306,0.014843397,0.00987488,0.96658653,0.0071903286,0.0000403503],"about_ca_topic_score_codex":0.00030336535,"about_ca_topic_score_gemma":0.0003036683,"teacher_disagreement_score":0.008031641,"about_ca_system_score_codex":0.0007557242,"about_ca_system_score_gemma":0.00053830777,"threshold_uncertainty_score":0.026868522},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04589275,0.0021242916,0.60315746,0.0015054522,0.0012285543,0.00016426742,0.0005683259,0.001699208,0.34365976],"genre_scores_gemma":[0.5827075,0.0026021174,0.22805528,0.0013523413,0.0009722266,0.00021150052,0.0011329885,0.0010150563,0.18195099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991435,0.00013073134,0.000044997738,0.00024993415,0.00027845817,0.00015237005],"domain_scores_gemma":[0.9991547,0.0001757666,0.00007339015,0.00038885375,0.00015806334,0.0000493129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005358972,0.000952136,0.0005381133,0.0011015449,0.0009225691,0.0018985169,0.0005289405,0.00060789863,0.026789071],"category_scores_gemma":[0.0022793403,0.0003244331,0.00059510325,0.0012795817,0.001537655,0.0033901152,0.0016535125,0.0017333927,0.0080495775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016485246,0.00003776893,0.00019478238,0.00009794273,0.000012664925,0.00006421171,0.00011889084,0.0028980644,0.0056967936,0.8195982,0.010025433,0.16109039],"study_design_scores_gemma":[0.000048170536,0.00014420715,0.00021080655,0.00008035121,0.000033096832,0.00040615705,0.000090086716,0.011891947,0.01712686,0.800198,0.16972822,0.000041968273],"about_ca_topic_score_codex":0.0004183219,"about_ca_topic_score_gemma":0.0004566712,"teacher_disagreement_score":0.026789071,"about_ca_system_score_codex":0.00084661326,"about_ca_system_score_gemma":0.00056272006,"threshold_uncertainty_score":0.089618385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4942149,0.00076779915,0.4280923,0.000943625,0.0006379152,0.0002600156,0.0005111744,0.00051847356,0.07405373],"genre_scores_gemma":[0.92166024,0.00032164247,0.044396847,0.00045668296,0.00023031386,0.00023560501,0.00034296492,0.00008193725,0.03227379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918014,0.00028362212,0.000048209524,0.00014937941,0.00019320037,0.00014540451],"domain_scores_gemma":[0.9979691,0.00069423794,0.0004239853,0.00033258303,0.00036967715,0.00021046361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066598377,0.0005468175,0.0005431157,0.0016635171,0.0013349698,0.0031669165,0.0007558373,0.00169888,0.011281797],"category_scores_gemma":[0.0032636577,0.00044568744,0.0004955402,0.0010147546,0.0014442647,0.0020111392,0.0016641589,0.0011617126,0.0013693821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010875443,0.0000371732,0.00027922657,0.000041645428,0.000014514745,0.00009259642,0.00013064106,0.0034202116,0.0031711177,0.98517275,0.0008423406,0.006688988],"study_design_scores_gemma":[0.0000817611,0.00014084057,0.00025879606,0.000042301763,0.00001956227,0.00017221607,0.00011081366,0.036326982,0.004228404,0.95298064,0.005593624,0.000044025695],"about_ca_topic_score_codex":0.00025832295,"about_ca_topic_score_gemma":0.00038748834,"teacher_disagreement_score":0.011281797,"about_ca_system_score_codex":0.0010105477,"about_ca_system_score_gemma":0.00067997025,"threshold_uncertainty_score":0.037741363},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18366885,0.009861375,0.6175887,0.009034048,0.0014412191,0.00014891729,0.0018187797,0.00040836484,0.17602974],"genre_scores_gemma":[0.80440235,0.006900598,0.10195786,0.001564926,0.002120669,0.00030903806,0.0009929854,0.00034908165,0.08140246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782205,0.0007548292,0.000108486514,0.00027635635,0.00081248855,0.0002256988],"domain_scores_gemma":[0.99556136,0.0021623303,0.00051195343,0.0007175906,0.0007038414,0.000342863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016283325,0.001057762,0.0008947815,0.0028837686,0.0013188513,0.0041904277,0.0010983099,0.0018817515,0.009058637],"category_scores_gemma":[0.009292872,0.00040624378,0.0006700254,0.002973268,0.002743983,0.0056306417,0.0028382905,0.003614871,0.0020094947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027740152,0.000007962928,0.000056098834,0.000019502284,0.000003558397,0.000016420097,0.00004941912,0.0020544284,0.00022533591,0.9893261,0.0015122965,0.0067009935],"study_design_scores_gemma":[0.0000058090445,0.000010016512,0.000054391225,0.000016009804,0.0000025675045,0.000044138018,0.00002411707,0.009778338,0.00028146236,0.98611706,0.0036514804,0.000014780282],"about_ca_topic_score_codex":0.0013191968,"about_ca_topic_score_gemma":0.0009800359,"teacher_disagreement_score":0.009058637,"about_ca_system_score_codex":0.0019510912,"about_ca_system_score_gemma":0.001332468,"threshold_uncertainty_score":0.030304134},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4351871,0.0026450562,0.34996805,0.0059118047,0.0006437507,0.00010129494,0.00042320616,0.0005026985,0.20461707],"genre_scores_gemma":[0.95507324,0.0007960039,0.018858476,0.00059148064,0.00052144995,0.00008156391,0.000120661985,0.00007171753,0.023885379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984981,0.00061111536,0.00006534622,0.00033902773,0.00032362936,0.0001627888],"domain_scores_gemma":[0.9959974,0.002631224,0.00031987502,0.00049084955,0.00028352602,0.00027713145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015570357,0.0006669724,0.00067764777,0.0014656899,0.001784913,0.003420881,0.0006122695,0.0010396086,0.0066706594],"category_scores_gemma":[0.0035781343,0.000561142,0.00052046543,0.0011566161,0.00393841,0.0061115474,0.0024541367,0.0022452746,0.000910977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027583155,0.000014915843,0.00007218056,0.000018089871,0.000003407961,0.000013912935,0.0001039647,0.00047879643,0.00038912767,0.99543107,0.0004584455,0.0029885634],"study_design_scores_gemma":[0.000009803558,0.000009481296,0.00005279988,0.000007870758,0.0000037624145,0.000040187075,0.000022513063,0.0017705582,0.0005463883,0.9954379,0.0020923214,0.000006243108],"about_ca_topic_score_codex":0.00029842442,"about_ca_topic_score_gemma":0.00026943572,"teacher_disagreement_score":0.0066706594,"about_ca_system_score_codex":0.0013025197,"about_ca_system_score_gemma":0.00072344014,"threshold_uncertainty_score":0.022315562},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033675157,0.00056662067,0.9443347,0.00090496044,0.0005758028,0.00046870238,0.0007834615,0.0043606884,0.0143299205],"genre_scores_gemma":[0.5368488,0.00037795206,0.43687043,0.0006155546,0.000513931,0.00042806513,0.0016092533,0.00030812036,0.022427866],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974675,0.00039133066,0.00014348769,0.00039547993,0.0013288457,0.0002733523],"domain_scores_gemma":[0.99801505,0.00029942946,0.00012241189,0.0010156555,0.00039083662,0.00015661228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010686456,0.00074252835,0.0016462691,0.0008700478,0.000994575,0.0019447013,0.0019647887,0.0012289382,0.012595144],"category_scores_gemma":[0.0023391608,0.00039438365,0.00074681174,0.0014635343,0.0010894041,0.0036372084,0.0045958287,0.0014182742,0.005531549],"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.0026990813,0.00064491195,0.001261528,0.0005582919,0.00020550934,0.0004079292,0.00026905574,0.052262675,0.121717766,0.28051108,0.033773735,0.5056885],"study_design_scores_gemma":[0.00061106804,0.0010026194,0.00072128186,0.00005481777,0.00014497731,0.00070420787,0.000143102,0.66707736,0.065365724,0.22272143,0.04129929,0.00015413795],"about_ca_topic_score_codex":0.0007126932,"about_ca_topic_score_gemma":0.0010205986,"teacher_disagreement_score":0.012595144,"about_ca_system_score_codex":0.0010021419,"about_ca_system_score_gemma":0.0024361752,"threshold_uncertainty_score":0.04213494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38667306,0.00240019,0.43077782,0.011447253,0.0007041897,0.0001352826,0.00061689614,0.00038665134,0.16685866],"genre_scores_gemma":[0.96868324,0.0013690781,0.01717239,0.0011326543,0.0007290407,0.000120663935,0.0003341018,0.00015962053,0.01029918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975419,0.0007827917,0.00013811272,0.00047799398,0.000604857,0.0004544185],"domain_scores_gemma":[0.97995675,0.015300473,0.0010127211,0.0021817493,0.000985965,0.00056240667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039369366,0.0011425784,0.0012503172,0.0016578836,0.0017507584,0.00427321,0.0011306485,0.0024195104,0.0067435266],"category_scores_gemma":[0.017149368,0.0006457474,0.0015247972,0.0015780126,0.0075343614,0.012650248,0.0033124194,0.006436355,0.0012571154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010462459,0.000024068335,0.00014343987,0.000024483312,0.000007702171,0.000051747254,0.000096328535,0.001899142,0.0006304987,0.9930942,0.00067004765,0.0032537389],"study_design_scores_gemma":[0.0000151827535,0.000014993652,0.000039274844,0.000010708145,0.0000056732447,0.0000468199,0.000025319807,0.0063304263,0.00041251286,0.9926191,0.00047410076,0.000005785559],"about_ca_topic_score_codex":0.00044132,"about_ca_topic_score_gemma":0.00022715097,"teacher_disagreement_score":0.0067435266,"about_ca_system_score_codex":0.001659432,"about_ca_system_score_gemma":0.0011315198,"threshold_uncertainty_score":0.022559345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50971055,0.0041084858,0.34940413,0.0025385984,0.00043559258,0.00018311877,0.00091101683,0.00043731934,0.13227126],"genre_scores_gemma":[0.93980074,0.0024419082,0.035465322,0.0005205694,0.00039351228,0.00015411736,0.00048362874,0.00016593172,0.020574281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989906,0.00018759334,0.00004304832,0.0001682909,0.00037130734,0.00023926033],"domain_scores_gemma":[0.9971769,0.0016773499,0.00035704992,0.0002702997,0.00033956053,0.00017869777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092152617,0.0010443695,0.0011701259,0.002206045,0.0012802412,0.0032684961,0.0009705506,0.0015986444,0.0066621276],"category_scores_gemma":[0.007853722,0.00043777216,0.0005649819,0.0024199593,0.001923201,0.0024616146,0.0016386027,0.001619611,0.00068111427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017316955,0.00004693544,0.0003688693,0.00007950237,0.000015013519,0.00006736034,0.000097403135,0.023460444,0.0021238162,0.9507716,0.0029478548,0.01984817],"study_design_scores_gemma":[0.000059896873,0.000052792555,0.000319565,0.00005250045,0.00001712688,0.00016981036,0.00006867931,0.11615648,0.001742608,0.8766168,0.0047175125,0.0000262907],"about_ca_topic_score_codex":0.0014679332,"about_ca_topic_score_gemma":0.0012803577,"teacher_disagreement_score":0.0066621276,"about_ca_system_score_codex":0.002060441,"about_ca_system_score_gemma":0.0016838809,"threshold_uncertainty_score":0.02228707},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16052529,0.009591654,0.3624282,0.02122867,0.0020267977,0.00021036949,0.0007398155,0.0014772321,0.4417721],"genre_scores_gemma":[0.8718205,0.0034385917,0.0729902,0.0043451893,0.0018077247,0.00042886563,0.0004011173,0.0006538896,0.044113945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935869,0.0021864986,0.00019832591,0.0008448834,0.0020185325,0.0011648815],"domain_scores_gemma":[0.9708473,0.0207267,0.0012949196,0.003739763,0.0015378065,0.0018535446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007834788,0.0032217782,0.0024410796,0.008670992,0.0042889696,0.009604543,0.0050046323,0.0052519287,0.021854285],"category_scores_gemma":[0.035158813,0.0016022284,0.0016316677,0.005011646,0.013609558,0.015451462,0.00856058,0.017305382,0.0043243966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001086569,0.00003127514,0.00009849238,0.00005895468,0.000009291476,0.000025322646,0.00013192664,0.0022296514,0.0004736471,0.990236,0.002165935,0.0044307844],"study_design_scores_gemma":[0.000032132128,0.00002321929,0.00008270732,0.000050239698,0.00001711275,0.00005549557,0.00006405166,0.009002702,0.0008533888,0.986845,0.0029415633,0.000032373213],"about_ca_topic_score_codex":0.001691436,"about_ca_topic_score_gemma":0.0015691589,"teacher_disagreement_score":0.021854285,"about_ca_system_score_codex":0.0077057183,"about_ca_system_score_gemma":0.0020774077,"threshold_uncertainty_score":0.073109865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45833638,0.0019531283,0.39703155,0.0034365635,0.0006868406,0.00018343909,0.0003843166,0.0005725143,0.13741527],"genre_scores_gemma":[0.9132457,0.0011886474,0.051721048,0.0007524617,0.00054048,0.00019812092,0.0002241329,0.0001412171,0.03198822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981178,0.0007452709,0.00007886924,0.00021231145,0.00051333563,0.0003324426],"domain_scores_gemma":[0.99340504,0.0039437623,0.00093526626,0.0008251713,0.0005349038,0.00035584086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002252937,0.0011805681,0.0011270918,0.0021307475,0.0021926234,0.0023273074,0.0010577171,0.0019403526,0.00651987],"category_scores_gemma":[0.010467303,0.0008256945,0.0007755436,0.0022139056,0.004078194,0.0037819385,0.0030352497,0.0025279603,0.0010958919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011487801,0.000014593975,0.00016797251,0.00003084322,0.000005597092,0.00005144752,0.00017812058,0.0026446255,0.0006401282,0.98888075,0.0010804519,0.0061906883],"study_design_scores_gemma":[0.000037390797,0.000054283573,0.00009321478,0.000026281206,0.000008741404,0.000097992524,0.000050605817,0.011883849,0.0008475251,0.98417467,0.0027045785,0.0000208838],"about_ca_topic_score_codex":0.0007847714,"about_ca_topic_score_gemma":0.00069113827,"teacher_disagreement_score":0.00651987,"about_ca_system_score_codex":0.0019098496,"about_ca_system_score_gemma":0.0012985027,"threshold_uncertainty_score":0.021811187},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006500264,0.00045972015,0.9686752,0.00033839032,0.00043473137,0.00008243389,0.000084712985,0.000348146,0.023076354],"genre_scores_gemma":[0.15932976,0.0015826604,0.76578206,0.0010933417,0.00082033675,0.0005107299,0.00047819625,0.00084858114,0.06955439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894947,0.00040026277,0.000072543335,0.00016157002,0.0003234266,0.000092754075],"domain_scores_gemma":[0.9986085,0.00046634054,0.00008140538,0.0004299186,0.00029582568,0.00011794726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014994972,0.0019034069,0.0010340391,0.0023429329,0.0013734526,0.0016706446,0.0014369683,0.0014107166,0.011349391],"category_scores_gemma":[0.004206648,0.0006504398,0.0021275077,0.0015467826,0.0020465225,0.002409949,0.00244429,0.0036715756,0.0065142266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118028445,0.00009563231,0.00023759325,0.00023919561,0.000032615328,0.000084776126,0.00029865425,0.0038758116,0.010525095,0.8467305,0.006048372,0.1317138],"study_design_scores_gemma":[0.00008162937,0.00028008674,0.00035381992,0.00013439477,0.000061524304,0.0006754085,0.00008103662,0.04814424,0.019876461,0.8701344,0.060065795,0.00011125196],"about_ca_topic_score_codex":0.00031235424,"about_ca_topic_score_gemma":0.00064966385,"teacher_disagreement_score":0.011349391,"about_ca_system_score_codex":0.001039411,"about_ca_system_score_gemma":0.00074563985,"threshold_uncertainty_score":0.037967443},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.733288,0.0010086368,0.16524228,0.0015203403,0.0002198233,0.00014531249,0.00052835105,0.00091780955,0.097129434],"genre_scores_gemma":[0.9462547,0.001083404,0.027444473,0.00027946391,0.0001475632,0.00018194257,0.00054763287,0.0002923647,0.023768425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837875,0.00027970618,0.0000748528,0.00016929126,0.00058550516,0.0005118549],"domain_scores_gemma":[0.9948001,0.0028477844,0.00088257564,0.00042550432,0.00037199678,0.0006720521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013667027,0.0013036813,0.0013254117,0.0030112122,0.0029368892,0.005684012,0.0014211851,0.0021979003,0.007876587],"category_scores_gemma":[0.005183338,0.0013563973,0.00090582797,0.0030662082,0.00391678,0.0050389767,0.0037033064,0.0044976156,0.0017831883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014809282,0.000031716256,0.00024425346,0.00002454236,0.000007108177,0.000120634795,0.0002253295,0.002057298,0.0019363239,0.99201035,0.00064452726,0.0025498793],"study_design_scores_gemma":[0.00008764506,0.000057842513,0.00025330047,0.00004235006,0.000025028628,0.00030124013,0.00019684457,0.011186618,0.0053199762,0.977496,0.0049937703,0.00003941486],"about_ca_topic_score_codex":0.0014530366,"about_ca_topic_score_gemma":0.0010446192,"teacher_disagreement_score":0.007876587,"about_ca_system_score_codex":0.0029543107,"about_ca_system_score_gemma":0.001240819,"threshold_uncertainty_score":0.026349783},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3857949,0.0022852933,0.43228844,0.0036488406,0.0024665392,0.0002774281,0.0011878604,0.0018023278,0.17024837],"genre_scores_gemma":[0.8023862,0.0011917992,0.111977614,0.0017302069,0.0010852893,0.0002819708,0.000883442,0.0010626792,0.07940071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920887,0.00014603739,0.0000473672,0.00012942059,0.00032473312,0.00014360776],"domain_scores_gemma":[0.99883896,0.00032155853,0.00015818348,0.00021738885,0.0002822204,0.00018175959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351821,0.0008882627,0.00064022816,0.0018861566,0.0011918957,0.0023771543,0.0008418606,0.0015642123,0.010305489],"category_scores_gemma":[0.0024087387,0.00052310113,0.0008165735,0.0011184382,0.001744997,0.0026189126,0.0024649256,0.0021041078,0.0020212363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073300675,0.00003017339,0.00013316768,0.000050793948,0.000010706147,0.00006458351,0.00008547663,0.0014870997,0.005084833,0.97851163,0.0020576878,0.012410439],"study_design_scores_gemma":[0.000058106016,0.000056856752,0.0003257729,0.00006564938,0.00002175803,0.00038013194,0.00004599529,0.023177521,0.012463411,0.94701517,0.01632386,0.00006574943],"about_ca_topic_score_codex":0.00049995637,"about_ca_topic_score_gemma":0.00084224856,"teacher_disagreement_score":0.010305489,"about_ca_system_score_codex":0.0012056126,"about_ca_system_score_gemma":0.0010151481,"threshold_uncertainty_score":0.034475327},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24704498,0.0005720802,0.7140029,0.0014203873,0.00016503161,0.000100051875,0.00026387247,0.00051882304,0.03591192],"genre_scores_gemma":[0.95809114,0.00027433631,0.02929644,0.00030754463,0.00010146437,0.00008799687,0.00015165888,0.00009917787,0.011590326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977323,0.0005501402,0.00013902747,0.00040740884,0.0006918467,0.0004791944],"domain_scores_gemma":[0.9952734,0.0020887263,0.00051622814,0.0012899934,0.00057733845,0.00025429396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020212096,0.00053988805,0.0007162173,0.0009533228,0.0014057022,0.0020776836,0.0011080639,0.0012894499,0.0037997894],"category_scores_gemma":[0.0067794444,0.0003847655,0.000801791,0.0010272039,0.0034141303,0.0051162504,0.0036901645,0.0026648245,0.00087976555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023987867,0.000025349253,0.00016143596,0.000031837684,0.000009224738,0.000062846535,0.00015263169,0.0052653067,0.0025714447,0.98281026,0.0005154878,0.008154366],"study_design_scores_gemma":[0.000041821448,0.000063185966,0.00010348232,0.000023949822,0.000015044654,0.00018944214,0.00004644158,0.043976646,0.0065999813,0.94607484,0.0028284115,0.00003672893],"about_ca_topic_score_codex":0.0004496132,"about_ca_topic_score_gemma":0.00027421612,"teacher_disagreement_score":0.0037997894,"about_ca_system_score_codex":0.0016815052,"about_ca_system_score_gemma":0.0015003113,"threshold_uncertainty_score":0.012711585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25577623,0.0033125498,0.69389915,0.0026564961,0.0003526438,0.00015168048,0.0009627244,0.0010444197,0.041844092],"genre_scores_gemma":[0.8690248,0.00086237246,0.1128724,0.00035713817,0.00011280968,0.00017326615,0.00032563743,0.00022540697,0.016046198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990018,0.00023404212,0.00007651799,0.00014857821,0.0003753503,0.00016364113],"domain_scores_gemma":[0.996225,0.0020618166,0.0005021944,0.00055972085,0.00048854185,0.00016264124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088471174,0.00072957244,0.0009680091,0.0008986583,0.00079766393,0.0015007613,0.0012516744,0.0015979594,0.0064190943],"category_scores_gemma":[0.00781991,0.00045543635,0.00044961664,0.0010806378,0.0011796576,0.001911531,0.002060495,0.0011592993,0.0011929572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010266597,0.00008275386,0.0007304491,0.00044214277,0.000054625605,0.0001442638,0.0003482156,0.18527009,0.022575306,0.69669276,0.005957526,0.08667525],"study_design_scores_gemma":[0.00017409767,0.00036327486,0.0006267136,0.00018551097,0.0000663124,0.00050125254,0.0002472918,0.38814014,0.026610577,0.57595646,0.007023782,0.00010454196],"about_ca_topic_score_codex":0.00092015095,"about_ca_topic_score_gemma":0.0015087094,"teacher_disagreement_score":0.0064190943,"about_ca_system_score_codex":0.0017315206,"about_ca_system_score_gemma":0.0018627589,"threshold_uncertainty_score":0.021474004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14268474,0.00043828395,0.76198524,0.00076660654,0.00076047255,0.00028474457,0.00033747696,0.0012978117,0.09144459],"genre_scores_gemma":[0.62365246,0.0005736904,0.34424835,0.00043092997,0.00020597561,0.00035624305,0.0005329558,0.000861185,0.029138152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989699,0.00032364397,0.00007348232,0.00015135073,0.00028414745,0.0001974641],"domain_scores_gemma":[0.9984511,0.0007325686,0.00013636172,0.00034148662,0.00021727564,0.00012123985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096716837,0.0009049131,0.0006552007,0.0018134406,0.0015572727,0.0022374634,0.00081039383,0.0008656465,0.00636856],"category_scores_gemma":[0.0036486574,0.0006532678,0.0008002185,0.0011776345,0.0021524685,0.0024185968,0.00230206,0.0024630094,0.0021276867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012507275,0.00006715765,0.00019991622,0.00010653274,0.000015295393,0.00014962142,0.00038400205,0.014143875,0.0069669364,0.93504536,0.0026854018,0.040110942],"study_design_scores_gemma":[0.00004126372,0.000105978994,0.00013844483,0.000065826076,0.000020581403,0.00018572436,0.00014805641,0.060596086,0.013822749,0.9033074,0.021505069,0.00006294229],"about_ca_topic_score_codex":0.0006208725,"about_ca_topic_score_gemma":0.0011802353,"teacher_disagreement_score":0.00636856,"about_ca_system_score_codex":0.00096212636,"about_ca_system_score_gemma":0.0007497197,"threshold_uncertainty_score":0.021304905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12003638,0.0019480948,0.81301916,0.00097185763,0.00044033412,0.00014313932,0.00037027305,0.000367901,0.06270295],"genre_scores_gemma":[0.72774726,0.0032515842,0.24063061,0.0010672138,0.00043407286,0.00031003065,0.000646565,0.00044497426,0.025467776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992125,0.00022333098,0.000031765303,0.000117896205,0.00029195234,0.0001224307],"domain_scores_gemma":[0.99880755,0.00062975124,0.00013609829,0.00013943145,0.00021923285,0.00006792125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786872,0.0013633975,0.0007063646,0.0013861655,0.00082800735,0.0016672243,0.0009455329,0.0011010509,0.0051764264],"category_scores_gemma":[0.004711513,0.00052709115,0.00054775225,0.00232932,0.0014456786,0.0017207128,0.0016333028,0.0016635339,0.0012232949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001399363,0.00004140266,0.00025981682,0.00012049384,0.000023685408,0.00007399217,0.00013615434,0.070446745,0.009132811,0.8736921,0.0035607095,0.042372115],"study_design_scores_gemma":[0.000047245565,0.000078964935,0.00021851521,0.00011590081,0.00002901029,0.00016724212,0.00008157566,0.27362692,0.006136661,0.712904,0.006535292,0.000058651265],"about_ca_topic_score_codex":0.0020644118,"about_ca_topic_score_gemma":0.0037700026,"teacher_disagreement_score":0.0051764264,"about_ca_system_score_codex":0.0014946053,"about_ca_system_score_gemma":0.0016731215,"threshold_uncertainty_score":0.017316878},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20171599,0.0062681306,0.6848909,0.0054417686,0.001036908,0.0001847025,0.0006287732,0.0005633116,0.09926948],"genre_scores_gemma":[0.8736197,0.005642131,0.07648678,0.0017223182,0.0012642114,0.00036069594,0.00057545886,0.00035226782,0.03997656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700874,0.000797557,0.00019433587,0.0003546649,0.0011430471,0.0005017457],"domain_scores_gemma":[0.9860405,0.010429456,0.0009905857,0.001247426,0.0009765783,0.00031556597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027672867,0.0020620585,0.0012862191,0.0030545623,0.0016624809,0.0027917512,0.0016360515,0.0026386883,0.0061830143],"category_scores_gemma":[0.018915921,0.0009018166,0.0011646814,0.0029550032,0.0052920184,0.006423058,0.0044245347,0.003320799,0.0013178568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021586465,0.00002200969,0.00018686376,0.00010172637,0.000014394291,0.00012640048,0.00025000508,0.020693636,0.0016472985,0.9549404,0.0023158751,0.019485613],"study_design_scores_gemma":[0.000033809465,0.00004307565,0.00007674862,0.00008183269,0.000013863684,0.00015666561,0.000046785386,0.029185485,0.0015357325,0.96599114,0.0027997321,0.00003518999],"about_ca_topic_score_codex":0.0014242098,"about_ca_topic_score_gemma":0.00171728,"teacher_disagreement_score":0.0061830143,"about_ca_system_score_codex":0.0031888266,"about_ca_system_score_gemma":0.0021253321,"threshold_uncertainty_score":0.023136735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24370776,0.0031300068,0.66608346,0.0036139458,0.00025044804,0.00047649906,0.0017712795,0.0015887968,0.07937783],"genre_scores_gemma":[0.86723596,0.0009222885,0.122527346,0.00082805933,0.00029176212,0.0013902729,0.0007463869,0.0006663658,0.005391619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9747696,0.008685096,0.0018414856,0.0034841534,0.0087039685,0.0025157754],"domain_scores_gemma":[0.7650507,0.1763619,0.010582733,0.032309912,0.01205298,0.0036418308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0205677,0.001695716,0.0033017506,0.0051315594,0.0025187295,0.0071152006,0.006083493,0.0029039145,0.011386222],"category_scores_gemma":[0.14182681,0.001503792,0.0016552844,0.005900473,0.0064518396,0.019186849,0.008248247,0.005943283,0.0018135235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014218624,0.0004678464,0.0053819455,0.0005748926,0.00012091871,0.0003257282,0.0005088372,0.108550034,0.01096579,0.7967522,0.0036408042,0.071289144],"study_design_scores_gemma":[0.000118895114,0.0005255873,0.0010341541,0.00024804077,0.00006813769,0.00066663336,0.00022291177,0.22311537,0.0151997795,0.7514414,0.0072321077,0.00012695426],"about_ca_topic_score_codex":0.0006199373,"about_ca_topic_score_gemma":0.00048117773,"teacher_disagreement_score":0.0205677,"about_ca_system_score_codex":0.005932548,"about_ca_system_score_gemma":0.0023483962,"threshold_uncertainty_score":0.10877371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76250166,0.0019958937,0.16959007,0.0017584577,0.00055916037,0.000106979656,0.001100631,0.0005160505,0.06187101],"genre_scores_gemma":[0.9459998,0.0009902657,0.03223257,0.00049025775,0.0005629636,0.00007550789,0.0019049154,0.00015328782,0.01759045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935585,0.00012926025,0.00004729445,0.00011450196,0.00022167234,0.00013138412],"domain_scores_gemma":[0.9968652,0.0012487044,0.00056824175,0.000407648,0.0005538279,0.00035639442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053515506,0.0005703198,0.000567244,0.002552716,0.0012238707,0.0024943857,0.000642521,0.0009880894,0.005392966],"category_scores_gemma":[0.0033105118,0.00031170395,0.00042582813,0.0016193627,0.0018239425,0.0021324595,0.0009709695,0.001387039,0.00088601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012381903,0.000084713,0.0018743817,0.00005667859,0.000010174062,0.00012686668,0.00033928984,0.004412214,0.0046142233,0.9503419,0.004694321,0.033321388],"study_design_scores_gemma":[0.000027669423,0.000122003614,0.0015243249,0.000050939252,0.000009011254,0.00048080098,0.00018750221,0.038203888,0.002240279,0.94816667,0.008946207,0.00004068147],"about_ca_topic_score_codex":0.00077251205,"about_ca_topic_score_gemma":0.0006978432,"teacher_disagreement_score":0.005392966,"about_ca_system_score_codex":0.000818718,"about_ca_system_score_gemma":0.0008824642,"threshold_uncertainty_score":0.018041253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031828843,0.0003508347,0.9480361,0.0008155988,0.000050065388,0.000055547018,0.00007014553,0.000118426084,0.018674474],"genre_scores_gemma":[0.8773677,0.00086592,0.11076076,0.0003021229,0.00013827816,0.00028626228,0.00012587885,0.00012066346,0.0100325635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829024,0.000781421,0.000053149088,0.00016681486,0.0004837123,0.000224545],"domain_scores_gemma":[0.9947556,0.003557157,0.00059652666,0.00044425065,0.00045684056,0.00018965885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022242588,0.00071683293,0.0005816993,0.0008757042,0.0009797539,0.0023411447,0.0010815669,0.0011805064,0.0031848003],"category_scores_gemma":[0.008715421,0.00038160937,0.00046148707,0.0010192435,0.003040797,0.003346994,0.0032854602,0.0024798021,0.00052938564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038648872,0.000017496817,0.00010831532,0.000046090678,0.000006889502,0.00005932944,0.00014686976,0.074959695,0.0016690248,0.91629064,0.0006981192,0.005958931],"study_design_scores_gemma":[0.000023884559,0.00004437457,0.00007128933,0.000040652023,0.000009058668,0.00010618493,0.000105404426,0.45365304,0.002398296,0.54013824,0.0033890908,0.000020435999],"about_ca_topic_score_codex":0.0008835867,"about_ca_topic_score_gemma":0.0007506487,"teacher_disagreement_score":0.0031848003,"about_ca_system_score_codex":0.0019912717,"about_ca_system_score_gemma":0.0013100448,"threshold_uncertainty_score":0.014447749},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07591133,0.16006806,0.60745376,0.004411258,0.0015487401,0.00022681065,0.00047289504,0.0006797895,0.14922735],"genre_scores_gemma":[0.47376463,0.17894414,0.3047422,0.0024476363,0.004115353,0.00028241938,0.0013962984,0.0004981206,0.03380918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983467,0.00040503195,0.00014255893,0.00033343816,0.0006191049,0.00015312439],"domain_scores_gemma":[0.99807465,0.0011091514,0.00012360311,0.0003642986,0.00026671673,0.00006148958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018097346,0.00089212245,0.0008666294,0.0028337205,0.0010660326,0.0033080445,0.0011783779,0.001227868,0.0047849766],"category_scores_gemma":[0.004585446,0.0009382541,0.001073899,0.0040048915,0.0025658193,0.0073770913,0.0020878222,0.0027461997,0.0017158729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004627249,0.00007028178,0.00037617603,0.0005457937,0.000013402388,0.00009477871,0.00021090315,0.0028029871,0.0018019275,0.8501973,0.0025625397,0.1412777],"study_design_scores_gemma":[0.000017860957,0.00013197045,0.0003613741,0.00032608068,0.000020870288,0.0010734804,0.000103102946,0.0097816605,0.003034824,0.9039853,0.08111852,0.000044832952],"about_ca_topic_score_codex":0.0005448023,"about_ca_topic_score_gemma":0.0006090672,"teacher_disagreement_score":0.0047849766,"about_ca_system_score_codex":0.0014417995,"about_ca_system_score_gemma":0.0014774919,"threshold_uncertainty_score":0.016007304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35664898,0.002932486,0.45409906,0.0046108947,0.0024005289,0.00025621348,0.0007837994,0.0010422034,0.17722589],"genre_scores_gemma":[0.7870185,0.00258541,0.13729,0.0022227492,0.002205929,0.000321009,0.0016588873,0.0007910633,0.06590652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989359,0.0002607049,0.00007997546,0.00015971168,0.00034974184,0.00021396932],"domain_scores_gemma":[0.99799997,0.0008690036,0.00029072672,0.00027997658,0.00033076122,0.0002295926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012548425,0.00081397954,0.0009708349,0.0025011399,0.0017863102,0.00375986,0.0012131331,0.0014460573,0.008244749],"category_scores_gemma":[0.0047182953,0.0005202358,0.0009709358,0.001633883,0.0031106554,0.0036831046,0.0018218706,0.0033528318,0.0021472638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060557548,0.000047000176,0.0005280236,0.000037758393,0.0000059217923,0.000078931706,0.00014653901,0.0010567973,0.0014192046,0.97053707,0.0049434854,0.021138815],"study_design_scores_gemma":[0.000030704246,0.00005267312,0.00049315114,0.00006188206,0.000011721094,0.00036282704,0.0000901359,0.016218763,0.0011153824,0.9680766,0.013457508,0.000028765951],"about_ca_topic_score_codex":0.00078778306,"about_ca_topic_score_gemma":0.00074738567,"teacher_disagreement_score":0.008244749,"about_ca_system_score_codex":0.0009846903,"about_ca_system_score_gemma":0.0012198415,"threshold_uncertainty_score":0.027581453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019181285,0.0017050338,0.9737249,0.0007938924,0.00031993282,0.000052640036,0.00013980003,0.0002321292,0.0038504745],"genre_scores_gemma":[0.5936501,0.0033404727,0.38762665,0.00081429695,0.00076979236,0.0002908569,0.0004575974,0.00010829636,0.012941893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890447,0.00032656058,0.000059545448,0.00012805958,0.00048913,0.000092209084],"domain_scores_gemma":[0.9962281,0.002362857,0.00026347977,0.00055875833,0.00050272286,0.000084105806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012582996,0.0006930296,0.0005057853,0.001554268,0.0006823393,0.0012784762,0.0008058801,0.0015741722,0.0030671034],"category_scores_gemma":[0.008490508,0.00039920834,0.00029369438,0.0015539319,0.0012254536,0.0023112877,0.001368579,0.0016187308,0.0009967744],"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.00042698125,0.000086921405,0.0007977707,0.00027046684,0.000031723066,0.00012648232,0.00013924658,0.07719404,0.01591644,0.65604913,0.0037795452,0.24518135],"study_design_scores_gemma":[0.00004769429,0.00020086615,0.00052990165,0.00015252408,0.000028201019,0.000440117,0.0000623217,0.5925957,0.014158385,0.38089865,0.010825619,0.000059941627],"about_ca_topic_score_codex":0.00087202305,"about_ca_topic_score_gemma":0.0007834224,"teacher_disagreement_score":0.0030671034,"about_ca_system_score_codex":0.001120324,"about_ca_system_score_gemma":0.0011471577,"threshold_uncertainty_score":0.010260463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30554092,0.0036557147,0.5972913,0.003114705,0.0004782708,0.00006757483,0.00035958938,0.00041338307,0.08907863],"genre_scores_gemma":[0.9448881,0.0017600525,0.038736064,0.000595166,0.0005309014,0.00014106314,0.00023394453,0.00019288143,0.0129219005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746144,0.00064194814,0.00012306529,0.00036416855,0.0009642547,0.000445145],"domain_scores_gemma":[0.99033815,0.0059964587,0.0006349249,0.0012319684,0.00088492985,0.0009134917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024924977,0.0011937523,0.0011224176,0.0039110766,0.0024652176,0.0045305644,0.0023243364,0.0022528074,0.0068223393],"category_scores_gemma":[0.012856701,0.0007341498,0.001026216,0.0024793209,0.0060589835,0.009752895,0.0065242792,0.006148092,0.0010931445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027840146,0.000011617858,0.00011130908,0.000023583567,0.0000035765236,0.00002889599,0.00013495388,0.0018761219,0.000465465,0.99333835,0.00043135803,0.0035468827],"study_design_scores_gemma":[0.0000058813744,0.000014966984,0.000064758366,0.000024406325,0.000007025121,0.00007760376,0.00004967943,0.013893574,0.00074162934,0.9838209,0.0012841143,0.000015381254],"about_ca_topic_score_codex":0.0004093772,"about_ca_topic_score_gemma":0.0003906383,"teacher_disagreement_score":0.0068223393,"about_ca_system_score_codex":0.0023623067,"about_ca_system_score_gemma":0.0008810964,"threshold_uncertainty_score":0.022823036},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4253029,0.00080162304,0.5158286,0.00070215086,0.0006745407,0.00033812976,0.0005386428,0.00090593897,0.054907504],"genre_scores_gemma":[0.81436723,0.0002860208,0.1682836,0.00022248965,0.00007238877,0.00015189097,0.0004966345,0.00015794658,0.0159617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965405,0.000088276116,0.00002113636,0.00006214187,0.00009889804,0.0000755554],"domain_scores_gemma":[0.99938476,0.00021987793,0.00006123686,0.00015743848,0.0001347777,0.000041912244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033161326,0.00039504477,0.00033516219,0.00060388434,0.00054371293,0.00067741465,0.0004165165,0.00045452928,0.003858386],"category_scores_gemma":[0.0010175146,0.00018876488,0.0003325491,0.00042293262,0.00046156254,0.0008001671,0.0006039485,0.0005037469,0.00076231384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091141765,0.00025158544,0.0013741681,0.00052057055,0.00005477833,0.0009892789,0.00047794255,0.033515707,0.26590347,0.49925408,0.006081918,0.19066514],"study_design_scores_gemma":[0.00025954246,0.0005953131,0.0010193752,0.00012588737,0.00009470505,0.0018092798,0.00019925181,0.3023198,0.40482476,0.23819126,0.05041487,0.00014593053],"about_ca_topic_score_codex":0.0002818631,"about_ca_topic_score_gemma":0.0006713175,"teacher_disagreement_score":0.003858386,"about_ca_system_score_codex":0.000396071,"about_ca_system_score_gemma":0.0007430636,"threshold_uncertainty_score":0.012907565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3853165,0.0009819929,0.5823121,0.0010375198,0.00025208917,0.00020483341,0.00039337392,0.0013315501,0.028170114],"genre_scores_gemma":[0.7384179,0.00081764744,0.24924326,0.00046715708,0.00011501152,0.00030955582,0.0006197354,0.00033657768,0.009673061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991277,0.0002679246,0.0000772647,0.0001235967,0.00023933288,0.00016425876],"domain_scores_gemma":[0.9962807,0.0021729525,0.0005261339,0.00055329734,0.00026835466,0.00019842733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009050692,0.0011012948,0.00075622846,0.0010629279,0.0006807668,0.001286608,0.0008630357,0.0016010429,0.0034001248],"category_scores_gemma":[0.007037373,0.00066801376,0.00049852784,0.001206635,0.0010829546,0.0021275654,0.0018722453,0.0015058087,0.0013402624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001104282,0.0002601958,0.0021000623,0.0005917676,0.00008964167,0.00046885008,0.0007962945,0.10722615,0.09405209,0.596885,0.0059220605,0.19050354],"study_design_scores_gemma":[0.00030109964,0.00079958246,0.00093685073,0.00023636906,0.00008433803,0.0005338926,0.00039547432,0.32388404,0.06933365,0.58900535,0.014366289,0.00012299207],"about_ca_topic_score_codex":0.0004804234,"about_ca_topic_score_gemma":0.0009299487,"teacher_disagreement_score":0.0034001248,"about_ca_system_score_codex":0.0008794051,"about_ca_system_score_gemma":0.0010019157,"threshold_uncertainty_score":0.011374533},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014781144,0.38786408,0.1126948,0.2869687,0.10748613,0.000075617485,0.00057612424,0.0007141688,0.088839285],"genre_scores_gemma":[0.37650752,0.20978935,0.05669283,0.059201762,0.180902,0.00023411469,0.0005253849,0.0012580638,0.11488891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978873,0.0007578439,0.00013878015,0.00050435914,0.0005813703,0.00013031346],"domain_scores_gemma":[0.9951315,0.0030456085,0.00017555575,0.00029191075,0.0009518743,0.00040353704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034100504,0.001786063,0.0019316383,0.0022122525,0.00226989,0.0048353076,0.0011225952,0.001969146,0.0038402446],"category_scores_gemma":[0.012141507,0.00068371807,0.00057749584,0.0021851738,0.007360775,0.011147403,0.0027303228,0.008320719,0.0021281152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030294663,0.00008146384,0.0002920216,0.00036227633,0.000071228525,0.00011885088,0.0011573368,0.002577315,0.0013625781,0.6979771,0.24765815,0.04803873],"study_design_scores_gemma":[0.00007133572,0.00013526407,0.00025566245,0.00029870303,0.000033844986,0.00022798887,0.00031178232,0.003965518,0.0020850925,0.46942803,0.5230505,0.0001364571],"about_ca_topic_score_codex":0.0016999162,"about_ca_topic_score_gemma":0.0012170903,"teacher_disagreement_score":0.0048353076,"about_ca_system_score_codex":0.0022038405,"about_ca_system_score_gemma":0.001584105,"threshold_uncertainty_score":0.018034339},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7276782,0.00071693334,0.154856,0.0017045629,0.000546788,0.000093221206,0.00028700932,0.0003591824,0.113758184],"genre_scores_gemma":[0.9594814,0.0003245088,0.014793479,0.000390196,0.0001637499,0.00008739826,0.00014152343,0.00012104228,0.024496585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990163,0.00028573922,0.0000586454,0.00012540116,0.00025966731,0.00025432935],"domain_scores_gemma":[0.99719185,0.0012075909,0.00033006503,0.00036822222,0.00044694438,0.00045532035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008985231,0.00049492536,0.000647501,0.002123247,0.0022902088,0.002995102,0.00080410205,0.0013637429,0.008822385],"category_scores_gemma":[0.0032565084,0.00054074015,0.0005334192,0.0012031032,0.0024053277,0.0031438058,0.0022818488,0.0023873183,0.0011507017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006607164,0.000013057188,0.00013020501,0.000019463989,0.0000047740104,0.00005733259,0.00019953812,0.0009970043,0.002244455,0.99180955,0.00071009493,0.0037485363],"study_design_scores_gemma":[0.000016070615,0.000028675156,0.00014372556,0.000015538875,0.0000054066954,0.00006188945,0.0001245428,0.006580607,0.0012017251,0.9896012,0.0022034138,0.000017057297],"about_ca_topic_score_codex":0.0009869237,"about_ca_topic_score_gemma":0.0011134195,"teacher_disagreement_score":0.008822385,"about_ca_system_score_codex":0.0010243059,"about_ca_system_score_gemma":0.0007193067,"threshold_uncertainty_score":0.029513836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57174456,0.0028199647,0.3182632,0.0016245592,0.00018165063,0.00012683663,0.0010681159,0.0003597151,0.10381144],"genre_scores_gemma":[0.9811467,0.00090182654,0.014825966,0.00011571475,0.000070466296,0.000063893145,0.00021840486,0.000060895207,0.0025962177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988809,0.00023941892,0.000045718007,0.0001079753,0.00047090082,0.00025499676],"domain_scores_gemma":[0.9886326,0.008543967,0.00047926424,0.00059834623,0.0015444002,0.00020143169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012295968,0.00057512894,0.00041189793,0.0019946909,0.0005070258,0.0011729007,0.0007647911,0.00068478164,0.004659832],"category_scores_gemma":[0.011255158,0.00026599586,0.0003531254,0.0009209364,0.0021072377,0.0014765742,0.0012644598,0.00077348435,0.000630726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016381423,0.000053752454,0.0009474084,0.0002436262,0.00002349774,0.0003318594,0.0001862692,0.12942055,0.022697678,0.8170612,0.00228827,0.026582107],"study_design_scores_gemma":[0.00003980957,0.00007836626,0.0007501703,0.00022374891,0.000029895544,0.00077036425,0.00008235349,0.35241544,0.044597227,0.59608597,0.0048467284,0.00007991693],"about_ca_topic_score_codex":0.00097103755,"about_ca_topic_score_gemma":0.0005908039,"teacher_disagreement_score":0.004659832,"about_ca_system_score_codex":0.001283231,"about_ca_system_score_gemma":0.0010285974,"threshold_uncertainty_score":0.015588701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18020484,0.00018907487,0.7999265,0.00026565552,0.000088156026,0.00010382129,0.00014823116,0.0002600444,0.018813686],"genre_scores_gemma":[0.81587684,0.00017362463,0.17545713,0.00020839942,0.00012559067,0.00019456222,0.0001999183,0.000101920225,0.007662088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973678,0.0009533695,0.00013160646,0.0003643487,0.0008448778,0.00033797932],"domain_scores_gemma":[0.9930922,0.0033111481,0.0010162916,0.0011679836,0.0011349544,0.0002773419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017759596,0.0005619957,0.00046424512,0.0011423995,0.00087954174,0.0009775735,0.00060551014,0.0007173845,0.004698475],"category_scores_gemma":[0.01218901,0.0004107591,0.00048966805,0.0008001149,0.0014366726,0.0017127866,0.0013229097,0.0008809143,0.001015584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023880256,0.0000706797,0.0023329286,0.000117667965,0.000055707165,0.00024614835,0.00027029493,0.039669223,0.040076245,0.85878557,0.002235815,0.05590101],"study_design_scores_gemma":[0.000054154556,0.00031232348,0.0018885654,0.00007010687,0.000036450554,0.00056958693,0.00018197212,0.32439926,0.041917313,0.6194161,0.011053632,0.00010053902],"about_ca_topic_score_codex":0.000382621,"about_ca_topic_score_gemma":0.00046848523,"teacher_disagreement_score":0.004698475,"about_ca_system_score_codex":0.0005476914,"about_ca_system_score_gemma":0.00064605154,"threshold_uncertainty_score":0.015717983},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92633283,0.00014974843,0.014011819,0.0005585941,0.00010708736,0.000025091289,0.000071480754,0.00016165439,0.05858162],"genre_scores_gemma":[0.9908091,0.000033893382,0.0019375063,0.000029750328,0.000033209533,0.000007892004,0.000058160447,0.000024832476,0.007065642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908006,0.00015057011,0.000027753342,0.00014558475,0.00031486872,0.0002811743],"domain_scores_gemma":[0.9991861,0.00015223477,0.00014677379,0.00007872479,0.00015089243,0.00028523395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006743576,0.00049051526,0.0004061623,0.0020828499,0.0019603176,0.0019849865,0.0006011843,0.00086189754,0.012204591],"category_scores_gemma":[0.002004903,0.0003532338,0.00035515122,0.0007913494,0.0026893483,0.0018091497,0.0026439342,0.0015038821,0.0011233483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035497764,0.000100829275,0.0043308605,0.00006215491,0.000029309907,0.0009541447,0.0010880795,0.0030654524,0.00778105,0.96087104,0.0020445834,0.019317506],"study_design_scores_gemma":[0.00021959227,0.00064512645,0.013394206,0.00015110183,0.00009266934,0.0016950442,0.0031847146,0.035241425,0.018888371,0.8885371,0.037800185,0.00015038934],"about_ca_topic_score_codex":0.0014279534,"about_ca_topic_score_gemma":0.001219219,"teacher_disagreement_score":0.012204591,"about_ca_system_score_codex":0.001706832,"about_ca_system_score_gemma":0.00048506312,"threshold_uncertainty_score":0.040828407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54795474,0.0012647439,0.3054255,0.0026501522,0.00072412286,0.00013348374,0.00048481015,0.00032514456,0.14103732],"genre_scores_gemma":[0.9314146,0.0005422191,0.029008973,0.00051408244,0.00034945918,0.000079440564,0.00033082548,0.00007982073,0.037680626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992119,0.00017464561,0.00004275563,0.00017639397,0.00022540207,0.00016884331],"domain_scores_gemma":[0.9984164,0.00050537474,0.0002455915,0.00023346728,0.0002608371,0.00033827304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077321613,0.00057274086,0.0006670515,0.0014214328,0.0017018766,0.0021201465,0.00077131856,0.00070152764,0.0085218325],"category_scores_gemma":[0.0031281344,0.00036632703,0.0005379941,0.0007190573,0.0029186863,0.0034291933,0.0022159617,0.0018905974,0.0014550457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046206165,0.000014290201,0.00010523783,0.000013419345,0.0000023461016,0.000024171435,0.00017185151,0.0008231702,0.00051264814,0.9944003,0.0005566078,0.0033296992],"study_design_scores_gemma":[0.000011457751,0.000020433385,0.00005522357,0.000010128087,0.0000019538033,0.00004496183,0.000085046915,0.0026773862,0.00032089485,0.994124,0.0026411412,0.0000074778322],"about_ca_topic_score_codex":0.00094797753,"about_ca_topic_score_gemma":0.0009035505,"teacher_disagreement_score":0.0085218325,"about_ca_system_score_codex":0.0011997484,"about_ca_system_score_gemma":0.0005919467,"threshold_uncertainty_score":0.028508365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18894815,0.0012521124,0.6352092,0.0060251844,0.0014717586,0.0003081833,0.0011781403,0.0016061337,0.16400112],"genre_scores_gemma":[0.6189615,0.0011605433,0.24927886,0.0032531843,0.0005419789,0.0004997579,0.0017784418,0.0009884557,0.123537235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983413,0.0004606401,0.00010723075,0.00028175797,0.00042446677,0.00038451122],"domain_scores_gemma":[0.9987684,0.00034304857,0.00013364204,0.0004931417,0.0001551529,0.00010660809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011939297,0.0013722426,0.0009644672,0.001182553,0.001564464,0.0022655881,0.0014840687,0.0019590473,0.02392222],"category_scores_gemma":[0.0027066488,0.00076308317,0.0015945466,0.001693917,0.0017906518,0.004288157,0.0034574857,0.0032053706,0.004278091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020378538,0.000069261914,0.00039293774,0.00008000643,0.000024116998,0.000108451124,0.00022974501,0.004835384,0.0062411935,0.95910186,0.004234827,0.024478387],"study_design_scores_gemma":[0.00015612521,0.00016206471,0.0006897284,0.00009645464,0.00005766803,0.00039325227,0.00014893466,0.023595585,0.018907169,0.90142417,0.054237098,0.00013177941],"about_ca_topic_score_codex":0.0009087932,"about_ca_topic_score_gemma":0.0016537249,"teacher_disagreement_score":0.02392222,"about_ca_system_score_codex":0.0029835664,"about_ca_system_score_gemma":0.0011760338,"threshold_uncertainty_score":0.08002782},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3576363,0.003439382,0.31652027,0.05151753,0.0034154428,0.0003159,0.0011191134,0.001707881,0.2643281],"genre_scores_gemma":[0.92760926,0.0007280384,0.042658698,0.0025188148,0.0009006194,0.0001415763,0.00022727237,0.00041857956,0.024797015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935149,0.002941829,0.0003449199,0.001044474,0.0013859596,0.0007679271],"domain_scores_gemma":[0.9474464,0.03703361,0.0015999229,0.0072842394,0.005782864,0.00085286226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00822979,0.0010903275,0.0019214299,0.002879376,0.004355832,0.004868066,0.0016762369,0.0052484423,0.008237353],"category_scores_gemma":[0.091010414,0.0011143798,0.0014068567,0.0027035743,0.013822684,0.017620625,0.0051847105,0.0091131935,0.0020194645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081120364,0.000014268664,0.00023538078,0.00003253213,0.0000060310476,0.00005997543,0.00023756242,0.0008603149,0.0002628588,0.98823965,0.0026085465,0.0073617552],"study_design_scores_gemma":[0.000027112992,0.000020968186,0.00005145569,0.000035254827,0.0000076422775,0.000050430568,0.00007220705,0.0036817098,0.0014936264,0.98906225,0.005469959,0.000027410206],"about_ca_topic_score_codex":0.0016749789,"about_ca_topic_score_gemma":0.0011021281,"teacher_disagreement_score":0.008237353,"about_ca_system_score_codex":0.005219314,"about_ca_system_score_gemma":0.0030651663,"threshold_uncertainty_score":0.043523848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33812413,0.007814798,0.40953246,0.0109033855,0.001262616,0.00023028575,0.0021139125,0.0017746583,0.2282438],"genre_scores_gemma":[0.9184643,0.003969044,0.04279963,0.0012641601,0.0022525713,0.00042840786,0.0019928927,0.00088124134,0.027947808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940528,0.0010336093,0.00033430467,0.0007874489,0.002425615,0.0013662054],"domain_scores_gemma":[0.9749874,0.016073098,0.0019060354,0.0026993875,0.0021153635,0.0022187645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045828763,0.002481932,0.0025795875,0.0058494005,0.0036697604,0.009687068,0.004032744,0.0021913105,0.0110632405],"category_scores_gemma":[0.026772235,0.0010904496,0.0013239306,0.0057438817,0.004657417,0.019132178,0.008677556,0.0069998465,0.0031674313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047021892,0.0001400416,0.0014094486,0.00022838403,0.000042754447,0.00014196451,0.0005619152,0.010294066,0.002696032,0.95095843,0.006615996,0.026440801],"study_design_scores_gemma":[0.000021391581,0.00004439715,0.00029956494,0.00008464425,0.000041892235,0.00013479716,0.00007633097,0.028289499,0.0023353437,0.9644836,0.0041549182,0.00003358478],"about_ca_topic_score_codex":0.0006366012,"about_ca_topic_score_gemma":0.00086778955,"teacher_disagreement_score":0.0110632405,"about_ca_system_score_codex":0.0056064837,"about_ca_system_score_gemma":0.002096621,"threshold_uncertainty_score":0.040678084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15668586,0.00066966616,0.8260715,0.0011967563,0.0003357801,0.00021823063,0.0010053326,0.002519402,0.011297498],"genre_scores_gemma":[0.9225292,0.0002243203,0.06539659,0.00028192395,0.00022409986,0.00018498424,0.0005670667,0.00027920443,0.01031263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928456,0.0014846756,0.0004021764,0.0010921487,0.0026160125,0.0015593352],"domain_scores_gemma":[0.9766517,0.007042448,0.001172491,0.012821105,0.0016729042,0.0006393409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049358304,0.0011582192,0.0022191342,0.0007831175,0.00113017,0.004514905,0.0030507299,0.0017942088,0.00867645],"category_scores_gemma":[0.0134549085,0.0010061887,0.0013128439,0.0013805532,0.003062185,0.0077781146,0.004442393,0.004213835,0.0017150743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007962736,0.00035124543,0.0022847662,0.00044705256,0.00023127865,0.00055556156,0.00061606884,0.16359997,0.038633354,0.66454464,0.010631962,0.11014137],"study_design_scores_gemma":[0.0003068505,0.00032399117,0.0006455613,0.000076721546,0.000089169574,0.00014904964,0.000073634845,0.49650708,0.045838196,0.45155582,0.004335301,0.00009864187],"about_ca_topic_score_codex":0.0025387844,"about_ca_topic_score_gemma":0.002635483,"teacher_disagreement_score":0.00867645,"about_ca_system_score_codex":0.0039970553,"about_ca_system_score_gemma":0.004601294,"threshold_uncertainty_score":0.029025555},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4008714,0.41854978,0.059971783,0.05750433,0.0016017628,0.0003964293,0.0032160806,0.0002477774,0.057640713],"genre_scores_gemma":[0.7574966,0.21813647,0.008592085,0.0061247894,0.0013692055,0.00015417305,0.00146066,0.00019458284,0.0064715007],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957832,0.002220057,0.0003430238,0.0004793759,0.0008537311,0.00032059342],"domain_scores_gemma":[0.9252061,0.052554347,0.007278346,0.007305823,0.006099757,0.0015556078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014548837,0.00050146604,0.00068477803,0.001896846,0.0007542795,0.0024871281,0.0015462015,0.0014005703,0.0039218063],"category_scores_gemma":[0.049782258,0.00057425525,0.000612301,0.002719587,0.0035509465,0.007785235,0.0020000478,0.0037368042,0.0009283826],"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.0020955615,0.0014030694,0.13669904,0.0017224472,0.0005514746,0.0013802357,0.0021045005,0.010421368,0.0010844505,0.34286374,0.033041038,0.46663308],"study_design_scores_gemma":[0.000256665,0.0033773822,0.119911395,0.005524486,0.0011099825,0.010511148,0.004148958,0.026488803,0.0076480443,0.20506702,0.6155486,0.000407536],"about_ca_topic_score_codex":0.0036660067,"about_ca_topic_score_gemma":0.00242564,"teacher_disagreement_score":0.014548837,"about_ca_system_score_codex":0.0024138545,"about_ca_system_score_gemma":0.0026290521,"threshold_uncertainty_score":0.0769425},"labels":[],"label_agreement":null}]}